{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T12:10:10Z","timestamp":1744027810070,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_39","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"443-454","source":"Crossref","is-referenced-by-count":1,"title":["Faster Geometric Algorithms via Dynamic\u00a0Determinant\u00a0Computation"],"prefix":"10.1007","author":[{"given":"Vissarion","family":"Fisikopoulos","sequence":"first","affiliation":[]},{"given":"Luis","family":"Pe\u00f1aranda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Abbott, J., Bronstein, M., Mulders, T.: Fast deterministic computation of determinants of dense matrices. In: ISSAC, pp. 197\u2013203 (1999)","DOI":"10.1145\/309831.309934"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Avis, D.: lrs: A revised implementation of the reverse search vertex enumeration algorithm. In: Polytopes - Combinatorics and Computation, Oberwolfach Seminars, vol.\u00a029, pp. 177\u2013198. Birkh\u00e4user-Verlag (2000)","DOI":"10.1007\/978-3-0348-8438-9_9"},{"issue":"1","key":"39_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1214\/aoms\/1177729698","volume":"22","author":"M.S. Bartlett","year":"1951","unstructured":"Bartlett, M.S.: An inverse matrix adjustment arising in discriminant analysis. The Annals of Mathematical Statistics\u00a022(1), 107\u2013111 (1951)","journal-title":"The Annals of Mathematical Statistics"},{"key":"39_CR4","unstructured":"Barvinok, A., Pommersheim, J.E.: An algorithmic theory of lattice points in polyhedra. New Perspectives in Algebraic Combinatorics, 91\u2013147 (1999)"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1016\/j.ipl.2011.08.006","volume":"111","author":"R. Bird","year":"2011","unstructured":"Bird, R.: A simple division-free algorithm for computing determinants. Inf. Process. Lett.\u00a0111, 1072\u20131074 (2011)","journal-title":"Inf. Process. Lett."},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Boissonnat, J.D., Devillers, O., Hornus, S.: Incremental construction of the Delaunay triangulation and the Delaunay graph in medium dimension. In: SoCG, pp. 208\u2013216 (2009)","DOI":"10.1145\/1542362.1542403"},{"key":"39_CR7","unstructured":"Boost: peer reviewed C++ libraries, http:\/\/www.boost.org"},{"issue":"1","key":"39_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0304-3975(98)00101-7","volume":"210","author":"H. Br\u00f6nnimann","year":"1999","unstructured":"Br\u00f6nnimann, H., Emiris, I., Pan, V., Pion, S.: Sign determination in Residue Number Systems. Theor. Comp. Science\u00a0210(1), 173\u2013197 (1999)","journal-title":"Theor. Comp. Science"},{"key":"39_CR9","unstructured":"B\u00fceler, B., Enge, A., Fukuda, K.: Exact volume computation for polytopes: A practical study (1998)"},{"key":"39_CR10","unstructured":"CGAL: Computational geometry algorithms library, http:\/\/www.cgal.org"},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0925-7721(93)90009-U","volume":"3","author":"K. Clarkson","year":"1993","unstructured":"Clarkson, K., Mehlhorn, K., Seidel, R.: Four results on randomized incremental constructions. Comput. Geom.: Theory & Appl.\u00a03, 185\u2013212 (1993)","journal-title":"Comput. Geom.: Theory & Appl."},{"key":"39_CR12","series-title":"Graduate Texts in Mathematics","volume-title":"Using Algebraic Geometry","author":"D.A. Cox","year":"2005","unstructured":"Cox, D.A., Little, J., O\u2019Shea, D.: Using Algebraic Geometry. Graduate Texts in Mathematics. Springer, Heidelberg (2005)"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Dumas, J.G., Gautier, T., Giesbrecht, M., Giorgi, P., Hovinen, B., Kaltofen, E., Saunders, B., Turner, W., Villard, G.: Linbox: A generic library for exact linear algebra. In: ICMS, pp. 40\u201350 (2002)","DOI":"10.1142\/9789812777171_0005"},{"key":"39_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in combinatorial geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in combinatorial geometry. Springer-Verlag New York, Inc., New York (1987)"},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"Emiris, I., Fisikopoulos, V., Konaxis, C., Pe\u00f1aranda, L.: An output-sensitive algorithm for computing projections of resultant polytopes. In: SoCG, pp. 179\u2013188 (2012)","DOI":"10.1145\/2261250.2261276"},{"key":"39_CR16","unstructured":"Fukuda, K.: cddlib, version 0.94f (2008), http:\/\/www.ifor.math.ethz.ch\/~fukuda\/cdd_home"},{"key":"39_CR17","doi-asserted-by":"crossref","unstructured":"Gawrilow, E., Joswig, M.: Polymake: a framework for analyzing convex polytopes, pp. 43\u201374 (1999)","DOI":"10.1007\/978-3-0348-8438-9_2"},{"key":"39_CR18","unstructured":"Guennebaud, G., Jacob, B., et al.: Eigen\u00a0v3 (2010), http:\/\/eigen.tuxfamily.org"},{"key":"39_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/b98818","volume-title":"Matrix algebra from a statistician\u2019s perspective","author":"D.A. Harville","year":"1997","unstructured":"Harville, D.A.: Matrix algebra from a statistician\u2019s perspective. Springer, New York (1997)"},{"key":"39_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00037-004-0185-3","volume":"13","author":"E. Kaltofen","year":"2005","unstructured":"Kaltofen, E., Villard, G.: On the complexity of computing determinants. Computational Complexity\u00a013, 91\u2013130 (2005)","journal-title":"Computational Complexity"},{"key":"39_CR21","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.laa.2005.06.042","volume":"411","author":"C. Krattenthaler","year":"2005","unstructured":"Krattenthaler, C.: Advanced determinant calculus: A complement. Linear Algebra Appl.\u00a0411, 68 (2005)","journal-title":"Linear Algebra Appl."},{"key":"39_CR22","unstructured":"Poole, D.: Linear Algebra: A Modern Introduction. Cengage Learning (2006)"},{"key":"39_CR23","doi-asserted-by":"crossref","unstructured":"Rambau, J.: TOPCOM: Triangulations of point configurations and oriented matroids. In: Cohen, A., Gao, X.S., Takayama, N. (eds.) Math. Software: ICMS, pp. 330\u2013340. World Scientific (2002)","DOI":"10.1142\/9789812777171_0035"},{"key":"39_CR24","doi-asserted-by":"crossref","unstructured":"Rote, G.: Division-free algorithms for the determinant and the Pfaffian: algebraic and combinatorial approaches. Comp. Disc. Math., 119\u2013135 (2001)","DOI":"10.1007\/3-540-45506-X_9"},{"key":"39_CR25","doi-asserted-by":"crossref","unstructured":"Sankowski, P.: Dynamic transitive closure via dynamic matrix inverse. In: Proc. IEEE Symp. on Found. Comp. Sci., pp. 509\u2013517 (2004)","DOI":"10.1109\/FOCS.2004.25"},{"key":"39_CR26","unstructured":"Seidel, R.: A convex hull algorithm optimal for point sets in even dimensions. Tech. Rep. 81-14, Dept. Comp. Sci., Univ. British Columbia, Vancouver (1981)"},{"issue":"1","key":"39_CR27","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1214\/aoms\/1177729893","volume":"21","author":"J. Sherman","year":"1950","unstructured":"Sherman, J., Morrison, W.J.: Adjustment of an inverse matrix corresponding to a change in one element of a given matrix. The Annals of Mathematical Statistics\u00a021(1), 124\u2013127 (1950)","journal-title":"The Annals of Mathematical Statistics"},{"key":"39_CR28","doi-asserted-by":"crossref","unstructured":"Ziegler, G.: Lectures on Polytopes. Springer (1995)","DOI":"10.1007\/978-1-4613-8431-1"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T11:34:43Z","timestamp":1744025683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}