The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Lars Arge: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter
    Efficient Searching with Linear Constraints. [Citation Graph (8, 28)][DBLP]
    PODS, 1998, pp:169-178 [Conf]
  2. Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter
    Scalable Sweeping-Based Spatial Join. [Citation Graph (6, 33)][DBLP]
    VLDB, 1998, pp:570-581 [Conf]
  3. Lars Arge, Jeffrey Scott Vitter
    Optimal Dynamic Interval Management in External Memory (extended abstract). [Citation Graph (5, 0)][DBLP]
    FOCS, 1996, pp:560-569 [Conf]
  4. Lars Arge
    The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract). [Citation Graph (5, 0)][DBLP]
    WADS, 1995, pp:334-345 [Conf]
  5. Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter
    External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract). [Citation Graph (3, 0)][DBLP]
    ESA, 1995, pp:295-310 [Conf]
  6. Lars Arge, Vasilis Samoladas, Jeffrey Scott Vitter
    On Two-Dimensional Indexability and Optimal Range Search Indexing. [Citation Graph (2, 21)][DBLP]
    PODS, 1999, pp:346-357 [Conf]
  7. Pankaj K. Agarwal, Lars Arge, Jeff Erickson
    Indexing Moving Points. [Citation Graph (1, 34)][DBLP]
    PODS, 2000, pp:175-186 [Conf]
  8. 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). [Citation Graph (1, 0)][DBLP]
    SODA, 1998, pp:685-694 [Conf]
  9. Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter
    On Sorting Strings in External Memory (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    STOC, 1997, pp:540-548 [Conf]
  10. Lars Arge, Mikael Knudsen, Kirsten Larsen
    A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms. [Citation Graph (1, 0)][DBLP]
    WADS, 1993, pp:83-94 [Conf]
  11. Lars Arge
    Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk). [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:- [Conf]
  12. Lars Arge, Andrew Danner, Sha-Mayn Teh
    I/O-efficient Point Location Using Persistent B-Trees. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:82-92 [Conf]
  13. Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter
    Efficient Bulk Operations on Dynamic R-trees. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:328-348 [Conf]
  14. Lars Arge
    External-Memory Algorithms with Applications in GIS. [Citation Graph (0, 0)][DBLP]
    Algorithmic Foundations of Geographic Information Systems, 1996, pp:213-254 [Conf]
  15. Lars Arge
    External Geometric Data Structures. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:1- [Conf]
  16. Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan Holland-Minkley
    Cache-oblivious data structures for orthogonal range searching. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:237-245 [Conf]
  17. Pankaj K. Agarwal, Lars Arge, Ke Yi
    I/O-efficient batched union-find and its applications to terrain analysis. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:167-176 [Conf]
  18. Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen
    Cache-oblivious planar orthogonal range searching and counting. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:160-169 [Conf]
  19. Lars Arge, Mark de Berg, Herman J. Haverkort
    Cache-oblivious r-trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:170-179 [Conf]
  20. Lars Arge, Jan Vahrenhold
    I/O-efficient dynamic planar point location (extended abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:191-200 [Conf]
  21. Lars Arge, Norbert Zeh
    Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:158-166 [Conf]
  22. Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jan Vahrenhold, Jeffrey Scott Vitter
    A Unified Approach for Indexed and Non-Indexed Spatial Joins. [Citation Graph (0, 29)][DBLP]
    EDBT, 2000, pp:413-429 [Conf]
  23. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu
    Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:4-15 [Conf]
  24. Pankaj K. Agarwal, Lars Arge, Ke Yi
    I/O-Efficient Construction of Constrained Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:355-366 [Conf]
  25. Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi
    I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:7-18 [Conf]
  26. Lars Arge
    External Memory Data Structures. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:1-29 [Conf]
  27. Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter
    Implementing I/O-efficient Data Structures Using TPIE. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:88-100 [Conf]
  28. Lars Arge, Vasilis Samoladas, Ke Yi
    Optimal External Memory Planar Point Enclosure. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:40-52 [Conf]
  29. Lars Arge, Norbert Zeh
    I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:261-270 [Conf]
  30. Lars Arge, Gerth Stølting Brodal, Loukas Georgiadis
    Improved Dynamic Planar Point Location. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:305-314 [Conf]
  31. Laura Toma, Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Patrick N. Halpin, Dean Urban
    Flow Computation on Massive Grids. [Citation Graph (0, 0)][DBLP]
    ACM-GIS, 2001, pp:82-87 [Conf]
  32. Lars Arge, Ulrich Meyer, Laura Toma
    External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:146-157 [Conf]
  33. Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter
    A Framework for Index Bulk Loading and Dynamization. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:115-127 [Conf]
  34. Sathish Govindarajan, Pankaj K. Agarwal, Lars Arge
    CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries. [Citation Graph (0, 0)][DBLP]
    ICDT, 2003, pp:143-157 [Conf]
  35. Lars Arge
    The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:82-91 [Conf]
  36. Lars Arge, Laura Toma
    External Data Structures for Shortest Path Queries on Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:328-338 [Conf]
  37. Lars Arge, David Eppstein, Michael T. Goodrich
    Skip-webs: efficient distributed data structures for multi-dimensional data sets. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:69-76 [Conf]
  38. Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi
    The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2004, pp:347-358 [Conf]
  39. Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter
    I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:11-20 [Conf]
  40. 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). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:117-126 [Conf]
  41. Pankaj K. Agarwal, Lars Arge, Ke Yi
    An optimal dynamic interval stabbing-max data structure? [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:803-812 [Conf]
  42. Lars Arge, Laura Toma, Norbert Zeh
    I/O-efficient topological sorting of planar DAGs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:85-93 [Conf]
  43. Lars Arge, Andrew Chatham
    Efficient Object-Realtional Interval Management and Beyond. [Citation Graph (0, 0)][DBLP]
    SSTD, 2003, pp:66-82 [Conf]
  44. Octavian Procopiuc, Pankaj K. Agarwal, Lars Arge, Jeffrey Scott Vitter
    Bkd-Tree: A Dznamic Scalable kd-Tree. [Citation Graph (0, 0)][DBLP]
    SSTD, 2003, pp:46-65 [Conf]
  45. Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro
    Cache-oblivious priority queue and graph algorithm applications. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:268-276 [Conf]
  46. Lars Arge, Jakob Pagter
    I/O-Space Trade-Offs. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:448-461 [Conf]
  47. Lars Arge, Gerth Stølting Brodal, Laura Toma
    On External-Memory MST, SSSP, and Multi-way Planar Graph Separation. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:433-447 [Conf]
  48. Lars Arge, Laura Toma
    Simplified External Memory Algorithms for Planar DAGs. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:493-503 [Conf]
  49. Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold
    Time Responsive External Data Structures for Moving Points. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:50-61 [Conf]
  50. Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
    On External-Memory Planar Depth First Search. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:471-482 [Conf]
  51. Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Rajiv Wickremesinghe
    Efficient Sorting Using Registers and Caches. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2000, pp:51-62 [Conf]
  52. Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter
    Efficient Bulk Operations on Dynamic R-Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:1, pp:104-128 [Journal]
  53. Lars Arge
    The Buffer Tree: A Technique for Designing Batched External Data Structures. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:37, n:1, pp:1-24 [Journal]
  54. Lars Arge, Jan Vahrenhold
    I/O-efficient dynamic planar point location. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:2, pp:147-162 [Journal]
  55. 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. [Citation Graph (0, 0)][DBLP]
    GeoInformatica, 2003, v:7, n:4, pp:283-313 [Journal]
  56. Lars Arge, Gerth Stølting Brodal, Laura Toma
    On external-memory MST, SSSP and multi-way planar graph separation. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:53, n:2, pp:186-206 [Journal]
  57. Pankaj K. Agarwal, Lars Arge, Jeff Erickson
    Indexing Moving Points. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:1, pp:207-243 [Journal]
  58. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter
    Efficient Searching with Linear Constraints. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:61, n:2, pp:194-216 [Journal]
  59. Lars Arge, Andrew Danner, Sha-Mayn Teh
    I/O-efficient point location using persistent B-trees. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2003, v:8, n:, pp:- [Journal]
  60. Lars Arge, Laura Toma, Jeffrey Scott Vitter
    I/O-Efficient Algorithms for Problems on Grid-Based Terrains. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2001, v:6, n:, pp:1- [Journal]
  61. Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter
    Efficient Sorting Using Registers and Caches. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2002, v:7, n:, pp:9- [Journal]
  62. Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
    On External-Memory Planar Depth First Search. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:2, pp:105-129 [Journal]
  63. Lars Arge, Jeffrey Scott Vitter
    Optimal External Memory Interval Management. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1488-1508 [Journal]
  64. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:6, pp:1672-1695 [Journal]
  65. Michael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, Lars Arge
    The ComBack Method - Extending Hash Compaction with Backtracking. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2007, pp:445-464 [Conf]
  66. Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter
    External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:1, pp:1-25 [Journal]
  67. Lars Arge, Giuseppe F. Italiano
    Preface. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2007, v:12, n:, pp:- [Journal]

  68. External memory planar point location with logarithmic updates. [Citation Graph (, )][DBLP]


  69. I/o-efficient efficient algorithms for computing contours on a terrain. [Citation Graph (, )][DBLP]


  70. I/O-efficient computation of water flow across a terrain. [Citation Graph (, )][DBLP]


  71. Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements. [Citation Graph (, )][DBLP]


  72. 06091 Abstracts Collection -- Data Structures. [Citation Graph (, )][DBLP]


  73. 06091 Executive Summary -- Data Structures. [Citation Graph (, )][DBLP]


  74. The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. [Citation Graph (, )][DBLP]


  75. 04301 Abstracts Collection - Cache-Oblivious and Cache-Aware Algorithms. [Citation Graph (, )][DBLP]


  76. Cache-Oblivious Red-Blue Line Segment Intersection. [Citation Graph (, )][DBLP]


  77. Orthogonal Range Reporting in Three and Higher Dimensions. [Citation Graph (, )][DBLP]


  78. TerraStream: from elevation data to watershed hierarchies. [Citation Graph (, )][DBLP]


  79. I/O-Efficient Contour Tree Simplification. [Citation Graph (, )][DBLP]


  80. Worst-case efficient range search indexing: invited tutorial. [Citation Graph (, )][DBLP]


  81. Fundamental parallel algorithms for private-cache chip multiprocessors. [Citation Graph (, )][DBLP]


  82. Recent Advances in Worst-Case Efficient Range Search Indexing. [Citation Graph (, )][DBLP]


  83. Scalable algorithms for large high-resolution terrain data. [Citation Graph (, )][DBLP]


  84. Cache-Oblivious R-Trees. [Citation Graph (, )][DBLP]


  85. Optimal External Memory Planar Point Enclosure. [Citation Graph (, )][DBLP]


  86. Foreword. [Citation Graph (, )][DBLP]


  87. Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.458secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002