default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLars Arge
Person information
- affiliation: Aarhus University, Denmark
- affiliation: Duke University, Durham, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j29]Lars Arge, Aaron Lowe
, Svend C. Svendsen, Pankaj K. Agarwal:
1D and 2D Flow Routing on a Terrain. ACM Trans. Spatial Algorithms Syst. 9(1): 3:1-3:39 (2023)- 2020
- [c85]Aaron Lowe, Svend C. Svendsen, Pankaj K. Agarwal, Lars Arge:
1D and 2D Flow Routing on a Terrain. SIGSPATIAL/GIS 2020: 5-14 - [c84]Lars Arge, Mathias Rav, Morten Revsbæk, Yujin Shin, Jungwoo Yang:
Sea-Rise Flooding on Massive Dynamic Terrains. SWAT 2020: 6:1-6:19 - [i14]Aaron Lowe, Svend C. Svendsen, Pankaj K. Agarwal, Lars Arge:
1D and 2D Flow Routing on a Terrain. CoRR abs/2009.08014 (2020)
2010 – 2019
- 2019
- [c83]Lars Arge, Allan Grønlund, Svend Christian Svendsen, Jonas Tranberg:
Learning to Find Hydrological Corrections. SIGSPATIAL/GIS 2019: 464-467 - [i13]Lars Arge, Allan Grønlund, Svend Christian Svendsen, Jonas Tranberg:
Learning to Find Hydrological Corrections. CoRR abs/1909.07685 (2019) - 2018
- [c82]Lars Arge, Yujin Shin, Constantinos Tsirogiannis:
Computing Floods Caused by Non-Uniform Sea-Level Rise. ALENEX 2018: 97-108 - [c81]Pankaj K. Agarwal, Lars Arge, Frank Staals:
Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon. SoCG 2018: 4:1-4:14 - [i12]Pankaj K. Agarwal, Lars Arge, Frank Staals:
Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon. CoRR abs/1803.05765 (2018) - 2017
- [c80]Lars Arge, Mathias Rav, Sarfraz Raza, Morten Revsbæk:
I/O-Efficient Event Based Depression Flood Risk. ALENEX 2017: 259-269 - [c79]Lars Arge, Mathias Rav, Svend C. Svendsen, Jakob Truelsen:
External memory pipelining made easy with TPIE. IEEE BigData 2017: 319-324 - [i11]Lars Arge, Frank Staals:
Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon. CoRR abs/1707.02961 (2017) - [i10]Lars Arge, Mathias Rav, Svend C. Svendsen, Jakob Truelsen:
External Memory Pipelining Made Easy With TPIE. CoRR abs/1710.10091 (2017) - 2016
- [j28]Lars Arge, János Pach:
Guest Editors' Foreword. Discret. Comput. Geom. 56(4): 833-835 (2016) - [c78]Cici Alexander, Lars Arge, Peder Klith Bøcher, Morten Revsbæk, Brody Sandel, Jens-Christian Svenning, Constantinos Tsirogiannis, Jungwoo Yang:
Computing River Floods Using Massive Terrain Data. GIScience 2016: 3-17 - 2015
- [j27]Lars Arge, Mikkel Thorup:
RAM-Efficient External Memory Sorting. Algorithmica 73(4): 623-636 (2015) - [e9]Lars Arge, János Pach:
31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands. LIPIcs 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-83-5 [contents] - 2014
- [c77]Lars Arge, Jakob Truelsen, Jungwoo Yang:
Simplifying massive planar subdivisions. ALENEX 2014: 20-30 - [i9]Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, Morten Revsbæk, Jungwoo Yang:
Maintaining Contour Trees of Dynamic Terrains. CoRR abs/1406.4005 (2014) - 2013
- [j26]Pankaj K. Agarwal, Lars Arge, Sathish Govindarajan, Jun Yang, Ke Yi:
Efficient external memory structures for range-aggregate queries. Comput. Geom. 46(3): 358-370 (2013) - [j25]Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips:
(Approximate) Uncertain Skylines. Theory Comput. Syst. 52(3): 342-366 (2013) - [c76]Lars Arge, Michael T. Goodrich, Freek van Walderveen:
Computing betweenness centrality in external memory. IEEE BigData 2013: 368-375 - [c75]Lars Arge, Gerth Stølting Brodal, Jakob Truelsen, Constantinos Tsirogiannis:
An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters. ESA 2013: 61-72 - [c74]Lars Arge, Mikkel Thorup:
RAM-Efficient External Memory Sorting. ISAAC 2013: 491-501 - [c73]Freek van Walderveen, Norbert Zeh, Lars Arge:
Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs. SODA 2013: 901-918 - [c72]Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava:
On (Dynamic) Range Minimum Queries in External Memory. WADS 2013: 37-48 - [i8]Lars Arge, Mikkel Thorup:
RAM-Efficient External Memory Sorting. CoRR abs/1312.2018 (2013) - 2012
- [j24]Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao:
External Memory Planar Point Location with Logarithmic Updates. Algorithmica 63(1-2): 457-475 (2012) - [j23]Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Molad, Robert Endre Tarjan, Ke Yi:
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries. SIAM J. Comput. 41(1): 104-127 (2012) - [j22]Lars Arge, Kasper Green Larsen:
I/O-efficient spatial data structures for range queries. ACM SIGSPATIAL Special 4(2): 2-7 (2012) - [c71]Peyman Afshani, Lars Arge, Kasper Green Larsen:
Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model. SCG 2012: 323-332 - [c70]Lars Arge, Lasse Deleuran, Thomas Mølhave, Morten Revsbæk, Jakob Truelsen:
Simplifying Massive Contour Maps. ESA 2012: 96-107 - [c69]Lars Arge, Herman J. Haverkort, Constantinos Tsirogiannis:
Fast generation of multiple resolution instances of raster data sets. SIGSPATIAL/GIS 2012: 52-60 - 2011
- [c68]Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips:
(Approximate) uncertain skylines. ICDT 2011: 186-196 - 2010
- [j21]Pankaj K. Agarwal, Lars Arge, Ke Yi:
I/O-efficient batched union-find and its applications to terrain analysis. ACM Trans. Algorithms 7(1): 11:1-11:21 (2010) - [c67]Thomas Mølhave, Pankaj K. Agarwal, Lars Arge, Morten Revsbæk:
Scalable algorithms for large high-resolution terrain data. COM.Geo 2010 - [c66]Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen:
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements. SCG 2010: 240-246 - [c65]Lars Arge, Morten Revsbæk, Norbert Zeh:
I/O-efficient computation of water flow across a terrain. SCG 2010: 403-412 - [c64]Lars Arge, Kasper Green Larsen, Thomas Mølhave, Freek van Walderveen:
Cleaning massive sonar point clouds. GIS 2010: 152-161 - [c63]Lars Arge, Michael T. Goodrich, Nodari Sitchinava:
Parallel external memory graph algorithms. IPDPS 2010: 1-11 - [e8]Lars Arge, Erik D. Demaine, Raimund Seidel:
Data Structures, 28.02. - 05.03.2010. Dagstuhl Seminar Proceedings 10091, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i7]Lars Arge, Erik D. Demaine, Raimund Seidel:
10091 Abstracts Collection - Data Structures. Data Structures 2010
2000 – 2009
- 2009
- [j20]Lars Arge, Mark de Berg, Herman J. Haverkort:
Cache-Oblivious R-Trees. Algorithmica 53(1): 50-68 (2009) - [j19]Lars Arge, Vasilis Samoladas, Ke Yi:
Optimal External Memory Planar Point Enclosure. Algorithmica 54(3): 337-352 (2009) - [j18]Lars Arge, Emo Welzl:
Foreword. Algorithmica 55(2): 269-270 (2009) - [j17]Lars Arge, Christian Cachin, Andrzej Tarlecki:
Preface. Theor. Comput. Sci. 410(18): 1617 (2009) - [c62]Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen:
Orthogonal Range Reporting in Three and Higher Dimensions. FOCS 2009: 149-158 - [c61]Lars Arge, Morten Revsbæk:
I/O-Efficient Contour Tree Simplification. ISAAC 2009: 1155-1165 - [c60]Lars Arge:
Worst-case efficient range search indexing: invited tutorial. PODS 2009: 175-176 - [c59]Lars Arge:
Recent Advances in Worst-Case Efficient Range Search Indexing. SSTD 2009: 3-4 - 2008
- [j16]Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi:
The priority R-tree: A practically efficient and worst-case optimal R-tree. ACM Trans. Algorithms 4(1): 9:1-9:30 (2008) - [c58]Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, Bardia Sadri:
I/o-efficient efficient algorithms for computing contours on a terrain. SCG 2008: 129-138 - [c57]Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao:
External memory planar point location with logarithmic updates. SCG 2008: 139-147 - [c56]Lars Arge, Thomas Mølhave, Norbert Zeh:
Cache-Oblivious Red-Blue Line Segment Intersection. ESA 2008: 88-99 - [c55]Lars Arge, Michael T. Goodrich, Michael J. Nelson, Nodari Sitchinava:
Fundamental parallel algorithms for private-cache chip multiprocessors. SPAA 2008: 197-206 - [e7]Lars Arge, Robert Sedgewick, Raimund Seidel:
Data Structures, 17.02. - 22.02.2008. Dagstuhl Seminar Proceedings 08081, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - [i6]Lars Arge, Robert Sedgewick, Raimund Seidel:
08081 Abstracts Collection - Data Structures. Data Structures 2008 - 2007
- [j15]Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter:
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. Algorithmica 47(1): 1-25 (2007) - [j14]Lars Arge, Giuseppe F. Italiano:
Preface. ACM J. Exp. Algorithmics 12: 2.1:1 (2007) - [j13]Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro:
An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms. SIAM J. Comput. 36(6): 1672-1695 (2007) - [c54]Michael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, Lars Arge:
The ComBack Method - Extending Hash Compaction with Backtracking. ICATPN 2007: 445-464 - [c53]Andrew Danner, Thomas Mølhave, Ke Yi, Pankaj K. Agarwal, Lars Arge, Helena Mitásová:
TerraStream: from elevation data to watershed hierarchies. GIS 2007: 28 - [e6]Lars Arge, Michael Hoffmann, Emo Welzl:
Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings. Lecture Notes in Computer Science 4698, Springer 2007, ISBN 978-3-540-75519-7 [contents] - [e5]Lars Arge, Christian Cachin, Tomasz Jurdzinski, Andrzej Tarlecki:
Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings. Lecture Notes in Computer Science 4596, Springer 2007, ISBN 978-3-540-73419-2 [contents] - 2006
- [c52]Lars Arge, Norbert Zeh:
Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching. SCG 2006: 158-166 - [c51]Pankaj K. Agarwal, Lars Arge, Ke Yi:
I/O-efficient batched union-find and its applications to terrain analysis. SCG 2006: 167-176 - [c50]Lars Arge, Gerth Stølting Brodal, Loukas Georgiadis:
Improved Dynamic Planar Point Location. FOCS 2006: 305-314 - [e4]Lars Arge, Robert Sedgewick, Dorothea Wagner:
Data Structures, 26.02. - 03.03.2006. Dagstuhl Seminar Proceedings 06091, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [e3]Lars Arge, Rusins Freivalds:
Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings. Lecture Notes in Computer Science 4059, Springer 2006, ISBN 3-540-35753-X [contents] - [i5]Lars Arge, Robert Sedgewick, Dorothea Wagner:
06091 Executive Summary -- Data Structures. Data Structures 2006 - [i4]Lars Arge, Robert Sedgewick, Dorothea Wagner:
06091 Abstracts Collection -- Data Structures. Data Structures 2006 - 2005
- [c49]Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen:
Cache-oblivious planar orthogonal range searching and counting. SCG 2005: 160-169 - [c48]Lars Arge, Mark de Berg, Herman J. Haverkort:
Cache-oblivious r-trees. SCG 2005: 170-179 - [c47]Pankaj K. Agarwal, Lars Arge, Ke Yi:
I/O-Efficient Construction of Constrained Delaunay Triangulations. ESA 2005: 355-366 - [c46]Lars Arge, Laura Toma:
External Data Structures for Shortest Path Queries on Planar Digraphs. ISAAC 2005: 328-338 - [c45]Lars Arge, David Eppstein, Michael T. Goodrich:
Skip-webs: efficient distributed data structures for multi-dimensional data sets. PODC 2005: 69-76 - [c44]Pankaj K. Agarwal, Lars Arge, Ke Yi:
An optimal dynamic interval stabbing-max data structure? SODA 2005: 803-812 - [e2]Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn:
Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004. Dagstuhl Seminar Proceedings 04301, IBFI, Schloss Dagstuhl, Germany 2005 [contents] - [i3]Lars Arge, David Eppstein, Michael T. Goodrich:
Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets. CoRR abs/cs/0507050 (2005) - 2004
- [j12]Lars Arge, Jan Vahrenhold:
I/O-efficient dynamic planar point location. Comput. Geom. 29(2): 147-162 (2004) - [j11]Lars Arge, Gerth Stølting Brodal, Laura Toma:
On external-memory MST, SSSP and multi-way planar graph separation. J. Algorithms 53(2): 186-206 (2004) - [c43]Lars Arge:
External Geometric Data Structures. COCOON 2004: 1 - [c42]Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu:
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. ESA 2004: 4-15 - [c41]Lars Arge, Vasilis Samoladas, Ke Yi:
Optimal External Memory Planar Point Enclosure. ESA 2004: 40-52 - [c40]Lars Arge, Ulrich Meyer, Laura Toma:
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. ICALP 2004: 146-157 - [c39]Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi:
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. SIGMOD Conference 2004: 347-358 - [c38]Lars Arge, Laura Toma:
Simplified External Memory Algorithms for Planar DAGs. SWAT 2004: 493-503 - [e1]Lars Arge, Giuseppe F. Italiano, Robert Sedgewick:
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, New Orleans, LA, USA, January 10, 2004. SIAM 2004, ISBN 0-89871-564-4 [contents] - [r1]Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg:
Cache-Oblivious Data Structures. Handbook of Data Structures and Applications 2004 - [i2]Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn:
04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. Cache-Oblivious and Cache-Aware Algorithms 2004 - [i1]Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi:
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. Cache-Oblivious and Cache-Aware Algorithms 2004 - 2003
- [j10]Lars Arge:
The Buffer Tree: A Technique for Designing Batched External Data Structures. Algorithmica 37(1): 1-24 (2003) - [j9]Lars Arge, Jeffrey S. Chase, Patrick N. Halpin, Laura Toma, Jeffrey Scott Vitter, Dean Urban, Rajiv Wickremesinghe:
Efficient Flow Computation on Massive Grid Terrain Datasets. GeoInformatica 7(4): 283-313 (2003) - [j8]Pankaj K. Agarwal, Lars Arge, Jeff Erickson:
Indexing Moving Points. J. Comput. Syst. Sci. 66(1): 207-243 (2003) - [j7]Lars Arge, Andrew Danner, Sha-Mayn Teh:
I/O-efficient point location using persistent B-trees. ACM J. Exp. Algorithmics 8 (2003) - [j6]Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh:
On External-Memory Planar Depth First Search. J. Graph Algorithms Appl. 7(2): 105-129 (2003) - [j5]Lars Arge, Jeffrey Scott Vitter:
Optimal External Memory Interval Management. SIAM J. Comput. 32(6): 1488-1508 (2003) - [c37]Lars Arge:
Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk). ALENEX 2003 - [c36]Lars Arge, Andrew Danner, Sha-Mayn Teh:
I/O-efficient Point Location Using Persistent B-Trees. ALENEX 2003: 82-92 - [c35]Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan Holland-Minkley:
Cache-oblivious data structures for orthogonal range searching. SCG 2003: 237-245 - [c34]Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi:
I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. ESA 2003: 7-18 - [c33]Lars Arge, Norbert Zeh:
I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. FOCS 2003: 261-270 - [c32]Sathish Govindarajan, Pankaj K. Agarwal, Lars Arge:
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries. ICDT 2003: 143-157 - [c31]Lars Arge, Laura Toma, Norbert Zeh:
I/O-efficient topological sorting of planar DAGs. SPAA 2003: 85-93 - [c30]Octavian Procopiuc, Pankaj K. Agarwal, Lars Arge, Jeffrey Scott Vitter:
Bkd-Tree: A Dznamic Scalable kd-Tree. SSTD 2003: 46-65 - [c29]Lars Arge, Andrew Chatham:
Efficient Object-Realtional Interval Management and Beyond. SSTD 2003: 66-82 - 2002
- [j4]Lars Arge, Klaus H. Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter:
Efficient Bulk Operations on Dynamic R-Trees. Algorithmica 33(1): 104-128 (2002) - [j3]Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter:
Efficient Sorting Using Registers and Caches. ACM J. Exp. Algorithmics 7: 9 (2002) - [c28]Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter:
Implementing I/O-efficient Data Structures Using TPIE. ESA 2002: 88-100 - [c27]Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro:
Cache-oblivious priority queue and graph algorithm applications. STOC 2002: 268-276 - 2001
- [j2]Lars Arge, Laura Toma, Jeffrey Scott Vitter:
I/O-Efficient Algorithms for Problems on Grid-Based Terrains. ACM J. Exp. Algorithmics 6: 1 (2001) - [c26]Lars Arge:
External Memory Data Structures. ESA 2001: 1-29 - [c25]Laura Toma, Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Patrick N. Halpin, Dean Urban:
Flow Computation on Massive Grids. ACM-GIS 2001: 82-87 - [c24]Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter:
A Framework for Index Bulk Loading and Dynamization. ICALP 2001: 115-127 - [c23]Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold:
Time Responsive External Data Structures for Moving Points. WADS 2001: 50-61 - [c22]Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh:
On External-Memory Planar Depth First Search. WADS 2001: 471-482 - 2000
- [j1]Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter:
Efficient Searching with Linear Constraints. J. Comput. Syst. Sci. 61(2): 194-216 (2000) - [c21]Lars Arge, Jan Vahrenhold:
I/O-efficient dynamic planar point location (extended abstract). SCG 2000: 191-200 - [c20]Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jan Vahrenhold, Jeffrey Scott Vitter:
A Unified Approach for Indexed and Non-Indexed Spatial Joins. EDBT 2000: 413-429 - [c19]Pankaj K. Agarwal, Lars Arge, Jeff Erickson:
Indexing Moving Points. PODS 2000: 175-186 - [c18]Lars Arge, Gerth Stølting Brodal, Laura Toma:
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation. SWAT 2000: 433-447 - [c17]Lars Arge, Jakob Pagter:
I/O-Space Trade-Offs. SWAT 2000: 448-461 - [c16]Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Rajiv Wickremesinghe:
Efficient Sorting Using Registers and Caches. WAE 2000: 51-62
1990 – 1999
- 1999
- [c15]Lars Arge, Klaus H. Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter:
Efficient Bulk Operations on Dynamic R-trees. ALENEX 1999: 328-348 - [c14]Lars Arge, Vasilis Samoladas, Jeffrey Scott Vitter:
On Two-Dimensional Indexability and Optimal Range Search Indexing. PODS 1999: 346-357 - [c13]Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter:
I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. SODA 1999: 11-20 - 1998
- [c12]Lars Arge, Peter Bro Miltersen:
On showing lower bounds for external-memory computational geometry problems. External Memory Algorithms 1998: 139-159 - [c11]Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter:
Efficient Searching with Linear Constraints. PODS 1998: 169-178 - [c10]Pankaj K. Agarwal, Lars Arge, T. M. Murali, Kasturi R. Varadarajan, Jeffrey Scott Vitter:
I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract). SODA 1998: 117-126 - [c9]Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter:
Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract). SODA 1998: 685-694 - [c8]Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter:
Scalable Sweeping-Based Spatial Join. VLDB 1998: 570-581 - 1997
- [c7]Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter:
Sequence sorting in secondary storage. SEQUENCES 1997: 329-346 - [c6]Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter:
On Sorting Strings in External Memory (Extended Abstract). STOC 1997: 540-548 - 1996
- [b1]Lars Arge:
Efficient External-Memory Data Structures and Applications. University of Aarhus, BRICS Dissertation Series, 1996 - [c5]Lars Arge, Jeffrey Scott Vitter:
Optimal Dynamic Interval Management in External Memory (extended abstract). FOCS 1996: 560-569 - [p1]Lars Arge:
External-Memory Algorithms with Applications in GIS. Algorithmic Foundations of Geographic Information Systems 1996: 213-254 - 1995
- [c4]Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter:
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract). ESA 1995: 295-310 - [c3]Lars Arge:
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation. ISAAC 1995: 82-91 - [c2]Lars Arge:
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract). WADS 1995: 334-345 - 1993
- [c1]Lars Arge, Mikael B. Knudsen, Kirsten Larsen:
A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms. WADS 1993: 83-94
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
