| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao |
External Memory Planar Point Location with Logarithmic Updates.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Molad, Robert Endre Tarjan, Ke Yi |
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips |
(Approximate) uncertain skylines. |
ICDT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Lars Arge, Ke Yi |
I/O-efficient batched union-find and its applications to terrain analysis. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Michael T. Goodrich, Nodari Sitchinava |
Parallel external memory graph algorithms. |
IPDPS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Morten Revsbæk, Norbert Zeh |
I/O-efficient computation of water flow across a terrain. |
Symposium on Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
i/o-efficient algorithms, geographical information systems, terrains |
| 1 | Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen |
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements. |
Symposium on Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
orthogonal range reporting, pointer machine, data structures, lower bounds |
| 1 | Thomas Mølhave, Pankaj K. Agarwal, Lars Arge, Morten Revsbæk |
Scalable algorithms for large high-resolution terrain data. |
COM.Geo |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Kasper Green Larsen, Thomas Mølhave, Freek van Walderveen |
Cleaning massive sonar point clouds. |
GIS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Christian Cachin, Andrzej Tarlecki |
Preface. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Vasilis Samoladas, Ke Yi |
Optimal External Memory Planar Point Enclosure. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Point enclosure, Data structures, External memory algorithms |
| 1 | Lars Arge, Mark de Berg, Herman J. Haverkort |
Cache-Oblivious R-Trees. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Cache-oblivious data structures, R-trees, Geometric data structures, I/O-efficiency |
| 1 | Lars Arge, Emo Welzl |
Foreword. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge |
Recent Advances in Worst-Case Efficient Range Search Indexing. |
SSTD |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen |
Orthogonal Range Reporting in Three and Higher Dimensions. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
data structures, computational geometry, external memory, orthogonal range searching |
| 1 | Lars Arge, Morten Revsbæk |
I/O-Efficient Contour Tree Simplification. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge |
Worst-case efficient range search indexing: invited tutorial. |
PODS |
2009 |
DBLP DOI BibTeX RDF |
indexing, range search |
| 1 | Lars 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 |
2008 |
DBLP DOI BibTeX RDF |
R-trees |
| 1 | Lars Arge, Thomas Mølhave, Norbert Zeh |
Cache-Oblivious Red-Blue Line Segment Intersection. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj 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 |
DBLP DOI BibTeX RDF |
i/o-efficient algorithms, geographical information systems, contours, terrains |
| 1 | Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao |
External memory planar point location with logarithmic updates. |
Symposium on Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
dynamic data structure, external memory, point location, planar subdivisions |
| 1 | Lars Arge, Michael T. Goodrich, Michael J. Nelson, Nodari Sitchinava |
Fundamental parallel algorithms for private-cache chip multiprocessors. |
SPAA |
2008 |
DBLP DOI BibTeX RDF |
parallel external memory, pem, private-cache cmp |
| 1 | Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter |
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Giuseppe F. Italiano |
Preface. |
ACM Journal of Experimental Algorithmics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Michael Hoffmann, Emo Welzl (eds.) |
Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings |
ESA |
2007 |
DBLP BibTeX RDF |
|
| 1 | Michael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, Lars Arge |
The ComBack Method - Extending Hash Compaction with Backtracking. |
ICATPN |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Christian Cachin, Tomasz Jurdzinski, Andrzej Tarlecki (eds.) |
Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings |
ICALP |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andrew Danner, Thomas Mølhave, Ke Yi, Pankaj K. Agarwal, Lars Arge, Helena Mitásová |
TerraStream: from elevation data to watershed hierarchies. |
GIS |
2007 |
DBLP DOI BibTeX RDF |
terrain modeling |
| 1 | Pankaj K. Agarwal, Lars Arge, Ke Yi |
I/O-efficient batched union-find and its applications to terrain analysis. |
Symposium on Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
terrain analysis, algorithms, union-find, I/O-efficient, contour trees |
| 1 | Lars Arge, Norbert Zeh |
Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching. |
Symposium on Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
data structures, memory hierarchies, range searching, cache-obliviousness |
| 1 | Lars Arge, Robert Sedgewick, Dorothea Wagner |
06091 Abstracts Collection -- Data Structures. |
Data Structures |
2006 |
DBLP BibTeX RDF |
|
| 1 | Lars Arge, Robert Sedgewick, Dorothea Wagner |
06091 Executive Summary -- Data Structures. |
Data Structures |
2006 |
DBLP BibTeX RDF |
|
| 1 | Lars Arge, Robert Sedgewick, Dorothea Wagner (eds.) |
Data Structures, 26.02. - 03.03.2006 |
Data Structures |
2006 |
DBLP BibTeX RDF |
|
| 1 | Lars Arge, Rusins Freivalds (eds.) |
Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings |
SWAT |
2006 |
DBLP BibTeX RDF |
|
| 1 | Lars Arge, Gerth Stølting Brodal, Loukas Georgiadis |
Improved Dynamic Planar Point Location. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, David Eppstein, Michael T. Goodrich |
Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Lars Arge, Ke Yi |
I/O-Efficient Construction of Constrained Delaunay Triangulations. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Lars Arge, Ke Yi |
An optimal dynamic interval stabbing-max data structure? |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Mark de Berg, Herman J. Haverkort |
Cache-oblivious r-trees. |
Symposium on Computational Geometry |
2005 |
DBLP DOI BibTeX RDF |
cache-oblivious data structures, R-trees, geometric data structures, I/O-efficiency |
| 1 | Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen |
Cache-oblivious planar orthogonal range searching and counting. |
Symposium on Computational Geometry |
2005 |
DBLP DOI BibTeX RDF |
range counting, semi-group range queries, cache-oblivious, orthogonal range searching |
| 1 | Lars Arge, Michael A. Bender, Erik D. Demaine, Charles E. Leiserson, Kurt Mehlhorn (eds.) |
Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004 |
Cache-Oblivious and Cache-Aware Algorithms |
2005 |
DBLP BibTeX RDF |
|
| 1 | Lars Arge, David Eppstein, Michael T. Goodrich |
Skip-webs: efficient distributed data structures for multi-dimensional data sets. |
PODC |
2005 |
DBLP DOI BibTeX RDF |
trapezoidal maps, peer-to-peer networks, quadtrees, octrees, distributed data structures, tries, skip lists |
| 1 | Lars Arge, Laura Toma |
External Data Structures for Shortest Path Queries on Planar Digraphs. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Gerth Stølting Brodal, Laura Toma |
On external-memory MST, SSSP and multi-way planar graph separation. |
J. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Jan Vahrenhold |
I/O-efficient dynamic planar point location. |
Comput. Geom. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Vasilis Samoladas, Ke Yi |
Optimal External Memory Planar Point Enclosure. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu |
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Ulrich Meyer, Laura Toma |
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Giuseppe F. Italiano, Robert Sedgewick (eds.) |
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 |
ALENEX/ANALC |
2004 |
DBLP BibTeX RDF |
|
| 1 | Lars 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 |
DBLP BibTeX RDF |
|
| 1 | Lars 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 |
DBLP BibTeX RDF |
|
| 1 | Lars Arge, Laura Toma |
Simplified External Memory Algorithms for Planar DAGs. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge |
External Geometric Data Structures. |
COCOON |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge |
The Buffer Tree: A Technique for Designing Batched External Data Structures. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Internal memory algorithms, Batched external data structures, Buffer tree, I/O efficiency |
| 1 | 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 |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Lars Arge, Jeff Erickson |
Indexing Moving Points. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Jeffrey Scott Vitter |
Optimal External Memory Interval Management. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh |
On External-Memory Planar Depth First Search. |
J. Graph Algorithms Appl. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Lars Arge, Andrew Danner, Sha-Mayn Teh |
I/O-efficient point location using persistent B-trees. |
ACM Journal of Experimental Algorithmics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Lars Arge, Jun Yang 0001, Ke Yi |
I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Andrew Danner, Sha-Mayn Teh |
I/O-efficient Point Location Using Persistent B-Trees. |
ALENEX |
2003 |
DBLP BibTeX RDF |
|
| 1 | Lars Arge |
Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk). |
ALENEX |
2003 |
DBLP BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan Holland-Minkley |
Cache-oblivious data structures for orthogonal range searching. |
Symposium on Computational Geometry |
2003 |
DBLP DOI BibTeX RDF |
cache-oblivious, orthogonal range searching |
| 1 | Lars Arge, Laura Toma, Norbert Zeh |
I/O-efficient topological sorting of planar DAGs. |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
I/O-efficient algorithms, planar directed graphs, graph algorithms, topological sorting, ear decomposition |
| 1 | Sathish Govindarajan, Pankaj K. Agarwal, Lars Arge |
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries. |
ICDT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Octavian Procopiuc, Pankaj K. Agarwal, Lars Arge, Jeffrey Scott Vitter |
Bkd-Tree: A Dznamic Scalable kd-Tree. |
SSTD |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Andrew Chatham |
Efficient Object-Realtional Interval Management and Beyond. |
SSTD |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Norbert Zeh |
I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter |
Efficient Bulk Operations on Dynamic R-Trees. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter |
Efficient Sorting Using Registers and Caches. |
ACM Journal of Experimental Algorithmics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter |
Implementing I/O-efficient Data Structures Using TPIE. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro |
Cache-oblivious priority queue and graph algorithm applications. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Laura Toma, Jeffrey Scott Vitter |
I/O-Efficient Algorithms for Problems on Grid-Based Terrains. |
ACM Journal of Experimental Algorithmics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge |
External Memory Data Structures. |
ESA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter |
A Framework for Index Bulk Loading and Dynamization. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold |
Time Responsive External Data Structures for Moving Points. |
WADS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh |
On External-Memory Planar Depth First Search. |
WADS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter |
Efficient Searching with Linear Constraints. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Jan Vahrenhold |
I/O-efficient dynamic planar point location (extended abstract). |
Symposium on Computational Geometry |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Gerth Stølting Brodal, Laura Toma |
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation. |
SWAT |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Jakob Pagter |
I/O-Space Trade-Offs. |
SWAT |
2000 |
DBLP BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Lars Arge, Jeff Erickson |
Indexing Moving Points. |
PODS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Rajiv Wickremesinghe |
Efficient Sorting Using Registers and Caches. |
Algorithm Engineering |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter |
I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. |
SODA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter |
Efficient Bulk Operations on Dynamic R-trees. |
ALENEX |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Vasilis Samoladas, Jeffrey Scott Vitter |
On Two-Dimensional Indexability and Optimal Range Search Indexing. |
PODS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter |
Scalable Sweeping-Based Spatial Join. |
VLDB |
1998 |
DBLP BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter |
Efficient Searching with Linear Constraints. |
PODS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter |
On Sorting Strings in External Memory (Extended Abstract). |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge |
Efficient External-Memory Data Structures and Applications. |
|
1996 |
RDF |
|
| 1 | Lars Arge |
External-Memory Algorithms with Applications in GIS. |
Algorithmic Foundations of Geographic Information Systems |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Jeffrey Scott Vitter |
Optimal Dynamic Interval Management in External Memory (extended abstract). |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
optimal dynamic interval management, space-optimal external-memory data structure, I/O-optimal external-memory data structure, stabbing query answering, dynamically maintained intervals, I/O algorithms, 2D range searching, optimal linear space, optimal I/O query bound, optimal I/O update bound, worst-case update bounds, balancing technique, worst-case balanced tree manipulation, databases, object-oriented databases, temporal databases, storage management, constraint logic programming, external memory |
| 1 | Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter |
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract). |
ESA |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge |
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract). |
WADS |
1995 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")