Lars Arge

According to our database, Lars Arge authored at least 109 papers between 1993 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

1D and 2D Flow Routing on a Terrain.

Lars Arge, Aaron Lowe, Svend C. Svendsen, Pankaj K. Agarwal

ACM Trans. Spatial Algorithms Syst., March, 2023

2020

Sea-Rise Flooding on Massive Dynamic Terrains.

Lars Arge, Mathias Rav, Morten Revsbæk, Yujin Shin, Jungwoo Yang

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019

Learning to Find Hydrological Corrections.

Lars Arge, Allan Grønlund, Svend Christian Svendsen, Jonas Tranberg

Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2019

2018

Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon.

Pankaj K. Agarwal, Lars Arge, Frank Staals

Proceedings of the 34th International Symposium on Computational Geometry, 2018

Computing Floods Caused by Non-Uniform Sea-Level Rise.

Lars Arge, Yujin Shin, Constantinos Tsirogiannis

Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017

Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon.

Lars Arge, Frank Staals

CoRR, 2017

External memory pipelining made easy with TPIE.

Lars Arge, Mathias Rav, Svend C. Svendsen, Jakob Truelsen

Proceedings of the 2017 IEEE International Conference on Big Data (IEEE BigData 2017), 2017

I/O-Efficient Event Based Depression Flood Risk.

Lars Arge, Mathias Rav, Sarfraz Raza, Morten Revsbæk

Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016

Guest Editors' Foreword.

Lars Arge, János Pach

Discret. Comput. Geom., 2016

Computing River Floods Using Massive Terrain Data.

Cici Alexander, Lars Arge, Peder Klith Bøcher, Morten Revsbæk, Brody Sandel, Jens-Christian Svenning, Constantinos Tsirogiannis, Jungwoo Yang

Proceedings of the Geographic Information Science - 9th International Conference, 2016

2015

RAM-Efficient External Memory Sorting.

Lars Arge, Mikkel Thorup

Algorithmica, 2015

2014

Maintaining Contour Trees of Dynamic Terrains.

Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, Morten Revsbæk, Jungwoo Yang

CoRR, 2014

Simplifying massive planar subdivisions.

Lars Arge, Jakob Truelsen, Jungwoo Yang

Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013

(Approximate) Uncertain Skylines.

Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips

Theory Comput. Syst., 2013

Efficient external memory structures for range-aggregate queries.

Pankaj K. Agarwal, Lars Arge, Sathish Govindarajan, Jun Yang, Ke Yi

Comput. Geom., 2013

On (Dynamic) Range Minimum Queries in External Memory.

Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs.

Freek van Walderveen, Norbert Zeh, Lars Arge

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters.

Lars Arge, Gerth Stølting Brodal, Jakob Truelsen, Constantinos Tsirogiannis

Proceedings of the Algorithms - ESA 2013, 2013

Computing betweenness centrality in external memory.

Lars Arge, Michael T. Goodrich, Freek van Walderveen

Proceedings of the 2013 IEEE International Conference on Big Data (IEEE BigData 2013), 2013

2012

I/O-efficient spatial data structures for range queries.

Lars Arge, Kasper Green Larsen

ACM SIGSPATIAL Special, 2012

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., 2012

External Memory Planar Point Location with Logarithmic Updates.

Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao

Algorithmica, 2012

Fast generation of multiple resolution instances of raster data sets.

Lars Arge, Herman J. Haverkort, Constantinos Tsirogiannis

Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

Simplifying Massive Contour Maps.

Lars Arge, Lasse Deleuran, Thomas Mølhave, Morten Revsbæk, Jakob Truelsen

Proceedings of the Algorithms - ESA 2012, 2012

Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model.

Peyman Afshani, Lars Arge, Kasper Green Larsen

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2010

I/O-efficient batched union-find and its applications to terrain analysis.

Pankaj K. Agarwal, Lars Arge, Ke Yi

ACM Trans. Algorithms, 2010

Parallel external memory graph algorithms.

Lars Arge, Michael T. Goodrich, Nodari Sitchinava

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Cleaning massive sonar point clouds.

Lars Arge, Kasper Green Larsen, Thomas Mølhave, Freek van Walderveen

Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2010

10091 Abstracts Collection - Data Structures.

Lars Arge, Erik D. Demaine, Raimund Seidel

Proceedings of the Data Structures, 28.02. - 05.03.2010, 2010

I/O-efficient computation of water flow across a terrain.

