| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Lars Arge 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 Lars Arge: External Geometric Data Structures. COCOON 2004 : 1 Pankaj K. Agarwal , Lars Arge, Jeff Erickson , Hai Yu : Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. ESA 2004 : 4-15 Lars Arge, Vasilis Samoladas , Ke Yi : Optimal External Memory Planar Point Enclosure. ESA 2004 : 40-52 Lars Arge, Ulrich Meyer , Laura Toma : External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. ICALP 2004 : 146-157 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 Lars Arge, Laura Toma : Simplified External Memory Algorithms for Planar DAGs. SWAT 2004 : 493-503 Lars Arge, Andrew Danner , Sha-Mayn Teh : I/O-efficient Point Location Using Persistent B-Trees. ALENEX 2003 : 82-92 Lars Arge: Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk). ALENEX 2003 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 Lars Arge, Norbert Zeh : I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. FOCS 2003 : 261-270 Sathish Govindarajan , Pankaj K. Agarwal , Lars Arge: CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries. ICDT 2003 : 143-157 Lars Arge, Laura Toma , Norbert Zeh : I/O-efficient topological sorting of planar DAGs. SPAA 2003 : 85-93 Octavian Procopiuc , Pankaj K. Agarwal , Lars Arge, Jeffrey Scott Vitter : Bkd-Tree: A Dznamic Scalable kd-Tree. SSTD 2003 : 46-65 Lars Arge, Andrew Chatham : Efficient Object-Realtional Interval Management and Beyond. SSTD 2003 : 66-82 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 Lars Arge: The Buffer Tree: A Technique for Designing Batched External Data Structures. Algorithmica 37 (1): 1-24 (2003) 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) Pankaj K. Agarwal , Lars Arge, Jeff Erickson : Indexing Moving Points. J. Comput. Syst. Sci. 66 (1): 207-243 (2003) Lars Arge, Ulrich Meyer , Laura Toma , Norbert Zeh : On External-Memory Planar Depth First Search. J. Graph Algorithms Appl. 7 (2): 105-129 (2003) Lars Arge, Jeffrey Scott Vitter : Optimal External Memory Interval Management. SIAM J. Comput. 32 (6): 1488-1508 (2003) Lars Arge, Octavian Procopiuc , Jeffrey Scott Vitter : Implementing I/O-efficient Data Structures Using TPIE. ESA 2002 : 88-100 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 Rajiv Wickremesinghe , Lars Arge, Jeffrey S. Chase , Jeffrey Scott Vitter : Efficient Sorting Using Registers and Caches. ACM Journal of Experimental Algorithms 7 : 9 (2002) Lars Arge, Klaus Hinrichs , Jan Vahrenhold , Jeffrey Scott Vitter : Efficient Bulk Operations on Dynamic R-Trees. Algorithmica 33 (1): 104-128 (2002) 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 Lars Arge: External Memory Data Structures. ESA 2001 : 1-29 Pankaj K. Agarwal , Lars Arge, Octavian Procopiuc , Jeffrey Scott Vitter : A Framework for Index Bulk Loading and Dynamization. ICALP 2001 : 115-127 Lars Arge, Ulrich Meyer , Laura Toma , Norbert Zeh : On External-Memory Planar Depth First Search. WADS 2001 : 471-482 Pankaj K. Agarwal , Lars Arge, Jan Vahrenhold : Time Responsive External Data Structures for Moving Points. WADS 2001 : 50-61 Lars Arge, Laura Toma , Jeffrey Scott Vitter : I/O-Efficient Algorithms for Problems on Grid-Based Terrains. ACM Journal of Experimental Algorithms 6 : 1 (2001) Lars Arge, Jeffrey S. Chase , Jeffrey Scott Vitter , Rajiv Wickremesinghe : Efficient Sorting Using Registers and Caches. Algorithm Engineering 2000 : 51-62 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 Pankaj K. Agarwal , Lars Arge, Jeff Erickson : Indexing Moving Points. PODS 2000 : 175-186 Lars Arge, Gerth Stølting Brodal , Laura Toma : On External-Memory MST, SSSP, and Multi-way Planar Graph Separation. SWAT 2000 : 433-447 Lars Arge: I/O-Space Trade-Offs. SWAT 2000 : 448-461 Lars Arge, Jan Vahrenhold : I/O-efficient dynamic planar point location (extended abstract). Symposium on Computational Geometry 2000 : 191-200 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) Lars Arge, Klaus Hinrichs , Jan Vahrenhold , Jeffrey Scott Vitter : Efficient Bulk Operations on Dynamic R-trees. ALENEX 1999 : 328-348 Lars Arge, Vasilis Samoladas , Jeffrey Scott Vitter : On Two-Dimensional Indexability and Optimal Range Search Indexing. PODS 1999 : 346-357 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 Pankaj K. Agarwal , Lars Arge, Jeff Erickson , Paolo Giulio Franciosa , Jeffrey Scott Vitter : Efficient Searching with Linear Constraints. PODS 1998 : 169-178 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 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 Lars Arge, Octavian Procopiuc , Sridhar Ramaswamy , Torsten Suel , Jeffrey Scott Vitter : Scalable Sweeping-Based Spatial Join. VLDB 1998 : 570-581 Lars Arge, Paolo Ferragina , Roberto Grossi , Jeffrey Scott Vitter : On Sorting Strings in External Memory (Extended Abstract). STOC 1997 : 540-548 Lars Arge: External-Memory Algorithms with Applications in GIS. Algorithmic Foundations of Geographic Information Systems 1996 : 213-254 Lars Arge, Jeffrey Scott Vitter : Optimal Dynamic Interval Management in External Memory (extended abstract). FOCS 1996 : 560-569 Lars Arge: Efficient External-Memory Data Structures and Applications. University of Aarhus 1996 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 Lars Arge: The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation. ISAAC 1995 : 82-91 Lars Arge: The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract). WADS 1995 : 334-345 Lars Arge, Mikael Knudsen , Kirsten Larsen : A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms. WADS 1993 : 83-94 1 [ 11 ] [ 12 ] [ 13 ] [ 16 ] [ 20 ] [ 24 ] [ 26 ] [ 35 ] [ 38 ] [ 40 ] [ 42 ] [ 44 ] [ 51 ] 2 [ 31 ] 3 [ 48 ] 4 [ 13 ] [ 19 ] 5 [ 22 ] [ 28 ] [ 30 ] [ 36 ] 6 [ 39 ] 7 [ 38 ] [ 46 ] 8 [ 31 ] 9 [ 12 ] [ 16 ] [ 20 ] [ 35 ] [ 51 ] 10 [ 8 ] 11 [ 12 ] [ 16 ] 12 [ 42 ] 13 [ 8 ] 14 [ 28 ] [ 36 ] 15 [ 48 ] 16 [ 15 ] [ 29 ] 17 [ 31 ] [ 38 ] 18 [ 53 ] 19 [ 1 ] 20 [ 1 ] 21 [ 25 ] [ 34 ] [ 49 ] 22 [ 31 ] 23 [ 11 ] 24 [ 9 ] [ 10 ] [ 21 ] [ 26 ] [ 32 ] [ 40 ] 25 [ 9 ] [ 10 ] [ 21 ] 26 [ 14 ] [ 50 ] 27 [ 53 ] 28 [ 9 ] [ 10 ] [ 21 ] 29 [ 46 ] 30 [ 19 ] [ 23 ] [ 25 ] [ 28 ] [ 34 ] [ 36 ] [ 41 ] [ 47 ] [ 49 ] 31 [ 28 ] [ 36 ] 32 [ 15 ] [ 17 ] [ 21 ] [ 24 ] [ 29 ] 33 [ 11 ] 34 [ 4 ] 35 [ 4 ] [ 6 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 14 ] [ 15 ] [ 16 ] [ 21 ] [ 22 ] [ 23 ] [ 26 ] [ 28 ] [ 29 ] [ 30 ] [ 32 ] [ 33 ] [ 36 ] [ 40 ] 36 [ 22 ] [ 28 ] [ 30 ] [ 36 ] 37 [ 44 ] 38 [ 44 ] [ 48 ] [ 50 ] 39 [ 51 ] 40 [ 25 ] [ 34 ] [ 41 ] [ 43 ]  ©2005 Association for Computing Machinery |
