The input/output complexity of sorting and related problems
Communications of the ACM
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
The human genome project and informatics
Communications of the ACM
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Deterministic distribution sort in shared and distributed memory multiprocessors
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
Optimal parallel string algorithms: sorting, merging and computing the minimum
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Communications of the ACM
Greed sort: optimal deterministic sorting on parallel disks
Journal of the ACM (JACM)
Sorting strings and constructing digital search trees in parallel
Theoretical Computer Science
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A fully-dynamic data structure for external substring search
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Strategic directions in storage I/O issues in large-scale computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast string searching in secondary storage: theoretical developments and experimental results
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient suffix trees on secondary storage
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Database Systems (TODS)
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Merging and Sorting Strings in Parallel
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
On the Parallel Dynamic Dictionary Matching Problem: New Results with Applications
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Rapid identification of repeated patterns in strings, trees and arrays
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
I/O Efficient Scientific Computation Using TPIE
I/O Efficient Scientific Computation Using TPIE
New coding techniques for improved bandwidth utilization
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Why sort-merge gives the best implementation of the natural join
ACM SIGMOD Record
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
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On effective multi-dimensional indexing for strings
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
On the sorting-complexity of suffix tree construction
Journal of the ACM (JACM)
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
On Constructing Suffix Arrays in External Memory
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
External memory data structures
Handbook of massive data sets
Handbook of massive data sets
Cache-conscious sorting of large sets of strings with dynamic tries
Journal of Experimental Algorithmics (JEA)
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
Cache-oblivious string dictionaries
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Using random sampling to build approximate tries for efficient string sorting
Journal of Experimental Algorithmics (JEA)
Making deterministic signatures quickly
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Better external memory suffix array construction
Journal of Experimental Algorithmics (JEA)
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
New Frontiers in Applied Data Mining
Making deterministic signatures quickly
ACM Transactions on Algorithms (TALG)
Engineering burstsort: Toward fast in-place string sorting
Journal of Experimental Algorithmics (JEA)
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Engineering burstsort: towards fast in-place string sorting
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
External-memory algorithms and data structures
Algorithms and theory of computation handbook
External string sorting: faster and cache-oblivious
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Optimal in-place sorting of vectors and records
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A simple optimal randomized algorithm for sorting on the PDM
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On demand string sorting over unbounded alphabets
Theoretical Computer Science
Efficient external-memory bisimulation on DAGs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
On demand string sorting over unbounded alphabets
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
External memory K-bisimulation reduction of big graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |