{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T18:51:38Z","timestamp":1673722298797},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,3,24]],"date-time":"2010-03-24T00:00:00Z","timestamp":1269388800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s00607-010-0086-z","type":"journal-article","created":{"date-parts":[[2010,3,23]],"date-time":"2010-03-23T01:01:07Z","timestamp":1269306067000},"page":"55-78","source":"Crossref","is-referenced-by-count":1,"title":["An empirical study of cache-oblivious polygon indecomposability testing"],"prefix":"10.1007","volume":"88","author":[{"given":"Fatima K.","family":"Abu Salem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rawan N.","family":"Soudah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,24]]},"reference":[{"issue":"5","key":"86_CR1","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/j.jsc.2007.10.011","volume":"43","author":"FK Abu Salem","year":"2008","unstructured":"Abu Salem FK (2008) An efficient sparse adaptation of the polytope method over $${\\mathbb{F}_p}$$ and a record-high binary bivariate factorisation. J Symb Comput 43(5): 311\u2013341","journal-title":"J Symb Comput"},{"key":"86_CR2","unstructured":"Abu Salem FK. Cache-oblivious polygon indecomposability testing. Pre-print. http:\/\/www.cs.aub.edu.lb\/fa21\/Papers\/COIrredTheory.pdf"},{"key":"86_CR3","unstructured":"Abu Salem FK, Soudah RN, Extended report on empirical, cache-oblivious polygon indecomposability testing. Technical Report. http:\/\/dr.aub.edu.lb\/file.php\/2\/moddata\/data\/3\/24\/1509\/Paper.pdf"},{"issue":"9","key":"86_CR4","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal A, Vitter JS (1988) The input\/output complexity of sorting and related problems. Commun ACM 31(9): 1116\u20131127","journal-title":"Commun ACM"},{"key":"86_CR5","doi-asserted-by":"crossref","unstructured":"Bader M, Zenger C (2006) Cache oblivious matrix multiplication using an element ordering based on the Peano curve. In: Proc. PPAM 2006, pp 1042\u20131049","DOI":"10.1016\/j.laa.2006.03.018"},{"issue":"3-4","key":"86_CR6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma W, Cannon J, Playoust C (1997) The Magma algebra system I. the user language. J Symb Comput 24(3-4): 235\u2013265","journal-title":"J Symb Comput"},{"key":"86_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0220001","volume":"20","author":"D Duval","year":"1991","unstructured":"Duval D (1991) Absolute factorization of polynomials: a geometric approach. SIAM J Comput 20: 1\u201321","journal-title":"SIAM J Comput"},{"key":"86_CR8","doi-asserted-by":"crossref","unstructured":"Frigo M, Leiserson CE, Prokop H, Ramachandran S (1999) Cache-oblivious algorithms. In: Proceedings of the 40th annual symposium on foundations of computer science, pp 285\u2013297, 1999","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"86_CR9","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1006\/jabr.2000.8586","volume":"237","author":"S Gao","year":"2001","unstructured":"Gao S (2001) Absolute irreducibility of polynomials via Newton polytopes. J Algebra 237: 501\u2013520","journal-title":"J Algebra"},{"key":"86_CR10","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1090\/S0025-5718-02-01428-X","volume":"72","author":"S Gao","year":"2003","unstructured":"Gao S (2003) Factoring multivariate polynomials via partial differential equations. Math Comput 72: 801\u2013822","journal-title":"Math Comput"},{"key":"86_CR11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s00454-001-0024-0","volume":"26","author":"S Gao","year":"2001","unstructured":"Gao S, Lauder AGB (2001) Decomposition of polytopes and polynomials. Discrete Comput Geom 26: 89\u2013104","journal-title":"Discrete Comput Geom"},{"issue":"12","key":"86_CR12","doi-asserted-by":"crossref","first-page":"1612","DOI":"10.1109\/12.40842","volume":"38","author":"MD Hill","year":"1989","unstructured":"Hill MD, Smith AJ (1989) Evaluating associativity in CPU caches. IEEE Trans Comput 38(12): 1612\u20131630","journal-title":"IEEE Trans Comput"},{"key":"86_CR13","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1137\/0214035","volume":"14","author":"E Kaltofen","year":"1985","unstructured":"Kaltofen E (1985) Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorisation. SIAM J Sci Comput 14: 469\u2013489","journal-title":"SIAM J Sci Comput"},{"issue":"5","key":"86_CR14","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1109\/TC.2005.79","volume":"54","author":"M Kharbutli","year":"2005","unstructured":"Kharbutli M, Solihin Y, Lee J (2005) Eliminating conflict misses using prime number-based cache indexing. IEEE Trans Comput 54(5): 573\u2013586","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"86_CR15","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0022-0000(85)90016-9","volume":"30","author":"AK Lenstra","year":"1985","unstructured":"Lenstra AK (1985) Factoring multivariate polynomials over finite fields. J Comput Syst Sci 30(2): 235\u2013248","journal-title":"J Comput Syst Sci"},{"issue":"3","key":"86_CR16","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1137\/0216040","volume":"16","author":"AK Lenstra","year":"1987","unstructured":"Lenstra AK (1987) Factoring multivariate polynomials over algebraic number fields. SIAM J Sci Comput 16(3): 591\u2013598","journal-title":"SIAM J Sci Comput"},{"key":"86_CR17","unstructured":"Luo Y, John LK, Eeckhout L (2004) Self-monitored adaptive cache warm-up for microprocessor simulation. In: 16th symposium on computer architecture and high performance computing, 2004. SBAC-PAD 2004, pp 10\u201317"},{"key":"86_CR18","doi-asserted-by":"crossref","unstructured":"Murphy RC, Berry J, McLendon W, Hendrickson B, Gregor D, Lumsdaine A (2006) DFS: a simple to write yet difficult to execute benchmark. In: Proceedings of the IEEE international symposium on workload characterizations IISWC06 2006, pp 175\u2013177","DOI":"10.1109\/IISWC.2006.302741"},{"key":"86_CR19","first-page":"98","volume":"30","author":"AM Ostrowski","year":"1921","unstructured":"Ostrowski AM (1921) \u00dcber die bedeutung der theorie der konvexen polyeder f\u00fcr die formale algebra. Jahresberichte Deutsche Math Verein 30: 98\u201399","journal-title":"Jahresberichte Deutsche Math Verein"},{"issue":"12","key":"86_CR20","doi-asserted-by":"crossref","first-page":"2626","DOI":"10.1109\/TCAD.2006.882588","volume":"25","author":"K Patel","year":"2006","unstructured":"Patel K, Benini L, Marcii E, Poncino M (2006) Reducing conflict misses by application-specific reconfigurable indexing. IEEE Trans Comput-Aid Des Integr Circuits Syst 25(12): 2626\u20132637","journal-title":"IEEE Trans Comput-Aid Des Integr Circuits Syst"},{"key":"86_CR21","doi-asserted-by":"crossref","unstructured":"Rivera G, Tseng C-W (1998) Eliminating conflict misses for high performance architectures. In: proceedings of the 12th international conference on supercomputing, pp 353\u2013360","DOI":"10.1145\/277830.277917"},{"issue":"5","key":"86_CR22","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/277652.277661","volume":"33","author":"G Rivera","year":"1998","unstructured":"Rivera G, Tseng C-W (1998) Data transformations for eliminating conflict misses. ACM SIGPLAN Notices 33(5): 38\u201349","journal-title":"ACM SIGPLAN Notices"},{"key":"86_CR23","volume-title":"Thomas\u2019 Calculus","author":"GB Thomas","year":"2003","unstructured":"Thomas GB, Finney RL, Maurice WD, Giordano FR (2003) Thomas\u2019 Calculus. Addison-Wesley, Reading"},{"issue":"1","key":"86_CR24","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/L-CA.2006.5","volume":"5","author":"C Zhang","year":"2006","unstructured":"Zhang C (2006) Balanced instruction cache: reducing conflict misses of direct-mapped caches through balanced subarray accesses. IEEE Comput Architect Lett 5(1): 2\u20135","journal-title":"IEEE Comput Architect Lett"},{"issue":"171","key":"86_CR25","first-page":"251","volume":"45","author":"J zur Gathen von","year":"1985","unstructured":"von zur Gathen J, Kaltofen E (1985) Factorization of multivariate polynomials over finite fields. Appl Math Comput 45(171): 251\u2013261","journal-title":"Appl Math Comput"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-010-0086-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-010-0086-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-010-0086-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:30:22Z","timestamp":1559140222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-010-0086-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,24]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["86"],"URL":"https:\/\/doi.org\/10.1007\/s00607-010-0086-z","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,24]]}}}