Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Lars Arge
2010 – today
- 2013
[j26]Pankaj K. Agarwal, Lars Arge, Sathish Govindarajan, Jun Yang, Ke Yi: Efficient external memory structures for range-aggregate queries. Comput. Geom. 46(3): 358-370 (2013)- [j25]Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips: (Approximate) Uncertain Skylines. Theory Comput. Syst. 52(3): 342-366 (2013)
- [c77]Lars Arge, Gerth Stølting Brodal, Jakob Truelsen, Constantinos Tsirogiannis: An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters. ESA 2013: 61-72
- [c76]Freek van Walderveen, Norbert Zeh, Lars Arge: Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs. SODA 2013: 901-918
- [c75]Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava: On (Dynamic) Range Minimum Queries in External Memory. WADS 2013: 37-48
- 2012
- [j24]Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao: External Memory Planar Point Location with Logarithmic Updates. Algorithmica 63(1-2): 457-475 (2012)
- [j23]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): 104-127 (2012)
- [j22]Lars Arge, Kasper Green Larsen: I/O-efficient spatial data structures for range queries. SIGSPATIAL Special 4(2): 2-7 (2012)
- [c74]Peyman Afshani, Lars Arge, Kasper Green Larsen: Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model. Symposium on Computational Geometry 2012: 323-332
- [c73]Lars Arge, Lasse Deleuran, Thomas Mølhave, Morten Revsbæk, Jakob Truelsen: Simplifying Massive Contour Maps. ESA 2012: 96-107
- [c72]Lars Arge, Herman J. Haverkort, Constantinos Tsirogiannis: Fast generation of multiple resolution instances of raster data sets. SIGSPATIAL/GIS 2012: 52-60
- 2011
- [c71]Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips: (Approximate) uncertain skylines. ICDT 2011: 186-196
- 2010
- [j21]Pankaj K. Agarwal, Lars Arge, Ke Yi: I/O-efficient batched union-find and its applications to terrain analysis. ACM Transactions on Algorithms 7(1): 11 (2010)
- [c70]Thomas Mølhave, Pankaj K. Agarwal, Lars Arge, Morten Revsbæk: Scalable algorithms for large high-resolution terrain data. COM.Geo 2010
- [c69]Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen: Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements. Symposium on Computational Geometry 2010: 240-246
- [c68]Lars Arge, Morten Revsbæk, Norbert Zeh: I/O-efficient computation of water flow across a terrain. Symposium on Computational Geometry 2010: 403-412
- [c67]Lars Arge, Kasper Green Larsen, Thomas Mølhave, Freek van Walderveen: Cleaning massive sonar point clouds. GIS 2010: 152-161
- [c66]Lars Arge, Michael T. Goodrich, Nodari Sitchinava: Parallel external memory graph algorithms. IPDPS 2010: 1-11
2000 – 2009
- 2009
- [j20]Lars Arge, Mark de Berg, Herman J. Haverkort: Cache-Oblivious R-Trees. Algorithmica 53(1): 50-68 (2009)
- [j19]Lars Arge, Vasilis Samoladas, Ke Yi: Optimal External Memory Planar Point Enclosure. Algorithmica 54(3): 337-352 (2009)
- [j18]
- [j17]
- [c65]Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen: Orthogonal Range Reporting in Three and Higher Dimensions. FOCS 2009: 149-158
- [c64]
- [c63]
- [c62]
- 2008
- [j16]Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi: The priority R-tree: A practically efficient and worst-case optimal R-tree. ACM Transactions on Algorithms 4(1) (2008)
- [c61]Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, Bardia Sadri: I/o-efficient efficient algorithms for computing contours on a terrain. Symposium on Computational Geometry 2008: 129-138
- [c60]Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao: External memory planar point location with logarithmic updates. Symposium on Computational Geometry 2008: 139-147
- [c59]Lars Arge, Thomas Mølhave, Norbert Zeh: Cache-Oblivious Red-Blue Line Segment Intersection. ESA 2008: 88-99
- [c58]Lars Arge, Michael T. Goodrich, Michael J. Nelson, Nodari Sitchinava: Fundamental parallel algorithms for private-cache chip multiprocessors. SPAA 2008: 197-206
- 2007
- [j15]Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter: External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. Algorithmica 47(1): 1-25 (2007)
- [j14]
- [j13]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): 1672-1695 (2007)
- [c57]Michael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, Lars Arge: The ComBack Method - Extending Hash Compaction with Backtracking. ICATPN 2007: 445-464
- [c56]Andrew Danner, Thomas Mølhave, Ke Yi, Pankaj K. Agarwal, Lars Arge, Helena Mitásová: TerraStream: from elevation data to watershed hierarchies. GIS 2007: 28
- [e6]Lars Arge, Michael Hoffmann, Emo Welzl (Eds.): Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings. Lecture Notes in Computer Science 4698, Springer 2007, ISBN 978-3-540-75519-7
- [e5]Lars Arge, Christian Cachin, Tomasz Jurdzinski, Andrzej Tarlecki (Eds.): Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings. Lecture Notes in Computer Science 4596, Springer 2007, ISBN 978-3-540-73419-2
- 2006
- [c55]Lars Arge, Norbert Zeh: Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching. Symposium on Computational Geometry 2006: 158-166
- [c54]Pankaj K. Agarwal, Lars Arge, Ke Yi: I/O-efficient batched union-find and its applications to terrain analysis. Symposium on Computational Geometry 2006: 167-176
- [c53]Lars Arge, Robert Sedgewick, Dorothea Wagner: 06091 Executive Summary -- Data Structures. Data Structures 2006
- [c52]Lars Arge, Robert Sedgewick, Dorothea Wagner: 06091 Abstracts Collection -- Data Structures. Data Structures 2006
- [c51]Lars Arge, Gerth Stølting Brodal, Loukas Georgiadis: Improved Dynamic Planar Point Location. FOCS 2006: 305-314
- [e4]Lars Arge, Robert Sedgewick, Dorothea Wagner (Eds.): Data Structures, 26.02. - 03.03.2006. Dagstuhl Seminar Proceedings 06091, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006
- [e3]Lars Arge, Rusins Freivalds (Eds.): Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings. Lecture Notes in Computer Science 4059, Springer 2006, ISBN 3-540-35753-X
- 2005
- [c50]Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen: Cache-oblivious planar orthogonal range searching and counting. Symposium on Computational Geometry 2005: 160-169
- [c49]Lars Arge, Mark de Berg, Herman J. Haverkort: Cache-oblivious r-trees. Symposium on Computational Geometry 2005: 170-179
- [c48]Pankaj K. Agarwal, Lars Arge, Ke Yi: I/O-Efficient Construction of Constrained Delaunay Triangulations. ESA 2005: 355-366
- [c47]Lars Arge, Laura Toma: External Data Structures for Shortest Path Queries on Planar Digraphs. ISAAC 2005: 328-338
- [c46]Lars Arge, David Eppstein, Michael T. Goodrich: Skip-webs: efficient distributed data structures for multi-dimensional data sets. PODC 2005: 69-76
- [c45]Pankaj K. Agarwal, Lars Arge, Ke Yi: An optimal dynamic interval stabbing-max data structure? SODA 2005: 803-812
- [e2]Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn (Eds.): Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004. Dagstuhl Seminar Proceedings 04301, IBFI, Schloss Dagstuhl, Germany 2005
- [i1]Lars Arge, David Eppstein, Michael T. Goodrich: Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets. CoRR abs/cs/0507050 (2005)
- 2004
- [j12]Lars Arge, Jan Vahrenhold: I/O-efficient dynamic planar point location. Comput. Geom. 29(2): 147-162 (2004)
- [j11]Lars Arge, Gerth Stølting Brodal, Laura Toma: On external-memory MST, SSSP and multi-way planar graph separation. J. Algorithms 53(2): 186-206 (2004)
- [c44]
- [c43]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
- [c42]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
- [c41]Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu: Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. ESA 2004: 4-15
- [c40]Lars Arge, Vasilis Samoladas, Ke Yi: Optimal External Memory Planar Point Enclosure. ESA 2004: 40-52
- [c39]Lars Arge, Ulrich Meyer, Laura Toma: External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. ICALP 2004: 146-157
- [c38]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: 347-358
- [c37]
- [e1]Lars Arge, Giuseppe F. Italiano, Robert Sedgewick (Eds.): 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. SIAM 2004, ISBN 0-89871-564-4
- 2003
- [j10]Lars Arge: The Buffer Tree: A Technique for Designing Batched External Data Structures. Algorithmica 37(1): 1-24 (2003)
- [j9]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): 283-313 (2003)
- [j8]Pankaj K. Agarwal, Lars Arge, Jeff Erickson: Indexing Moving Points. J. Comput. Syst. Sci. 66(1): 207-243 (2003)
- [j7]Lars Arge, Andrew Danner, Sha-Mayn Teh: I/O-efficient point location using persistent B-trees. ACM Journal of Experimental Algorithmics 8 (2003)
- [j6]Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh: On External-Memory Planar Depth First Search. J. Graph Algorithms Appl. 7(2): 105-129 (2003)
- [j5]Lars Arge, Jeffrey Scott Vitter: Optimal External Memory Interval Management. SIAM J. Comput. 32(6): 1488-1508 (2003)
- [c36]Lars Arge: Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk). ALENEX 2003
- [c35]Lars Arge, Andrew Danner, Sha-Mayn Teh: I/O-efficient Point Location Using Persistent B-Trees. ALENEX 2003: 82-92
- [c34]Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan Holland-Minkley: Cache-oblivious data structures for orthogonal range searching. Symposium on Computational Geometry 2003: 237-245
- [c33]Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi: I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. ESA 2003: 7-18
- [c32]Lars Arge, Norbert Zeh: I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. FOCS 2003: 261-270
- [c31]Sathish Govindarajan, Pankaj K. Agarwal, Lars Arge: CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries. ICDT 2003: 143-157
- [c30]Lars Arge, Laura Toma, Norbert Zeh: I/O-efficient topological sorting of planar DAGs. SPAA 2003: 85-93
- [c29]Octavian Procopiuc, Pankaj K. Agarwal, Lars Arge, Jeffrey Scott Vitter: Bkd-Tree: A Dznamic Scalable kd-Tree. SSTD 2003: 46-65
- [c28]Lars Arge, Andrew Chatham: Efficient Object-Realtional Interval Management and Beyond. SSTD 2003: 66-82
- 2002
- [j4]Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter: Efficient Bulk Operations on Dynamic R-Trees. Algorithmica 33(1): 104-128 (2002)
- [j3]Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter: Efficient Sorting Using Registers and Caches. ACM Journal of Experimental Algorithmics 7: 9 (2002)
- [c27]Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter: Implementing I/O-efficient Data Structures Using TPIE. ESA 2002: 88-100
- [c26]Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro: Cache-oblivious priority queue and graph algorithm applications. STOC 2002: 268-276
- 2001
- [j2]Lars Arge, Laura Toma, Jeffrey Scott Vitter: I/O-Efficient Algorithms for Problems on Grid-Based Terrains. ACM Journal of Experimental Algorithmics 6: 1 (2001)
- [c25]
- [c24]Laura Toma, Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Patrick N. Halpin, Dean Urban: Flow Computation on Massive Grids. ACM-GIS 2001: 82-87
- [c23]Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter: A Framework for Index Bulk Loading and Dynamization. ICALP 2001: 115-127
- [c22]Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold: Time Responsive External Data Structures for Moving Points. WADS 2001: 50-61
- [c21]Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh: On External-Memory Planar Depth First Search. WADS 2001: 471-482
- 2000
- [j1]Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter: Efficient Searching with Linear Constraints. J. Comput. Syst. Sci. 61(2): 194-216 (2000)
- [c20]Lars Arge, Jan Vahrenhold: I/O-efficient dynamic planar point location (extended abstract). Symposium on Computational Geometry 2000: 191-200
- [c19]Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jan Vahrenhold, Jeffrey Scott Vitter: A Unified Approach for Indexed and Non-Indexed Spatial Joins. EDBT 2000: 413-429
- [c18]
- [c17]Lars Arge, Gerth Stølting Brodal, Laura Toma: On External-Memory MST, SSSP, and Multi-way Planar Graph Separation. SWAT 2000: 433-447
- [c16]
- [c15]Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Rajiv Wickremesinghe: Efficient Sorting Using Registers and Caches. Algorithm Engineering 2000: 51-62
1990 – 1999
- 1999
- [c14]Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter: Efficient Bulk Operations on Dynamic R-trees. ALENEX 1999: 328-348
- [c13]Lars Arge, Vasilis Samoladas, Jeffrey Scott Vitter: On Two-Dimensional Indexability and Optimal Range Search Indexing. PODS 1999: 346-357
- [c12]Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter: I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. SODA 1999: 11-20
- 1998
- [c11]Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter: Efficient Searching with Linear Constraints. PODS 1998: 169-178
- [c10]Pankaj K. Agarwal, Lars Arge, T. M. Murali, Kasturi R. Varadarajan, Jeffrey Scott Vitter: I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract). SODA 1998: 117-126
- [c9]Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter: Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract). SODA 1998: 685-694
- [c8]Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter: Scalable Sweeping-Based Spatial Join. VLDB 1998: 570-581
- 1997
- [c7]Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter: On Sorting Strings in External Memory (Extended Abstract). STOC 1997: 540-548
- 1996
- [b1]Lars Arge: Efficient External-Memory Data Structures and Applications. BRICS Dissertation Series, University of Aarhus 1996
- [c6]Lars Arge: External-Memory Algorithms with Applications in GIS. Algorithmic Foundations of Geographic Information Systems 1996: 213-254
- [c5]Lars Arge, Jeffrey Scott Vitter: Optimal Dynamic Interval Management in External Memory (extended abstract). FOCS 1996: 560-569
- 1995
- [c4]Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter: External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract). ESA 1995: 295-310
- [c3]Lars Arge: The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation. ISAAC 1995: 82-91
- [c2]Lars Arge: The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract). WADS 1995: 334-345
- 1993
- [c1]Lars Arge, Mikael Knudsen, Kirsten Larsen: A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms. WADS 1993: 83-94
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:22 CEST by the dblp team