dblp.uni-trier.dewww.uni-trier.de

Lars Arge Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
91EELars Arge: Worst-case efficient range search indexing: invited tutorial. PODS 2009: 175-176
90EELars Arge: Recent Advances in Worst-Case Efficient Range Search Indexing. SSTD 2009: 3-4
89EELars Arge, Mark de Berg, Herman J. Haverkort: Cache-Oblivious R-Trees. Algorithmica 53(1): 50-68 (2009)
88EELars Arge, Vasilis Samoladas, Ke Yi: Optimal External Memory Planar Point Enclosure. Algorithmica 54(3): 337-352 (2009)
87EELars Arge, Emo Welzl: Foreword. Algorithmica 55(2): 269-270 (2009)
86EELars Arge, Christian Cachin, Andrzej Tarlecki: Preface. Theor. Comput. Sci. 410(18): 1617 (2009)
2008
85EELars Arge, Thomas Mølhave, Norbert Zeh: Cache-Oblivious Red-Blue Line Segment Intersection. ESA 2008: 88-99
84EELars Arge, Michael T. Goodrich, Michael J. Nelson, Nodari Sitchinava: Fundamental parallel algorithms for private-cache chip multiprocessors. SPAA 2008: 197-206
83EEPankaj 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
82EELars Arge, Gerth Stølting Brodal, S. Srinivasa Rao: External memory planar point location with logarithmic updates. Symposium on Computational Geometry 2008: 139-147
81EELars 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)
2007
80 Lars Arge, Christian Cachin, Tomasz Jurdzinski, Andrzej Tarlecki: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings Springer 2007
79 Lars Arge, Michael Hoffmann, Emo Welzl: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings Springer 2007
78EEAndrew Danner, Thomas Mølhave, Ke Yi, Pankaj K. Agarwal, Lars Arge, Helena Mitásová: TerraStream: from elevation data to watershed hierarchies. GIS 2007: 28
77EEMichael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, Lars Arge: The ComBack Method - Extending Hash Compaction with Backtracking. ICATPN 2007: 445-464
76EELars Arge, Giuseppe F. Italiano: Preface. ACM Journal of Experimental Algorithmics 12: (2007)
75EELars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter: External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. Algorithmica 47(1): 1-25 (2007)
74EELars 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)
2006
73 Lars Arge, Robert Sedgewick, Dorothea Wagner: Data Structures, 26.02. - 03.03.2006 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006
72 Lars Arge, Rusins Freivalds: Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings Springer 2006
71EELars Arge, Robert Sedgewick, Dorothea Wagner: 06091 Abstracts Collection -- Data Structures. Data Structures 2006
70EELars Arge, Robert Sedgewick, Dorothea Wagner: 06091 Executive Summary -- Data Structures. Data Structures 2006
69EELars Arge, Gerth Stølting Brodal, Loukas Georgiadis: Improved Dynamic Planar Point Location. FOCS 2006: 305-314
68EELars Arge, Norbert Zeh: Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching. Symposium on Computational Geometry 2006: 158-166
67EEPankaj 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
2005
66 Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn: Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004 IBFI, Schloss Dagstuhl, Germany 2005
65EEPankaj K. Agarwal, Lars Arge, Ke Yi: I/O-Efficient Construction of Constrained Delaunay Triangulations. ESA 2005: 355-366
64EELars Arge, Laura Toma: External Data Structures for Shortest Path Queries on Planar Digraphs. ISAAC 2005: 328-338
63EELars Arge, David Eppstein, Michael T. Goodrich: Skip-webs: efficient distributed data structures for multi-dimensional data sets. PODC 2005: 69-76
62EEPankaj K. Agarwal, Lars Arge, Ke Yi: An optimal dynamic interval stabbing-max data structure? SODA 2005: 803-812
61EELars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen: Cache-oblivious planar orthogonal range searching and counting. Symposium on Computational Geometry 2005: 160-169
60EELars Arge, Mark de Berg, Herman J. Haverkort: Cache-oblivious r-trees. Symposium on Computational Geometry 2005: 170-179
59EELars Arge, David Eppstein, Michael T. Goodrich: Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets CoRR abs/cs/0507050: (2005)
2004
58 Lars Arge, Giuseppe F. Italiano, Robert Sedgewick: 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
57EELars Arge: External Geometric Data Structures. COCOON 2004: 1
56EELars 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
55EELars 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
54EEPankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu: Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. ESA 2004: 4-15
53EELars Arge, Vasilis Samoladas, Ke Yi: Optimal External Memory Planar Point Enclosure. ESA 2004: 40-52
52EELars Arge, Ulrich Meyer, Laura Toma: External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. ICALP 2004: 146-157
51EELars 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
50EELars Arge, Laura Toma: Simplified External Memory Algorithms for Planar DAGs. SWAT 2004: 493-503
49EELars Arge, Jan Vahrenhold: I/O-efficient dynamic planar point location. Comput. Geom. 29(2): 147-162 (2004)
48EELars 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)
2003
47 Lars Arge, Andrew Danner, Sha-Mayn Teh: I/O-efficient Point Location Using Persistent B-Trees. ALENEX 2003: 82-92
46 Lars Arge: Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk). ALENEX 2003
45EEPankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi: I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. ESA 2003: 7-18
44EELars Arge, Norbert Zeh: I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. FOCS 2003: 261-270
43EESathish Govindarajan, Pankaj K. Agarwal, Lars Arge: CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries. ICDT 2003: 143-157
42EELars Arge, Laura Toma, Norbert Zeh: I/O-efficient topological sorting of planar DAGs. SPAA 2003: 85-93
41EEOctavian Procopiuc, Pankaj K. Agarwal, Lars Arge, Jeffrey Scott Vitter: Bkd-Tree: A Dznamic Scalable kd-Tree. SSTD 2003: 46-65
40EELars Arge, Andrew Chatham: Efficient Object-Realtional Interval Management and Beyond. SSTD 2003: 66-82
39EEPankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan Holland-Minkley: Cache-oblivious data structures for orthogonal range searching. Symposium on Computational Geometry 2003: 237-245
38EELars Arge, Andrew Danner, Sha-Mayn Teh: I/O-efficient point location using persistent B-trees. ACM Journal of Experimental Algorithmics 8: (2003)
37EELars Arge: The Buffer Tree: A Technique for Designing Batched External Data Structures. Algorithmica 37(1): 1-24 (2003)
36 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)
35EEPankaj K. Agarwal, Lars Arge, Jeff Erickson: Indexing Moving Points. J. Comput. Syst. Sci. 66(1): 207-243 (2003)
34EELars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh: On External-Memory Planar Depth First Search. J. Graph Algorithms Appl. 7(2): 105-129 (2003)
33EELars Arge, Jeffrey Scott Vitter: Optimal External Memory Interval Management. SIAM J. Comput. 32(6): 1488-1508 (2003)
2002
32EELars Arge, Octavian Procopiuc, Jeffrey Scott Vitter: Implementing I/O-efficient Data Structures Using TPIE. ESA 2002: 88-100
31EELars 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
30EERajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter: Efficient Sorting Using Registers and Caches. ACM Journal of Experimental Algorithmics 7: 9 (2002)
29EELars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter: Efficient Bulk Operations on Dynamic R-Trees. Algorithmica 33(1): 104-128 (2002)
2001
28 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
27EELars Arge: External Memory Data Structures. ESA 2001: 1-29
26EEPankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter: A Framework for Index Bulk Loading and Dynamization. ICALP 2001: 115-127
25EELars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh: On External-Memory Planar Depth First Search. WADS 2001: 471-482
24EEPankaj K. Agarwal, Lars Arge, Jan Vahrenhold: Time Responsive External Data Structures for Moving Points. WADS 2001: 50-61
23 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)
2000
22EELars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Rajiv Wickremesinghe: Efficient Sorting Using Registers and Caches. Algorithm Engineering 2000: 51-62
21EELars 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
20EEPankaj K. Agarwal, Lars Arge, Jeff Erickson: Indexing Moving Points. PODS 2000: 175-186
19EELars Arge, Gerth Stølting Brodal, Laura Toma: On External-Memory MST, SSSP, and Multi-way Planar Graph Separation. SWAT 2000: 433-447
18EELars Arge, Jakob Pagter: I/O-Space Trade-Offs. SWAT 2000: 448-461
17EELars Arge, Jan Vahrenhold: I/O-efficient dynamic planar point location (extended abstract). Symposium on Computational Geometry 2000: 191-200
16 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)
1999
15EELars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter: Efficient Bulk Operations on Dynamic R-trees. ALENEX 1999: 328-348
14EELars Arge, Vasilis Samoladas, Jeffrey Scott Vitter: On Two-Dimensional Indexability and Optimal Range Search Indexing. PODS 1999: 346-357
13EEPankaj 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
12EEPankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter: Efficient Searching with Linear Constraints. PODS 1998: 169-178
11 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
10 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
9EELars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter: Scalable Sweeping-Based Spatial Join. VLDB 1998: 570-581
1997
8EELars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter: On Sorting Strings in External Memory (Extended Abstract). STOC 1997: 540-548
1996
7 Lars Arge: External-Memory Algorithms with Applications in GIS. Algorithmic Foundations of Geographic Information Systems 1996: 213-254
6 Lars Arge, Jeffrey Scott Vitter: Optimal Dynamic Interval Management in External Memory (extended abstract). FOCS 1996: 560-569
5 Lars Arge: Efficient External-Memory Data Structures and Applications. University of Aarhus 1996
1995
4EELars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter: External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract). ESA 1995: 295-310
3EELars Arge: The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation. ISAAC 1995: 82-91
2 Lars Arge: The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract). WADS 1995: 334-345
1993
1 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

