Lars Arge

Q: What Schools Are Affiliated With Lars Arge

Lars Arge is affiliated with the following schools: Aarhus University, Duke University

Lars Arge's AcademicInfluence.com Rankings

Lars Arge

Computer Science

#2781

World Rank

#2912

Historical Rank

Database

#7725

World Rank

#8031

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Lars Arge Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Lars Allan Arge was a Danish computer scientist, the head of the Center for Massive Data Algorithmics at Aarhus University, where he was also a professor of computer science. His research involved the study of algorithms and data structures for handling massive data, especially in graph algorithms and computational geometry.

(See a Problem?)

Lars Arge's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The Influence of Late Quaternary Climate-Change Velocity on Species Endemism (2011) (674)
Residential green space in childhood is associated with lower risk of psychiatric disorders from adolescence into adulthood (2019) (323)
Indexing Moving Points (2003) (270)
Scalable Sweeping-Based Spatial Join (1998) (222)
The priority R-tree: A practically efficient and worst-case optimal R-tree (2004) (213)
The Buffer Tree: A Technique for Designing Batched External Data Structures (2003) (202)
On two-dimensional indexability and optimal range search indexing (1999) (164)
Optimal dynamic interval management in external memory (1996) (163)
Topography as a driver of local terrestrial vascular plant diversity patterns (2013) (163)
The Buffer Tree: A New Technique for Optimal I/O Algorithms (1996) (160)
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract) (1995) (158)
Optimal External Memory Interval Management (2003) (141)
Efficient Bulk Operations on Dynamic R-Trees (1999) (135)
External Memory Data Structures (2001) (131)
Topographically controlled soil moisture drives plant diversity patterns within grasslands (2013) (129)
Bkd-Tree: A Dznamic Scalable kd-Tree (2003) (129)
Fundamental parallel algorithms for private-cache chip multiprocessors (2008) (125)
Cache-oblivious priority queue and graph algorithm applications (2002) (124)
Efficient Flow Computation on Massive Grid Terrain Datasets (2003) (121)
Indexing moving points (extended abstract) (2000) (118)
Efficient searching with linear constraints (1998) (92)
Topographically controlled soil moisture is the primary driver of local vegetation patterns across a lowland region (2013) (90)
Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings (2007) (85)
TerraStream: from elevation data to watershed hierarchies (2007) (84)
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation (2000) (82)
I/O-Efficient Algorithms for Problems on Grid-Based Terrains (2001) (70)
On sorting strings in external memory (extended abstract) (1997) (70)
Implementing I/O-efficient Data Structures Using TPIE (2002) (67)
On Sorting Strings in External Memory (1997) (61)
A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms (1992) (58)
I/O-efficient algorithms for contour-line extraction and planar graph blocking (1998) (57)
Efficient External-Memory Data Structures and Applications (1996) (56)
The Priority R-tree: a practically efficient and worst-case optimal R-tree (2008) (54)
From Point Cloud to Grid DEM: A Scalable Approach (2006) (54)
Cache-Oblivious Data Structures (2004) (52)
35.3 CHILDHOOD EXPOSURE TO GREEN SPACE – A NOVEL RISK-DECREASING MECHANISM FOR SCHIZOPHRENIA? (2018) (50)
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation (1995) (49)
Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings (2006) (49)
I/O-efficient batched union-find and its applications to terrain analysis (2006) (48)
A Unified Approach for Indexed and Non-Indexed Spatial Joins (2000) (47)
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries (2003) (46)
External-memory algorithms and data structures (2010) (46)
Parallel external memory graph algorithms (2010) (45)
Orthogonal Range Reporting in Three and Higher Dimensions (2009) (45)
Geographically Comprehensive Assessment of Salt-Meadow Vegetation-Elevation Relations Using LiDAR (2011) (45)
I/O-Efficient Construction of Constrained Delaunay Triangulations (2005) (45)
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements (2010) (42)
Efficient sorting using registers and caches (2000) (42)
I/O-efficient dynamic planar point location (2004) (42)
A Framework for Index Bulk Loading and Dynamization (2001) (41)
Skip-webs: efficient distributed data structures for multi-dimensional data sets (2005) (41)
Flow Computation on Massive Grid Terrains (2001) (41)
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (1995) (40)
Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model (2012) (39)
I/O-efficient point location using persistent B-trees (2003) (39)
(Approximate) Uncertain Skylines (2011) (38)
Cache-oblivious data structures for orthogonal range searching (2003) (37)
Airborne laser scanner (LiDAR) proxies for understory light conditions (2013) (37)
Flow computation on massive grids (2001) (36)
Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems (1998) (35)
External-Memory Algorithms with Applications in Geographic Information Systems (1997) (33)
Improved Dynamic Planar Point Location (2006) (33)
On External-Memory Planar Depth First Search (2001) (32)
I/O-efficient dynamic point location in monotone planar subdivisions (1999) (32)
On external-memory MST, SSSP and multi-way planar graph separation (2004) (31)
On showing lower bounds for external-memory computational geometry problems (1999) (31)
An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms (2007) (31)
Exact Minkowski sums of polyhedra and exact and efficient decomposition of polyhedra in convex pieces (2007) (30)
I/O-efficient topological sorting of planar DAGs (2003) (29)
Natural surroundings in childhood are associated with lower schizophrenia rates (2019) (27)
Regional-scale mapping of tree cover, height and main phenological tree types using airborne laser scanning data (2014) (26)
Cache-Oblivious R-Trees (2005) (25)
Cache-oblivious planar orthogonal range searching and counting (2005) (25)
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs (2004) (25)
An optimal dynamic interval stabbing-max data structure? (2005) (24)
Optimal External Memory Planar Point Enclosure (2004) (22)
Associations between growing up in natural environments and subsequent psychiatric disorders in Denmark. (2020) (22)
I/O-efficient computation of water flow across a terrain (2010) (21)
I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries (2003) (20)
Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs (2013) (19)
I/O-efficient strong connectivity and depth-first search for directed planar graphs (2003) (18)
Association Between Childhood Green Space, Genetic Liability, and the Incidence of Schizophrenia. (2020) (17)
Cleaning massive sonar point clouds (2010) (17)
I/O-Efficient Contour Tree Simplification (2009) (17)
The ComBack Method - Extending Hash Compaction with Backtracking (2007) (17)
Time Responsive External Data Structures for Moving Points (2001) (17)
Optimal Dynamic Interval Management in External Memory (extended abstract). (1996) (16)
External-Memory Algorithms with Applications in GIS (1996) (15)
I/O-Efficient Hierarchical Watershed Decomposition of Grid Terrain Models (2006) (15)
I/O-efficient batched union-find and its applications to terrain analysis (2010) (15)
External-Storage Data Structures for Plane-Sweep Algorithms (1994) (14)
I/O-efficient dynamic planar point location (extended abstract) (2000) (12)
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries (2012) (12)
Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching (2006) (11)
I/o-efficient efficient algorithms for computing contours on a terrain (2008) (11)
Simplified External Memory Algorithms for Planar DAGs (2004) (11)
I/O-Efficient Event Based Depression Flood Risk (2017) (10)
Scalable algorithms for large high-resolution terrain data (2010) (10)
External Memory Geometric Data Structures (2002) (10)
Cache-Oblivious Red-Blue Line Segment Intersection (2008) (9)
RAM-Efficient External Memory Sorting (2013) (8)
Efficient external memory structures for range-aggregate queries (2013) (8)
Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract) (1998) (8)
External Data Structures for Shortest Path Queries on Planar Digraphs (2005) (8)
On (Dynamic) Range Minimum Queries in External Memory (2013) (7)
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects (2004) (7)
Ecient Bulk Operations on Dynamic R-trees (Extended Abstract) (1999) (7)
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 (2004) (7)
A quasi-PTAS for profit-maximizing pricing on line graphs (2007) (7)
External memory graph algorithms and applications to geographic information systems (2003) (7)
I/O-Efficient Algorithms for Computing Contours on a Terrain (2008) (6)
Fast generation of multiple resolution instances of raster data sets (2012) (6)
I/O-efficient spatial data structures for range queries (2012) (5)
Computing betweenness centrality in external memory (2013) (5)
I/o efficient algorithms and applications in geographic information systems (2006) (5)
I/o-eecient Dynamic Planar Point Location (2000) (5)
External Memory Planar Point Location with Logarithmic Updates (2008) (5)
04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms (2004) (5)
Simplifying Massive Contour Maps (2012) (4)
Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon (2017) (4)
Efficient Object-Realtional Interval Management and Beyond (2003) (4)
A life course approach to understanding associations between natural environments and mental well-being for the Danish blood donor cohort. (2021) (3)
External memory pipelining made easy with TPIE (2017) (3)
External Memory Data Structures (invited Paper) (2001) (3)
I/O-Space Trade-Offs (2000) (3)
Cache-Oblivious Dynamic Dictionaries with Optimal Update / Query Tradeo (2010) (3)
I/O-Efficient Dynamic Point Location in Monotone Subdivisions (1999) (3)
An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters (2013) (2)
Proceedings of the 34th international colloquium on Automata, Languages and Programming (2007) (2)
External Geometric Data Structures (2004) (2)
Learning to Find Hydrological Corrections (2019) (2)
Simplifying massive planar subdivisions (2014) (2)
Impacts of 21st century sea-level rise on a Danish major city – an assessment based on fine-resolution digital topography and a new flooding algorithm (2009) (2)
Some Algorithmic Research Challenges and Opportunities in Geospatial Applications (2001) (2)
Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004 (2005) (2)
Algorithms for Computing Prominence on Grid Terrains (2013) (2)
I/O-Efficient Algorithms and Data Structures (2007) (2)
1D and 2D Flow Routing on a Terrain (2020) (1)
Computing River Floods Using Massive Terrain Data (2016) (1)
Computing Floods Caused by Non-Uniform Sea-Level Rise (2018) (1)
(Approximate) Uncertain Skylines (2012) (1)
1D and 2D Flow Routing on a Terrain (2022) (1)
Response—Global Endemism Needs Spatial Integration (2012) (1)
The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation (1996) (1)
cient Searching with Linear Constraints (1)
Special Issue: 31st Annual Symposium on Computational Geometry Foreword (2016) (0)
Foreword (2008) (0)
Computing Pfafstetter Labelings I/o-efficiently (2005) (0)
Topographically controlled soil moisture drives plant diversity patterns within grasslands (2013) (0)
On the power of data structures for parsing LR languages (2006) (0)
06091 Executive Summary -- Data Structures (2006) (0)
Preface (2009) (0)
Algorithms for very large spatial databases (2002) (0)
Proceedings of the 10th Scandinavian conference on Algorithm Theory (2006) (0)
Sea-Rise Flooding on Massive Dynamic Terrains (2020) (0)
I / O-Efficient Algorithms for Computing Contour Maps on Terrains (2010) (0)
Recent Advances in Worst-Case Efficient Range Search Indexing (2009) (0)
38 Cache-Oblivious Data Structures (0)
Session details: Indexing (2009) (0)
Cache-Oblivious and Cache-Aware Algorithms Dagstuhl Seminar (2005) (0)
Proceedings of the 34th international conference on Automata, Languages and Programming (2007) (0)
Sequence sorting in secondary storage (1997) (0)
Some) Techniques for Handling Massive Data Sets (2007) (0)
Front Matter, Table of Contents, Preface, Conference Organization (2015) (0)
Workshop on Massive Geometric Data Sets ( Massive 2005 ) (2005) (0)
Guest Editors’ Foreword (2016) (0)
Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings (2007) (0)
Algorithm Theory - SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings (Lecture Notes in Computer Science) (2006) (0)
Worst-case efficient range search indexing: invited tutorial (2009) (0)
RAM-Efficient External Memory Sorting (2015) (0)
External Memory Planar Point Location with Logarithmic Updates (2011) (0)
Alenex workshop preface (2005) (0)
Computing Pfafstetter labellings I/O-efficiently (Abstract) (2005) (0)
External Geometric Data Structures (Invited Paper) (2004) (0)
Preface (2010) (0)
Categoral views on computations on trees ( Extended abstract ) (2007) (0)
Proceedings of the 15th annual European conference on Algorithms (2007) (0)
Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk) (2003) (0)
10091 Abstracts Collection - Data Structures (2004) (0)
Rasters associated with Sandel et al. 2011 (2011) (0)
The Performance of In-memory Sorting (1999) (0)
On commutativity based edge lean search (2007) (0)
Modeling and Analyzing Terrain Data Acquired by Modern Mapping Techniques (2009) (0)

This paper list is powered by the following services:

Other Resources About Lars Arge

What Schools Are Affiliated With Lars Arge?

Lars Arge is affiliated with the following schools: