Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Swastik Kopparty, Mrinal Kumar, Michael Saks. Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields. In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias, editors, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. Volume 8572 of Lecture Notes in Computer Science, pages 726-737, Springer, 2014. [doi]

The following publications are possibly variants of this publication:

Efficient Indexing of Necklaces and Irreducible Polynomials over Finite FieldsSwastik Kopparty, Mrinal Kumar 0001, Michael E. Saks. toc, 12(1):1-27, 2016. [doi]

Efficient indexing of necklaces and irreducible polynomials over finite fieldsSwastik Kopparty, Mrinal Kumar 0001, Michael E. Saks. eccc, 22:47, 2015. [doi]

runs on WebDSL