Lars Arge

Publication Activity (10 Years)

Years Active: 1993-2023
Publications (10 Years): 16

Top Venues

CoRR

ALENEX

IEEE BigData

SIGSPATIAL/GIS

University of Aarhus (PHD)

Education History

University of Aarhus

PHD

Publications

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) (2023)
Aaron Lowe, Svend C. Svendsen, Pankaj K. Agarwal, Lars Arge
1D and 2D Flow Routing on a Terrain. CoRR (2020)
Lars Arge, Mathias Rav, Morten Revsbæk, Yujin Shin, Jungwoo Yang
Sea-Rise Flooding on Massive Dynamic Terrains. SWAT (2020)
Aaron Lowe, Svend C. Svendsen, Pankaj K. Agarwal, Lars Arge
1D and 2D Flow Routing on a Terrain. SIGSPATIAL/GIS (2020)
Lars Arge, Allan Grønlund, Svend Christian Svendsen, Jonas Tranberg
Learning to Find Hydrological Corrections. CoRR (2019)
Lars Arge, Allan Grønlund, Svend Christian Svendsen, Jonas Tranberg
Learning to Find Hydrological Corrections. SIGSPATIAL/GIS (2019)
Pankaj K. Agarwal, Lars Arge, Frank Staals
Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon. CoRR (2018)
Lars Arge, Yujin Shin, Constantinos Tsirogiannis
Computing Floods Caused by Non-Uniform Sea-Level Rise. ALENEX (2018)
Pankaj K. Agarwal, Lars Arge, Frank Staals
Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon. SoCG (2018)
Lars Arge, Mathias Rav, Svend C. Svendsen, Jakob Truelsen
External memory pipelining made easy with TPIE. IEEE BigData (2017)
Lars Arge, Mathias Rav, Svend C. Svendsen, Jakob Truelsen
External Memory Pipelining Made Easy With TPIE. CoRR (2017)
Lars Arge, Frank Staals
Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon. CoRR (2017)
Lars Arge, Mathias Rav, Sarfraz Raza, Morten Revsbæk
I/O-Efficient Event Based Depression Flood Risk. ALENEX (2017)
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)
Lars Arge, János Pach
Guest Editors' Foreword. Discret. Comput. Geom. 56 (4) (2016)
Lars Arge, Mikkel Thorup
RAM-Efficient External Memory Sorting. Algorithmica 73 (4) (2015)
Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, Morten Revsbæk, Jungwoo Yang
Maintaining Contour Trees of Dynamic Terrains. CoRR (2014)
Lars Arge, Jakob Truelsen, Jungwoo Yang
Simplifying massive planar subdivisions. ALENEX (2014)
Lars Arge, Mikkel Thorup
RAM-Efficient External Memory Sorting. CoRR (2013)
Lars Arge, Michael T. Goodrich, Freek van Walderveen
Computing betweenness centrality in external memory. IEEE BigData (2013)
Pankaj K. Agarwal, Lars Arge, Sathish Govindarajan, Jun Yang, Ke Yi
Efficient external memory structures for range-aggregate queries. Comput. Geom. 46 (3) (2013)
Lars Arge, Mikkel Thorup
RAM-Efficient External Memory Sorting. ISAAC (2013)
Freek van Walderveen, Norbert Zeh, Lars Arge
Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs. SODA (2013)
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips
(Approximate) Uncertain Skylines. Theory Comput. Syst. 52 (3) (2013)
Lars Arge, Gerth Stølting Brodal, Jakob Truelsen, Constantinos Tsirogiannis
An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters. ESA (2013)
Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava
On (Dynamic) Range Minimum Queries in External Memory. WADS (2013)
Lars Arge, Lasse Deleuran, Thomas Mølhave, Morten Revsbæk, Jakob Truelsen
Simplifying Massive Contour Maps. ESA (2012)
Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao
External Memory Planar Point Location with Logarithmic Updates. Algorithmica 63 (1-2) (2012)
Lars Arge, Kasper Green Larsen
I/O-efficient spatial data structures for range queries. ACM SIGSPATIAL Special 4 (2) (2012)
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) (2012)
Lars Arge, Herman J. Haverkort, Constantinos Tsirogiannis
Fast generation of multiple resolution instances of raster data sets. SIGSPATIAL/GIS (2012)
Peyman Afshani, Lars Arge, Kasper Green Larsen
Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model. SCG (2012)
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips
(Approximate) uncertain skylines. ICDT (2011)
Lars Arge, Erik D. Demaine, Raimund Seidel
10091 Abstracts Collection - Data Structures. Data Structures (2010)
Pankaj K. Agarwal, Lars Arge, Ke Yi
I/O-efficient batched union-find and its applications to terrain analysis. ACM Trans. Algorithms 7 (1) (2010)
Lars Arge, Michael T. Goodrich, Nodari Sitchinava
Parallel external memory graph algorithms. IPDPS (2010)
Thomas Mølhave, Pankaj K. Agarwal, Lars Arge, Morten Revsbæk
Scalable algorithms for large high-resolution terrain data. COM.Geo (2010)
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements. SCG (2010)
Lars Arge, Kasper Green Larsen, Thomas Mølhave, Freek van Walderveen
Cleaning massive sonar point clouds. GIS (2010)
Lars Arge, Morten Revsbæk, Norbert Zeh
I/O-efficient computation of water flow across a terrain. SCG (2010)
Lars Arge, Morten Revsbæk
I/O-Efficient Contour Tree Simplification. ISAAC (2009)
Lars Arge, Vasilis Samoladas, Ke Yi
Optimal External Memory Planar Point Enclosure. Algorithmica 54 (3) (2009)
Lars Arge
Worst-case efficient range search indexing: invited tutorial. PODS (2009)
Lars Arge
Recent Advances in Worst-Case Efficient Range Search Indexing. SSTD (2009)
Lars Arge, Emo Welzl
Foreword. Algorithmica 55 (2) (2009)
Lars Arge, Christian Cachin, Andrzej Tarlecki
Preface. Theor. Comput. Sci. 410 (18) (2009)
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
Orthogonal Range Reporting in Three and Higher Dimensions. FOCS (2009)
Lars Arge, Mark de Berg, Herman J. Haverkort
Cache-Oblivious R-Trees. Algorithmica 53 (1) (2009)
Lars Arge, Robert Sedgewick, Raimund Seidel
08081 Abstracts Collection - Data Structures. Data Structures (2008)
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) (2008)
Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, Bardia Sadri
I/o-efficient efficient algorithms for computing contours on a terrain. SCG (2008)
Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao
External memory planar point location with logarithmic updates. SCG (2008)
Lars Arge, Michael T. Goodrich, Michael J. Nelson, Nodari Sitchinava
Fundamental parallel algorithms for private-cache chip multiprocessors. SPAA (2008)
Lars Arge, Thomas Mølhave, Norbert Zeh
Cache-Oblivious Red-Blue Line Segment Intersection. ESA (2008)
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) (2007)
Michael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, Lars Arge
The ComBack Method - Extending Hash Compaction with Backtracking. ICATPN (2007)
Lars Arge, Giuseppe F. Italiano
Preface. ACM J. Exp. Algorithmics 12 (2007)
Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. Algorithmica 47 (1) (2007)
Andrew Danner, Thomas Mølhave, Ke Yi, Pankaj K. Agarwal, Lars Arge, Helena Mitásová
TerraStream: from elevation data to watershed hierarchies. GIS (2007)
Lars Arge, Gerth Stølting Brodal, Loukas Georgiadis
Improved Dynamic Planar Point Location. FOCS (2006)
Pankaj K. Agarwal, Lars Arge, Ke Yi
I/O-efficient batched union-find and its applications to terrain analysis. SCG (2006)
Lars Arge, Robert Sedgewick, Dorothea Wagner
06091 Abstracts Collection -- Data Structures. Data Structures (2006)
Lars Arge, Norbert Zeh
Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching. SCG (2006)
Lars Arge, Robert Sedgewick, Dorothea Wagner
06091 Executive Summary -- Data Structures. Data Structures (2006)
Pankaj K. Agarwal, Lars Arge, Ke Yi
I/O-Efficient Construction of Constrained Delaunay Triangulations. ESA (2005)
Pankaj K. Agarwal, Lars Arge, Ke Yi
An optimal dynamic interval stabbing-max data structure? SODA (2005)
Lars Arge, David Eppstein, Michael T. Goodrich
Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets CoRR (2005)
Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen
Cache-oblivious planar orthogonal range searching and counting. SCG (2005)
Lars Arge, Laura Toma
External Data Structures for Shortest Path Queries on Planar Digraphs. ISAAC (2005)
Lars Arge, David Eppstein, Michael T. Goodrich
Skip-webs: efficient distributed data structures for multi-dimensional data sets. PODC (2005)
Lars Arge, Mark de Berg, Herman J. Haverkort
Cache-oblivious r-trees. SCG (2005)
Lars Arge, Jan Vahrenhold
I/O-efficient dynamic planar point location. Comput. Geom. 29 (2) (2004)
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)
Lars Arge, Gerth Stølting Brodal, Laura Toma
On external-memory MST, SSSP and multi-way planar graph separation. J. Algorithms 53 (2) (2004)
Lars Arge, Ulrich Meyer, Laura Toma
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. ICALP (2004)
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)
Lars Arge
External Geometric Data Structures. COCOON (2004)
Lars Arge, Vasilis Samoladas, Ke Yi
Optimal External Memory Planar Point Enclosure. ESA (2004)
Lars Arge, Laura Toma
Simplified External Memory Algorithms for Planar DAGs. SWAT (2004)
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)
Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. ESA (2004)
Pankaj K. Agarwal, Lars Arge, Jeff Erickson
Indexing Moving Points. J. Comput. Syst. Sci. 66 (1) (2003)
Lars Arge, Norbert Zeh
I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. FOCS (2003)
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) (2003)
Lars Arge, Andrew Danner, Sha-Mayn Teh
I/O-efficient Point Location Using Persistent B-Trees. ALENEX (2003)
Lars Arge, Andrew Chatham
Efficient Object-Realtional Interval Management and Beyond. SSTD (2003)
Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi
I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. ESA (2003)
Lars Arge, Laura Toma, Norbert Zeh
I/O-efficient topological sorting of planar DAGs. SPAA (2003)
Octavian Procopiuc, Pankaj K. Agarwal, Lars Arge, Jeffrey Scott Vitter
Bkd-Tree: A Dznamic Scalable kd-Tree. SSTD (2003)
Sathish Govindarajan, Pankaj K. Agarwal, Lars Arge
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries. ICDT (2003)
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan Holland-Minkley
Cache-oblivious data structures for orthogonal range searching. SCG (2003)
Lars Arge, Jeffrey Scott Vitter
Optimal External Memory Interval Management. SIAM J. Comput. 32 (6) (2003)
Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
On External-Memory Planar Depth First Search. J. Graph Algorithms Appl. 7 (2) (2003)
Lars Arge
The Buffer Tree: A Technique for Designing Batched External Data Structures. Algorithmica 37 (1) (2003)
Lars Arge
Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk). ALENEX (2003)
Lars Arge, Andrew Danner, Sha-Mayn Teh
I/O-efficient point location using persistent B-trees. ACM J. Exp. Algorithmics 8 (2003)
Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro
Cache-oblivious priority queue and graph algorithm applications. STOC (2002)
Lars Arge, Klaus H. Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter
Efficient Bulk Operations on Dynamic R-Trees. Algorithmica 33 (1) (2002)
Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter
Implementing I/O-efficient Data Structures Using TPIE. ESA (2002)
Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter
Efficient Sorting Using Registers and Caches. ACM J. Exp. Algorithmics 7 (2002)

Lars Arge.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Lars Arge