{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:44:26Z","timestamp":1725795866897},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_60","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"726-737","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields"],"prefix":"10.1007","author":[{"given":"Swastik","family":"Kopparty","sequence":"first","affiliation":[]},{"given":"Mrinal","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Saks","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"60_CR1","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1145\/792538.792540","volume":"50","author":"M. Agrawal","year":"2003","unstructured":"Agrawal, M., Biswas, S.: Primality and identity testing via chinese remaindering. J. ACM\u00a050(4), 429\u2013443 (2003)","journal-title":"J. ACM"},{"issue":"3","key":"60_CR2","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"Alon, N., Goldreich, O., H\u00e5stad, J., Peralta, R.: Simple construction of almost k-wise independent random variables. Random Struct. Algorithms\u00a03(3), 289\u2013304 (1992)","journal-title":"Random Struct. Algorithms"},{"key":"60_CR3","doi-asserted-by":"crossref","unstructured":"Andoni, A., Goldberger, A., McGregor, A., Porat, E.: Homomorphic fingerprints under misalignments: sketching edit and shift distances. In: STOC, pp. 931\u2013940 (2013)","DOI":"10.1145\/2488608.2488726"},{"key":"60_CR4","doi-asserted-by":"crossref","unstructured":"Arndt, J.: Matters computational. Springer (2011)","DOI":"10.1007\/978-3-642-14764-7"},{"issue":"1","key":"60_CR5","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/0304-3975(94)00013-1","volume":"132","author":"J. Berstel","year":"1994","unstructured":"Berstel, J., Pocchiola, M.: Average cost of duval\u2019s algorithm for generating lyndon words. Theoretical Computer Science\u00a0132(1), 415\u2013425 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"60_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.2000.1108","volume":"37","author":"K. Cattell","year":"2000","unstructured":"Cattell, K., Ruskey, F., Sawada, J., Serra, M., Miers, C.R.: Fast algorithms to generate necklaces, unlabeled necklaces, and irreducible polynomials over gf(2). Journal of Algorithms\u00a037(2), 267\u2013282 (2000)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"60_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0304-3975(88)90113-2","volume":"60","author":"J.-P. Duval","year":"1988","unstructured":"Duval, J.-P.: G\u00e9n\u00e9ration d\u2019une section des classes de conjugaison et arbre des mots de lyndon de longueur born\u00e9e. Theoretical Computer Science\u00a060(3), 255\u2013283 (1988)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"60_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(86)90089-0","volume":"61","author":"H. Fredricksen","year":"1986","unstructured":"Fredricksen, H., Kessler, I.: An algorithm for generating necklaces of beads in two colors. Discrete Mathematics\u00a061(2), 181\u2013188 (1986)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"60_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(78)90002-X","volume":"23","author":"H. Fredricksen","year":"1978","unstructured":"Fredricksen, H., Maiorana, J.: Necklaces of beads in k colors and k-ary de bruijn sequences. Discrete Mathematics\u00a023(3), 207\u2013210 (1978)","journal-title":"Discrete Mathematics"},{"key":"60_CR10","unstructured":"Golomb, S.W.: Irreducible polynomials, synchronizing codes, primitive necklaces and cyclotomic algebra. In: Conference on Combinatorial Math. and Its Applications, pp. 358\u2013370 (1969)"},{"key":"60_CR11","first-page":"60","volume":"20","author":"V. Guruswami","year":"2013","unstructured":"Guruswami, V., Kopparty, S.: Explicit subspace designs. Electronic Colloquium on Computational Complexity (ECCC)\u00a020, 60 (2013)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"60_CR12","unstructured":"Knuth, D.E.: Art of Computer Programming. Fascicle 4, The: Generating All Trees\u2013History of Combinatorial Generation, vol.\u00a04. Addison-Wesley Professional (2006)"},{"key":"60_CR13","doi-asserted-by":"crossref","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial algorithms: generation, enumeration, and search, vol.\u00a07. CRC Press (1999)","DOI":"10.1145\/309739.309744"},{"key":"60_CR14","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez, C., Molinero, X.: An efficient generic algorithm for the generation of unlabelled cycles. Mathematics and Computer Science III, pp. 187\u2013197. Springer (2004)","DOI":"10.1007\/978-3-0348-7915-6_19"},{"issue":"6","key":"60_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0020-0190(01)00141-7","volume":"79","author":"W. Myrvold","year":"2001","unstructured":"Myrvold, W., Ruskey, F.: Ranking and unranking permutations in linear time. Information Processing Letters\u00a079(6), 281\u2013284 (2001)","journal-title":"Information Processing Letters"},{"key":"60_CR16","volume-title":"Computer Science and Applied Mathematics","author":"A. Nijenhuis","year":"1978","unstructured":"Nijenhuis, A., Wilf, H.S.: Combinatorial algorithms for computers and calculators. In: Computer Science and Applied Mathematics, 2nd edn., vol.\u00a01, Academic Press, New York (1978)","edition":"2"},{"key":"60_CR17","unstructured":"Rabin, M.O.: Fingerprinting by Random Polynomials. Center for Research in Computing Techn., Aiken Computation Laboratory, Univ. (1981)"},{"key":"60_CR18","unstructured":"Ruskey, F.: Combinatorial generation. Draft of a book (2003), \n                    \n                      http:\/\/www.1stworks.com\/ref\/RuskeyCombGen.pdf"},{"issue":"3","key":"60_CR19","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/0196-6774(92)90047-G","volume":"13","author":"F. Ruskey","year":"1992","unstructured":"Ruskey, F., Savage, C., Wang, T.M.Y.: Generating necklaces. Journal of Algorithms\u00a013(3), 414\u2013430 (1992)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"60_CR20","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1137\/S0097539798344112","volume":"29","author":"F. Ruskey","year":"1999","unstructured":"Ruskey, F., Sawada, J.: An efficient algorithm for generating necklaces with fixed density. SIAM Journal on Computing\u00a029(2), 671\u2013684 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"60_CR21","doi-asserted-by":"crossref","unstructured":"Shoup, V.: Searching for primitive roots in finite fields. In: STOC, pp. 546\u2013554 (1990)","DOI":"10.1145\/100216.100293"},{"key":"60_CR22","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci.\u00a08, 189\u2013201 (1979)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:21:14Z","timestamp":1558923674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}