On the public citation graph
Sorting and searching on the word RAM
0 signed · 206 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/inco.1997.2632openalex-snapshot
Improved Parallel Integer Sorting without Concurrent Writing
inferredcites →https://doi.org/10.1006/jagm.1993.1018openalex-snapshot
Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
inferredcites →https://doi.org/10.1006/jagm.1997.0873openalex-snapshot
A Reliable Randomized Algorithm for the Closest-Pair Problem
inferredcites →https://doi.org/10.1007/3-540-60220-8_87openalex-snapshot
Tables should be sorted (on random access machines)
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1007/bf01683268openalex-snapshot
Design and implementation of an efficient priority queue
inferredcites →https://doi.org/10.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1007/bfb0028545openalex-snapshot
Floats, integers, and single source shortest paths
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/0304-3975(83)90023-3openalex-snapshot
Upper bounds for sorting integers on random access machines
inferredcites →https://doi.org/10.1016/s0019-9958(84)80015-7openalex-snapshot
Hash functions for priority queues
inferredcites →https://doi.org/10.1016/s0022-0000(05)80064-9openalex-snapshot
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
inferredcites →https://doi.org/10.1016/s0022-0000(73)80029-7openalex-snapshot
Time bounded random access machines
inferredcites →https://doi.org/10.1109/sfcs.1993.366833openalex-snapshot
What can we sort in o(nlog n) time?
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.1997.646087openalex-snapshot
Beyond the flow decomposition barrier
inferredcites →https://doi.org/10.1109/sfcs.1997.646088openalex-snapshot
Undirected single source shortest paths in linear time
inferredcites →https://doi.org/10.1137/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
inferredcites →https://doi.org/10.1137/s0097539791278376openalex-snapshot
An $o(n^3 )$-Time Maximum-Flow Algorithm
inferredcites →https://doi.org/10.1145/12130.12132openalex-snapshot
Almost optimal lower bounds for small depth circuits
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/261342.261352openalex-snapshot
Recent results on the single-source shortest paths problem
inferredcites →https://doi.org/10.1145/73007.73040openalex-snapshot
The cell probe complexity of dynamic data structures
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.7146/brics.v4i14.21678openalex-snapshot
Dictionaries on AC^0 RAMs: Query Time Theta(√log n/log log n) is Necessary and Sufficient
inferredcites →https://doi.org/10.7146/brics.v4i17.18813openalex-snapshot
Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.2314openalex-snapshot
Practically efficient array initialization
inferred← citeshttps://doi.org/10.1006/inco.2001.3046openalex-snapshot
Lower Bounds for Dynamic Algebraic Problems
inferred← citeshttps://doi.org/10.1006/jcss.2002.1822openalex-snapshot
Optimal Bounds for the Predecessor Problem and Related Problems
inferred← citeshttps://doi.org/10.1007/11561071_23openalex-snapshot
Predecessor Queries in Constant Time?
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_3openalex-snapshot
Exact and Approximate Distances in Graphs — A Survey
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-45022-x_7openalex-snapshot
Improved Shortest Paths on the Word RAM
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_30openalex-snapshot
Succinct Dynamic Dictionaries and Trees
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_41openalex-snapshot
Performance Tuning an Algorithm for Compressing Relational Tables
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_18openalex-snapshot
An Experimental Evaluation of Hybrid Data Structures for Searching
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_24openalex-snapshot
Performance Engineering Case Study: Heap Construction
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_30openalex-snapshot
Efficient Searching for Multi—dimensional Data Made Simple
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_34openalex-snapshot
Lower Bounds for Dynamic Algebraic Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_332openalex-snapshot
Rank and Select Operations on Binary Strings
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_332openalex-snapshot
Rank and Select Operations on Bit Strings
inferred← citeshttps://doi.org/10.1007/978-3-030-14812-6_18openalex-snapshot
Theoretical Model of Computation and Algorithms for FPGA-Based Hardware Accelerators
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_7openalex-snapshot
Rank-Select Indices Without Tears
inferred← citeshttps://doi.org/10.1007/978-3-030-25027-0_3openalex-snapshot
Highly Succinct Dynamic Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_8openalex-snapshot
Fast Breadth-First Search in Still Less Space
inferred← citeshttps://doi.org/10.1007/978-3-030-32047-8_1openalex-snapshot
Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search
inferred← citeshttps://doi.org/10.1007/978-3-030-34029-2_30openalex-snapshot
A Faster Convex-Hull Algorithm via Bucketing
inferred← citeshttps://doi.org/10.1007/978-3-030-59212-7_20openalex-snapshot
Efficient Construction of Hierarchical Overlap Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-59267-7_2openalex-snapshot
Partial Sums on the Ultra-Wide Word RAM
inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_30openalex-snapshot
Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_14openalex-snapshot
Sublinear Time Lempel-Ziv (LZ77) Factorization
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_15openalex-snapshot
New Advances in Rightmost Lempel-Ziv
inferred← citeshttps://doi.org/10.1007/978-3-031-82670-2_10openalex-snapshot
Dynamic Range Minimum Queries on the Ultra-wide Word RAM
inferred← citeshttps://doi.org/10.1007/978-3-031-92932-8_19openalex-snapshot
Dynamic Filter and Retrieval with One Access to Modifiable Memory
inferred← citeshttps://doi.org/10.1007/978-3-031-93112-3_32openalex-snapshot
Space-Efficient Algorithm for Integer Programming with Few Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_3openalex-snapshot
Expected Linear Time Sorting for Word Size Ω(log2 n loglogn)
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-67428-5_8openalex-snapshot
Succinct Partial Sums and Fenwick Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-96884-1_14openalex-snapshot
Tight Tradeoffs in Searchable Symmetric Encryption
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_52openalex-snapshot
Succinct Data Structures for Searchable Partial Sums
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_8openalex-snapshot
Constructing Efficient Dictionaries in Close to Sorting Time
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-642-04128-0_65openalex-snapshot
Storing a Compressed Function with Constant Time Access
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_17openalex-snapshot
Hilbert’s Thirteenth Problem and Circuit Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-13509-5_18openalex-snapshot
Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_50openalex-snapshot
Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_332-2openalex-snapshot
Rank and Select Operations on Bit Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_25openalex-snapshot
String Indexing for Patterns with Wildcards
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_43openalex-snapshot
CRAM: Compressed Random Access Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-34109-0_22openalex-snapshot
Improved Address-Calculation Coding of Integer Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-38236-9_4openalex-snapshot
Priority Queues and Sorting for Read-Only Data
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_13openalex-snapshot
Fingerprints in Compressed Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_32openalex-snapshot
In-Place Binary Counters
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_47openalex-snapshot
Succinct Data Structures for Representing Equivalence Classes
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_71openalex-snapshot
Fast Pseudorandomness for Independence and Load Balancing
inferred← citeshttps://doi.org/10.1007/s00145-020-09370-zopenalex-snapshot
Tight Tradeoffs in Searchable Symmetric Encryption
inferred← citeshttps://doi.org/10.1007/s00224-006-1198-xopenalex-snapshot
Compressed Suffix Trees with Full Functionality
inferred← citeshttps://doi.org/10.1007/s00224-011-9322-yopenalex-snapshot
Faster Approximate String Matching for Short Patterns
inferred← citeshttps://doi.org/10.1007/s00224-013-9498-4openalex-snapshot
String Indexing for Patterns with Wildcards
inferred← citeshttps://doi.org/10.1007/s00236-021-00407-9openalex-snapshot
Regular numeral systems for data structures
inferred← citeshttps://doi.org/10.1007/s00453-001-0079-6openalex-snapshot
Lower Bounds for Dynamic Data Structures on Algebraic RAMs
inferred← citeshttps://doi.org/10.1007/s00453-002-0989-yopenalex-snapshot
Dynamic Programming on the Word RAM
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-013-9836-6openalex-snapshot
Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
inferred← citeshttps://doi.org/10.1007/s00453-016-0140-0openalex-snapshot
Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet
inferred← citeshttps://doi.org/10.1007/s00453-016-0192-1openalex-snapshot
On the Succinct Representation of Equivalence Classes
inferred← citeshttps://doi.org/10.1007/s00453-021-00869-wopenalex-snapshot
Top Tree Compression of Tries
inferred← citeshttps://doi.org/10.1007/s00453-023-01193-1openalex-snapshot
Predecessor on the Ultra-Wide Word RAM
inferred← citeshttps://doi.org/10.1007/s00607-008-0019-2openalex-snapshot
Two new methods for constructing double-ended priority queues from priority queues
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101699openalex-snapshot
Dynamic layers of maxima with applications to dominating queries
inferred← citeshttps://doi.org/10.1016/j.comnet.2008.11.009openalex-snapshot
Distribution-based bandwidth access scheme in slotted all-optical packet-switched networks
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.10.002openalex-snapshot
The saga of minimum spanning trees
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105379openalex-snapshot
Double-ended palindromic trees in linear time
inferred← citeshttps://doi.org/10.1016/j.ins.2012.01.038openalex-snapshot
Faster computation of the Robinson–Foulds distance between phylogenetic networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.07.006openalex-snapshot
On the algebraic complexity of set equality and inclusion
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.08.007openalex-snapshot
A compact data structure for representing a dynamic multiset
inferred← citeshttps://doi.org/10.1016/j.is.2010.10.001openalex-snapshot
Checking determinism of XML Schema content models in optimal time
inferred← citeshttps://doi.org/10.1016/j.is.2012.06.002openalex-snapshot
Practical perfect hashing in nearly optimal space
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.01.002openalex-snapshot
Fingerprints in compressed strings
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.proeng.2011.08.636openalex-snapshot
Dynamic Programming for NP-Hard Problems
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.2014.07.010openalex-snapshot
Compact q-gram profiling of compressed strings
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.08.023openalex-snapshot
Computing minimal and maximal suffixes of a substring
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115358openalex-snapshot
Sorting and ranking of self-delimiting numbers with applications to outerplanar graph isomorphism
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00228-4openalex-snapshot
On the existence and construction of non-extreme (a,b)-trees
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/focs.2014.29openalex-snapshot
Generating k-Independent Variables in Constant Time
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00099openalex-snapshot
Smoothing the gap between NP and ER
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00114openalex-snapshot
Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181890openalex-snapshot
Integer sorting in O(n√(log log n)) expected time and linear space
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.1137/1.9781611973105.48openalex-snapshot
Tight Cell-Probe Bounds for Online Hamming Distance Computation
inferred← citeshttps://doi.org/10.1137/1.9781611973730.37openalex-snapshot
Cell-probe bounds for online edit distance and other pattern matching problems
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch1openalex-snapshot
Locality-sensitive Hashing without False Negatives
inferred← citeshttps://doi.org/10.1137/1.9781611974782.3openalex-snapshot
A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch187openalex-snapshot
Breaking the 𝒪( n )-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees
inferred← citeshttps://doi.org/10.1137/130936889openalex-snapshot
Random Access to Grammar-Compressed Strings and Trees
inferred← citeshttps://doi.org/10.1137/19m1303186openalex-snapshot
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations
inferred← citeshttps://doi.org/10.1137/20m1385287openalex-snapshot
Smoothing the Gap Between NP and ER
inferred← citeshttps://doi.org/10.1145/1060590.1060606openalex-snapshot
On dynamic range reporting in one dimension
inferred← citeshttps://doi.org/10.1145/1148109.1148160openalex-snapshot
Deterministic load balancing and dictionaries in the parallel disk model
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/1328911.1328912openalex-snapshot
Uniform deterministic dictionaries
inferred← citeshttps://doi.org/10.1145/1498698.1564502openalex-snapshot
Goal-directed shortest-path queries using precomputed cluster distances
inferred← citeshttps://doi.org/10.1145/1541885.1541887openalex-snapshot
Making deterministic signatures quickly
inferred← citeshttps://doi.org/10.1145/2746539.2746620openalex-snapshot
From Independence to Expansion and Back Again
inferred← citeshttps://doi.org/10.1145/2897518.2897562openalex-snapshot
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
inferred← citeshttps://doi.org/10.1145/3055399.3055443openalex-snapshot
Set similarity search beyond MinHash
inferred← citeshttps://doi.org/10.1145/3139958.3140021openalex-snapshot
Answering Spatial Multiple-Set Intersection Queries Using 2-3 Cuckoo Hash-Filters
inferred← citeshttps://doi.org/10.1145/3145573openalex-snapshot
Simultaneous Conversions with the Residue Number System Using Linear Algebra
inferred← citeshttps://doi.org/10.1145/3209685openalex-snapshot
An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization
inferred← citeshttps://doi.org/10.1145/3452938openalex-snapshot
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls
inferred← citeshttps://doi.org/10.1145/3460120.3484735openalex-snapshot
Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access
inferred← citeshttps://doi.org/10.1145/351827.384257openalex-snapshot
Performance engineering case study
inferred← citeshttps://doi.org/10.1145/3519935.3520061openalex-snapshot
Dynamic suffix array with polylogarithmic queries and updates
inferred← citeshttps://doi.org/10.1145/3519935.3520070openalex-snapshot
An extendable data structure for incremental stable perfect hashing
inferred← citeshttps://doi.org/10.1145/3544585.3544589openalex-snapshot
Dijkstra’s Single Source Shortest Path Algorithm
inferred← citeshttps://doi.org/10.1145/3717823.3718291openalex-snapshot
On the Hardness Hierarchy for the 𝑂(𝑛 √log 𝑛) Complexity in the Word RAM
inferred← citeshttps://doi.org/10.1145/3762178openalex-snapshot
Coverability in VASS Revisited: Improving Rackoff’s Bounds to Obtain Conditional Optimality
inferred← citeshttps://doi.org/10.11606/d.45.2008.tde-19102009-002745openalex-snapshot
Filtros para a busca e extração de padrões aproximados em cadeias biológicas
inferred← citeshttps://doi.org/10.1201/9781315119335-67openalex-snapshot
Computational Geometry: Generalized (or Colored) Intersection Searching
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8145openalex-snapshot
Filtering Algorithms Based on the Word-RAM Model
inferred← citeshttps://doi.org/10.22028/d291-25417openalex-snapshot
Sampling from discrete distributions and computing Fréchet distances
inferred← citeshttps://doi.org/10.22028/d291-25431openalex-snapshot
Tight(er) bounds for similarity measures, smoothed approximation and broadcasting
inferred← citeshttps://doi.org/10.29012/jpc.809openalex-snapshot
Representing Sparse Vectors with Differential Privacy, Low Error, Optimal Space, and Fast Access
inferred← citeshttps://doi.org/10.4225/03/58b503991f38dopenalex-snapshot
Computing with arbitrary and random numbers
inferred← citeshttps://doi.org/10.4230/lipics.cpm.2016.28openalex-snapshot
Minimal Suffix and Rotation of a Substring in Optimal Time
inferred← citeshttps://doi.org/10.4230/lipics.esa.2016.31openalex-snapshot
Cell-Probe Lower Bounds for Bit Stream Computation
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.14openalex-snapshot
Space Efficient Construction of Lyndon Arrays in Linear Time
inferred← citeshttps://doi.org/10.4230/lipics.ipec.2025.35openalex-snapshot
Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances
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.isaac.2018.66openalex-snapshot
An Optimal Choice Dictionary
inferred← citeshttps://doi.org/10.4230/lipics.itc.2020.11openalex-snapshot
Deterministic oblivious distribution (and tight compaction) in linear time
inferred← citeshttps://doi.org/10.48550/arxiv.0811.3490openalex-snapshot
Faster Approximate String Matching for Short Patterns
inferred← citeshttps://doi.org/10.48550/arxiv.1011.1708openalex-snapshot
CRAM: Compressed Random Access Memory
inferred← citeshttps://doi.org/10.48550/arxiv.1211.5433openalex-snapshot
Approximate pattern matching with k-mismatches in packed text
inferred← citeshttps://doi.org/10.48550/arxiv.1304.1188openalex-snapshot
How to Approximate A Set Without Knowing Its Size In Advance
inferred← citeshttps://doi.org/10.48550/arxiv.1304.5373openalex-snapshot
Compact q-gram Profiling of Compressed Strings
inferred← citeshttps://doi.org/10.48550/arxiv.1305.2777openalex-snapshot
Fingerprints in Compressed Strings
inferred← citeshttps://doi.org/10.48550/arxiv.1306.4287openalex-snapshot
Succinct data structures for representing equivalence classes
inferred← citeshttps://doi.org/10.48550/arxiv.1308.4469openalex-snapshot
External Memory Algorithms For Path Traversal in Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1408.2157openalex-snapshot
Generating k-independent variables in constant time
inferred← citeshttps://doi.org/10.48550/arxiv.1411.7359openalex-snapshot
Algorithms in the Ultra-Wide Word Model
inferred← citeshttps://doi.org/10.48550/arxiv.1412.6935openalex-snapshot
Time Bounds for Streaming Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1506.03676openalex-snapshot
From Independence to Expansion and Back Again
inferred← citeshttps://doi.org/10.48550/arxiv.1507.03225openalex-snapshot
CoveringLSH: Locality-sensitive Hashing without False Negatives
inferred← citeshttps://doi.org/10.48550/arxiv.1510.02637openalex-snapshot
Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence
inferred← citeshttps://doi.org/10.48550/arxiv.1511.08598openalex-snapshot
Predecessor problem on smooth distributions
inferred← citeshttps://doi.org/10.48550/arxiv.1612.07710openalex-snapshot
Set Similarity Search Beyond MinHash
inferred← citeshttps://doi.org/10.48550/arxiv.1705.10987openalex-snapshot
Succinct Partial Sums and Fenwick Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1809.07661openalex-snapshot
Small Uncolored and Colored Choice Dictionaries
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.5555/1283383.1283480openalex-snapshot
Making deterministic signatures quickly
inferred← citeshttps://doi.org/10.5555/2722129.2722166openalex-snapshot
Cell-probe bounds for online edit distance and other pattern matching problems
inferred← citeshttps://doi.org/10.5555/338219.338595openalex-snapshot
Faster deterministic dictionaries
inferred← citeshttps://doi.org/10.5555/545381.545383openalex-snapshot
Optimal time-space trade-offs for non-comparison-based sorting
inferred← citeshttps://doi.org/10.5555/545381.545411openalex-snapshot
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
inferred← citeshttps://doi.org/10.70675/e9f35f8fz2d75z4febza504z6c6de6857242openalex-snapshot
Computing informative k-mers for phylogenetic placement
inferred← citeshttps://doi.org/10.7146/brics.v5i11.19283openalex-snapshot
Lower Bounds for Dynamic Algebraic Problems
inferred← citeshttps://doi.org/10.7146/brics.v6i48.20118openalex-snapshot
Faster Deterministic Dictionaries
inferred← citeshttps://doi.org/10.7146/brics.v7i4.20132openalex-snapshot
A New Trade-off for Deterministic Dictionaries
inferred← citeshttps://doi.org/10.7146/brics.v8i2.20456openalex-snapshot
Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting
inferred← citeshttps://doi.org/10.82444/warw.33621667openalex-snapshot
Tight cell-probe bounds for online hamming distance computation
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.