Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
I/O complexity: The red-blue pebble game
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
On the parallel decomposability of geometric problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
An Evaluation of Multiple-Disk I/O Systems
IEEE Transactions on Computers
Optimal disk I/O with parallel block transfer
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Large-scale sorting in parallel memories (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Parallel algorithms column 1: models of computation
ACM SIGACT News
Deterministic distribution sort in shared and distributed memory multiprocessors
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Asymptotically tight bounds for performing BMMC permutations on parallel disk systems
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Instability in parallel I/O systems
ACM SIGARCH Computer Architecture News - Special issue on input/output in parallel computer systems
Greed sort: optimal deterministic sorting on parallel disks
Journal of the ACM (JACM)
Bounds on the separation of two parallel disk models
Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference
Structured permuting in place on parallel disk systems
Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference
Simple randomized mergesort on parallel disks
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
&mgr;Database: parallelism in a memory-mapped environment (research summary)
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Efficient external memory algorithms by simulating coarse-grained parallel algorithms
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
On sorting strings in external memory (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Randomized external-memory algorithms for some geometric problems
Proceedings of the fourteenth annual symposium on Computational geometry
A framework for simple sorting algorithms on parallel disk systems (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Blocking in parallel multisearch problems (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Interactive out-of-core isosurface extraction
Proceedings of the conference on Visualization '98
Data cube approximation and histograms via wavelets
Proceedings of the seventh international conference on Information and knowledge management
A fast Fourier transform compiler
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximate computation of multidimensional aggregates of sparse data using wavelets
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
A simple and efficient parallel disk mergesort
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient dynamic point location in monotone planar subdivisions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Optimal parallel sorting in multi-level storage
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient algorithms for contour-line extraction and planar graph blocking
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Cache performance analysis of traversals and random accesses
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Just the fax—differentiating voice and fax phone lines using call billing data
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
I/O-efficient dynamic planar point location (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
Towards a theory of cache-efficient algorithms
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Fast concurrent access to parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On external memory graph traversal
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Asynchronous scheduling of redundant disk arrays
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Workfile Disk Management for Concurrent Mergesorts in a Multiprocessor Database System
Distributed and Parallel Databases
On the sorting-complexity of suffix tree construction
Journal of the ACM (JACM)
Solving Fundamental Problems on Sparse-Meshes
IEEE Transactions on Parallel and Distributed Systems
Reconciling simplicity and realism in parallel disk models
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Distribution sort with randomized cycle
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
External memory BFS on undirected graphs with bounded degree
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Columnsort lives! an efficient out-of-core sorting program
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Box-trees and R-trees with near-optimal query time
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Optimal prefetching and caching for parallel I/O sytems
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Optimal static range reporting in one dimension
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Analysing cache effects in distribution sorting
Journal of Experimental Algorithmics (JEA)
Cache-oblivious priority queue and graph algorithm applications
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Flow computation on massive grids
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Optimal time-space trade-offs for non-comparison-based sorting
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A locality-preserving cache-oblivious dynamic dictionary
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Cache oblivious search trees via binary trees of small height
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Heuristics for semi-external depth first search on directed graphs
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Towards a theory of cache-efficient algorithms
Journal of the ACM (JACM)
Reconciling simplicity and realism in parallel disk modelsy
Parallel Computing - Parallel data-intensive algorithms and applications
An Efficient Algorithm for Out-of-Core Matrix Transposition
IEEE Transactions on Computers
PC-OPT: Optimal Offline Prefetching and Caching for Parallel I/O Systems
IEEE Transactions on Computers
IEEE Transactions on Knowledge and Data Engineering
Speeding Up External Mergesort
IEEE Transactions on Knowledge and Data Engineering
High Dimensional Similarity Joins: Algorithms and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
On R-trees with low query complexity
Computational Geometry: Theory and Applications
Lower bounds for external memory dictionaries
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Register Efficient Mergesorting
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
An Efficient Indexing Scheme for Multi-dimensional Moving Objects
ICDT '03 Proceedings of the 9th International Conference on Database Theory
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
An Out-of-Core Sorting Algorithm for Clusters with Processors at Different Speed
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Generic Approach to Bulk Loading Multidimensional Index Structures
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Scalable Sweeping-Based Spatial Join
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
An Evaluation of Generic Bulk Loading Techniques
Proceedings of the 27th International Conference on Very Large Data Bases
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
On External-Memory Planar Depth First Search
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Time Responsive External Data Structures for Moving Points
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
A Framework for Index Bulk Loading and Dynamization
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Exponential Structures for Efficient Cache-Oblivious Algorithms
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Cache Oblivious Distribution Sweeping
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Funnel Heap - A Cache Oblivious Priority Queue
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Designing Practical Efficient Algorithms for Symmetric Multiprocessors
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Efficient Bulk Operations on Dynamic R-trees
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Planar Point Location for Large Data Sets: To Seek or Not to Seek
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Efficient Sorting Using Registers and Caches
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Interchanging Two Segments of an Array in a Hierarchical Memory System
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
On the Space and Access Complexity of Computation DAGs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A Functional Approach to External Graph Algorithms
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Duality between Prefetching and Queued Writing with Parallel Disks
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Implementing I/O-efficient Data Structures Using TPIE
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
External-Memory Breadth-First Search with Sublinear I/O
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
An Analytical Evaluation of Tiling for Stencil Codes with Time Loop
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Speeding up construction of PMR quadtree-based spatial indexes
The VLDB Journal — The International Journal on Very Large Data Bases
I/O-efficient topological sorting of planar DAGs
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Cache-oblivious data structures for orthogonal range searching
Proceedings of the nineteenth annual symposium on Computational geometry
External memory data structures
Handbook of massive data sets
Handbook of massive data sets
Sorting and selection on parallel disk models
Handbook of massive data sets
On the limits of cache-obliviousness
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Faster deterministic sorting through better sampling
Theoretical Computer Science
A Theoretical Framework for Memory-Adaptive Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Distributed Computing with Load-Managed Active Storage
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
The Sort/Sweep Algorithm: A New Method for R-tree Based Spatial Joins
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
An Efficient Algorithm for Large-Scale Matrix Transposition
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Algorithm engineering for parallel computation
Experimental algorithmics
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Efficient Flow Computation on Massive Grid Terrain Datasets
Geoinformatica
Asynchronous Scheduling of Redundant Disk Arrays
IEEE Transactions on Computers
Planar point location for large data sets: to seek or not to seek
Journal of Experimental Algorithmics (JEA)
Efficient sorting using registers and caches
Journal of Experimental Algorithmics (JEA)
I/O-Efficient Algorithms for Problems on Grid-Based Terrains
Journal of Experimental Algorithmics (JEA)
Adapting Radix Sort to the Memory Hierarchy
Journal of Experimental Algorithmics (JEA)
NEXSORT: Sorting XML in External Memory
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Proximity Mergesort: optimal in-place sorting in the cache-oblivious model
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A fast Fourier transform compiler
ACM SIGPLAN Notices - Best of PLDI 1979-1999
I/O-efficient point location using persistent B-trees
Journal of Experimental Algorithmics (JEA)
Cache-oblivious shortest paths in graphs using buffer heap
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
I/O-efficient dynamic planar point location
Computational Geometry: Theory and Applications
A locality-preserving cache-oblivious dynamic dictionary
Journal of Algorithms
On external-memory MST, SSSP and multi-way planar graph separation
Journal of Algorithms
PDM Sorting Algorithms That Take A Small Number of Passes
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Indexing mobile objects using dual transformations
The VLDB Journal — The International Journal on Very Large Data Bases
An Indexing Method for Answering Queries on Moving Objects
Distributed and Parallel Databases
External-memory depth-first search algorithm for solid grid graphs
Information Processing Letters
Cache-oblivious planar orthogonal range searching and counting
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
External-memory exact and approximate all-pairs shortest-paths in undirected graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for external algebraic decision trees
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An optimal dynamic interval stabbing-max data structure?
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Concurrent cache-oblivious b-trees
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
On the capacity of information networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Implicit dictionaries with O(1) modifications per update and fast search
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Cache-oblivious string dictionaries
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Cache-oblivious dynamic programming
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A computational study of external-memory BFS algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching
Proceedings of the twenty-second annual symposium on Computational geometry
I/O-efficient batched union-find and its applications to terrain analysis
Proceedings of the twenty-second annual symposium on Computational geometry
Journal of Algorithms
Proceedings of the 2006 ACM symposium on Applied computing
Scalable computation of acyclic joins
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Cache-oblivious string B-trees
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
GPUTeraSort: high performance graphics co-processor sorting for large database management
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Deterministic load balancing and dictionaries in the parallel disk model
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Type less, find more: fast autocompletion search with a succinct index
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Distribution sort with randomized cycling
Journal of the ACM (JACM)
A memory model for scientific algorithms on graphics processors
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
The memory behavior of cache oblivious stencil computations
The Journal of Supercomputing
An external-memory depth-first search algorithm for general grid graphs
Theoretical Computer Science
An efficient and scalable parallel algorithm for out-of-core isosurface extraction and rendering
Journal of Parallel and Distributed Computing
On the importance of cache tuning in a cache-aware algorithm: A case study
Computers & Mathematics with Applications
Optimal sparse matrix dense vector multiplication in the I/O-model
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Cache-oblivious streaming B-trees
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
A parallel dynamic programming algorithm on a multi-core architecture
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Voronoi diagrams in n · 2o(√lg lg n) time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Random Structures & Algorithms
I/O-efficient undirected shortest paths with unbounded edge lengths
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The partitioned exponential file for database storage management
The VLDB Journal — The International Journal on Very Large Data Bases
TerraStream: from elevation data to watershed hierarchies
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Efficient sampling of random permutations
Journal of Discrete Algorithms
Provably good multicore cache performance for divide-and-conquer algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic optimality for skip lists and B-trees
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Parallel out-of-core sorting and fast accesses to disks
International Journal of High Performance Computing and Networking
I/O-efficient algorithms for computing planar geometric spanners
Computational Geometry: Theory and Applications
Efficient gather and scatter operations on graphics processors
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
An experimental study of sorting and branch prediction
Journal of Experimental Algorithmics (JEA)
Terracost: Computing least-cost-path surfaces for massive grid terrains
Journal of Experimental Algorithmics (JEA)
Output-sensitive autocompletion search
Information Retrieval
I/o-efficient efficient algorithms for computing contours on a terrain
Proceedings of the twenty-fourth annual symposium on Computational geometry
External memory planar point location with logarithmic updates
Proceedings of the twenty-fourth annual symposium on Computational geometry
Fundamental parallel algorithms for private-cache chip multiprocessors
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Tight competitive ratios for parallel disk prefetching and caching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Combating I-O bottleneck using prefetching: model, algorithms, and ramifications
The Journal of Supercomputing
On the limits of cache-oblivious rational permutations
Theoretical Computer Science
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Massive model visualization techniques: course notes
ACM SIGGRAPH 2008 classes
Better external memory suffix array construction
Journal of Experimental Algorithmics (JEA)
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Real-Time Model Checking on Secondary Storage
Model Checking and Artificial Intelligence
On Trade-Offs in External-Memory Diameter-Approximation
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
A Bridging Model for Multi-core Computing
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Cache-Oblivious Red-Blue Line Segment Intersection
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A unified model for multicore architectures
IFMT '08 Proceedings of the 1st international forum on Next-generation multicore/manycore technologies
Cache-oblivious selection in sorted X+Y matrices
Information Processing Letters
Incremental analysis of large VLSI Layouts
Integration, the VLSI Journal
External memory layout vs. schematic
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Faster join-projects and sparse matrix multiplications
Proceedings of the 12th International Conference on Database Theory
Cache-oblivious range reporting with optimal queries requires superlinear space
Proceedings of the twenty-fifth annual symposium on Computational geometry
A general approach for cache-oblivious range reporting and approximate range counting
Proceedings of the twenty-fifth annual symposium on Computational geometry
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On Computational Models for Flash Memory Devices
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Design and Engineering of External Memory Traversal Algorithms for General Graphs
Algorithmics of Large and Complex Networks
On Cartesian Trees and Range Minimum Queries
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Communication-optimal parallel and sequential Cholesky decomposition: extended abstract
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Dynamic external hashing: the limit of buffering
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Structured duplicate detection in external-memory graph search
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Cost-optimal external planning
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Fault Tolerant External Memory Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Masking patterns in sequences: A new class of motif discovery with don't cares
Theoretical Computer Science
On Entropy-Compressed Text Indexing in External Memory
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Sorting on architecturally diverse computer systems
Proceedings of the Third International Workshop on High-Performance Reconfigurable Computing Technology and Applications
Improved visibility computation on massive grid terrains
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Reducing the memory required to find a geodesic shortest path on a large mesh
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Evaluating multicore algorithms on the unified memory model
Scientific Programming - Software Development for Multi-core Computing Systems
The complexity of flow on fat terrains and its i/o-efficient computation
Computational Geometry: Theory and Applications
I/O-Efficient Contour Tree Simplification
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
I/O and Space-Efficient Path Traversal in Planar Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Computational Geometry: Theory and Applications
External-memory depth-first search algorithm for solid grid graphs
Information Processing Letters
Introduction to the SIGACT news online algorithms column
ACM SIGACT News
Journal of Algorithms
On Developing New Models, with Paging as a Case Study
ACM SIGACT News
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Efficient bulk-loading on dynamic metric access methods
Information Systems
I/O efficient accepting cycle detection
CAV'07 Proceedings of the 19th international conference on Computer aided verification
On the limits of cache-oblivious matrix transposition
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
I/O-efficient map overlay and point location in low-density subdivisions
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
External memory range reporting on a grid
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Approximate range searching in external memory
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Fast evaluation of union-intersection expressions
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Closing the gap between theory and practice: new measures for on-line algorithm analysis
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Characterizing the performance of flash memory storage devices and its impact on algorithm design
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Efficient PDM sorting algorithms
HiPC'08 Proceedings of the 15th international conference on High performance computing
Revisiting resistance speeds up I/O-efficient LTL model checking
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
I/O-efficient point location in a set of rectangles
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
The limits of buffering: a tight lower bound for dynamic membership in the external memory model
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Performance guarantees for B-trees with different-sized atomic keys
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Journal of Discrete Algorithms
Towards optimizing energy costs of algorithms for shared memory architectures
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
I/O-efficient computation of water flow across a terrain
Proceedings of the twenty-sixth annual symposium on Computational geometry
A general approach for cache-oblivious range reporting and approximate range counting
Computational Geometry: Theory and Applications
Machine models for query processing
ACM SIGMOD Record
Cache-oblivious polygon indecomposability testing
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Cache-Oblivious Dynamic Programming for Bioinformatics
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Additive spanners and (α, β)-spanners
ACM Transactions on Algorithms (TALG)
I/O-efficient batched union-find and its applications to terrain analysis
ACM Transactions on Algorithms (TALG)
Cleaning massive sonar point clouds
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
On the cell probe complexity of dynamic membership
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Cache-oblivious dynamic dictionaries with update/query tradeoffs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Compression, indexing, and retrieval for massive string data
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
ISB-tree: A new indexing scheme with efficient expected behaviour
Journal of Discrete Algorithms
Resource oblivious sorting on multicores
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Geometric algorithms for private-cache chip multiprocessors
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Algorithms and theory of computation handbook
External-memory algorithms and data structures
Algorithms and theory of computation handbook
Evaluating non-square sparse bilinear forms on multiple vector pairs in the I/O-model
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
A bridging model for multi-core computing
Journal of Computer and System Sciences
Flash memory efficient LTL model checking
Science of Computer Programming
Cache-oblivious simulation of parallel programs
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
An efficient and scalable parallel algorithm for out-of-core isosurface extraction and rendering
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Efficient viewshed computation on terrain in external memory
Geoinformatica
TritonSort: a balanced large-scale sorting system
Proceedings of the 8th USENIX conference on Networked systems design and implementation
A new external sorting algorithm with selecting the record list location
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Cache-oblivious index for approximate string matching
Theoretical Computer Science
FIFO indexes for decomposable problems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
New results on two-dimensional orthogonal range aggregation in external memory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On finding skylines in external memory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Graph expansion and communication costs of fast matrix multiplication: regular submission
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Brief announcement: large-scale multimaps
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Balance principles for algorithm-architecture co-design
HotPar'11 Proceedings of the 3rd USENIX conference on Hot topic in parallelism
Triangle listing in massive networks and its applications
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient out-of-core sorting algorithms for the Parallel Disks Model
Journal of Parallel and Distributed Computing
Strong I/O lower bounds for binomial and FFT computation graphs
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
NEFOS: rapid cache-aware range query processing with probabilistic guarantees
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
ACM Transactions on Algorithms (TALG)
Communication-optimal Parallel and Sequential Cholesky Decomposition
SIAM Journal on Scientific Computing
Algorithmic ramifications of prefetching in memory hierarchy
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Using hashing to solve the dictionary problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
I/O-efficient data structures for colored range and prefix reporting
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
External string sorting: faster and cache-oblivious
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
I/O-Efficiently pruning dense spanners
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
The potential of on-chip multiprocessing for QCD machines
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Multi-DaC programming model: a variant of multi-BSP model for divide-and-conquer algorithms
DAMP '12 Proceedings of the 7th workshop on Declarative aspects and applications of multicore programming
Cache-oblivious planar shortest paths
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Cache-aware and cache-oblivious adaptive sorting
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
I/O-efficient construction of constrained delaunay triangulations
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Out-of-Core Computations of High-Resolution Level Sets by Means of Code Transformation
Journal of Scientific Computing
The i/o complexity of sparse matrix dense matrix multiplication
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
ISB-tree: a new indexing scheme with efficient expected behaviour
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
External data structures for shortest path queries on planar digraphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A simple optimal randomized algorithm for sorting on the PDM
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
I/O-efficient contour queries on terrains
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Ordered and unordered top-K range reporting in large data sets
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Top-K color queries for document retrieval
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved space bounds for cache-oblivious range reporting
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
How to pack directed acyclic graphs into small blocks
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Communication avoiding successive band reduction
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
I/O-Efficient algorithms on near-planar graphs
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Large-Scale directed model checking LTL
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 2
Secure computation, i/o-efficient algorithms and distributed signatures
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
External memory orthogonal range reporting with fast updates
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
scc: cluster storage provisioning informed by application characteristics and SLAs
FAST'12 Proceedings of the 10th USENIX conference on File and Storage Technologies
Space-efficient range reporting for categorical data
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Dynamic top-k range reporting in external memory
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Indexability of 2D range search revisited: constant redundancy and weak indivisibility
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Efficient processing of distance queries in large graphs: a vertex cover approach
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Efficient external-memory bisimulation on DAGs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths
ACM Transactions on Algorithms (TALG)
Fast and cache-oblivious dynamic programming with local dependencies
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
The efficiency of mapreduce in parallel external memory
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Stabbing horizontal segments with vertical rays
Proceedings of the twenty-eighth annual symposium on Computational geometry
Truss decomposition in massive networks
Proceedings of the VLDB Endowment
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Cache-conscious scheduling of streaming applications
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
A topological sorting algorithm for large graphs
Journal of Experimental Algorithmics (JEA)
Dynamic Indexability and the Optimality of B-Trees
Journal of the ACM (JACM)
Fast algorithms for maximal clique enumeration with limited memory
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
SIAM Journal on Computing
Combining the sweep-line method with the use of an external-memory priority queue
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
I/O-efficient spatial data structures for range queries
SIGSPATIAL Special
Viewsheds on terrains in external memory
SIGSPATIAL Special
Computational geometry in the parallel external memory model
SIGSPATIAL Special
Using TPIE for processing massive data sets in C++
SIGSPATIAL Special
Practical perfect hashing in nearly optimal space
Information Systems
Triangle listing in massive networks
ACM Transactions on Knowledge Discovery from Data (TKDD) - Special Issue on the Best of SIGKDD 2011
GraphChi: large-scale graph computation on just a PC
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
Managing data-movement for effective shared-memory parallelization of out-of-core sparse solvers
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Worst-Case I/O-Efficient Skyline Algorithms
ACM Transactions on Database Systems (TODS)
Themis: an I/O-efficient MapReduce
Proceedings of the Third ACM Symposium on Cloud Computing
Cache-oblivious index for approximate string matching
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
I/O-Efficient flow modeling on fat terrains
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Graph expansion and communication costs of fast matrix multiplication
Journal of the ACM (JACM)
Efficient external memory structures for range-aggregate queries
Computational Geometry: Theory and Applications
A lower bound technique for communication on BSP with application to the FFT
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Lower bounds for sorted geometric queries in the I/O model
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
I/O-efficient hierarchical diameter approximation
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Simplifying massive contour maps
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
An energy complexity model for algorithms
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Fast generation of multiple resolution instances of raster data sets
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
More efficient terrain viewshed computation on massive datasets using external memory
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Cache and I/O efficent functional algorithms
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Energy cost evaluation of parallel algorithms for multiprocessor systems
Cluster Computing
I/O efficient: computing SCCs in massive graphs
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
I/O-efficient planar range skyline and attrition priority queues
Proceedings of the 32nd symposium on Principles of database systems
Optimal splitters for temporal and multi-version databases
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
External memory K-bisimulation reduction of big graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
X-Stream: edge-centric graph processing using streaming partitions
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Memory-efficient groupby-aggregate using compressed buffer trees
Proceedings of the 4th annual Symposium on Cloud Computing
On IO-efficient viewshed algorithms and their accuracy
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
On (dynamic) range minimum queries in external memory
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Tight bounds for low dimensional star stencils in the external memory model
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Efficient parallel and external matching
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
IS-Label: an independent-set based labeling scheme for point-to-point distance querying
Proceedings of the VLDB Endowment
Deletion without rebalancing in multiway search trees
ACM Transactions on Database Systems (TODS)
Efficient range searching for categorical and plain data
ACM Transactions on Database Systems (TODS)
Efficient bulk updates on multiversion B-trees
Proceedings of the VLDB Endowment
A memory access model for highly-threaded many-core architectures
Future Generation Computer Systems
Measurement of the latency parameters of the Multi-BSP model: a multicore benchmarking approach
The Journal of Supercomputing
Hi-index | 48.24 |
We provide tight upper and lower bounds, up to a constant factor, for the number of inputs and outputs (I/OS) between internal memory and secondary storage required for five sorting-related problems: sorting, the fast Fourier transform (FFT), permutation networks, permuting, and matrix transposition. The bounds hold both in the worst case and in the average case, and in several situations the constant factors match. Secondary storage is modeled as a magnetic disk capable of transferring P blocks each containing B records in a single time unit; the records in each block must be input from or output to B contiguous locations on the disk. We give two optimal algorithms for the problems, which are variants of merge sorting and distribution sorting. In particular we show for P = 1 that the standard merge sorting algorithm is an optimal external sorting method, up to a constant factor in the number of I/Os. Our sorting algorithms use the same number of I/Os as does the permutation phase of key sorting, except when the internal memory size is extremely small, thus affirming the popular adage that key sorting is not faster. We also give a simpler and more direct derivation of Hong and Kung's lower bound for the FFT for the special case B = P = O(1).