- I/O-algorithms Spring 2009Project 2 --I/O-efficient heap and heap-sort The goal of this project is to implement and experiment with an I/O-efficient heap and with ex-
- Time Responsive External Data Structures for Moving Points
- The Priority RTree: A Practically Efficient and WorstCase Optimal RTree
- The Buffer Tree: A New Technique for Optimal I/OAlgorithms ?
- I/OEfficient Dynamic Point Location in Monotone Planar Subdivisions
- I/O-Space Trade-O s (Extended Abstract)
- I/O-Ecient Topological Sorting of Planar DAGs Dept. of Computer Science
- I/OEfficient Dynamic Planar Point Location (Extended Abstract)
- Ecient Sorting Using Registers and Caches Rajiv Wickremesinghe, Lars Arge, Je rey S. Chase, Je rey Scott Vitter
- CacheOblivious Planar Orthogonal Range Searching and Counting
- Bkdtree: A Dynamic Scalable kdtree Octavian Procopiuc 1? , Pankaj K. Agarwal 1?? ,
- Cache-Oblivious Priority Queue and Graph Algorithm Applications
- ExternalMemory Algorithms for Processing Line Segments in Geographic Information Systems \Lambda
- I/O-Ecient Structures for Orthogonal Range-Max and Stabbing-Max Queries
- I/O-ecient Point Location using Persistent B-Trees Lars Arge, Andrew Danner, and Sha-Mayn Teh
- I/OE#cient Construction of Constrained Delaunay Triangulations
- External Memory Data Structures (Invited Paper)
- Indexing Moving Points (Extended Abstract)
- Implementing I/OEfficient Data Structures Using TPIE Lars Arge ? , Octavian Procopiuc ?? , and Jeffrey Scott Vitter ? ? ?
- CRBTree: An Efficient Indexing Scheme for RangeAggregate Queries ?
- EXTERNAL MEMORY DATA STRUCTURES
- On ExternalMemory MST, SSSP and Multiway Planar Graph Separation
- On Sorting Strings in External Memory (extended Abstract)
- External Memory Algorithms for Diameter and AllPairs ShortestPaths on Sparse Graphs
- A Framework for Index Bulk Loading and Dynamization
- I/Oe#cient Point Location using Persistent BTrees Lars Arge # Andrew Danner + ShaMayn Teh
- Optimal External Memory Planar Point Enclosure
- The I/OComplexity of Ordered BinaryDecision Diagram Manipulation
- On TwoDimensional Indexability and Optimal Range Search Indexing
- I/O-algorithms Spring 2008Project 3 --Theoretical Homework The goal of this project is to use the theoretical techniques we have discussed in the first part
- A General Lower Bound on the I/OComplexity of Comparisonbased Algorithms \Lambda
- On ExternalMemory Planar Depth First Search Lars Arge 1;? , Ulrich Meyer 2;?? , Laura Toma 1;? ? ? , and Norbert Zeh 3;y
- Ecient Object-Relational Interval Management and Beyond ?
- An Optimal Dynamic Interval StabbingMax Data Structure? # Pankaj K. Agarwal + Lars Arge # Ke Yi
- CacheOblivious Data Structures for Orthogonal Range Searching
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- OPTIMAL EXTERNAL MEMORY INTERVAL MANAGEMENT # LARS ARGE + AND JEFFREY SCOTT VITTER #
- ExternalMemory Algorithms with Applications in Geographic Information Systems \Lambda
- Efficient Bulk Operations on Dynamic Rtrees (Extended Abstract)
- Optimal Dynamic Interval Management in External Memory (extended abstract)
- Simplified External Memory Algorithms for Planar DAGs
- ExternalMemory Algorithms for Processing Line Segments
- External-Memory Computational Geometry Preliminary Version
- External-Memory Graph Algorithms Yi-Jen Chiangy
- Cache-Oblivious Data Structures for Orthogonal Range Searching
- I/O-algorithms Spring 2005Project 1 --I/O-efficient merge-sort The goal of this project is to implement and experiment with I/O-efficient merge-sort using several
- Cache-Oblivious R-Trees BRICS, Department of
- I/O-algorithms Spring 2011Project 3 --Theoretical Homework The goal of this project is to use the theoretical techniques we have discussed in the first part of
- Exponential Structures for Efficient Cache-Oblivious Michael A. Bender1
- I/O-algorithms Spring 2005Project 2 --Theoretical Homework The goal of this project is to use the theoretical techniques we have discussed in the first part of
- I/O-algorithms Spring 2006Project 2 --I/O-efficient heap and heap-sort The goal of this project is to implement and experiment with an I/O-efficient heap and with ex-
- Theoretical Computer Science
- Cache Oblivious Distribution Sweeping Gerth Stlting Brodal1, ,
- I/O-algorithms Spring 2008Project 1 --I/O-efficient merge-sort The goal of this project is to implement and experiment with I/O-efficient merge-sort using several
- I/O-algorithms Spring 2009Project 3 --Theoretical Homework The goal of this project is to use the theoretical techniques we have discussed in the first part of
- The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree
- I/O-Algorithms Aarhus University
- I/O-algorithms Spring 2006Project 1 --I/O-efficient merge-sort The goal of this project is to implement and experiment with I/O-efficient merge-sort using several
- I/O-efficient Point Location using Persistent B-Trees Lars Arge, Andrew Danner, and Sha-Mayn Teh
- Parallel Private-Cache Algorithms Parallel Private-Cache Algorithms
- I/O-algorithms Spring 2005Project 3 --I/O-efficient heap and heap-sort The goal of this project is to implement and experiment with an I/O-efficient heap and with external
- External Memory Geometric Data Structures Department of Computer Science
- A Unified Approach For Indexed and Non-Indexed Spatial Joins
- Journal of Graph Algorithms and Applications http://jgaa.info/
- http://www.elsevier.com/locate/jcss Journal of Computer and System Sciences 66 (2003) 207243
- DOI: 10.1007/s00453-001-0107-6 Algorithmica (2002) 33: 104128
- Journal of Computer and System Sciences 61, 194 216 (2000) Efficient Searching with Linear Constraints1
- Efficient External-Memory Data Structures and Applications
- I/O-efficient Point Location using Persistent B-Trees Andrew Danner
- The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation
- External-Memory Algorithms for Processing Line Segments
- Optimal Dynamic Interval Management in External Memory (extended abstract)
- The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation
- Journal of Algorithms 53 (2004) 186206 www.elsevier.com/locate/jalgor
- I/O-algorithms Spring 2011Project 2 --I/O-efficient heap and heap-sort The goal of this project is to implement and experiment with an I/O-efficient heap and with
- I/O-algorithms Spring 2007Project 2 --I/O-efficient heap and heap-sort The goal of this project is to implement and experiment with an I/O-efficient heap and with
- Implementing I/O-Efficient Data Structures Using TPIE Lars Arge , Octavian Procopiuc , and Jeffrey Scott Vitter
- I/O-algorithms Spring 2007Project 1 --I/O-efficient merge-sort The goal of this project is to implement and experiment with I/O-efficient merge-sort using several
- I/O-algorithms Spring 2011Project 1 --I/O-efficient merge-sort The goal of this project is to implement and experiment with I/O-efficient merge-sort using several
- On External Memory GraphTraversal Adam L. Buchsbaum* Michael Goldwasser t Suresh Venkatasubramanian*
- I/O-Complexity of Graph Algorithms Kameshwar ikfunagala* Abhiram Ranadet
- I/O-algorithms Spring 2009Project 1 --I/O-efficient merge-sort The goal of this project is to implement and experiment with I/O-efficient merge-sort using several
- I/O-algorithms Spring 2008Project 2 --I/O-efficient heap and heap-sort The goal of this project is to implement and experiment with an I/O-efficient heap and with
- Flash memory: Models and Algorithms
- DOI: 10.1007/s00453-003-1021-x Algorithmica (2003) 37: 124
- I/O-algorithms Spring 2006Project 3 --Theoretical Homework The goal of this project is to use the theoretical techniques we have discussed in the first part of
- Cache-Oblivious Algorithms EXTENDED ABSTRACT
- Cache-Oblivious Data Structures Duke University
- external-memory data structures for searching geometric objects
- Lower Bound on External Permuting Theorem 1 Rearranging N elements according to a given permutation requires (min {N, n logm n})
- OPTIMAL EXTERNAL MEMORY INTERVAL MANAGEMENT LARS ARGE AND JEFFREY SCOTT VITTER
- Bkd-tree: A Dynamic Scalable kd-tree Octavian Procopiuc
- Scalable Sweeping-Based Spatial Join Octavian Procopiuc
- On Sorting Strings in External Memory (extended Abstract)
- An Optimal Cache-Oblivious Priority Queue and its Application to Graph Algorithms
- I/O-algorithms Spring 2012Project 1 --I/O-efficient merge-sort The goal of this project is to implement and experiment with I/O-efficient merge-sort using several
- External Memory Geometric Data Structures Department of Computer Science
- Lower Bound on External Permuting Theorem 1 Rearranging N elements according to a given permutation requires (min {N, n logm n})
- I/O-algorithms Spring 2012Project 2 --I/O-efficient heap and heap-sort The goal of this project is to implement and experiment with an I/O-efficient heap and with