A Family of Perfect Hashing Methods

No abstract is available for this paper.

• Publication year

  1996

• Venue

  Computer/law journal

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1093/comjnl/39.6.547
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Hash functions

  2005cited by this paper
• Sudden Emergence of a Giantk-Core in a Random Graph

  1996cited by this paper
• On randomization in sequential and distributed algorithms

  1994cited by this paper
• Graphs, Hypergraphs and Hashing

  1993cited by this paper
• On Lambert's W Function

  1993cited by this paper
• Graph-theoretic obstacles to perfect hashing

  1993cited by this paper
• A faster algorithm for constructing minimal perfect hash functions

  1992cited by this paper
• Practical minimal perfect hash functions for large databases

  1992cited by this paper
• The analysis of closed hashing under limited randomness

  1990cited by this paper
• A New Universal Class of Hash Functions and Dynamic Hashing in Real Time

  1990cited by this paper
• Fast hashing of variable-length text strings

  1990cited by this paper
• Order preserving minimal perfect hash functions and information retrieval

  1989cited by this paper
• On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications

  1989influential reference
• Hashing for dynamic and static internal tables

  1988cited by this paper
• Programming pearls: a sample of brilliance

  1987cited by this paper
• A versatile data structure for edge-oriented graph algorithms

  1987cited by this paper
• Types of Cycles in Hypergraphs

  1985cited by this paper
• Graphical evolution: an introduction to the theory of random graphs

  1985cited by this paper
• A polynomial time generator for minimal perfect hash functions

  1985cited by this paper
• On the evolution of random graphs

  1984cited by this paper
• The evolution of random graphs

  1984cited by this paper
• Handbook Of Algorithms And Data Structures

  1984cited by this paper
• Storing a sparse table with O(1) worst case access time

  1982cited by this paper
• New classes and applications of hash functions

  1979cited by this paper
• Universal Classes of Hash Functions

  1979cited by this paper
• The Design and Analysis of Computer Algorithms

  1974cited by this paper
• An Introduction to Probability Theory and Its Applications

  1959cited by this paper
• An Introduction to Probability Theory and its Applications

  1958cited by this paper
• Optimal algorithms for minimal perfect hashing

  year unknowncited by this paper

• A Graph-Based Theoretical Framework and Performance Analysis of Pattern Division Random Access

  2026cites this paper
• Pattern-Hiding Encrypted Multi-Maps With Support for Join Queries

  2025cites this paper
• Clubcards for the WebPKI: Smaller Certificate Revocation Tests in Theory and Practice

  2025cites this paper
• PtrHash: Minimal Perfect Hashing at RAM Throughput

  2025cites this paper
• Modern Minimal Perfect Hashing: A Survey

  2025influential citation
• ε-Cost Sharding: Scaling Hypergraph-Based Static Functions and Filters to Trillions of Keys

  2025influential citation
• Parrot Hashing: Fast and Low-Memory Table Lookups for Network Applications With One CRC-8

  2025cites this paper
• Is Perfect Hashing Practical for OLAP Systems?

  2024cites this paper
• Scalable, Fast, and Low-Memory Table Lookups for Network Applications With One CRC-8

  2024cites this paper
• Defending hash tables from algorithmic complexity attacks with resource burning

  2024cites this paper
• VisionEmbedder: Bit-Level-Compact Key-Value Storage with Constant Lookup, Rapid Updates, and Rare Failure

  2024cites this paper
• The Emergence of Hypergraphs in Complex System Analysis

  2023cites this paper
• Count-min sketch with variable number of hash functions: an experimental study

  2023influential citation
• ChainedFilter: Combining Membership Filters by Chain Rule

  2023cites this paper
• Learned Monotone Minimal Perfect Hashing

  2023cites this paper
• Defending Hash Tables from Subterfuge with Depth Charge

  2023cites this paper
• Phase Transition in Count Approximation by Count-Min Sketch with Conservative Updates

  2022cites this paper
• Locality-preserving minimal perfect hashing of k-mers

  2022cites this paper
• Practical Volume-Hiding Encrypted Multi-Maps with Optimal Overhead and Beyond

  2022cites this paper
• An extendable data structure for incremental stable perfect hashing

  2022cites this paper
• Analysis of Count-Min sketch under conservative update

  2022cites this paper
• Can Learned Models Replace Hash Functions?

  2022influential citation
• Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm

  2021cites this paper
• Parallel and External-Memory Construction of Minimal Perfect Hash Functions With PTHash

  2021cites this paper
• A four-dimensional Analysis of Partitioned Approximate Filters

  2021influential citation
• Data Structures for Ordered Short Character-Sequences

  2021cites this paper
• PTHash: Revisiting FCH Minimal Perfect Hashing

  2021cites this paper
• Approximate Membership Query Filters with a False Positive Free Set

  2021cites this paper
• Concury: a fast and light-weight software cloud load balancer

  2020cites this paper
• Rescore in a Flash: Compact, Cache Efficient Hashing Data Structures for n-Gram Language Models

  2020cites this paper
• Peeling Close to the Orientability Threshold Spatial Coupling in Hashing-Based Data Structures

  2020cites this paper
• The Case for a Learned Sorting Algorithm

  2020cites this paper
• Fast scalable construction of ([compressed] static | minimal perfect hash) functions

  2020cites this paper
• FCTrees: A Front-Coded Family of Compressed Tree-Based FIB Structures for NDN Routers

  2020cites this paper
