On the public citation graph
A new universal class of hash functions and dynamic hashing in real time
0 signed · 135 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-19488-6_126openalex-snapshot
A complexity theory of efficient parallel algorithms
inferredcites →https://doi.org/10.1007/978-1-4612-4800-2openalex-snapshot
Probabilistic Analysis of Algorithms
inferredcites →https://doi.org/10.1007/bf00264615openalex-snapshot
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
inferredcites →https://doi.org/10.1016/0020-0190(88)90210-4openalex-snapshot
The generation of random permutations on the fly
inferredcites →https://doi.org/10.1016/0022-0000(79)90045-xopenalex-snapshot
Fast probabilistic algorithms for hamiltonian circuits and matchings
inferredcites →https://doi.org/10.1016/0304-3975(90)90192-kopenalex-snapshot
A complexity theory of efficient parallel algorithms
inferredcites →https://doi.org/10.1109/sfcs.1988.21968openalex-snapshot
Dynamic Perfect Hashing: Upper and Lower Bounds
inferredcites →https://doi.org/10.1109/sfcs.1989.63450openalex-snapshot
On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications
inferredcites →https://doi.org/10.1145/100216.100229openalex-snapshot
How to distribute a dictionary in a complete network
inferredcites →https://doi.org/10.1145/100216.100247openalex-snapshot
Not all keys can be hashed in constant time
inferredcites →https://doi.org/10.1145/12130.12146openalex-snapshot
Parallel hashing---an efficient implementation of shared memory
inferredcites →https://doi.org/10.1145/828.1884openalex-snapshot
Storing a Sparse Table with 0 (1) Worst Case Access Time
inferredcites →https://doi.org/10.1145/828.1892openalex-snapshot
Efficient Schemes for Parallel Communication
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1096-9128(20000410)12:4<211::aid-cpe477>3.0.co;2-ropenalex-snapshot
PRAM programming: in theory and in practice
inferred← citeshttps://doi.org/10.1006/jcss.2002.1822openalex-snapshot
Optimal Bounds for the Predecessor Problem and Related Problems
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1085openalex-snapshot
Direct Bulk-Synchronous Parallel Algorithms
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1477openalex-snapshot
Practical Considerations of Parallel Simulations and Architecture Independent Parallel Algorithm Design
inferred← citeshttps://doi.org/10.1007/11682462_34openalex-snapshot
De Dictionariis Dynamicis Pauco Spatio Utentibus
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_28openalex-snapshot
Efficient Minimal Perfect Hashing in Nearly Minimal Space
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_4openalex-snapshot
A New Trade-Off for Deterministic Dictionaries
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_5openalex-snapshot
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_31openalex-snapshot
High performance universal hashing, with applications to shared memory simulations
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_1openalex-snapshot
Direct bulk-synchronous parallel algorithms
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_77openalex-snapshot
Polynomial hash functions are reliable
inferred← citeshttps://doi.org/10.1007/3-540-56024-6_21openalex-snapshot
Efficient randomized dictionary matching algorithms
inferred← citeshttps://doi.org/10.1007/3-540-56731-3_3openalex-snapshot
Hashing strategies for simulating shared memory on distributed memory machines
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_2openalex-snapshot
Simulations between different models of parallel computers
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_49openalex-snapshot
Graphs, hypergraphs and hashing
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_72openalex-snapshot
Simple fast parallel hashing
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_90openalex-snapshot
(Probabilistic) recurrence relations revisited
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_133openalex-snapshot
Shared memory simulations with triple-logarithmic delay
inferred← citeshttps://doi.org/10.1007/978-3-030-32686-9_13openalex-snapshot
Online Algorithms on Antipowers and Antiperiods
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_11openalex-snapshot
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations
inferred← citeshttps://doi.org/10.1007/978-3-322-95233-2_7openalex-snapshot
Dynamic Hashing in Real Time
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_62openalex-snapshot
Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners
inferred← citeshttps://doi.org/10.1007/978-3-540-74871-7_2openalex-snapshot
Design Strategies for Minimal Perfect Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_11openalex-snapshot
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_30openalex-snapshot
Applications of a Splitting Trick
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_60openalex-snapshot
3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit
inferred← citeshttps://doi.org/10.1007/978-3-642-31265-6_24openalex-snapshot
Time-Space Trade-Offs for Longest Common Extensions
inferred← citeshttps://doi.org/10.1007/978-3-642-76309-0_2openalex-snapshot
Überblick über PRAM-Simulationen und ihre Realisierbarkeit
inferred← citeshttps://doi.org/10.1007/bf01940869openalex-snapshot
Introduction to special issue on randomized and derandomized algorithms
inferred← citeshttps://doi.org/10.1007/bf01940878openalex-snapshot
Efficient PRAM simulation on a distributed memory machine
inferred← citeshttps://doi.org/10.1007/bfb0002716openalex-snapshot
Static and dynamic data management in networks
inferred← citeshttps://doi.org/10.1007/bfb0030821openalex-snapshot
Efficient randomized incremental algorithm for the closest pair problem using Leafary trees
inferred← citeshttps://doi.org/10.1007/bfb0049398openalex-snapshot
Membership in constant time and minimum space
inferred← citeshttps://doi.org/10.1007/s002360050181openalex-snapshot
On the cost-effectiveness of PRAMs
inferred← citeshttps://doi.org/10.1007/s00453-022-00934-yopenalex-snapshot
Efficient Computation of Sequence Mappability
inferred← citeshttps://doi.org/10.1007/s00453-022-01057-0openalex-snapshot
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations
inferred← citeshttps://doi.org/10.1007/s00453-023-01193-1openalex-snapshot
Predecessor on the Ultra-Wide Word RAM
inferred← citeshttps://doi.org/10.1007/s00453-025-01321-zopenalex-snapshot
ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90220-popenalex-snapshot
An optimal algorithm for generating minimal perfect hash functions
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103759openalex-snapshot
On the complexity of computing the co-lexicographic width of a regular language
inferred← citeshttps://doi.org/10.1016/j.jda.2013.06.003openalex-snapshot
Time–space trade-offs for longest common extensions
inferred← citeshttps://doi.org/10.1016/j.jda.2013.06.004openalex-snapshot
Various improvements to text fingerprinting
inferred← citeshttps://doi.org/10.1016/j.jpdc.2011.10.018openalex-snapshot
Low-contention data structures
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00500-8openalex-snapshot
Cuckoo hashing: Further analysis
inferred← citeshttps://doi.org/10.1093/comjnl/39.6.547openalex-snapshot
A Family of Perfect Hashing Methods
inferred← citeshttps://doi.org/10.1109/cec.2007.4424704openalex-snapshot
A tight analysis of the (1 + 1)-EA for the single source shortest path problem
inferred← citeshttps://doi.org/10.1109/empdp.1998.647194openalex-snapshot
PRAM programming: theory vs. practice
inferred← citeshttps://doi.org/10.1109/focs.2010.80openalex-snapshot
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
inferred← citeshttps://doi.org/10.1109/focs.2011.49openalex-snapshot
Balls and Bins: Smaller Hash Families and Faster Evaluation
inferred← citeshttps://doi.org/10.1109/focs.2013.17openalex-snapshot
How to Approximate a Set without Knowing Its Size in Advance
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00097openalex-snapshot
A Hash Table Without Hash Functions, and How to Get the Most Out of Your Random Bits
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00112openalex-snapshot
Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries
inferred← citeshttps://doi.org/10.1109/iccl.1992.185466openalex-snapshot
Complexity issues in the design of functional languages with explicit parallelism
inferred← citeshttps://doi.org/10.1109/ipps.1993.262847openalex-snapshot
Why BSP computers? (bulk-synchronous parallel computers)
inferred← citeshttps://doi.org/10.1109/istcs.1995.377051openalex-snapshot
Improved optimal shared memory simulations, and the power of reconsideration
inferred← citeshttps://doi.org/10.1109/mue.2011.27openalex-snapshot
An Exact and O(1) Time Heaviest and Lightest Hitters Algorithm for Sliding-Window Data Streams
inferred← citeshttps://doi.org/10.1109/pmmp.1993.315542openalex-snapshot
On the implementation of virtual shared memory
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21968openalex-snapshot
Dynamic Perfect Hashing: Upper and Lower Bounds
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185438openalex-snapshot
Towards a theory of nearly constant time parallel algorithms
inferred← citeshttps://doi.org/10.1109/sp.2018.00062openalex-snapshot
PIR with Compressed Queries and Amortized Query Processing
inferred← citeshttps://doi.org/10.1109/spdp.1991.218303openalex-snapshot
On the cost-effectiveness of PRAMs
inferred← citeshttps://doi.org/10.1137/060658400openalex-snapshot
Uniform Hashing in Constant Time and Optimal Space
inferred← citeshttps://doi.org/10.1137/1.9781611977912.122openalex-snapshot
Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time
inferred← citeshttps://doi.org/10.1137/s0097539702403372openalex-snapshot
On Worst-Case Robin Hood Hashing
inferred← citeshttps://doi.org/10.1137/s0097539703436722openalex-snapshot
Fully Dynamic Orthogonal Range Reporting on RAM
inferred← citeshttps://doi.org/10.1137/s0097539704443240openalex-snapshot
Two-Way Chaining with Reassignment
inferred← citeshttps://doi.org/10.1137/s0097539793255722openalex-snapshot
The Tree Model for Hashing: Lower and Upper Bounds
inferred← citeshttps://doi.org/10.1137/s0097539794291580openalex-snapshot
Simple Fast Parallel Hashing by Oblivious Execution
inferred← citeshttps://doi.org/10.1137/s0097539795294165openalex-snapshot
Membership in Constant Time and Almost-Minimum Space
inferred← citeshttps://doi.org/10.1137/s0097539797322425openalex-snapshot
Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
inferred← citeshttps://doi.org/10.1145/100216.100229openalex-snapshot
How to distribute a dictionary in a complete network
inferred← citeshttps://doi.org/10.1145/100216.100247openalex-snapshot
Not all keys can be hashed in constant time
inferred← citeshttps://doi.org/10.1145/103418.103453openalex-snapshot
Converting high probability into nearly-constant time---with applications to parallel hashing
inferred← citeshttps://doi.org/10.1145/1060590.1060606openalex-snapshot
On dynamic range reporting in one dimension
inferred← citeshttps://doi.org/10.1145/129712.129743openalex-snapshot
Efficient PRAM simulation on a distributed memory machine
inferred← citeshttps://doi.org/10.1145/165231.165246openalex-snapshot
Simple, efficient shared memory simulations
inferred← citeshttps://doi.org/10.1145/174666.174667openalex-snapshot
On randomization in sequential and distributed algorithms
inferred← citeshttps://doi.org/10.1145/181014.181382openalex-snapshot
Efficient low-contention parallel algorithms
inferred← citeshttps://doi.org/10.1145/1810479.1810539openalex-snapshot
Low-contention data structures
inferred← citeshttps://doi.org/10.1145/1921659.1921666openalex-snapshot
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
inferred← citeshttps://doi.org/10.1145/2746539.2746620openalex-snapshot
From Independence to Expansion and Back Again
inferred← citeshttps://doi.org/10.1145/301250.301323openalex-snapshot
Optimal bounds for the predecessor problem
inferred← citeshttps://doi.org/10.1145/335305.335352openalex-snapshot
Faster suffix tree construction with missing suffix links
inferred← citeshttps://doi.org/10.1145/3519935.3519969openalex-snapshot
On the optimal time/space tradeoff for hash tables
inferred← citeshttps://doi.org/10.1145/3519935.3520070openalex-snapshot
An extendable data structure for incremental stable perfect hashing
inferred← citeshttps://doi.org/10.1145/3625817openalex-snapshot
Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once
inferred← citeshttps://doi.org/10.1145/3797036openalex-snapshot
Modern Minimal Perfect Hashing: A Survey
inferred← citeshttps://doi.org/10.1145/3798129.3800855openalex-snapshot
Locally Computable High Independence Hashing
inferred← citeshttps://doi.org/10.1145/780542.780633openalex-snapshot
Uniform hashing in constant time and linear space
inferred← citeshttps://doi.org/10.1162/evco_a_00047openalex-snapshot
Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
inferred← citeshttps://doi.org/10.1561/0400000070openalex-snapshot
Hashing, Load Balancing and Multiple Choice
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.12openalex-snapshot
Incremental Edge Orientation in Forests
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.79openalex-snapshot
Succinct Filters for Sets of Unknown Sizes
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2012.25openalex-snapshot
On Randomness in Hash Functions (Invited Talk)
inferred← citeshttps://doi.org/10.4230/lipics.swat.2020.11openalex-snapshot
A Dynamic Space-Efficient Filter with Constant Time Operations
inferred← citeshttps://doi.org/10.48550/arxiv.1906.09430openalex-snapshot
Algorithms for Similarity Search and Pseudorandomness
inferred← citeshttps://doi.org/10.48550/arxiv.2005.01098openalex-snapshot
A Dynamic Space-Efficient Filter with Constant Time Operations
inferred← citeshttps://doi.org/10.48550/arxiv.2005.02143openalex-snapshot
A Space-Efficient Dynamic Dictionary for Multisets with Constant Time Operations
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0205010openalex-snapshot
Approximate Data Structures with Applications
inferred← citeshttps://doi.org/10.5555/2872599.2872621openalex-snapshot
A study of manycore shared memory architecture as a way to build SOC applications
inferred← citeshttps://doi.org/10.5555/313559.313807openalex-snapshot
Dynamic generation of discrete random variates
inferred← citeshttps://doi.org/10.6138/jit.2013.14.1.12openalex-snapshot
A Heaviest Hitters Limiting Mechanism with O(1) Time Complexity for Sliding-Window Data Streams
inferred← citeshttps://doi.org/10.7146/brics.v4i17.18813openalex-snapshot
Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries
inferred← citeshttps://doi.org/10.7146/brics.v6i13.20070openalex-snapshot
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions
inferred← citeshttps://doi.org/10.7146/brics.v7i4.20132openalex-snapshot
A New Trade-off for Deterministic Dictionaries
inferred← citeshttps://doi.org/10.7146/brics.v9i27.21743openalex-snapshot
Simulating Uniform Hashing in Constant Time and Optimal Space
inferred← citeshttps://doi.org/10.82308/45910openalex-snapshot
Two-way hashing with separate chaining and linear probing
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.