Lars Arge, Morten Revsbæk, Norbert Zeh

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements.

Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Scalable algorithms for large high-resolution terrain data.

Thomas Mølhave, Pankaj K. Agarwal, Lars Arge, Morten Revsbæk

Proceedings of the 1st International Conference and Exhibition on Computing for Geospatial Research & Application, 2010

2009

Preface.

Lars Arge, Christian Cachin, Andrzej Tarlecki

Theor. Comput. Sci., 2009

Foreword.

Lars Arge, Emo Welzl

Algorithmica, 2009

Optimal External Memory Planar Point Enclosure.

Lars Arge, Vasilis Samoladas, Ke Yi

Algorithmica, 2009

Cache-Oblivious R-Trees.

Lars Arge, Mark de Berg, Herman J. Haverkort

Algorithmica, 2009

Recent Advances in Worst-Case Efficient Range Search Indexing.

Lars Arge

Proceedings of the Advances in Spatial and Temporal Databases, 2009

Worst-case efficient range search indexing: invited tutorial.

Lars Arge

Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

I/O-Efficient Contour Tree Simplification.

Lars Arge, Morten Revsbæk

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Orthogonal Range Reporting in Three and Higher Dimensions.

Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008

The priority R-tree: A practically efficient and worst-case optimal R-tree.

Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi

ACM Trans. Algorithms, 2008

Fundamental parallel algorithms for private-cache chip multiprocessors.

Lars Arge, Michael T. Goodrich, Michael J. Nelson, Nodari Sitchinava

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Cache-Oblivious Red-Blue Line Segment Intersection.

Lars Arge, Thomas Mølhave, Norbert Zeh

Proceedings of the Algorithms, 2008

08081 Abstracts Collection - Data Structures.

Lars Arge, Robert Sedgewick, Raimund Seidel

Proceedings of the Data Structures, 17.02. - 22.02.2008, 2008

I/o-efficient efficient algorithms for computing contours on a terrain.

Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, Bardia Sadri

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

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., 2007

Preface.

Lars Arge, Giuseppe F. Italiano

ACM J. Exp. Algorithmics, 2007

External-Memory Algorithms for Processing Line Segments in Geographic Information Systems.

Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter

Algorithmica, 2007

TerraStream: from elevation data to watershed hierarchies.

Andrew Danner, Thomas Mølhave, Ke Yi, Pankaj K. Agarwal, Lars Arge, Helena Mitásová

Proceedings of the 15th ACM International Symposium on Geographic Information Systems, 2007

The ComBack Method - Extending Hash Compaction with Backtracking.

Michael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, Lars Arge

Proceedings of the Petri Nets and Other Models of Concurrency, 2007

2006

Improved Dynamic Planar Point Location.

Lars Arge, Gerth Stølting Brodal, Loukas Georgiadis

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

06091 Abstracts Collection -- Data Structures.

Lars Arge, Robert Sedgewick, Dorothea Wagner

Proceedings of the Data Structures, 26.02. - 03.03.2006, 2006

06091 Executive Summary -- Data Structures.

Lars Arge, Robert Sedgewick, Dorothea Wagner

Proceedings of the Data Structures, 26.02. - 03.03.2006, 2006

Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching.

Lars Arge, Norbert Zeh

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

An optimal dynamic interval stabbing-max data structure?

Pankaj K. Agarwal, Lars Arge, Ke Yi

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Skip-webs: efficient distributed data structures for multi-dimensional data sets.

Lars Arge, David Eppstein, Michael T. Goodrich

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

External Data Structures for Shortest Path Queries on Planar Digraphs.

Lars Arge, Laura Toma

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

I/O-Efficient Construction of Constrained Delaunay Triangulations.

Pankaj K. Agarwal, Lars Arge, Ke Yi

Proceedings of the Algorithms, 2005

Cache-oblivious planar orthogonal range searching and counting.

Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004

Cache-Oblivious Data Structures.

Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg

Proceedings of the Handbook of Data Structures and Applications., 2004

On external-memory MST, SSSP and multi-way planar graph separation.

Lars Arge, Gerth Stølting Brodal, Laura Toma

J. Algorithms, 2004

I/O-efficient dynamic planar point location.

Lars Arge, Jan Vahrenhold

Comput. Geom., 2004

Simplified External Memory Algorithms for Planar DAGs.

Lars Arge, Laura Toma

Proceedings of the Algorithm Theory, 2004

External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs.

Lars Arge, Ulrich Meyer, Laura Toma

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects.

Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu

Proceedings of the Algorithms, 2004