• Ludo Hashing

  2020cites this paper
• Re-designing Compact-structure based Forwarding for Programmable Networks

  2019cites this paper
• Concury: A Fast and Light-weighted Software Load Balancer

  2019cites this paper
• RecSplit: Minimal Perfect Hashing via Recursive Splitting

  2019cites this paper
• Dense Peelable Random Uniform Hypergraphs

  2019cites this paper
• SeqOthello: Query over RNA-seq experiments at scale

  2018cites this paper
• Compressed Static Functions and Minimal Perfect Hash Functions

  2018cites this paper
• SeqOthello: querying RNA-seq experiments at scale

  2018cites this paper
• Engineering Compressed Static Functions

  2018cites this paper
• FCTree: A Space Efficient FIB Data Structure for NDN Routers

  2018cites this paper
• Efficient similarity computations on parallel machines using data shaping

  2017cites this paper
• SDLB: A Scalable and Dynamic Software Load Balancer for Fog and Mobile Edge Computing

  2017cites this paper
• Lossy Compression of Pattern Databases Using Acyclic Random Hypergraphs

  2017cites this paper
• A Fast, Small, and Dynamic Forwarding Information Base

  2017cites this paper
• A concise forwarding information base for scalable and fast name lookups

  2017influential citation
• Backup to the Future: How Workload and Hardware Changes Continually Redefine Data Domain File Systems

  2017cites this paper
• The Logic of Physical Garbage Collection in Deduplicating Storage

  2017influential citation
• EFFICIENT DESIGN OF STORAGE AND RETRIEVAL METHODS

  2016cites this paper
• Efficient Representation of Pattern Databases Using Acyclic Random Hypergraphs

  2016cites this paper
• Memory-Efficient and Ultra-Fast Network Lookup and Forwarding Using Othello Hashing

  2016influential citation
• Monotone Minimal Perfect Hash Functions

  2016cites this paper
• Comparison of Parallel Linear Genetic Programming Implementations

  2016cites this paper
• A Simple Hash Class with Strong Randomness Properties in Graphs and Hypergraphs

  2016cites this paper
• Fast Scalable Construction of (Minimal Perfect Hash) Functions

  2016cites this paper
• A Concise Forwarding Information Base for Scalable and Fast Flat Name Switching

  2016influential citation
• On the Analysis of Two Fundamental Randomized Algorithms - Multi-Pivot Quicksort and Efficient Hash Functions

  2015cites this paper
• Minimal and Monotone Minimal Perfect Hash Functions

  2015cites this paper
• Mathematical Foundations of Computer Science 2015

  2015cites this paper
• Perfect Hashing Structures for Parallel Similarity Searches

  2015influential citation
• Perfect Hashing Base R-tree for multiple queries

  2014cites this paper
• Algorithmic Gems in the Data Miner's Cave

  2014cites this paper
• Synthesis Algorithm for Parallel Index Generator

  2014cites this paper
• Synthesis algorithm of parallel index generation units

  2014cites this paper
• Cache-Oblivious Peeling of Random Hypergraphs

  2013cites this paper
• Practical perfect hashing in nearly optimal space

  2013influential citation
• Mixed Hypergraphs for Linear-Time Construction of Denser Hashing-Based Data Structures

  2013cites this paper
• The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem

  2012cites this paper
• Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT

  2012cites this paper
• On Thresholds for the Appearance of 2-cores in Mixed Hypergraphs

  2012cites this paper
• Bioinformatics Sequence Comparisons on Manycore Processors

  2012cites this paper
• Advanced rank/select data structures: succinctness, bounds and applications

  2012cites this paper
• Cores of random r-partite hypergraphs

  2012cites this paper
• Minimal perfect hashing: A competitive method for indexing internal memory

  2011cites this paper
• Flash memory efficient LTL model checking

  2011cites this paper
• The solution space geometry of random linear equations

  2011influential citation
• Theory and practice of monotone minimal perfect hashing

  2011cites this paper
• Bloom maps for big data

  2010cites this paper
• Monotone minimal perfect hashing: searching a sorted table with O(1) accesses

  2009cites this paper
• Hash, Displace, and Compress

  2009cites this paper
• Strategies for Static Tables

  2009cites this paper
• Strategies for Static Tables

  2009cites this paper
• Theory and Practise of Monotone Minimal Perfect Hashing

  2009influential citation
• Near-Optimal Space Perfect Hashing Algorithms

  2009influential citation
• Threshold Phenomena in Random Constraint Satisfaction Problems

  2008cites this paper
• Succinct Data Structures for Retrieval and Approximate Membership

  2008influential citation
• Randomized Language Models via Perfect Hash Functions

  2008cites this paper
• Indexing Internal Memory with Minimal Perfect Hash Functions

  2008cites this paper
• Handbook of research on modern systems analysis and design technologies and applications

  2008cites this paper
• Chapter XI Strategies for Static Tables

  2008cites this paper
• Direct suffix sorting and its applications

  2008cites this paper
• Direct Suffix Sorting and Its Applications

  2008cites this paper
• Multimodal augmented reality to enhance human communication

  2008cites this paper
• External perfect hashing for very large key sets

  2007cites this paper
• Simple and Space-Efficient Minimal Perfect Hash Functions

  2007influential citation
• Bloom Maps

  2007cites this paper
• Design Strategies for Minimal Perfect Hash Functions

  2007influential citation