☰

Lars Arge - Publications

Affiliations: 
Duke University, Durham, NC 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

64 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2014 Arge L, Truelsen J, Yang J. Simplifying massive planar subdivisions Proceedings of the Workshop On Algorithm Engineering and Experiments. 20-30. DOI: 10.1137/1.9781611973198.3  0.398
2014 Alexander C, Bøcher PK, Arge L, Svenning JC. Regional-scale mapping of tree cover, height and main phenological tree types using airborne laser scanning data Remote Sensing of Environment. 147: 156-172. DOI: 10.1016/J.Rse.2014.02.013  0.383
2013 Arge L, Goodrich MT, Van Walderveen F. Computing betweenness centrality in external memory Proceedings - 2013 Ieee International Conference On Big Data, Big Data 2013. 368-375. DOI: 10.1109/BigData.2013.6691597  0.303
2013 Agarwal PK, Arge L, Govindarajan S, Yang J, Yi K. Efficient external memory structures for range-aggregate queries Computational Geometry: Theory and Applications. 46: 358-370. DOI: 10.1016/J.Comgeo.2012.10.003  0.472
2013 Arge L, Thorup M. RAM-efficient external memory sorting Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8283: 491-501. DOI: 10.1007/S00453-015-0032-8  0.428
2013 Afshani P, Agarwal PK, Arge L, Larsen KG, Phillips JM. (Approximate) Uncertain Skylines Theory of Computing Systems. 52: 342-366. DOI: 10.1007/S00224-012-9382-7  0.377
2013 Arge L, Brodal GS, Truelsen J, Tsirogiannis C. An optimal and practical cache-oblivious algorithm for computing multiresolution rasters Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8125: 61-72. DOI: 10.1007/978-3-642-40450-4_6  0.395
2013 Arge L, Van Walderveen F, Zeh N. Multiway simple cycle separators and I/O-efficient algorithms for planar graphs Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 901-918.  0.377
2012 Arge L, Haverkort H, Tsirogiannis C. Fast generation of multiple resolution instances of raster data sets Gis: Proceedings of the Acm International Symposium On Advances in Geographic Information Systems. 52-60. DOI: 10.1145/2424321.2424329  0.428
2012 Arge L, Larsen KG. I/O-efficient spatial data structures for range queries Sigspatial Special. 4: 2-7. DOI: 10.1145/2367574.2367575  0.441
2012 Agarwal PK, Arge L, Kaplan H, Molad E, Tarjan RE, Yi K. An optimal dynamic data structure for stabbing-semigroup queries Siam Journal On Computing. 41: 104-127. DOI: 10.1137/10078791X  0.428
2010 Arge L, Larsen KG, Mølhave T, Van Walderveen F. Cleaning massive sonar point clouds Gis: Proceedings of the Acm International Symposium On Advances in Geographic Information Systems. 152-161. DOI: 10.1145/1869790.1869815  0.426
2010 Agarwal PK, Arge L, Yi K. I/O-efficient batched union-find and its applications to terrain analysis Acm Transactions On Algorithms. 7. DOI: 10.1145/1868237.1868249  0.551
2010 Arge L, Revsbæk M, Zeh N. I/O-efficient computation of water flow across a terrain Proceedings of the Annual Symposium On Computational Geometry. 403-412. DOI: 10.1145/1810959.1811026  0.331
2010 Arge L, Sitchinava N, Goodrich MT. Parallel external memory graph algorithms Proceedings of the 2010 Ieee International Symposium On Parallel and Distributed Processing, Ipdps 2010. DOI: 10.1109/IPDPS.2010.5470440  0.398
2009 Arge L. Worst-case efficient range search indexing: Invited tutorial Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 175-176. DOI: 10.1145/1559795.1559822  0.422
2009 Arge L, De Berg M, Haverkort H. Cache-oblivious R-trees Algorithmica (New York). 53: 50-68. DOI: 10.1007/S00453-007-9007-8  0.458
2009 Arge L, Revsbæk M. I/O-efficient contour tree simplification Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5878: 1155-1165. DOI: 10.1007/978-3-642-10631-6_116  0.436
2008 Arge L, Goodrich MT, Nelson M, Sitchinava N. Fundamental parallel algorithms for private-cache chip multiprocessors Annual Acm Symposium On Parallelism in Algorithms and Architectures. 197-206. DOI: 10.1145/1378533.1378573  0.394
2008 Agarwal PK, Arge L, Moølhave T, Sadri B. I/O-efflcient algorithms for computing contours on a terrain Proceedings of the Annual Symposium On Computational Geometry. 129-138. DOI: 10.1145/1377676.1377698  0.39
2008 Arge L, De Berg M, Haverkort H, Yi K. The priority R-tree: A practically efficient and worst-case optimal R-tree Acm Transactions On Algorithms. 4. DOI: 10.1145/1328911.1328920  0.369
2008 Arge L, Brodal GS, Rao SS. External memory planar point location with logarithmic updates Proceedings of the Annual Symposium On Computational Geometry. 139-147. DOI: 10.1007/S00453-011-9541-2  0.479
2007 Arge L, Vengroff DE, Vitter JS. External-memory algorithms for processing line segments in geographic information systems Algorithmica (New York). 47: 1-25. DOI: 10.7146/Brics.V3I12.19975  0.452
2007 Arge L, Bender MA, Demaine ED, Holland-Minkley B, Munro JI. An optimal cache-oblivious priority queue and its application to graph algorithms Siam Journal On Computing. 36: 1672-1695. DOI: 10.1137/S0097539703428324  0.459
2006 Arge L, Meyer U, Toma L, Zeh N. On external-memory planar depth first search Graph Algorithms and Applications 4. 105-130. DOI: 10.1142/9789812773296_0005  0.452
2006 Arge L, Danner A, Haverkort H, Zeh N. I/O-efficient hierarchical watershed decomposition of grid terrain models Progress in Spatial Data Handling - 12th International Symposium On Spatial Data Handling, Sdh 2006. 825-844. DOI: 10.1007/3-540-35589-8_51  0.683
2006 Agarwal PK, Arge L, Danner A. From point cloud to grid DEM: A scalable approach Progress in Spatial Data Handling - 12th International Symposium On Spatial Data Handling, Sdh 2006. 771-788. DOI: 10.1007/3-540-35589-8_48  0.666
2006 Arge L, Zeh N. Simple and semi-dynamic structured for cache-oblivious planar orthogonal range searching Proceedings of the Annual Symposium On Computational Geometry. 2006: 158-166.  0.366
2005 Arge L, Eppstein D, Goodrich MT. Skip-webs: Efficient distributed data structures for multi-dimensional data sets Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 24: 69-76. DOI: 10.1145/1073814.1073827  0.343
2005 Arge L, Brodal GS, Fagerberg R, Laustsen M. Cache-oblivious planar orthogonal range searching and counting Proceedings of the Annual Symposium On Computational Geometry. 160-169. DOI: 10.1145/1064092.1064119  0.313
2005 Arge L, Toma L. External data structures for shortest path queries on planar digraphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3827: 328-338. DOI: 10.1007/11602613_34  0.357
2005 Agarwal PK, Arge L, Yi K. I/O-efficient construction of constrained delaunay triangulations Lecture Notes in Computer Science. 3669: 355-366.  0.436
2005 Agarwal PK, Arge L, Yi K. An optimal dynamic interval stabbing-max data structure? Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 803-812.  0.389
2004 Arge L, Brodal GS, Toma L. On external-memory MST, SSSP and multi-way planar graph separation Journal of Algorithms. 53: 186-206. DOI: 10.1016/J.Jalgor.2004.04.001  0.739
2004 Arge L, Vahrenhold J. I/O-efficient dynamic planar point location Computational Geometry: Theory and Applications. 29: 147-162. DOI: 10.1016/J.Comgeo.2003.04.001  0.498
2004 Arge L, Samoladas V, Yi K. Optimal external memory planar point enclosure Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3221: 40-52. DOI: 10.1007/S00453-007-9126-2  0.475
2004 Arge L, Toma L. Simplified external memory algorithms for planar DAGs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3111: 493-503.  0.464
2004 Arge L, Meyer U, Toma L. External memory algorithms for diameter and all-pairs shortest-paths on sparse graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3142: 146-157.  0.391
2003 Arge L, Danner A, Teh SM. I/O-efficient point location using persistent B-trees Journal of Experimental Algorithmics. 8. DOI: 10.1145/996546.996549  0.692
2003 Arge L, Vitter JS. Optimal external memory interval management Siam Journal On Computing. 32: 1488-1508. DOI: 10.1137/S009753970240481X  0.437
2003 Arge L, Zeh N. I/O-efficient strong connectivity and depth-first search for directed planar graphs Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2003: 261-270. DOI: 10.1109/SFCS.2003.1238200  0.388
2003 Arge L, Chase JS, Halpin P, Toma L, Vitter JS, Urban D, Wickremesinghe R. Efficient flow computation on massive grid terrain datasets Geoinformatica. 7: 283-313. DOI: 10.1023/A:1025526421410  0.744
2003 Agarwal PK, Arge L, Erickson J. Indexing moving points Journal of Computer and System Sciences. 66: 207-243. DOI: 10.1016/S0022-0000(02)00035-1  0.389
2003 Arge L. The buffer tree: A technique for designing batched external data structures Algorithmica (New York). 37: 1-24. DOI: 10.1007/S00453-003-1021-X  0.569
2003 Govindarajan S, Agarwal PK, Arge L. CRB-tree: An efficient indexing scheme for range-aggregate queries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2572: 143-157.  0.354
2003 Arge L, Meyer U, Toma L, Zeh N. On external-memory planar depth-first search Journal of Graph Algorithms and Applications. 7: 105-129.  0.451
2003 Agarwal PK, Arge L, Danner A, Holland-Minkley B. Cache-oblivious data structures for orthogonal range searching Proceedings of the Annual Symposium On Computational Geometry. 237-245.  0.642
2003 Agarwal PK, Arge L, Yang J, Yi K. I/O-efficient structures for orthogonal range-max and stabbing-max queries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2832: 7-18.  0.354
2003 Arge L, Toma L, Zeh N. I/O-efficient topological sorting of planar DAGs Annual Acm Symposium On Parallel Algorithms and Architectures. 85-93.  0.338
2003 Procopiuc O, Agarwal PK, Arge L, Vitter JS. Bkd-tree: A dynamic scalable kd-tree Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2750: 46-65.  0.752
2002 Wickremesinghe R, Arge L, Chase JS, Vitter JS. Efficient sorting using register and caches Journal of Experimental Algorithmics. 7. DOI: 10.1007/3-540-44691-5_5  0.436
2002 Arge L, Bender MA, Demaine ED, Holland-Minkley B, Munro JI. Cache-oblivious priority queue and graph algorithm applications Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 268-276.  0.36
2002 Arge L, Procopiuc O, Vitter JS. Implementing I/O-efficient data structures using TPIE Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2461: 88-100.  0.752
2001 Arge L, Toma L, Vitter JS. I/O-efficient algorithms for problems on grid-based terrains Journal of Experimental Algorithmics. 6. DOI: 10.1145/945394.945395  0.761
2001 Arge L. External memory data structures (Invited paper) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2161: 1-29.  0.339
2001 Agarwal PK, Arge L, Procopiuc O, Vittery JS. A framework for index bulk loading and dynamization Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2076: 115-127.  0.764
2001 Arge L, Chase J, Vitter JS, Wickremesinghe R. Efficient sorting using registers and caches Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1982: 51-62.  0.34
2000 Arge L, Procopiuc O, Ramaswamy S, Suel T, Vahrenhold J, Scott JV. A unified approach for indexed and non-indexed spatial joins Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1777: 413-429.  0.739
1997 Arge L, Ferragina P, Grossi R, Vitter JS. Sequence sorting in secondary storage Sequence. 331. DOI: 10.1109/Sequen.1997.666927  0.407
1995 Arge L. The I/O-complexity of ordered binary-decision diagram manipulation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1004: 82-91. DOI: 10.7146/Brics.V3I29.20010  0.495
1995 Arge L. The buffer tree: A new technique for optimal I/O-algorithms Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 955: 334-345. DOI: 10.7146/Brics.V3I28.20009  0.58
1995 Arge L, Vengroff DE, Vitter JS. External-memory algorithms for processing line segments geographic information systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 979: 295-310.  0.36
1994 Arge L. External-Storage Data Structures for Plane-Sweep Algorithms Brics Report Series. 1. DOI: 10.7146/Brics.V1I16.21651  0.576
1992 Arge L, Knudsen M, Larsen K. A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms Daimi Report Series. 21. DOI: 10.7146/dpb.v21i407.6641  0.406
Show low-probability matches.