04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms.

Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn

Proceedings of the Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004, 2004

External Geometric Data Structures.

Lars Arge

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

Optimal External Memory Interval Management.

Lars Arge, Jeffrey Scott Vitter

SIAM J. Comput., 2003

On External-Memory Planar Depth First Search.

Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh

J. Graph Algorithms Appl., 2003

I/O-efficient point location using persistent B-trees.

Lars Arge, Andrew Danner, Sha-Mayn Teh

ACM J. Exp. Algorithmics, 2003

Indexing Moving Points.

Pankaj K. Agarwal, Lars Arge, Jeff Erickson

J. Comput. Syst. Sci., 2003

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, 2003

The Buffer Tree: A Technique for Designing Batched External Data Structures.

Lars Arge

Algorithmica, 2003

Bkd-Tree: A Dznamic Scalable kd-Tree.

Octavian Procopiuc, Pankaj K. Agarwal, Lars Arge, Jeffrey Scott Vitter

Proceedings of the Advances in Spatial and Temporal Databases, 8th International Symposium, 2003

Efficient Object-Realtional Interval Management and Beyond.

Lars Arge, Andrew Chatham

Proceedings of the Advances in Spatial and Temporal Databases, 8th International Symposium, 2003

I/O-efficient topological sorting of planar DAGs.

Lars Arge, Laura Toma, Norbert Zeh

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries.

Sathish Govindarajan, Pankaj K. Agarwal, Lars Arge

Proceedings of the Database Theory, 2003

I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs.

Lars Arge, Norbert Zeh

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries.

Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi

Proceedings of the Algorithms, 2003

Cache-oblivious data structures for orthogonal range searching.

Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan Holland-Minkley

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk).

Lars Arge

Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003

2002

Efficient Sorting Using Registers and Caches.

Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter

ACM J. Exp. Algorithmics, 2002

Efficient Bulk Operations on Dynamic R-Trees.

Lars Arge, Klaus H. Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter

Algorithmica, 2002

Cache-oblivious priority queue and graph algorithm applications.

Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Implementing I/O-efficient Data Structures Using TPIE.

Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter

Proceedings of the Algorithms, 2002

2001

I/O-Efficient Algorithms for Problems on Grid-Based Terrains.

Lars Arge, Laura Toma, Jeffrey Scott Vitter

ACM J. Exp. Algorithmics, 2001

Time Responsive External Data Structures for Moving Points.

Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

A Framework for Index Bulk Loading and Dynamization.

Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Flow Computation on Massive Grids.

Laura Toma, Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Patrick N. Halpin, Dean Urban

Proceedings of the ACM-GIS 2001, 2001

External Memory Data Structures.

Lars Arge

Proceedings of the Algorithms, 2001

2000

Efficient Searching with Linear Constraints.

Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter

J. Comput. Syst. Sci., 2000

I/O-Space Trade-Offs.

Lars Arge, Jakob Pagter

Proceedings of the Algorithm Theory, 2000

A Unified Approach for Indexed and Non-Indexed Spatial Joins.

Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jan Vahrenhold, Jeffrey Scott Vitter

Proceedings of the Advances in Database Technology, 2000

I/O-efficient dynamic planar point location (extended abstract).

Lars Arge, Jan Vahrenhold

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999

I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions.

Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

On Two-Dimensional Indexability and Optimal Range Search Indexing.

Lars Arge, Vasilis Samoladas, Jeffrey Scott Vitter

Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999

1998

Scalable Sweeping-Based Spatial Join.

Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter

Proceedings of the VLDB'98, 1998

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

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

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

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

On showing lower bounds for external-memory computational geometry problems.

Lars Arge, Peter Bro Miltersen

Proceedings of the External Memory Algorithms, 1998

1997

On Sorting Strings in External Memory (Extended Abstract).

Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Sequence sorting in secondary storage.

Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter

Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

1996

Efficient External-Memory Data Structures and Applications.

Lars Arge

PhD thesis, 1996

Optimal Dynamic Interval Management in External Memory (extended abstract).

Lars Arge, Jeffrey Scott Vitter

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

External-Memory Algorithms with Applications in GIS.

Lars Arge

Proceedings of the Algorithmic Foundations of Geographic Information Systems, 1996

1995

The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract).

Lars Arge

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation.

Lars Arge

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract).

Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter

Proceedings of the Algorithms, 1995

1993

A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms.

Lars Arge, Mikael B. Knudsen, Kirsten Larsen

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993