Welcome to DiSC 2002
SIGMOD 2001
PODS 2001
 SIGMOD RECORD 2001
CIKM 2001
CoopIS 2001
DASFAA 2001
DASFAA 2000
DBPL 2001
Data Engineering Bul
DEXA_EC-WEB 2001
DMKD 2001
 DPDJ 2001
HYPERTEXT 2001
ICDE 2001
ICDM 2001
ICDT 2001
JCDL 2001
KDD 2001
 KDD_EXPLORATIONS 20
KRDB 2001
MDM 2001
MIR 2001
MIS 2001
RIDE 2001
SBBD 2001
 SIGIR 2001
 SIGIR FORUM 2001
SSDBM 2001
SSTD 2001
TODS 2001
TIME 2001
VLDB 2001
VLDBJ 2001
About DiSC 2002
Editorial Board
Acknowledgements
DiSC 2002 Production
ADVIS
DiSC'02 Feedback
DiSC'02 Sitemap
Search DiSC'02
<<<Author Index>>>
Copyright Notice

Lars Arge

Papers on DiSC'02


Flow Computation on Massive Grids

Publications


Note: Links lead to the DBLP on the Web.

Lars Arge

27 Lars Arge, Klaus Hinrichs , Jan Vahrenhold , Jeffrey Scott Vitter : Efficient Bulk Operations on Dynamic R-Trees. Algorithmica 33 (1): 104-128 (2002)

26 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

25 Lars Arge: External Memory Data Structures. ESA 2001 : 1-29

24 Pankaj K. Agarwal , Lars Arge, Octavian Procopiuc , Jeffrey Scott Vitter : A Framework for Index Bulk Loading and Dynamization. ICALP 2001 : 115-127

23 Lars Arge, Ulrich Meyer , Laura Toma , Norbert Zeh : On External-Memory Planar Depth First Search. WADS 2001 : 471-482

22 Pankaj K. Agarwal , Lars Arge, Jan Vahrenhold : Time Responsive External Data Structures for Moving Points. WADS 2001 : 50-61

21 Lars Arge, Jeffrey S. Chase , Jeffrey Scott Vitter , Rajiv Wickremesinghe : Efficient Sorting Using Registers and Caches. Algorithm Engineering 2000 : 51-62

20 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

19 Pankaj K. Agarwal , Lars Arge, Jeff Erickson : Indexing Moving Points. PODS 2000 : 175-186

18 Lars Arge, Gerth Stølting Brodal , Laura Toma : On External-Memory MST, SSSP, and Multi-way Planar Graph Separation. SWAT 2000 : 433-447

17 Lars Arge: I/O-Space Trade-Offs. SWAT 2000 : 448-461

16 Lars Arge, Jan Vahrenhold : I/O-efficient dynamic planar point location (extended abstract). Symposium on Computational Geometry 2000 : 191-200

15 Pankaj K. Agarwal , Lars Arge, Jeff Erickson , Paolo Giulio Franciosa , Jeffrey Scott Vitter : Efficient Searching with Linear Constraints. JCSS 61 (2): 194-216 (2000)

14 Lars Arge, Klaus Hinrichs , Jan Vahrenhold , Jeffrey Scott Vitter : Efficient Bulk Operations on Dynamic R-trees. ALENEX 1999 : 328-348

13 Lars Arge, Vasilis Samoladas , Jeffrey Scott Vitter : On Two-Dimensional Indexability and Optimal Range Search Indexing. PODS 1999 : 346-357

12 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

11 Pankaj K. Agarwal , Lars Arge, Jeff Erickson , Paolo Giulio Franciosa , Jeffrey Scott Vitter : Efficient Searching with Linear Constraints. PODS 1998 : 169-178

10 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

9 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

8 Lars Arge, Octavian Procopiuc , Sridhar Ramaswamy , Torsten Suel , Jeffrey Scott Vitter : Scalable Sweeping-Based Spatial Join. VLDB 1998 : 570-581

7 Lars Arge, Paolo Ferragina , Roberto Grossi , Jeffrey Scott Vitter : On Sorting Strings in External Memory (Extended Abstract). STOC 1997 : 540-548

6 Lars Arge: External-Memory Algorithms with Applications in GIS. Algorithmic Foundations of Geographic Information Systems 1996 : 213-254

5 Lars Arge, Jeffrey Scott Vitter : Optimal Dynamic Interval Management in External Memory (extended abstract). FOCS 1996 : 560-569

4 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

3 Lars 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

1 Lars Arge, Mikael Knudsen , Kirsten Larsen : A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms. WADS 1993 : 83-94




DiSC'02 © 2003 Association for Computing Machinery