On the public citation graph
Optimal Bounds for the Predecessor Problem and Related Problems
0 signed · 209 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.1006/jagm.1997.0873openalex-snapshot
A Reliable Randomized Algorithm for the Closest-Pair Problem
inferredcites →https://doi.org/10.1006/jagm.2001.1193openalex-snapshot
Toward Optimal ϵ-Approximate Nearest Neighbor Algorithms
inferredcites →https://doi.org/10.1006/jcss.1998.1577openalex-snapshot
On Data Structures and Asymmetric Communication Complexity
inferredcites →https://doi.org/10.1007/3-540-18088-5_41openalex-snapshot
A Lower Bound on the Complexity of the Union-Split-Find Problem
inferredcites →https://doi.org/10.1007/3-540-48481-7_31openalex-snapshot
Geometric Searching over the Rationals
inferredcites →https://doi.org/10.1007/3-540-55719-9_77openalex-snapshot
Polynomial hash functions are reliable
inferredcites →https://doi.org/10.1007/3-540-56503-5_65openalex-snapshot
The bit probe complexity measure revisited
inferredcites →https://doi.org/10.1007/3-540-61680-2_51openalex-snapshot
Priority queues: Small, monotone and trans-dichotomous
inferredcites →https://doi.org/10.1007/3-540-63307-3_80openalex-snapshot
Trans-dichotomous algorithms without multiplication — some upper and lower bounds
inferredcites →https://doi.org/10.1007/bf01683268openalex-snapshot
Design and implementation of an efficient priority queue
inferredcites →https://doi.org/10.1007/bf01874387openalex-snapshot
Probabilistic methods in graph theory
inferredcites →https://doi.org/10.1007/bf02126797openalex-snapshot
A lower bound for finding predecessors in Yao's cell probe model
inferredcites →https://doi.org/10.1007/bfb0023445openalex-snapshot
Predecessor queries in dynamic integer sets
inferredcites →https://doi.org/10.1007/bfb0028575openalex-snapshot
Sorting and searching on the word RAM
inferredcites →https://doi.org/10.1007/bfb0032018openalex-snapshot
A new universal class of hash functions and dynamic hashing in real time
inferredcites →https://doi.org/10.1007/s00453-001-0013-yopenalex-snapshot
Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems
inferredcites →https://doi.org/10.1016/0020-0190(77)90031-xopenalex-snapshot
Preserving order in a forest in less than logarithmic time and linear space
inferredcites →https://doi.org/10.1016/0020-0190(77)90072-2openalex-snapshot
Understanding the complexity of interpolation search
inferredcites →https://doi.org/10.1016/0020-0190(83)90075-3openalex-snapshot
Log-logarithmic worst-case range queries are possible in space Θ(N)
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1016/0022-0000(93)90040-4openalex-snapshot
Surpassing the information theoretic bound with fusion trees
inferredcites →https://doi.org/10.1016/s0019-9958(84)80015-7openalex-snapshot
Hash functions for priority queues
inferredcites →https://doi.org/10.1016/s0304-3975(98)00172-8openalex-snapshot
Fusion trees can be implemented with AC0 instructions only
inferredcites →https://doi.org/10.1109/sfcs.1988.21968openalex-snapshot
Dynamic Perfect Hashing: Upper and Lower Bounds
inferredcites →https://doi.org/10.1109/sfcs.1995.492667openalex-snapshot
Sublogarithmic searching without multiplications
inferredcites →https://doi.org/10.1109/sfcs.1996.548472openalex-snapshot
Faster deterministic sorting and searching in linear space
inferredcites →https://doi.org/10.1109/sfcs.1996.548503openalex-snapshot
Static dictionaries on AC/sup 0/ RAMs: query time θ(√log n/log log n) is necessary and sufficient
inferredcites →https://doi.org/10.1109/sffcs.1999.814588openalex-snapshot
Efficient regular data structures and algorithms for location and proximity problems
inferredcites →https://doi.org/10.1137/0214071openalex-snapshot
Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
inferredcites →https://doi.org/10.1137/0403021openalex-snapshot
Monotone Circuits for Connectivity Require Super-Logarithmic Depth
inferredcites →https://doi.org/10.1145/100216.100221openalex-snapshot
Lower bounds for the union-find and the split-find problem on pointer machines
inferredcites →https://doi.org/10.1145/195058.195415openalex-snapshot
Lower bounds for union-split-find related problems on random access machines
inferredcites →https://doi.org/10.1145/301250.301325openalex-snapshot
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
inferredcites →https://doi.org/10.1145/335305.335344openalex-snapshot
Tight(er) worst-case bounds on dynamic searching and priority queues
inferredcites →https://doi.org/10.1145/380752.380842openalex-snapshot
Optimal static range reporting in one dimension
inferredcites →https://doi.org/10.1145/62212.62265openalex-snapshot
Monotone circuits for connectivity require super-logarithmic depth
inferredcites →https://doi.org/10.1145/73007.73040openalex-snapshot
The cell probe complexity of dynamic data structures
inferredcites →https://doi.org/10.1145/800135.804414openalex-snapshot
Some complexity questions related to distributive computing(Preliminary Report)
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.5555/314613.314844openalex-snapshot
Faster deterministic sorting and priority queues in linear space
inferredcites →https://doi.org/10.5555/314613.314845openalex-snapshot
Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries
inferredcites →https://doi.org/10.5555/338219.338595openalex-snapshot
Faster deterministic dictionaries
inferredcites →https://doi.org/10.5860/choice.40-2215openalex-snapshot
The discrepancy method: randomness and complexity
inferredcites →https://doi.org/10.7146/brics.v2i26.19928openalex-snapshot
Tables should be sorted (on random access machines)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4805896openalex-extracted
Efficient Algorithms for Enumerating Maximal Common Subsequences of Two Strings
inferred← citeshttps://doi.org/10.1002/spe.2791openalex-snapshot
Compact Fenwick trees for dynamic ranking and selection
inferred← citeshttps://doi.org/10.1007/11561071_23openalex-snapshot
Predecessor Queries in Constant Time?
inferred← citeshttps://doi.org/10.1007/11786986_34openalex-snapshot
Dynamic Interpolation Search Revisited
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_28openalex-snapshot
The Cell Probe Complexity of Succinct Data Structures
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_153openalex-snapshot
Fully Dynamic Connectivity: Upper and Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_263openalex-snapshot
O(log log n)‐competitive Binary Search Tree
inferred← citeshttps://doi.org/10.1007/978-0-387-34735-6_12openalex-snapshot
An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_153openalex-snapshot
Fully Dynamic Connectivity: Upper and Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_631openalex-snapshot
Orthogonal Range Searching on Discrete Grids
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_632openalex-snapshot
Predecessor Search, String Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_35openalex-snapshot
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings
inferred← citeshttps://doi.org/10.1007/978-3-031-20643-6_16openalex-snapshot
Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries
inferred← citeshttps://doi.org/10.1007/978-3-319-17142-5_29openalex-snapshot
Algorithms in the Ultra-Wide Word Model
inferred← citeshttps://doi.org/10.1007/978-3-319-19929-0_14openalex-snapshot
Alphabet-Dependent String Searching with Wexponential Search Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_17openalex-snapshot
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_31openalex-snapshot
Improved Bounds for Finger Search on a RAM
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_7openalex-snapshot
Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_34openalex-snapshot
On the Size of Succinct Indices
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_35openalex-snapshot
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_46openalex-snapshot
External Memory Range Reporting on a Grid
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_33openalex-snapshot
Succinct Representations of Arbitrary Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-00563-3_57openalex-snapshot
On Two Variants of the Longest Increasing Subsequence Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_20openalex-snapshot
Data Structures for Approximate Orthogonal Range Counting
inferred← citeshttps://doi.org/10.1007/978-3-642-11266-9_35openalex-snapshot
Fast and Compact Prefix Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_57openalex-snapshot
Optimal Trade-Offs for Succinct String Indexes
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_62openalex-snapshot
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_14openalex-snapshot
Unit-Time Predecessor Queries on Massive Data Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_631-1openalex-snapshot
Orthogonal Range Searching on Discrete Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_632-2openalex-snapshot
Predecessor Search, String Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_10openalex-snapshot
A History of Distribution-Sensitive Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_26openalex-snapshot
Minimal Indices for Successor Search
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_63openalex-snapshot
Optimal Color Range Reporting in One Dimension
inferred← citeshttps://doi.org/10.1007/978-3-642-40897-7_21openalex-snapshot
Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_65openalex-snapshot
Biased Predecessor Search
inferred← citeshttps://doi.org/10.1007/s00224-007-9050-5openalex-snapshot
Two-Dimensional Packet Classification and Filter Conflict Resolution in the Internet
inferred← citeshttps://doi.org/10.1007/s00224-020-09980-xopenalex-snapshot
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings
inferred← citeshttps://doi.org/10.1007/s00453-012-9636-4openalex-snapshot
Improved Bounds for Finger Search on a RAM
inferred← citeshttps://doi.org/10.1007/s00453-012-9664-0openalex-snapshot
A Uniform Paradigm to Succinctly Encode Various Families of Trees
inferred← citeshttps://doi.org/10.1007/s00453-013-9836-6openalex-snapshot
Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
inferred← citeshttps://doi.org/10.1007/s00453-022-01046-3openalex-snapshot
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees
inferred← citeshttps://doi.org/10.1007/s00453-023-01193-1openalex-snapshot
Predecessor on the Ultra-Wide Word RAM
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.01.002openalex-snapshot
Fast local searches and updates in bounded universes
inferred← citeshttps://doi.org/10.1016/j.dam.2014.11.022openalex-snapshot
Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations
inferred← citeshttps://doi.org/10.1016/j.dam.2019.01.014openalex-snapshot
Dynamic index and LZ factorization in compressed space
inferred← citeshttps://doi.org/10.1016/j.ic.2014.09.005openalex-snapshot
Minimal indices for predecessor search
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104465openalex-snapshot
Dynamic Interpolation Search revisited
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104518openalex-snapshot
A compressed dynamic self-index for highly repetitive text collections
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104794openalex-snapshot
c-trie++: A dynamic trie tailored for fast prefix searches
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.12.006openalex-snapshot
Adjacency queries in dynamic sparse graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.03.003openalex-snapshot
A note on predecessor searching in the pointer machine model
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.06.016openalex-snapshot
Lower bounds for predecessor searching in the cell probe model
inferred← citeshttps://doi.org/10.1016/j.jda.2005.01.006openalex-snapshot
Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem
inferred← citeshttps://doi.org/10.1016/j.jss.2004.09.002openalex-snapshot
Worst case constant time priority queue
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.047openalex-snapshot
The Cell Probe Complexity of Succinct Data Structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.003openalex-snapshot
Towards optimal range medians
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.05.023openalex-snapshot
Succinct data structures for Searchable Partial Sums with optimal worst-case performance
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.09.031openalex-snapshot
Succinct encoding of arbitrary graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.06.020openalex-snapshot
Maximal common subsequence algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115360openalex-snapshot
Efficient algorithms for enumerating maximal common subsequences of two strings
inferred← citeshttps://doi.org/10.1017/9781108671644.016openalex-snapshot
Extension Complexity of Polytopes
inferred← citeshttps://doi.org/10.1109/ccc.2003.1214411openalex-snapshot
Lower bounds for predecessor searching in the cell probe model
inferred← citeshttps://doi.org/10.1109/dcc.2018.00037openalex-snapshot
A Dynamic Compressed Self-Index for Highly Repetitive Text Collections
inferred← citeshttps://doi.org/10.1109/dcc47342.2020.00032openalex-snapshot
c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches
inferred← citeshttps://doi.org/10.1109/focs.2006.62openalex-snapshot
Point Location in o(log n) Time, Voronoi Diagrams in o(n log n) Time, and Other Transdichotomous Results in Computational Geometry
inferred← citeshttps://doi.org/10.1109/focs.2012.21openalex-snapshot
Higher Cell Probe Lower Bounds for Evaluating Polynomials
inferred← citeshttps://doi.org/10.1109/focs.2012.79openalex-snapshot
On-Line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List
inferred← citeshttps://doi.org/10.1109/focs.2013.78openalex-snapshot
On the Communication Complexity of Sparse Set Disjointness and Exists-Equal Problems
inferred← citeshttps://doi.org/10.1109/focs.2014.26openalex-snapshot
Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00044openalex-snapshot
Optimal Approximate Distance Oracle for Planar Graphs
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238199openalex-snapshot
Breaking a time-and-space barrier in constructing full-text indices
inferred← citeshttps://doi.org/10.1109/tit.2024.3425808openalex-snapshot
Access-Redundancy Tradeoffs in Quantized Linear Computations
inferred← citeshttps://doi.org/10.1137/070685373openalex-snapshot
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices
inferred← citeshttps://doi.org/10.1137/07068669xopenalex-snapshot
Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
inferred← citeshttps://doi.org/10.1137/09075336xopenalex-snapshot
Unifying the Landscape of Cell-Probe Lower Bounds
inferred← citeshttps://doi.org/10.1137/1.9781611976465.73openalex-snapshot
New Data Structures for Orthogonal Range Reporting and Range Minima Queries
inferred← citeshttps://doi.org/10.1137/120897146openalex-snapshot
Replacement Paths via Row Minima of Concise Matrices
inferred← citeshttps://doi.org/10.1137/s0097539701391592openalex-snapshot
New Lower Bound Techniques for Dynamic Partial Sums and Related Problems
inferred← citeshttps://doi.org/10.1137/s0097539705447256openalex-snapshot
Logarithmic Lower Bounds in the Cell-Probe Model
inferred← citeshttps://doi.org/10.1145/1007352.1007435openalex-snapshot
Lower bounds for dynamic connectivity
inferred← citeshttps://doi.org/10.1145/1060590.1060606openalex-snapshot
On dynamic range reporting in one dimension
inferred← citeshttps://doi.org/10.1145/1132516.1132551openalex-snapshot
Time-space trade-offs for predecessor search
inferred← citeshttps://doi.org/10.1145/1236457.1236460openalex-snapshot
Dynamic ordered sets with exponential search trees
inferred← citeshttps://doi.org/10.1145/1240233.1240242openalex-snapshot
Dynamic text and static pattern matching
inferred← citeshttps://doi.org/10.1145/1250790.1250796openalex-snapshot
Voronoi diagrams in n · 2 o(√lg lg n) time
inferred← citeshttps://doi.org/10.1145/1290672.1290680openalex-snapshot
Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
inferred← citeshttps://doi.org/10.1145/1314690.1314692openalex-snapshot
Equivalence between priority queues and sorting
inferred← citeshttps://doi.org/10.1145/1328911.1328912openalex-snapshot
Uniform deterministic dictionaries
inferred← citeshttps://doi.org/10.1145/1328911.1328915openalex-snapshot
Alternation and redundancy analysis of the intersection problem
inferred← citeshttps://doi.org/10.1145/1541885.1541887openalex-snapshot
Making deterministic signatures quickly
inferred← citeshttps://doi.org/10.1145/1559795.1559825openalex-snapshot
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
inferred← citeshttps://doi.org/10.1145/1806689.1806754openalex-snapshot
Connectivity oracles for failure prone graphs
inferred← citeshttps://doi.org/10.1145/2339123.2339129openalex-snapshot
Dynamic Indexability and the Optimality of B-Trees
inferred← citeshttps://doi.org/10.1145/2483699.2483702openalex-snapshot
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
inferred← citeshttps://doi.org/10.1145/3188745.3188862openalex-snapshot
Cell-probe lower bounds from online communication complexity
inferred← citeshttps://doi.org/10.1145/3802062openalex-snapshot
FIRAS: A Framework for Interval Range Search and Sampling
inferred← citeshttps://doi.org/10.1145/3810900.3810910openalex-snapshot
Dynamic Range Filtering Beyond Worst-Case Bounds
inferred← citeshttps://doi.org/10.1145/780542.780636openalex-snapshot
Space efficient dynamic stabbing with fast queries
inferred← citeshttps://doi.org/10.14778/3749646.3749664openalex-snapshot
Diva: Dynamic Range Filter for Var-Length Keys and Queries
inferred← citeshttps://doi.org/10.1587/transfun.e100.a.1785openalex-snapshot
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
inferred← citeshttps://doi.org/10.22215/etd/2012-09696openalex-snapshot
Exploiting non-uniform query distributions in data structuring problems
inferred← citeshttps://doi.org/10.36948/ijfmr.2024.v06i03.21967openalex-snapshot
Review on Computational Biology and Computational Chemistry Applications
inferred← citeshttps://doi.org/10.4230/lipics.cpm.2019.4openalex-snapshot
Optimal Rank and Select Queries on Dictionary-Compressed Text
inferred← citeshttps://doi.org/10.4230/lipics.cpm.2019.9openalex-snapshot
Conversion from RLBWT to LZ77
inferred← citeshttps://doi.org/10.4230/lipics.cpm.2024.3openalex-snapshot
Fully dynamic data structure for LCE queries in compressed space
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2017.44openalex-snapshot
On-the-Fly Array Initialization in Less Space
inferred← citeshttps://doi.org/10.4230/lipics.socg.2018.25openalex-snapshot
Dynamic Planar Orthogonal Point Location in Sublogarithmic Time
inferred← citeshttps://doi.org/10.4230/lipics.socg.2020.33openalex-snapshot
Finding Closed Quasigeodesics on Convex Polyhedra
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2009.1847openalex-snapshot
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2014.506openalex-snapshot
Space-Efficient String Indexing for Wildcard Pattern Matching
inferred← citeshttps://doi.org/10.48550/arxiv.0811.4346openalex-snapshot
Dynamic Indexability: The Query-Update Tradeoff for One-Dimensional Range Queries
inferred← citeshttps://doi.org/10.48550/arxiv.0906.2738openalex-snapshot
Data Structures for Approximate Range Counting
inferred← citeshttps://doi.org/10.48550/arxiv.0909.1030openalex-snapshot
The Euler Path to Static Level-Ancestors
inferred← citeshttps://doi.org/10.48550/arxiv.1006.5354openalex-snapshot
Optimal Trade-Off for Succinct String Indexes
inferred← citeshttps://doi.org/10.48550/arxiv.1010.3783openalex-snapshot
Unifying the Landscape of Cell-Probe Lower Bounds
inferred← citeshttps://doi.org/10.48550/arxiv.1302.3347openalex-snapshot
Alphabet-Dependent String Searching with Wexponential Search Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1306.3772openalex-snapshot
Minimal Indices for Successor Search
inferred← citeshttps://doi.org/10.48550/arxiv.1306.5029openalex-snapshot
Optimal Color Range Reporting in One Dimension
inferred← citeshttps://doi.org/10.48550/arxiv.1308.0833openalex-snapshot
Data Structures in Classical and Quantum Computing
inferred← citeshttps://doi.org/10.48550/arxiv.1408.3045openalex-snapshot
Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search
inferred← citeshttps://doi.org/10.48550/arxiv.1411.7359openalex-snapshot
Algorithms in the Ultra-Wide Word Model
inferred← citeshttps://doi.org/10.48550/arxiv.1504.06954openalex-snapshot
Dynamic index, LZ factorization, and LCE queries in compressed space
inferred← citeshttps://doi.org/10.48550/arxiv.1608.06666openalex-snapshot
Synergistic Sorting, MultiSelection and Deferred Data Structures on MultiSets
inferred← citeshttps://doi.org/10.48550/arxiv.2003.11835openalex-snapshot
Succinct Dynamic Ordered Sets with Random Access
inferred← citeshttps://doi.org/10.48550/arxiv.2111.03560openalex-snapshot
Optimal Approximate Distance Oracle for Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0502041openalex-snapshot
Logarithmic Lower Bounds in the Cell-Probe Model
inferred← citeshttps://doi.org/10.5555/1283383.1283443openalex-snapshot
Randomization does not help searching predecessors
inferred← citeshttps://doi.org/10.5555/1283383.1283480openalex-snapshot
Making deterministic signatures quickly
inferred← citeshttps://doi.org/10.5555/1496770.1496839openalex-snapshot
Cell probe lower bounds for succinct data structures
inferred← citeshttps://doi.org/10.5555/982792.982796openalex-snapshot
Tight bounds for the partial-sums problem
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.