Fast deterministic construction of static dictionaries
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Performance engineering case study: heap construction
Journal of Experimental Algorithmics (JEA)
Lower bounds for dynamic algebraic problems
Information and Computation
Optimal time-space trade-offs for non-comparison-based sorting
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the existence and construction of non-extreme (a, b)-trees
Information Processing Letters
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
A trade-off for worst-case efficient dictionaries
Nordic Journal of Computing
A New Trade-Off for Deterministic Dictionaries
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Performance Tuning an Algorithm for Compressing Relational Tables
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Improved Shortest Paths on the Word RAM
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Efficient Minimal Perfect Hashing in Nearly Minimal Space
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Performance Engineering Case Study: Heap Construction
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
An Experimental Evaluation of Hybrid Data Structures for Searching
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Efficient Searching for Multi-dimensional Data Made Simple
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Navigation piles with applications to sorting, priority queues, and priority deques
Nordic Journal of Computing
On the algebraic complexity of set equality and inclusion
Information Processing Letters
On dynamic range reporting in one dimension
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Deterministic load balancing and dictionaries in the parallel disk model
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Making deterministic signatures quickly
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
ACM Transactions on Algorithms (TALG)
Uniform deterministic dictionaries
ACM Transactions on Algorithms (TALG)
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Distribution-based bandwidth access scheme in slotted all-optical packet-switched networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Making deterministic signatures quickly
ACM Transactions on Algorithms (TALG)
Goal-directed shortest-path queries using precomputed cluster distances
Journal of Experimental Algorithmics (JEA)
Hilbert's Thirteenth Problem and Circuit Complexity
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On the algebraic complexity of set equality and inclusion
Information Processing Letters
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Succinct dynamic dictionaries and trees
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Lower bounds for dynamic algebraic problems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Compressed dynamic tries with applications to LZ-compression in sublinear time and space
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
A compact data structure for representing a dynamic multiset
Information Processing Letters
Faster computation of the Robinson-Foulds distance between phylogenetic networks
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Checking determinism of XML Schema content models in optimal time
Information Systems
Predecessor queries in constant time?
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Random access to grammar-compressed strings
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Faster computation of the Robinson-Foulds distance between phylogenetic networks
Information Sciences: an International Journal
Research paper: The saga of minimum spanning trees
Computer Science Review
CRAM: compressed random access memory
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Practical perfect hashing in nearly optimal space
Information Systems
Improved address-calculation coding of integer arrays
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |