Lars Arge - RankMe

140 papers A* 22A 20B 15Misc 1Journal 37Unranked 36

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	1D and 2D Flow Routing on a Terrain. ACM Trans. Spatial Algorithms Syst. Lars Arge, Aaron Lowe, Svend C. Svendsen, Pankaj K. Agarwal
2020	—	`conf`	1D and 2D Flow Routing on a Terrain. SIGSPATIAL/GIS Aaron Lowe, Svend C. Svendsen, Pankaj K. Agarwal, Lars Arge
2020	J	`jnl`	1D and 2D Flow Routing on a Terrain. CoRR Aaron Lowe, Svend C. Svendsen, Pankaj K. Agarwal, Lars Arge
2020	—	`conf`	Sea-Rise Flooding on Massive Dynamic Terrains. SWAT Lars Arge, Mathias Rav, Morten Revsbæk, Yujin Shin, Jungwoo Yang
2019	—	`conf`	Learning to Find Hydrological Corrections. SIGSPATIAL/GIS Lars Arge, Allan Grønlund, Svend Christian Svendsen, Jonas Tranberg
2019	J	`jnl`	Learning to Find Hydrological Corrections. CoRR Lars Arge, Allan Grønlund, Svend Christian Svendsen, Jonas Tranberg
2018	A	`conf`	Computing Floods Caused by Non-Uniform Sea-Level Rise. ALENEX Lars Arge, Yujin Shin, Constantinos Tsirogiannis
2018	A*	`conf`	Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon. SoCG Pankaj K. Agarwal, Lars Arge, Frank Staals
2018	J	`jnl`	Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon. CoRR Pankaj K. Agarwal, Lars Arge, Frank Staals
2017	J	`jnl`	Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon. CoRR Lars Arge, Frank Staals
2017	J	`jnl`	External Memory Pipelining Made Easy With TPIE. CoRR Lars Arge, Mathias Rav, Svend C. Svendsen, Jakob Truelsen
2017	—	`conf`	External memory pipelining made easy with TPIE. IEEE BigData Lars Arge, Mathias Rav, Svend C. Svendsen, Jakob Truelsen
2017	A	`conf`	I/O-Efficient Event Based Depression Flood Risk. ALENEX Lars Arge, Mathias Rav, Sarfraz Raza, Morten Revsbæk
2016	—	`conf`	Computing River Floods Using Massive Terrain Data. GIScience Cici Alexander, Lars Arge, Peder Klith Bøcher, Morten Revsbæk, Brody Sandel, Jens-Christian Svenning, Constantinos Tsirogiannis, Jungwoo Yang
2016	J	`jnl`	Guest Editors' Foreword. Discret. Comput. Geom. Lars Arge, János Pach
2015	A*	`ed.`	31st International Symposium on Computational Geometry, SoCG 2015, Eindhoven, The Netherlands, June 22-25, 2015 SoCG Lars Arge, János Pach
2015	J	`jnl`	RAM-Efficient External Memory Sorting. Algorithmica Lars Arge, Mikkel Thorup
2014	J	`jnl`	Maintaining Contour Trees of Dynamic Terrains. CoRR Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, Morten Revsbæk, Jungwoo Yang
2014	A	`conf`	Simplifying massive planar subdivisions. ALENEX Lars Arge, Jakob Truelsen, Jungwoo Yang
2013	J	`jnl`	(Approximate) Uncertain Skylines. Theory Comput. Syst. Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips
2013	A	`conf`	An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters. ESA Lars Arge, Gerth Stølting Brodal, Jakob Truelsen, Constantinos Tsirogiannis
2013	—	`conf`	Computing betweenness centrality in external memory. IEEE BigData Lars Arge, Michael T. Goodrich, Freek van Walderveen
2013	J	`jnl`	Efficient external memory structures for range-aggregate queries. Comput. Geom. Pankaj K. Agarwal, Lars Arge, Sathish Govindarajan, Jun Yang, Ke Yi
2013	A*	`conf`	Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs. SODA Freek van Walderveen, Norbert Zeh, Lars Arge
2013	B	`conf`	On (Dynamic) Range Minimum Queries in External Memory. WADS Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava
2013	B	`conf`	RAM-Efficient External Memory Sorting. ISAAC Lars Arge, Mikkel Thorup
2013	J	`jnl`	RAM-Efficient External Memory Sorting. CoRR Lars Arge, Mikkel Thorup
2012	J	`jnl`	An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries. SIAM J. Comput. Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Molad, Robert Endre Tarjan, Ke Yi
2012	J	`jnl`	External Memory Planar Point Location with Logarithmic Updates. Algorithmica Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao
2012	—	`conf`	Fast generation of multiple resolution instances of raster data sets. SIGSPATIAL/GIS Lars Arge, Herman J. Haverkort, Constantinos Tsirogiannis
2012	—	`conf`	Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model. SCG Peyman Afshani, Lars Arge, Kasper Green Larsen
2012	J	`jnl`	I/O-efficient spatial data structures for range queries. ACM SIGSPATIAL Special Lars Arge, Kasper Green Larsen
2012	A	`conf`	Simplifying Massive Contour Maps. ESA Lars Arge, Lasse Deleuran, Thomas Mølhave, Morten Revsbæk, Jakob Truelsen
2011	A	`conf`	(Approximate) uncertain skylines. ICDT Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips
2010	—	`conf`	10091 Abstracts Collection - Data Structures. Data Structures Lars Arge, Erik D. Demaine, Raimund Seidel
2010	—	`conf`	Cleaning massive sonar point clouds. GIS Lars Arge, Kasper Green Larsen, Thomas Mølhave, Freek van Walderveen
2010	—	`ed.`	Data Structures, 28.02. - 05.03.2010 Data Structures Lars Arge, Erik D. Demaine, Raimund Seidel
2010	J	`jnl`	I/O-efficient batched union-find and its applications to terrain analysis. ACM Trans. Algorithms Pankaj K. Agarwal, Lars Arge, Ke Yi
2010	—	`conf`	I/O-efficient computation of water flow across a terrain. SCG Lars Arge, Morten Revsbæk, Norbert Zeh
2010	—	`conf`	Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements. SCG Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
2010	A	`conf`	Parallel external memory graph algorithms. IPDPS Lars Arge, Michael T. Goodrich, Nodari Sitchinava
2010	—	`conf`	Scalable algorithms for large high-resolution terrain data. COM.Geo Thomas Mølhave, Pankaj K. Agarwal, Lars Arge, Morten Revsbæk
2009	J	`jnl`	Cache-Oblivious R-Trees. Algorithmica Lars Arge, Mark de Berg, Herman J. Haverkort
2009	J	`jnl`	Foreword. Algorithmica Lars Arge, Emo Welzl
2009	B	`conf`	I/O-Efficient Contour Tree Simplification. ISAAC Lars Arge, Morten Revsbæk
2009	J	`jnl`	Optimal External Memory Planar Point Enclosure. Algorithmica Lars Arge, Vasilis Samoladas, Ke Yi
2009	A*	`conf`	Orthogonal Range Reporting in Three and Higher Dimensions. FOCS Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
2009	J	`jnl`	Preface. Theor. Comput. Sci. Lars Arge, Christian Cachin, Andrzej Tarlecki
2009	B	`conf`	Recent Advances in Worst-Case Efficient Range Search Indexing. SSTD Lars Arge
2009	A*	`conf`	Worst-case efficient range search indexing: invited tutorial. PODS Lars Arge
2008	—	`conf`	08081 Abstracts Collection - Data Structures. Data Structures Lars Arge, Robert Sedgewick, Raimund Seidel
2008	A	`conf`	Cache-Oblivious Red-Blue Line Segment Intersection. ESA Lars Arge, Thomas Mølhave, Norbert Zeh
2008	—	`ed.`	Data Structures, 17.02. - 22.02.2008 Data Structures Lars Arge, Robert Sedgewick, Raimund Seidel
2008	—	`conf`	External memory planar point location with logarithmic updates. SCG Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao
2008	B	`conf`	Fundamental parallel algorithms for private-cache chip multiprocessors. SPAA Lars Arge, Michael T. Goodrich, Michael J. Nelson, Nodari Sitchinava
2008	—	`conf`	I/o-efficient efficient algorithms for computing contours on a terrain. SCG Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, Bardia Sadri
2008	J	`jnl`	The priority R-tree: A practically efficient and worst-case optimal R-tree. ACM Trans. Algorithms Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi
2007	A	`ed.`	Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings ESA Lars Arge, Michael Hoffmann, Emo Welzl
2007	J	`jnl`	An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms. SIAM J. Comput. Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro
2007	A*	`ed.`	Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings ICALP Lars Arge, Christian Cachin, Tomasz Jurdzinski, Andrzej Tarlecki
2007	J	`jnl`	External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. Algorithmica Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter
2007	J	`jnl`	Preface. ACM J. Exp. Algorithmics Lars Arge, Giuseppe F. Italiano
2007	—	`conf`	TerraStream: from elevation data to watershed hierarchies. GIS Andrew Danner, Thomas Mølhave, Ke Yi, Pankaj K. Agarwal, Lars Arge, Helena Mitásová
2007	—	`conf`	The ComBack Method - Extending Hash Compaction with Backtracking. ICATPN Michael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, Lars Arge
2006	—	`conf`	06091 Abstracts Collection -- Data Structures. Data Structures Lars Arge, Robert Sedgewick, Dorothea Wagner
2006	—	`conf`	06091 Executive Summary -- Data Structures. Data Structures Lars Arge, Robert Sedgewick, Dorothea Wagner
2006	—	`ed.`	Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings SWAT Lars Arge, Rusins Freivalds
2006	—	`ed.`	Data Structures, 26.02. - 03.03.2006 Data Structures Lars Arge, Robert Sedgewick, Dorothea Wagner
2006	—	`conf`	I/O-efficient batched union-find and its applications to terrain analysis. SCG Pankaj K. Agarwal, Lars Arge, Ke Yi
2006	A*	`conf`	Improved Dynamic Planar Point Location. FOCS Lars Arge, Gerth Stølting Brodal, Loukas Georgiadis
2006	—	`conf`	Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching. SCG Lars Arge, Norbert Zeh
2005	A*	`conf`	An optimal dynamic interval stabbing-max data structure? SODA Pankaj K. Agarwal, Lars Arge, Ke Yi
2005	—	`ed.`	Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004 Cache-Oblivious and Cache-Aware Algorithms Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn
2005	—	`conf`	Cache-oblivious planar orthogonal range searching and counting. SCG Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen
2005	—	`conf`	Cache-oblivious r-trees. SCG Lars Arge, Mark de Berg, Herman J. Haverkort
2005	B	`conf`	External Data Structures for Shortest Path Queries on Planar Digraphs. ISAAC Lars Arge, Laura Toma
2005	A	`conf`	I/O-Efficient Construction of Constrained Delaunay Triangulations. ESA Pankaj K. Agarwal, Lars Arge, Ke Yi
2005	J	`jnl`	Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets CoRR Lars Arge, David Eppstein, Michael T. Goodrich
2005	A*	`conf`	Skip-webs: efficient distributed data structures for multi-dimensional data sets. PODC Lars Arge, David Eppstein, Michael T. Goodrich
2004	—	`conf`	04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. Cache-Oblivious and Cache-Aware Algorithms Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn
2004	—	`ch.`	Cache-Oblivious Data Structures. Handbook of Data Structures and Applications Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg
2004	A	`conf`	Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. ESA Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu
2004	Misc	`conf`	External Geometric Data Structures. COCOON Lars Arge
2004	A*	`conf`	External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. ICALP Lars Arge, Ulrich Meyer, Laura Toma
2004	J	`jnl`	I/O-efficient dynamic planar point location. Comput. Geom. Lars Arge, Jan Vahrenhold
2004	J	`jnl`	On external-memory MST, SSSP and multi-way planar graph separation. J. Algorithms Lars Arge, Gerth Stølting Brodal, Laura Toma
2004	A	`conf`	Optimal External Memory Planar Point Enclosure. ESA Lars Arge, Vasilis Samoladas, Ke Yi
2004	—	`ed.`	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 ALENEX/ANALC Lars Arge, Giuseppe F. Italiano, Robert Sedgewick
2004	—	`conf`	Simplified External Memory Algorithms for Planar DAGs. SWAT Lars Arge, Laura Toma
2004	—	`conf`	The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. SIGMOD Conference Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi
2004	—	`conf`	The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. Cache-Oblivious and Cache-Aware Algorithms Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi
2003	B	`conf`	Bkd-Tree: A Dznamic Scalable kd-Tree. SSTD Octavian Procopiuc, Pankaj K. Agarwal, Lars Arge, Jeffrey Scott Vitter
2003	A	`conf`	CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries. ICDT Sathish Govindarajan, Pankaj K. Agarwal, Lars Arge
2003	—	`conf`	Cache-oblivious data structures for orthogonal range searching. SCG Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan Holland-Minkley
2003	J	`jnl`	Efficient Flow Computation on Massive Grid Terrain Datasets. GeoInformatica Lars Arge, Jeffrey S. Chase, Patrick N. Halpin, Laura Toma, Jeffrey Scott Vitter, Dean L. Urban, Rajiv Wickremesinghe
2003	B	`conf`	Efficient Object-Realtional Interval Management and Beyond. SSTD Lars Arge, Andrew Chatham
2003	A*	`conf`	I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. FOCS Lars Arge, Norbert Zeh
2003	A	`conf`	I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. ESA Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi
2003	A	`conf`	I/O-efficient Point Location Using Persistent B-Trees. ALENEX Lars Arge, Andrew Danner, Sha-Mayn Teh
2003	J	`jnl`	I/O-efficient point location using persistent B-trees. ACM J. Exp. Algorithmics Lars Arge, Andrew Danner, Sha-Mayn Teh
2003	B	`conf`	I/O-efficient topological sorting of planar DAGs. SPAA Lars Arge, Laura Toma, Norbert Zeh
2003	A	`conf`	Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk). ALENEX Lars Arge
2003	J	`jnl`	Indexing Moving Points. J. Comput. Syst. Sci. Pankaj K. Agarwal, Lars Arge, Jeff Erickson
2003	J	`jnl`	On External-Memory Planar Depth First Search. J. Graph Algorithms Appl. Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
2003	J	`jnl`	Optimal External Memory Interval Management. SIAM J. Comput. Lars Arge, Jeffrey Scott Vitter
2003	J	`jnl`	The Buffer Tree: A Technique for Designing Batched External Data Structures. Algorithmica Lars Arge
2002	A*	`conf`	Cache-oblivious priority queue and graph algorithm applications. STOC Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro
2002	J	`jnl`	Efficient Bulk Operations on Dynamic R-Trees. Algorithmica Lars Arge, Klaus H. Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter
2002	J	`jnl`	Efficient Sorting Using Registers and Caches. ACM J. Exp. Algorithmics Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter
2002	A	`conf`	Implementing I/O-efficient Data Structures Using TPIE. ESA Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter
2001	A*	`conf`	A Framework for Index Bulk Loading and Dynamization. ICALP Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter
2001	A	`conf`	External Memory Data Structures. ESA Lars Arge
2001	—	`conf`	Flow Computation on Massive Grids. ACM-GIS Laura Toma, Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Patrick N. Halpin, Dean L. Urban
2001	J	`jnl`	I/O-Efficient Algorithms for Problems on Grid-Based Terrains. ACM J. Exp. Algorithmics Lars Arge, Laura Toma, Jeffrey Scott Vitter
2001	B	`conf`	On External-Memory Planar Depth First Search. WADS Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
2001	B	`conf`	Time Responsive External Data Structures for Moving Points. WADS Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold
2000	B	`conf`	A Unified Approach for Indexed and Non-Indexed Spatial Joins. EDBT Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jan Vahrenhold, Jeffrey Scott Vitter
2000	J	`jnl`	Efficient Searching with Linear Constraints. J. Comput. Syst. Sci. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter
2000	—	`conf`	Efficient Sorting Using Registers and Caches. WAE Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Rajiv Wickremesinghe
2000	—	`conf`	I/O-Space Trade-Offs. SWAT Lars Arge, Jakob Pagter
2000	—	`conf`	I/O-efficient dynamic planar point location (extended abstract). SCG Lars Arge, Jan Vahrenhold
2000	A*	`conf`	Indexing Moving Points. PODS Pankaj K. Agarwal, Lars Arge, Jeff Erickson
2000	—	`conf`	On External-Memory MST, SSSP, and Multi-way Planar Graph Separation. SWAT Lars Arge, Gerth Stølting Brodal, Laura Toma
1999	A	`conf`	Efficient Bulk Operations on Dynamic R-trees. ALENEX Lars Arge, Klaus H. Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter
1999	A*	`conf`	I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. SODA Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter
1999	A*	`conf`	On Two-Dimensional Indexability and Optimal Range Search Indexing. PODS Lars Arge, Vasilis Samoladas, Jeffrey Scott Vitter
1998	A*	`conf`	Efficient Searching with Linear Constraints. PODS Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter
1998	A*	`conf`	I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract). SODA Pankaj K. Agarwal, Lars Arge, T. M. Murali, Kasturi R. Varadarajan, Jeffrey Scott Vitter
1998	—	`conf`	On showing lower bounds for external-memory computational geometry problems. External Memory Algorithms Lars Arge, Peter Bro Miltersen
1998	A*	`conf`	Scalable Sweeping-Based Spatial Join. VLDB Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter
1998	A*	`conf`	Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract). SODA Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter
1997	A*	`conf`	On Sorting Strings in External Memory (Extended Abstract). STOC Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter
1997	—	`conf`	Sequence sorting in secondary storage. SEQUENCES Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter
1996	—	`—`	Efficient External-Memory Data Structures and Applications. Lars Arge
1996	—	`ch.`	External-Memory Algorithms with Applications in GIS. Algorithmic Foundations of Geographic Information Systems Lars Arge
1996	A*	`conf`	Optimal Dynamic Interval Management in External Memory (extended abstract). FOCS Lars Arge, Jeffrey Scott Vitter
1995	A	`conf`	External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract). ESA Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter
1995	B	`conf`	The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract). WADS Lars Arge
1995	B	`conf`	The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation. ISAAC Lars Arge
1993	B	`conf`	A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms. WADS Lars Arge, Mikael B. Knudsen, Kirsten Larsen