Storing a Sparse Table with 0 (1) Worst Case Access Time
From MaRDI portal
Publication:3766870
Recommendations
Cited in
(only showing first 100 items - show all)- Cuckoo hashing: Further analysis
- Optimal higher order Delaunay triangulations of polygons
- Improved parameterized set splitting algorithms: A Probabilistic approach
- Two results on tables
- Information compression and Varshamov-Gilbert bound
- The problem of space invariance for sequential machines
- A practical method for implementing string pattern matching machines
- On a compaction theorem of Ragde
- The effect of table expansion on the program complexity of perfect hash functions
- An optimal algorithm for generating minimal perfect hash functions
- Point location in fat subdivisions
- Attribute-efficient learning in query and mistake-bound models
- On data structures and asymmetric communication complexity
- Perfect hashing
- Algorithmic complexity of protein identification: Combinatorics of weighted strings
- Permuted function matching
- Time-space trade-offs for Lempel-Ziv compressed indexing
- The nearest colored node in a tree
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs
- Linear time local approximation algorithm for maximum stable marriage
- On-line weighted pattern matching
- Alignment-free sequence comparison using absent words
- Storing information with extractors.
- Sparse sets and collapse of complexity classes
- Lower bounds for dynamic algebraic problems
- Optimal bounds for the predecessor problem and related problems
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
- On the power of unambiguity in log-space
- Linear matroid intersection is in quasi-NC
- Parameterized complexity of small weight automorphisms and isomorphisms
- String indexing for top-\(k\) close consecutive occurrences
- Dynamic and internal longest common substring
- Index structures for fast similarity search for symbol strings
- Indexing weighted sequences: neat and efficient
- Approximate pattern matching on elastic-degenerate text
- The cell probe complexity of succinct data structures
- Canonical density control
- Construct a perfect word hash function in time independent of the size of integers
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches
- An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem
- A uniform paradigm to succinctly encode various families of trees
- Lower bounds for predecessor searching in the cell probe model
- On two continuum armed bandit problems in high dimensions
- Sublinear-space approximation algorithms for Max r-SAT
- Gapped indexing for consecutive occurrences
- A Survey of Data Structures in the Bitprobe Model
- Longest common extensions in trees
- Alphabet-dependent string searching with wexponential search trees
- Minimal and monotone minimal perfect hash functions
- Improved bounds for dictionary look-up with one error
- Time-optimal top-k document retrieval
- Worst case efficient single and multiple string matching in the RAM model
- Substring Range Reporting
- Dispersing Hash functions
- On the Circuit Complexity of Perfect Hashing
- Optimal hitting sets for combinatorial shapes
- A constructive arboricity approximation scheme
- Certifying equality with limited interaction
- Approximating Shortest Paths in Graphs
- A Table Compression Method for Extended Aho-Corasick Automaton
- Balanced hashing, color coding and approximate counting
- Succinct encoding of arbitrary graphs
- Membership in Constant Time and Almost-Minimum Space
- Low-contention data structures
- Smaller representation of finite state automata
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
- An Efficient Trie Construction for Natural Language Dictionaries
- Searching among intervals and compact routing tables
- Simple fast parallel hashing
- Representing shared data on distributed-memory parallel computers
- NL-printable sets and nondeterministic Kolmogorov complexity
- Bipartite perfect matching is in quasi-NC
- Isolating a vertex via lattices: polytopes with totally unimodular faces
- A subquadratic algorithm for 3XOR
- Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions
- Sorting and searching revisted
- Stochastic analysis of dynamic processes
- Two- and three- dimensional point location in rectangular subdivisions
- Tables should be sorted (on random access machines)
- Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP
- Nearly Optimal Static Las Vegas Succinct Dictionary
- Preconditioning for the Geometric Transportation Problem
- Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes
- Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs
- Constant-time retrieval with O( m) extra bits
- Compressed Decision Problems in Hyperbolic Groups.
- Near-linear time algorithm for \(n\)-fold ILPs via color coding
- The log-star revolution
- A perfect parallel dictionary
- Trans-dichotomous algorithms without multiplication — some upper and lower bounds
- Reverse-safe text indexing
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet
- Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable
- Near-linear time algorithm for n-fold ILPs via color coding
- Longest common factor after one edit operation
- Substring range reporting
- Polynomial hash functions are reliable (extended abstract)
- Efficient indexes for jumbled pattern matching with constant-sized alphabet
- Dilation-optimal edge deletion in polygonal cycles
- Improved deterministic algorithms for weighted matching and packing problems
This page was built for publication: Storing a Sparse Table with 0 (1) Worst Case Access Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3766870)
