Lars Arge

According to our database1, Lars Arge authored at least 109 papers between 1993 and 2020.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Awards

ACM Fellow

ACM Fellow 2012, "For contributions to massive data algorithmics".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Sea-Rise Flooding on Massive Dynamic Terrains.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

1D and 2D Flow Routing on a Terrain.
Proceedings of the SIGSPATIAL '20: 28th International Conference on Advances in Geographic Information Systems, 2020

2019
Learning to Find Hydrological Corrections.
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.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Computing Floods Caused by Non-Uniform Sea-Level Rise.
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017
Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon.
CoRR, 2017

External memory pipelining made easy with TPIE.
Proceedings of the 2017 IEEE International Conference on Big Data, 2017

I/O-Efficient Event Based Depression Flood Risk.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016
Guest Editors' Foreword.
Discret. Comput. Geom., 2016

Computing River Floods Using Massive Terrain Data.
Proceedings of the Geographic Information Science - 9th International Conference, 2016

2015
RAM-Efficient External Memory Sorting.
Algorithmica, 2015

2014
Maintaining Contour Trees of Dynamic Terrains.
CoRR, 2014

Simplifying massive planar subdivisions.
Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013
(Approximate) Uncertain Skylines.
Theory Comput. Syst., 2013

Efficient external memory structures for range-aggregate queries.
Comput. Geom., 2013

On (Dynamic) Range Minimum Queries in External Memory.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters.
Proceedings of the Algorithms - ESA 2013, 2013

Computing betweenness centrality in external memory.
Proceedings of the 2013 IEEE International Conference on Big Data, 2013

2012
I/O-efficient spatial data structures for range queries.
ACM SIGSPATIAL Special, 2012

An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries.
SIAM J. Comput., 2012

External Memory Planar Point Location with Logarithmic Updates.
Algorithmica, 2012

Fast generation of multiple resolution instances of raster data sets.
Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

Simplifying Massive Contour Maps.
Proceedings of the Algorithms - ESA 2012, 2012

Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model.
Proceedings of the Symposuim on Computational Geometry 2012, 2012

2010
I/O-efficient batched union-find and its applications to terrain analysis.
ACM Trans. Algorithms, 2010

Parallel external memory graph algorithms.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Cleaning massive sonar point clouds.
Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2010

10091 Abstracts Collection - Data Structures.
Proceedings of the Data Structures, 28.02. - 05.03.2010, 2010

I/O-efficient computation of water flow across a terrain.
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.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Scalable algorithms for large high-resolution terrain data.
Proceedings of the 1st International Conference and Exhibition on Computing for Geospatial Research & Application, 2010

2009
Preface.
Theor. Comput. Sci., 2009

Foreword.
Algorithmica, 2009

Optimal External Memory Planar Point Enclosure.
Algorithmica, 2009

Cache-Oblivious R-Trees.
Algorithmica, 2009

Recent Advances in Worst-Case Efficient Range Search Indexing.
Proceedings of the Advances in Spatial and Temporal Databases, 2009

Worst-case efficient range search indexing: invited tutorial.
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

I/O-Efficient Contour Tree Simplification.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Orthogonal Range Reporting in Three and Higher Dimensions.
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.
ACM Trans. Algorithms, 2008

Fundamental parallel algorithms for private-cache chip multiprocessors.
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.
Proceedings of the Algorithms, 2008

08081 Abstracts Collection - Data Structures.
Proceedings of the Data Structures, 17.02. - 22.02.2008, 2008

I/o-efficient efficient algorithms for computing contours on a terrain.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms.
SIAM J. Comput., 2007

Preface.
ACM J. Exp. Algorithmics, 2007

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

TerraStream: from elevation data to watershed hierarchies.
Proceedings of the 15th ACM International Symposium on Geographic Information Systems, 2007

The ComBack Method - Extending Hash Compaction with Backtracking.
Proceedings of the Petri Nets and Other Models of Concurrency, 2007

2006
Improved Dynamic Planar Point Location.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