1Pankaj K. Agarwal [11] [12] [13] [16] [20] [24] [26] [35] [39] [41] [43] [45] [54] [62] [65] [67] [78] [83]
2Michael A. Bender [31] [56] [66] [74]
3Mark de Berg [51] [55] [60] [81] [89]
4Gerth Stølting Brodal [13] [19] [48] [61] [69] [77] [82]
5Christian Cachin [80] [86]
6Jeffrey S. Chase [22] [28] [30] [36]
7Andrew Chatham [40]
8Andrew Danner [38] [39] [47] [78]
9Erik D. Demaine [31] [56] [66] [74]
10David Eppstein [59] [63]
11Jeff Erickson [12] [16] [20] [35] [54]
12Rolf Fagerberg [61]
13Paolo Ferragina [8]
14Paolo Giulio Franciosa [12] [16]
15Rusins Freivalds [72]
16Loukas Georgiadis [69]
17Michael T. Goodrich [59] [63] [84]
18Sathish Govindarajan [43]
19Roberto Grossi [8]
20Patrick N. Halpin [28] [36]
21Herman J. Haverkort [51] [55] [60] [81] [89]
22Klaus Hinrichs [15] [29]
23Michael Hoffmann [79]
24Bryan Holland-Minkley [31] [39] [74]
25Giuseppe F. Italiano [58] [76]
26Tomasz Jurdzinski [80]
27Mikael Knudsen [1]
28Lars Michael Kristensen [77]
29Kirsten Larsen [1]
30Morten Laustsen [61]
31Charles E. Leiserson [56] [66]
32Kurt Mehlhorn [56] [66]
33Ulrich Meyer [25] [34] [52]
34Helena Mitásová [78]
35Thomas Mølhave [78] [83] [85]
36J. Ian Munro [31] [74]
37T. M. Murali [11]
38Michael J. Nelson [84]
39Jakob Illeborg Pagter (Jakob Pagter) [18]
40Octavian Procopiuc [9] [10] [21] [26] [32] [41]
41Sridhar Ramaswamy [9] [10] [21]
42S. Srinivasa Rao (Srinivasa Rao Satti) [82]
43Bardia Sadri [83]
44Vasilis Samoladas [14] [53] [88]
45Robert Sedgewick [58] [70] [71] [73]
46Nodari Sitchinava [84]
47Torsten Suel [9] [10] [21]
48Andrzej Tarlecki [80] [86]
49Sha-Mayn Teh [38] [47]
50Laura Toma [19] [23] [25] [28] [34] [36] [42] [48] [50] [52] [64]
51Dean Urban [28] [36]
52Jan Vahrenhold [15] [17] [21] [24] [29] [49]
53Kasturi R. Varadarajan [11]
54Darren Erik Vengroff [4] [75]
55Jeffrey Scott Vitter [4] [6] [8] [9] [10] [11] [12] [13] [14] [15] [16] [21] [22] [23] [26] [28] [29] [30] [32] [33] [36] [41] [75]
56Dorothea Wagner [70] [71] [73]
57Emo Welzl [79] [87]
58Michael Westergaard [77]
59Rajiv Wickremesinghe [22] [28] [30] [36]
60Jun Yang [45]
61Ke Yi [45] [51] [53] [55] [62] [65] [67] [78] [81] [88]
62Hai Yu [54]
63Norbert Zeh [25] [34] [42] [44] [68] [85]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)