{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T08:30:00Z","timestamp":1676449800579},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T00:00:00Z","timestamp":1308009600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s00453-011-9537-y","type":"journal-article","created":{"date-parts":[[2011,6,13]],"date-time":"2011-06-13T14:29:52Z","timestamp":1307975392000},"page":"363-397","source":"Crossref","is-referenced-by-count":3,"title":["Interval Partitions and Polynomial Factorization"],"prefix":"10.1007","volume":"63","author":[{"given":"Joachim","family":"von\u00a0zur Gathen","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Panario","sequence":"additional","affiliation":[]},{"given":"Bruce","family":"Richmond","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,14]]},"reference":[{"key":"9537_CR1","volume-title":"Handbook of Mathematical Functions","author":"M. Abramowitz","year":"1970","unstructured":"Abramowitz, M., Stegun, I.: Handbook of Mathematical Functions. Dover, New York (1970)"},{"issue":"1","key":"9537_CR2","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/504331.504333","volume":"35","author":"O. Bonorden","year":"2001","unstructured":"Bonorden, O., von\u00a0zur Gathen, J., Gerhard, J., M\u00fcller, O., N\u00f6cker, M.: Factoring a binary polynomial of degree over one million. ACM SIGSAM Bull. 35(1), 16\u201318 (2001)","journal-title":"ACM SIGSAM Bull."},{"key":"9537_CR3","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1145\/322092.322099","volume":"25","author":"R.P. Brent","year":"1978","unstructured":"Brent, R.P., Kung, H.-T.: Fast algorithms for manipulating formal power series. J. Assoc. Comput. Mach. 25, 581\u2013595 (1978)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9537_CR4","series-title":"Contemporary Mathematics","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1090\/conm\/461\/08982","volume-title":"Proc. Fq8, Melbourne, Australia","author":"R.P. Brent","year":"2008","unstructured":"Brent, R.P., Zimmermann, P.: A multi-level blocking distinct-degree factorization algorithm. In: Mullen, G.L., Panario, D., Shparlinski, I. (eds.) Proc. Fq8, Melbourne, Australia. Contemporary Mathematics, vol. 461, pp. 47\u201358. Am. Math. Soc., Providence (2008)"},{"key":"9537_CR5","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0606517-5","volume":"36","author":"D.G. Cantor","year":"1981","unstructured":"Cantor, D.G., Zassenhaus, H.: A new algorithm for factoring polynomials over finite fields. Math. Comput. 36, 587\u2013592 (1981)","journal-title":"Math. Comput."},{"key":"9537_CR6","unstructured":"Darboux, G.: M\u00e9moires sur l\u2019approximation des fonctions de\u00a0tr\u00e9s-grands nombres, et sur une classe \u00e9tendue de\u00a0d\u00e9veloppements en s\u00e9rie. Journal de Math\u00e9matiques Pures et Appliqu\u00e9es 4, 5\u201356, 377\u2013416 (1878)"},{"key":"9537_CR7","doi-asserted-by":"crossref","first-page":"R103","DOI":"10.37236\/1129","volume":"13","author":"P. Flajolet","year":"2006","unstructured":"Flajolet, P., Fusy, \u00c9., Gourdon, X., Panario, D., Pouyanne, N.: A hybrid of Darboux\u2019s method and singularity analysis in combinatorial asymptotics. Electron. J. Comb. 13, R103 (2006)","journal-title":"Electron. J. Comb."},{"key":"9537_CR8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1006\/jagm.2001.1158","volume":"40","author":"P. Flajolet","year":"2001","unstructured":"Flajolet, P., Gourdon, X., Panario, D.: The complete analysis of a polynomial factorization algorithm over finite fields. J. Algorithms 40, 37\u201381 (2001)","journal-title":"J. Algorithms"},{"issue":"2","key":"9537_CR9","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0403019","volume":"3","author":"P. Flajolet","year":"1990","unstructured":"Flajolet, P., Odlyzko, A.: Singularity analysis of generating functions. SIAM J. Discrete Math. 3(2), 216\u2013240 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"9537_CR10","volume-title":"Analytic Combinatorics","author":"P. Flajolet","year":"2008","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2008)"},{"key":"9537_CR11","unstructured":"Gourdon, X.: Combinatoire, algorithmique et g\u00e9om\u00e9trie des polyn\u00f4mes. Th\u00e8se, \u00c9cole Polytechnique (1996)"},{"key":"9537_CR12","volume-title":"Concrete Mathematics","author":"R. Graham","year":"1994","unstructured":"Graham, R., Knuth, D.E., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison-Wesley, Reading (1994)","edition":"2"},{"key":"9537_CR13","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1090\/S0025-5718-98-00944-2","volume":"67","author":"E. Kaltofen","year":"1998","unstructured":"Kaltofen, E., Shoup, V.: Subquadratic-time factorization of polynomials over finite fields. Math. Comput. 67, 1179\u20131197 (1998)","journal-title":"Math. Comput."},{"key":"9537_CR14","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1109\/FOCS.2008.13","volume-title":"49th Annual IEEE Symposium on Foundations of Computer Science","author":"K.S. Kedlaya","year":"2008","unstructured":"Kedlaya, K.S., Umans, C.: Fast modular composition in any characteristic. In: 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 146\u2013155 (2008)"},{"key":"9537_CR15","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Finite Fields","author":"R. Lidl","year":"1983","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Encyclopedia of Mathematics and its Applications, vol.\u00a020. Addison-Wesley, Reading (1983)"},{"key":"9537_CR16","first-page":"1063","volume-title":"Handbook of Combinatorics","author":"A. Odlyzko","year":"1995","unstructured":"Odlyzko, A.: Asymptotic enumeration methods. In: Graham, R., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.) Handbook of Combinatorics, vol. 2, pp. 1063\u20131229. Elsevier, Amsterdam (1995)"},{"key":"9537_CR17","series-title":"AKP Classics","doi-asserted-by":"crossref","DOI":"10.1201\/9781439864548","volume-title":"Asymptotics and Special Functions","author":"F. Olver","year":"1997","unstructured":"Olver, F.: Asymptotics and Special Functions. AKP Classics. AK Peters, Wellesley (1997)"},{"key":"9537_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-540-24633-6_8","volume-title":"Proc. Fq7","author":"D. Panario","year":"2004","unstructured":"Panario, D.: What do random polynomials over finite fields look like. In: Mullen, G.L., Poli, A., Stichtenoth, H. (eds.) Proc. Fq7, Toulouse, France. Lecture Notes in Computer Science, vol. 2948, pp. 89\u2013108. Springer, Berlin (2004)"},{"key":"9537_CR19","volume-title":"An Introduction to the Analysis of Algorithms","author":"R. Sedgewick","year":"1996","unstructured":"Sedgewick, R., Flajolet, P.: An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading (1996)"},{"key":"9537_CR20","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1006\/jsco.1995.1055","volume":"20","author":"V. Shoup","year":"1996","unstructured":"Shoup, V.: A new polynomial factorization algorithm and its implementation. J. Symb. Comput. 20, 363\u2013397 (1996)","journal-title":"J. Symb. Comput."},{"key":"9537_CR21","first-page":"1","volume-title":"Proc. ISSAC\u201996","author":"J. Gathen von\u00a0zur","year":"1996","unstructured":"von\u00a0zur Gathen, J., Gerhard, J.: Arithmetic and factorization of polynomials over ${\\mathbb{F}}_{2}$ . In: Proc. ISSAC\u201996, Z\u00fcrich, Switzerland, pp. 1\u20139. ACM, New York (1996)"},{"key":"9537_CR22","doi-asserted-by":"crossref","first-page":"1677","DOI":"10.1090\/S0025-5718-02-01421-7","volume":"71","author":"J. Gathen von\u00a0zur","year":"2002","unstructured":"von\u00a0zur Gathen, J., Gerhard, J.: Polynomial factorization over ${\\mathbb{F}}_{2}$ . Math. Comput. 71, 1677\u20131698 (2002)","journal-title":"Math. Comput."},{"key":"9537_CR23","volume-title":"Modern Computer Algebra","author":"J. Gathen von\u00a0zur","year":"2003","unstructured":"von\u00a0zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, Cambridge (2003)","edition":"2"},{"key":"9537_CR24","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1006\/jsco.1999.1002","volume":"31","author":"J. Gathen von\u00a0zur","year":"2001","unstructured":"von\u00a0zur Gathen, J., Panario, D.: Factoring polynomials over finite fields: a survey. J. Symb. Comput. 31, 3\u201317 (2001)","journal-title":"J. Symb. Comput."},{"key":"9537_CR25","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01272074","volume":"2","author":"J. Gathen von\u00a0zur","year":"1992","unstructured":"von\u00a0zur Gathen, J., Shoup, V.: Computing Frobenius maps and factoring polynomials. Comput. Complex. 2, 187\u2013224 (1992)","journal-title":"Comput. Complex."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9537-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9537-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9537-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,20]],"date-time":"2020-06-20T03:14:07Z","timestamp":1592622847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9537-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,14]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9537"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9537-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,14]]}}}