 |
|
Online DBLP entries are available for Lars Arge and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)
-
Pankaj K. Agarwal
,
Lars Arge,
Jeff Erickson
,
Paolo Giulio Franciosa
,
Jeffrey Scott Vitter
:
Efficient Searching with Linear Constraints.
PODS 1998
: 169-178
- 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,
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
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|