06091 Abstracts Collection -- Data Structures.
Proceedings of the Data Structures, 26.02. - 03.03.2006, 2006

06091 Executive Summary -- Data Structures.
Proceedings of the Data Structures, 26.02. - 03.03.2006, 2006

Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
An optimal dynamic interval stabbing-max data structure?
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Skip-webs: efficient distributed data structures for multi-dimensional data sets.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

External Data Structures for Shortest Path Queries on Planar Digraphs.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

I/O-Efficient Construction of Constrained Delaunay Triangulations.
Proceedings of the Algorithms, 2005

Cache-oblivious planar orthogonal range searching and counting.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004
Cache-Oblivious Data Structures.
Proceedings of the Handbook of Data Structures and Applications., 2004

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

I/O-efficient dynamic planar point location.
Comput. Geom., 2004

Simplified External Memory Algorithms for Planar DAGs.
Proceedings of the Algorithm Theory, 2004

External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects.
Proceedings of the Algorithms, 2004

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

External Geometric Data Structures.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
Optimal External Memory Interval Management.
SIAM J. Comput., 2003

On External-Memory Planar Depth First Search.
J. Graph Algorithms Appl., 2003

I/O-efficient point location using persistent B-trees.
ACM J. Exp. Algorithmics, 2003

Indexing Moving Points.
J. Comput. Syst. Sci., 2003

Efficient Flow Computation on Massive Grid Terrain Datasets.
GeoInformatica, 2003

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

Bkd-Tree: A Dznamic Scalable kd-Tree.
Proceedings of the Advances in Spatial and Temporal Databases, 8th International Symposium, 2003

Efficient Object-Realtional Interval Management and Beyond.
Proceedings of the Advances in Spatial and Temporal Databases, 8th International Symposium, 2003

I/O-efficient topological sorting of planar DAGs.
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.
Proceedings of the Database Theory, 2003

I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs.
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.
Proceedings of the Algorithms, 2003

Cache-oblivious data structures for orthogonal range searching.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk).
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003

2002
Efficient Sorting Using Registers and Caches.
ACM J. Exp. Algorithmics, 2002

Efficient Bulk Operations on Dynamic R-Trees.
Algorithmica, 2002

Cache-oblivious priority queue and graph algorithm applications.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Implementing I/O-efficient Data Structures Using TPIE.
Proceedings of the Algorithms, 2002

2001
I/O-Efficient Algorithms for Problems on Grid-Based Terrains.
ACM J. Exp. Algorithmics, 2001

Time Responsive External Data Structures for Moving Points.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

A Framework for Index Bulk Loading and Dynamization.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Flow Computation on Massive Grids.
Proceedings of the ACM-GIS 2001, 2001

External Memory Data Structures.
Proceedings of the Algorithms, 2001

2000
Efficient Searching with Linear Constraints.
J. Comput. Syst. Sci., 2000

I/O-Space Trade-Offs.
Proceedings of the Algorithm Theory, 2000

A Unified Approach for Indexed and Non-Indexed Spatial Joins.
Proceedings of the Advances in Database Technology, 2000

I/O-efficient dynamic planar point location (extended abstract).
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999
I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

On Two-Dimensional Indexability and Optimal Range Search Indexing.
Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999

1998
Scalable Sweeping-Based Spatial Join.
Proceedings of the VLDB'98, 1998

Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract).
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).
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

On showing lower bounds for external-memory computational geometry problems.
Proceedings of the External Memory Algorithms, 1998

1997
On Sorting Strings in External Memory (Extended Abstract).
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Sequence sorting in secondary storage.
Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

1996
Efficient External-Memory Data Structures and Applications.
PhD thesis, 1996

Optimal Dynamic Interval Management in External Memory (extended abstract).
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

External-Memory Algorithms with Applications in GIS.
Proceedings of the Algorithmic Foundations of Geographic Information Systems, 1996

1995
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract).
Proceedings of the Algorithms, 1995

1993
A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993


  Loading...