| 2013 |
|---|
| 98 | Efficient external memory structures for range-aggregate queries. Pankaj K. Agarwal, Lars Arge, Sathish Govindarajan, Jun Yang, Ke Yi. Comput. Geom. (46): 358-370 (2013). Web SearchBibTeXDownload |
| 97 | (Approximate) Uncertain Skylines. Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips. Theory Comput. Syst. (52): 342-366 (2013). Web SearchBibTeXDownload |
| 2012 |
|---|
| 96 | External Memory Planar Point Location with Logarithmic Updates. Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao. Algorithmica (63): 457-475 (2012). Web SearchBibTeXDownload |
| 95 | Simplifying Massive Contour Maps. Lars Arge, Lasse Deleuran, Thomas Mølhave, Morten Revsbæk, Jakob Truelsen. ESA 2012, 96-107. Web SearchBibTeXDownload |
| 94 | An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries. Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Molad, Robert Endre Tarjan, Ke Yi. SIAM J. Comput. (41): 104-127 (2012). Web SearchBibTeXDownload |
| 93 | Fast generation of multiple resolution instances of raster data sets. Lars Arge, Herman J. Haverkort, Constantinos Tsirogiannis. SIGSPATIAL/GIS 2012, 52-60. Web SearchBibTeXDownload |
| 92 | I/O-efficient spatial data structures for range queries. Lars Arge, Kasper Green Larsen. SIGSPATIAL Special (4): 2-7 (2012). Web SearchBibTeXDownload |
| 91 | Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model. Peyman Afshani, Lars Arge, Kasper Green Larsen. Symposium on Computational Geometry 2012, 323-332. Web SearchBibTeXDownload |
| 2011 |
|---|
| 90 | (Approximate) uncertain skylines. Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips. ICDT 2011, 186-196. Web SearchBibTeXDownload |
| 2010 |
|---|
| 89 | I/O-efficient batched union-find and its applications to terrain analysis. Pankaj K. Agarwal, Lars Arge, Ke Yi. ACM Transactions on Algorithms (7): 11 (2010). Cited by 16Web SearchBibTeXDownload |
| 88 | Scalable algorithms for large high-resolution terrain data. Thomas Mølhave, Pankaj K. Agarwal, Lars Arge, Morten Revsbæk. COM.Geo 2010. Web SearchBibTeXDownload |
| 87 | Cleaning massive sonar point clouds. Lars Arge, Kasper Green Larsen, Thomas Mølhave, Freek van Walderveen. GIS 2010, 152-161. Web SearchBibTeXDownload |
| 86 | Parallel external memory graph algorithms. Lars Arge, Michael T. Goodrich, Nodari Sitchinava. IPDPS 2010, 1-11. Web SearchBibTeXDownload |
| 85 | Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements. Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen. Symposium on Computational Geometry 2010, 240-246. Web SearchBibTeXDownload |
| 84 | I/O-efficient computation of water flow across a terrain. Lars Arge, Morten Revsbæk, Norbert Zeh. Symposium on Computational Geometry 2010, 403-412. Web SearchBibTeXDownload |
| 2009 |
|---|
| 83 | Cache-Oblivious R-Trees. Lars Arge, Mark de Berg, Herman J. Haverkort. Algorithmica (53): 50-68 (2009). Cited by 12Web SearchBibTeXDownload |
| 82 | Optimal External Memory Planar Point Enclosure. Lars Arge, Vasilis Samoladas, Ke Yi. Algorithmica (54): 337-352 (2009). Cited by 8Web SearchBibTeXDownload |
| 81 | Orthogonal Range Reporting in Three and Higher Dimensions. Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen. FOCS 2009, 149-158. Web SearchBibTeXDownload |
| 80 | I/O-Efficient Contour Tree Simplification. Lars Arge, Morten Revsbæk. ISAAC 2009, 1155-1165. Web SearchBibTeXDownload |
| 79 | Worst-case efficient range search indexing: invited tutorial. Lars Arge. PODS 2009, 175-176. Web SearchBibTeXDownload |
| 78 | Recent Advances in Worst-Case Efficient Range Search Indexing. Lars Arge. SSTD 2009, 3-4. Web SearchBibTeXDownload |
| 2008 |
|---|
| 77 | The priority R-tree: A practically efficient and worst-case optimal R-tree. Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi. ACM Transactions on Algorithms (4) (2008). Cited by 63Web SearchBibTeXDownload |
| 76 | Cache-Oblivious Red-Blue Line Segment Intersection. Lars Arge, Thomas Mølhave, Norbert Zeh. ESA 2008, 88-99. Cited by 1Web SearchBibTeXDownload |
| 75 | Fundamental parallel algorithms for private-cache chip multiprocessors. Lars Arge, Michael T. Goodrich, Michael J. Nelson, Nodari Sitchinava. SPAA 2008, 197-206. Cited by 7Web SearchBibTeXDownload |
| 74 | I/o-efficient efficient algorithms for computing contours on a terrain. Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, Bardia Sadri. Symposium on Computational Geometry 2008, 129-138. Web SearchBibTeXDownload |
| 73 | External memory planar point location with logarithmic updates. Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao. Symposium on Computational Geometry 2008, 139-147. Web SearchBibTeXDownload |
| 2007 |
|---|
| 72 | External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter. Algorithmica (47): 1-25 (2007). Cited by 109Web SearchBibTeXDownload |
| 71 | TerraStream: from elevation data to watershed hierarchies. Andrew Danner, Thomas Mølhave, Ke Yi, Pankaj K. Agarwal, Lars Arge, Helena Mitásová. GIS 2007, 28. Cited by 17Web SearchBibTeXDownload |
| 70 | The ComBack Method - Extending Hash Compaction with Backtracking. Michael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, Lars Arge. ICATPN 2007, 445-464. Cited by 5Web SearchBibTeXDownload |
| 69 | An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms. Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro. SIAM J. Comput. (36): 1672-1695 (2007). Cited by 9Web SearchBibTeXDownload |
| 2006 |
|---|
| 68 | 06091 Executive Summary -- Data Structures. Lars Arge, Robert Sedgewick, Dorothea Wagner. Data Structures 2006. Web SearchBibTeXDownload |
| 67 | 06091 Abstracts Collection -- Data Structures. Lars Arge, Robert Sedgewick, Dorothea Wagner. Data Structures 2006. Web SearchBibTeXDownload |
| 66 | Improved Dynamic Planar Point Location. Lars Arge, Gerth Stølting Brodal, Loukas Georgiadis. FOCS 2006, 305-314. Cited by 4Web SearchBibTeXDownload |
| 65 | I/O-efficient batched union-find and its applications to terrain analysis. Pankaj K. Agarwal, Lars Arge, Ke Yi. Symposium on Computational Geometry 2006, 167-176. Cited by 16Web SearchBibTeXDownload |
| 64 | Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching. Lars Arge, Norbert Zeh. Symposium on Computational Geometry 2006, 158-166. Cited by 2Web SearchBibTeXDownload |
| 2005 |
|---|
| 63 | Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets. Lars Arge, David Eppstein, Michael T. Goodrich. CoRR (abs/cs/0507050) (2005). Cited by 19Web SearchBibTeXDownload |
| 62 | I/O-Efficient Construction of Constrained Delaunay Triangulations. Pankaj K. Agarwal, Lars Arge, Ke Yi. ESA 2005, 355-366. Cited by 11Web SearchBibTeXDownload |
| 61 | External Data Structures for Shortest Path Queries on Planar Digraphs. Lars Arge, Laura Toma. ISAAC 2005, 328-338. Cited by 3Web SearchBibTeXDownload |
| 60 | Skip-webs: efficient distributed data structures for multi-dimensional data sets. Lars Arge, David Eppstein, Michael T. Goodrich. PODC 2005, 69-76. Web SearchBibTeXDownload |
| 59 | An optimal dynamic interval stabbing-max data structure?. Pankaj K. Agarwal, Lars Arge, Ke Yi. SODA 2005, 803-812. Cited by 9Web SearchBibTeXDownload |
| 58 | Cache-oblivious planar orthogonal range searching and counting. Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen. Symposium on Computational Geometry 2005, 160-169. Cited by 16Web SearchBibTeXDownload |
| 57 | Cache-oblivious r-trees. Lars Arge, Mark de Berg, Herman J. Haverkort. Symposium on Computational Geometry 2005, 170-179. Web SearchBibTeXDownload |
| 2004 |
|---|
| 56 | 04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn. Cache-Oblivious and Cache-Aware Algorithms 2004. Web SearchBibTeXDownload |
| 55 | The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi. Cache-Oblivious and Cache-Aware Algorithms 2004. Web SearchBibTeXDownload |
| 54 | External Geometric Data Structures. Lars Arge. COCOON 2004, 1. Cited by 9Web SearchBibTeXDownload |
| 53 | I/O-efficient dynamic planar point location. Lars Arge, Jan Vahrenhold. Comput. Geom. (29): 147-162 (2004). Cited by 33Web SearchBibTeXDownload |
| 52 | Optimal External Memory Planar Point Enclosure. Lars Arge, Vasilis Samoladas, Ke Yi. ESA 2004, 40-52. Cited by 8Web SearchBibTeXDownload |
| 51 | Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu. ESA 2004, 4-15. Cited by 6Web SearchBibTeXDownload |
| 50 | External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. Lars Arge, Ulrich Meyer, Laura Toma. ICALP 2004, 146-157. Cited by 11Web SearchBibTeXDownload |
| 49 | On external-memory MST, SSSP and multi-way planar graph separation. Lars Arge, Gerth Stølting Brodal, Laura Toma. J. Algorithms (53): 186-206 (2004). Cited by 63Web SearchBibTeXDownload |
| 48 | The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi. SIGMOD Conference 2004, 347-358. Web SearchBibTeXDownload |
| 47 | Simplified External Memory Algorithms for Planar DAGs. Lars Arge, Laura Toma. SWAT 2004, 493-503. Cited by 6Web SearchBibTeXDownload |
| 2003 |
|---|
| 46 | I/O-efficient point location using persistent B-trees. Lars Arge, Andrew Danner, Sha-Mayn Teh. ACM Journal of Experimental Algorithmics (8) (2003). Web SearchBibTeXDownload |
| 45 | Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk). Lars Arge. ALENEX 2003. Web SearchBibTeX |
| 44 | I/O-efficient Point Location Using Persistent B-Trees. Lars Arge, Andrew Danner, Sha-Mayn Teh. ALENEX 2003, 82-92. Cited by 24Web SearchBibTeX |
| 43 | The Buffer Tree: A Technique for Designing Batched External Data Structures. Lars Arge. Algorithmica (37): 1-24 (2003). Cited by 55Web SearchBibTeXDownload |
| 42 | I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi. ESA 2003, 7-18. Cited by 4Web SearchBibTeXDownload |
| 41 | I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. Lars Arge, Norbert Zeh. FOCS 2003, 261-270. Cited by 11Web SearchBibTeXDownload |
| 40 | Efficient Flow Computation on Massive Grid Terrain Datasets. Lars Arge, Jeffrey S. Chase, Patrick N. Halpin, Laura Toma, Jeffrey Scott Vitter, Dean Urban, Rajiv Wickremesinghe. GeoInformatica (7): 283-313 (2003). Web SearchBibTeXDownload |
| 39 | CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries. Sathish Govindarajan, Pankaj K. Agarwal, Lars Arge. ICDT 2003, 143-157. Cited by 26Web SearchBibTeXDownload |
| 38 | Indexing Moving Points. Pankaj K. Agarwal, Lars Arge, Jeff Erickson. J. Comput. Syst. Sci. (66): 207-243 (2003). Cited by 287Web SearchBibTeXDownload |
| 37 | On External-Memory Planar Depth First Search. Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh. J. Graph Algorithms Appl. (7): 105-129 (2003). Cited by 28Web SearchBibTeXDownload |
| 36 | Optimal External Memory Interval Management. Lars Arge, Jeffrey Scott Vitter. SIAM J. Comput. (32): 1488-1508 (2003). Cited by 40Web SearchBibTeXDownload |
| 35 | I/O-efficient topological sorting of planar DAGs. Lars Arge, Laura Toma, Norbert Zeh. SPAA 2003, 85-93. Cited by 16Web SearchBibTeXDownload |
| 34 | Efficient Object-Realtional Interval Management and Beyond. Lars Arge, Andrew Chatham. SSTD 2003, 66-82. Cited by 3Web SearchBibTeXDownload |
| 33 | Bkd-Tree: A Dznamic Scalable kd-Tree. Octavian Procopiuc, Pankaj K. Agarwal, Lars Arge, Jeffrey Scott Vitter. SSTD 2003, 46-65. Cited by 46Web SearchBibTeXDownload |
| 32 | Cache-oblivious data structures for orthogonal range searching. Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan Holland-Minkley. Symposium on Computational Geometry 2003, 237-245. Cited by 22Web SearchBibTeXDownload |
| 2002 |
|---|
| 31 | Efficient Sorting Using Registers and Caches. Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter. ACM Journal of Experimental Algorithmics (7): 9 (2002). Cited by 20Web SearchBibTeXDownload |
| 30 | Efficient Bulk Operations on Dynamic R-Trees. Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter. Algorithmica (33): 104-128 (2002). Cited by 110Web SearchBibTeXDownload |
| 29 | Implementing I/O-efficient Data Structures Using TPIE. Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter. ESA 2002, 88-100. Cited by 44Web SearchBibTeXDownload |
| 28 | Cache-oblivious priority queue and graph algorithm applications. Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro. STOC 2002, 268-276. Cited by 72Web SearchBibTeXDownload |
| 2001 |
|---|
| 27 | Flow Computation on Massive Grids. Laura Toma, Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Patrick N. Halpin, Dean Urban. ACM-GIS 2001, 82-87. Cited by 17Web SearchBibTeXDownload |
| 26 | I/O-Efficient Algorithms for Problems on Grid-Based Terrains. Lars Arge, Laura Toma, Jeffrey Scott Vitter. ACM Journal of Experimental Algorithmics (6): 1 (2001). Cited by 41Web SearchBibTeXDownload |
| 25 | External Memory Data Structures. Lars Arge. ESA 2001, 1-29. Cited by 98Web SearchBibTeXDownload |
| 24 | A Framework for Index Bulk Loading and Dynamization. Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter. ICALP 2001, 115-127. Cited by 32Web SearchBibTeXDownload |
| 23 | Time Responsive External Data Structures for Moving Points. Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold. WADS 2001, 50-61. Cited by 18Web SearchBibTeXDownload |
| 22 | On External-Memory Planar Depth First Search. Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh. WADS 2001, 471-482. Cited by 28Web SearchBibTeXDownload |
| 2000 |
|---|
| 21 | Efficient Sorting Using Registers and Caches. Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter. Algorithm Engineering 2000, 51-62. Cited by 20Web SearchBibTeXDownload |
| 20 | A Unified Approach for Indexed and Non-Indexed Spatial Joins. Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jan Vahrenhold, Jeffrey Scott Vitter. EDBT 2000, 413-429. Cited by 37Web SearchBibTeXDownload |
| 19 | Efficient Searching with Linear Constraints. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter. J. Comput. Syst. Sci. (61): 194-216 (2000). Cited by 82Web SearchBibTeXDownload |
| 18 | Indexing Moving Points. Pankaj K. Agarwal, Lars Arge, Jeff Erickson. PODS 2000, 175-186. Cited by 287Web SearchBibTeXDownload |
| 17 | On External-Memory MST, SSSP, and Multi-way Planar Graph Separation. Lars Arge, Gerth Stølting Brodal, Laura Toma. SWAT 2000, 433-447. Web SearchBibTeXDownload |
| 16 | I/O-Space Trade-Offs. Lars Arge, Jakob Pagter. SWAT 2000, 448-461. Cited by 3Web SearchBibTeXDownload |
| 15 | I/O-efficient dynamic planar point location (extended abstract). Lars Arge, Jan Vahrenhold. Symposium on Computational Geometry 2000, 191-200. Web SearchBibTeXDownload |
| 1999 |
|---|
| 14 | Efficient Bulk Operations on Dynamic R-trees. Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter. ALENEX 1999, 328-348. Web SearchBibTeXDownload |
| 13 | On Two-Dimensional Indexability and Optimal Range Search Indexing. Lars Arge, Vasilis Samoladas, Jeffrey Scott Vitter. PODS 1999, 346-357. Cited by 111Web SearchBibTeXDownload |
| 12 | I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter. SODA 1999, 11-20. Cited by 31Web SearchBibTeXDownload |
| 1998 |
|---|
| 11 | Efficient Searching with Linear Constraints. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter. PODS 1998, 169-178. Cited by 82Web SearchBibTeXDownload |
| 10 | Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract). Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter. SODA 1998, 685-694. Cited by 38Web SearchBibTeXDownload |
| 9 | I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract). Pankaj K. Agarwal, Lars Arge, T. M. Murali, Kasturi R. Varadarajan, Jeffrey Scott Vitter. SODA 1998, 117-126. Cited by 47Web SearchBibTeXDownload |
| 8 | Scalable Sweeping-Based Spatial Join. Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter. VLDB 1998, 570-581. Cited by 157Web SearchBibTeXDownload |
| 1997 |
|---|
| 7 | On Sorting Strings in External Memory (Extended Abstract). Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter. STOC 1997, 540-548. Cited by 67Web SearchBibTeXDownload |
| 1996 |
|---|
| 6 | External-Memory Algorithms with Applications in GIS. Lars Arge. Algorithmic Foundations of Geographic Information Systems 1996, 213-254. Cited by 16Web SearchBibTeXDownload |
| 5 | Optimal Dynamic Interval Management in External Memory (extended abstract). Lars Arge, Jeffrey Scott Vitter. FOCS 1996, 560-569. Cited by 141Web SearchBibTeXDownload |
| 1995 |
|---|
| 4 | External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract). Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter. ESA 1995, 295-310. Web SearchBibTeXDownload |
| 3 | The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation. Lars Arge. ISAAC 1995, 82-91. Cited by 32Web SearchBibTeXDownload |
| 2 | The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract). Lars Arge. WADS 1995, 334-345. Cited by 210Web SearchBibTeXDownload |
| 1993 |
|---|
| 1 | A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms. Lars Arge, Mikael Knudsen, Kirsten Larsen. WADS 1993, 83-94. Cited by 43Web SearchBibTeXDownload |
