{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T12:40:07Z","timestamp":1746362407841,"version":"3.40.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319105147"},{"type":"electronic","value":"9783319105154"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10515-4_28","type":"book-chapter","created":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T05:23:50Z","timestamp":1409549030000},"page":"388-402","source":"Crossref","is-referenced-by-count":0,"title":["Factoring Sparse Bivariate Polynomials Using the Priority Queue"],"prefix":"10.1007","author":[{"given":"Fatima K. Abu","family":"Salem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khalil","family":"El-Harake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karl","family":"Gemayel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Abu Salem, F.K., Gao, S., Lauder, A.G.B.: Factoring polynomials via polytopes. In: Proc. of ISSAC, pp. 4\u201311 (2004)","DOI":"10.1145\/1005285.1005289"},{"issue":"5","key":"28_CR2","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.jsc.2007.10.011","volume":"43","author":"F.K. Abu Salem","year":"2008","unstructured":"Abu Salem, F.K.: An efficient sparse adaptation of the polytope method over $\\mathbb{F}_p$ and a record-high binary bivariate factorisation. J. Symb. Comp.\u00a043(5), 311\u2013341 (2008)","journal-title":"J. Symb. Comp."},{"issue":"9","key":"28_CR3","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.: The input\/output complexity of sorting and related problems. Communications of the ACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"Communications of the ACM"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Arge, L., Bender, M.A., Demaine, E.D., Holland-Minkley, B., Munro, J.I.: Cache-oblivious priority queue and graph algorithm applications. In: Proc. of STOC, pp. 268\u2013276 (2002)","DOI":"10.1145\/509907.509950"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Bernardin, L., Monagan, M.B.: Efficient multivariate factorization over finite fields. In: Mora, T., Mattson, H. (eds.) AAECC. LNCS, vol.\u00a01255, pp. 15\u201328. Springer, Heidelberg (1997)","DOI":"10.1007\/3-540-63163-1_2"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Bostan, A., Lecerf, G., Salvy, B., Schost, E., Wiebelt, B.: Complexity issues in bivariate polynomial factorization. In: Proc. of ISSAC, pp. 42\u201349 (2004)","DOI":"10.1145\/1005285.1005294"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-36136-7_20","volume-title":"Algorithms and Computation","author":"G.S. Brodal","year":"2002","unstructured":"Brodal, G.S., Fagerberg, R.: Funnel heap - a cache oblivious priority queue. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 219\u2013228. Springer, Heidelberg (2002)"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-540-27810-8_41","volume-title":"Algorithm Theory - SWAT 2004","author":"G.S. Brodal","year":"2004","unstructured":"Brodal, G.S., Fagerberg, R., Meyer, U., Zeh, N.: Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 480\u2013492. Springer, Heidelberg (2004)"},{"issue":"1","key":"28_CR9","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/844076.844080","volume":"37","author":"R. Fateman","year":"2003","unstructured":"Fateman, R.: Comparing the speed of programs for sparse polynomial multiplication. ACM SIGSAM Bulletin\u00a037(1), 4\u201315 (2003)","journal-title":"ACM SIGSAM Bulletin"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"1663","DOI":"10.1090\/S0025-5718-01-01393-X","volume":"71","author":"S. Gao","year":"2002","unstructured":"Gao, S., Lauder, A.G.B.: Hensel lifting and bivariate polynomial factorisation over finite fields. Math. Comp.\u00a071, 1663\u20131676 (2002)","journal-title":"Math. Comp."},{"key":"28_CR11","unstructured":"Goodrich, M., Tamassia, R.: Algorithm Design. John Wiley and Sons (2002)"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1086837.1086847","volume":"8","author":"S.C. Johnson","year":"1974","unstructured":"Johnson, S.C.: Sparse polynomial arithmetic. ACM SIGSAM Bulletin\u00a08, 63\u201371 (1974)","journal-title":"ACM SIGSAM Bulletin"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Frigo, H.P.M., Leiserson, C.E., Ramachandran, S.: Cache-oblivious algorithms. In: Proc. of FOCS, pp. 285\u2013297 (1999)","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-540-75187-8_23","volume-title":"Computer Algebra in Scientific Computing","author":"M. Monagan","year":"2007","unstructured":"Monagan, M., Pearce, R.: Polynomial division using dynamic arrays, heaps, and packed exponent vectors. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2007. LNCS, vol.\u00a04770, pp. 295\u2013315. Springer, Heidelberg (2007)"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Monagan, M., Pearce, R.: Parallel sparse polynomial multiplication using heaps. In: Proc. ISSAC, pp. 263\u2013269 (2009)","DOI":"10.1145\/1576702.1576739"},{"issue":"7","key":"28_CR16","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1016\/j.jsc.2010.08.014","volume":"46","author":"M. Monagan","year":"2011","unstructured":"Monagan, M., Pearce, R.: Sparse polynomial pseudo division using a heap. J. Symb. Comp.\u00a046(7), 807\u2013822 (2011)","journal-title":"J. Symb. Comp."},{"issue":"2","key":"28_CR17","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0022-314X(01)92763-5","volume":"95","author":"M. Hoeij Von","year":"2002","unstructured":"Von Hoeij, M.: Factoring polynomials and the knapsack problem. J. Number Theory\u00a095(2), 167\u2013189 (2002)","journal-title":"J. Number Theory"},{"key":"28_CR18","unstructured":"Von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press (1999)"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1090\/S0025-5718-1990-1011448-0","volume":"54","author":"D.Q. Wan","year":"1990","unstructured":"Wan, D.Q.: Factoring multivariate polynomials over large finite fields. Math. Comp.\u00a054, 755\u2013770 (1990)","journal-title":"Math. Comp."},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0022-314X(69)90047-X","volume":"1","author":"H. Zassenhaus","year":"1969","unstructured":"Zassenhaus, H.: On Hensel factorization I. J. Number Theory\u00a01, 291\u2013311 (1969)","journal-title":"J. Number Theory"},{"key":"28_CR21","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1090\/S0025-5718-1975-0396471-3","volume":"29","author":"P. Wang","year":"1975","unstructured":"Wang, P., Rothschild, L.: Factoring multivariate polynomials over the integers. Math. Comp.\u00a029, 935\u2013950 (1975)","journal-title":"Math. Comp."}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10515-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T12:15:15Z","timestamp":1746360915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10515-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319105147","9783319105154"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10515-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}