Simple, efficient shared memory simulations
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Min-wise independent permutations (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Optimal bounds for the predecessor problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Fast deterministic construction of static dictionaries
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Faster suffix tree construction with missing suffix links
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Faster deterministic dictionaries
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Maintaining hierarchical graph views
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Accountable certificate management using undeniable attestations
Proceedings of the 7th ACM conference on Computer and communications security
Anti-presistence: history independent data structures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Scalable high-speed prefix matching
ACM Transactions on Computer Systems (TOCS)
Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Eliminating counterevidence with applications to accountable certificate management
Journal of Computer Security
Incremental algorithms for dispatching in dynamically typed languages
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Cost-Effective Flow Table Designs for High-Speed Routers: Architecture and Performance Evaluation
IEEE Transactions on Computers
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
Work-optimal simulation of PRAM models on meshes
Nordic Journal of Computing
A trade-off for worst-case efficient dictionaries
Nordic Journal of Computing
Efficient Strongly Universal and Optimally Universal Hashing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
A New Trade-Off for Deterministic Dictionaries
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Resizable Arrays in Optimal Time and Space
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Space Efficient Hash Tables with Worst Case Constant Access Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Randomized Gossiping by Packets in Faulty Networks
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Range Searching in Categorical Data: Colored Range Searching on Grid
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Almost random graphs with simple hash functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Cuckoo hashing: further analysis
Information Processing Letters
Privacy preserving frequent itemset mining
CRPIT '14 Proceedings of the IEEE international conference on Privacy, security and data mining - Volume 14
A parallel computer as a NOC region
Networks on chip
Meldable RAM priority queues and minimum directed spanning trees
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Making data structures confluently persistent
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Journal of Algorithms
Fossilized index: the linchpin of trustworthy non-alterable electronic records
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Dictionaries using variable-length keys and data, with applications
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient hashing with lookups in two memory accesses
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Worst case constant time priority queue
Journal of Systems and Software
Perfect hashing schemes for mining traversal patterns
Fundamenta Informaticae
Faster algorithms for finding missing patterns
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Theoretical Computer Science - Computing and combinatorics
Adjacency queries in dynamic sparse graphs
Information Processing Letters
Making deterministic signatures quickly
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient dynamic dispatching with type slicing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Randomised algorithms for isomorphisms of simple types
Mathematical Structures in Computer Science
Layer-Based Representation of Polyhedrons for Point Containment Tests
IEEE Transactions on Visualization and Computer Graphics
Uniform deterministic dictionaries
ACM Transactions on Algorithms (TALG)
Compact dictionaries for variable-length keys and data with applications
ACM Transactions on Algorithms (TALG)
EST-grid: an efficient scalable peer-to-peer infrastructure for web service discovery
AIC'05 Proceedings of the 5th WSEAS International Conference on Applied Informatics and Communications
A dictionary implementation based on dynamic perfect hashing
Journal of Experimental Algorithmics (JEA)
History-Independent Cuckoo Hashing
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Proceedings of the 15th ACM conference on Computer and communications security
Making deterministic signatures quickly
ACM Transactions on Algorithms (TALG)
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Dynamic external hashing: the limit of buffering
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Configurable emulated shared memory architecture for general purpose MP-SOCs and NOC regions
NOCS '09 Proceedings of the 2009 3rd ACM/IEEE International Symposium on Networks-on-Chip
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
ACM Transactions on Algorithms (TALG)
Succinct dynamic dictionaries and trees
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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
On the cell probe complexity of dynamic membership
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
A note on the learning effect in multi-agent optimization
Expert Systems with Applications: An International Journal
Performance comparison of some shared memory organizations for 2D mesh-like NOCs
Microprocessors & Microsystems
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Developments in data structure research during the first 25 years of FSTTCS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Validating the knuth-morris-pratt failure function, fast and online
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Maintaining external memory efficient hash tables
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
De dictionariis dynamicis pauco spatio utentibus
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Fast dynamic multiple-set membership testing using combinatorial bloom filters
IEEE/ACM Transactions on Networking (TON)
Perfect Hashing Schemes for Mining Traversal Patterns
Fundamenta Informaticae
Fast local searches and updates in bounded universes
Computational Geometry: Theory and Applications
Design strategies for minimal perfect hash functions
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Range non-overlapping indexing and successive list indexing
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Theoretical Computer Science
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Faster algorithms for finding missing patterns
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Dynamic compressed strings with random access
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
Theory of Computing Systems
| Hi-index | 0.01 |
The dynamic dictionary problem is considered: provide an algorithm for storing a dynamic set, allowing the operations insert, delete, and lookup. A dynamic perfect hashing strategy is given: a randomized algorithm for the dynamic dictionary problem that takes $O(1)$ worst-case time for lookups and $O(1)$ amortized expected time for insertions and deletions; it uses space proportional to the size of the set stored. Furthermore, lower bounds for the time complexity of a class of deterministic algorithms for the dictionary problem are proved. This class encompasses realistic hashing-based schemes that use linear space. Such algorithms have amortized worst-case time complexity $\Omega(\log n)$ for a sequence of $n$ insertions and lookups; if the worst-case lookup time is restricted to $k$, then the lower bound becomes $\Omega(k\cdot n^{1/k})$.