On the public citation graph
Fast Compressed Tries through Path Decompositions
0 signed · 74 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.1002/spe.587openalex-snapshot
UbiCrawler: a scalable fully distributed Web crawler
inferredcites →https://doi.org/10.1007/3-540-48518-x_18openalex-snapshot
Adaptive Algorithms for Cache-efficient Trie Search
inferredcites →https://doi.org/10.1007/978-3-540-68552-4_12openalex-snapshot
Broadword Implementation of Rank/Select Queries
inferredcites →https://doi.org/10.1007/978-3-642-20662-7_12openalex-snapshot
Compressed String Dictionaries
inferredcites →https://doi.org/10.1007/978-3-642-32241-9_34openalex-snapshot
Succinct Representations of Binary Trees for Range Minimum Queries
inferredcites →https://doi.org/10.1007/s00453-004-1146-6openalex-snapshot
Representing Trees of Higher Degree
inferredcites →https://doi.org/10.1016/j.jcss.2011.09.002openalex-snapshot
Ultra-succinct representation of ordered trees with applications
inferredcites →https://doi.org/10.1093/comjnl/42.3.193openalex-snapshot
Compressing Integers for Fast File Access
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/dcc.1991openalex-snapshot
[1991] Proceedings. Data Compression Conference
inferredcites →https://doi.org/10.1109/dcc.1999.755679openalex-snapshot
Offline dictionary-based compression
inferredcites →https://doi.org/10.1109/dcc.2010.45openalex-snapshot
I/O-Efficient Compressed Text Indexes: From Theory to Practice
inferredcites →https://doi.org/10.1109/sfcs.1989.63533openalex-snapshot
Space-efficient static trees and graphs
inferredcites →https://doi.org/10.1109/sfcs.1997.646100openalex-snapshot
Succinct representation of balanced parentheses, static trees and planar graphs
inferredcites →https://doi.org/10.1109/tit.1975.1055349openalex-snapshot
Universal codeword sets and representations of the integers
inferredcites →https://doi.org/10.1137/1.9781611972870.6openalex-snapshot
Practical Entropy-Compressed Rank/Select Dictionary
inferredcites →https://doi.org/10.1137/1.9781611972894.13openalex-snapshot
Theory and Practise of Monotone Minimal Perfect Hashing
inferredcites →https://doi.org/10.1137/s0097539702402354openalex-snapshot
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
inferredcites →https://doi.org/10.1137/s0097539799364092openalex-snapshot
Succinct Representation of Balanced Parentheses and Static Trees
inferredcites →https://doi.org/10.1145/1142351.1142385openalex-snapshot
Cache-oblivious string B-trees
inferredcites →https://doi.org/10.1145/1361192.1361194openalex-snapshot
Compact dictionaries for variable-length keys and data with applications
inferredcites →https://doi.org/10.1145/1376916.1376943openalex-snapshot
On searching compressed string collections cache-obliviously
inferredcites →https://doi.org/10.1145/1613676.1613680openalex-snapshot
Compressing and indexing labeled trees, with applications
inferredcites →https://doi.org/10.1145/1841909.1841913openalex-snapshot
Fast and Compact Web Graph Representations
inferredcites →https://doi.org/10.1145/1963190.2025378openalex-snapshot
Theory and practice of monotone minimal perfect hashing
inferredcites →https://doi.org/10.1145/2488388.2488440openalex-snapshot
Space-efficient data structures for Top- k completion
inferredcites →https://doi.org/10.1145/321812.321820openalex-snapshot
Efficient Storage and Retrieval by Content and Address of Static Files
inferredcites →https://doi.org/10.1145/800076.802464openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.5555/1109557.1109621openalex-snapshot
Cache-oblivious string dictionaries
inferredcites →https://doi.org/10.5555/1496770.1496856openalex-snapshot
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses
inferredcites →https://doi.org/10.5555/1873601.1873614openalex-snapshot
Fully-functional succinct trees
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.2516openalex-snapshot
Practical rearrangement methods for dynamic double‐array dictionaries
inferred← citeshttps://doi.org/10.1007/978-3-030-23679-3_3openalex-snapshot
Enumerated Automata Implementation of String Dictionaries
inferred← citeshttps://doi.org/10.1007/978-3-030-57675-2_29openalex-snapshot
A Compression-Based Design for Higher Throughput in a Lock-Free Hash Map
inferred← citeshttps://doi.org/10.1007/978-3-030-73197-7_50openalex-snapshot
Accurate Cardinality Estimation of Co-occurring Words Using Suffix Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-20643-6_17openalex-snapshot
Compressed String Dictionaries via Data-Aware Subtrie Compaction
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_16openalex-snapshot
Engineering a Textbook Approach to Index Massive String Dictionaries
inferred← citeshttps://doi.org/10.1007/978-3-319-67428-5_19openalex-snapshot
Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_14openalex-snapshot
Random Access to High-Order Entropy Compressed Text
inferred← citeshttps://doi.org/10.1007/978-981-33-4305-4_25openalex-snapshot
A Novel Focused Crawler with Anti-spamming Approach & Fast Query Retrieval
inferred← citeshttps://doi.org/10.1007/s00453-017-0348-7openalex-snapshot
Lempel–Ziv-78 Compressed String Dictionaries
inferred← citeshttps://doi.org/10.1007/s00453-021-00869-wopenalex-snapshot
Top Tree Compression of Tries
inferred← citeshttps://doi.org/10.1007/s00607-022-01085-2openalex-snapshot
On the correctness of a lock-free compression-based elastic mechanism for a hash trie design
inferred← citeshttps://doi.org/10.1007/s00778-020-00620-xopenalex-snapshot
Faster & strong: string dictionary compression using sampling and fast vectorized decompression
inferred← citeshttps://doi.org/10.1007/s10115-016-0999-8openalex-snapshot
Compressed double-array tries for string dictionaries supporting fast lookup
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.ic.2023.105124openalex-snapshot
Succinct data structure for path graphs
inferred← citeshttps://doi.org/10.1016/j.is.2023.102316openalex-snapshot
CoCo-trie: Data-aware compression and indexing of strings
inferred← citeshttps://doi.org/10.1016/j.is.2024.102490openalex-snapshot
Two-level massive string dictionaries
inferred← citeshttps://doi.org/10.1016/j.jcss.2022.09.001openalex-snapshot
Faster compressed quadtrees
inferred← citeshttps://doi.org/10.1109/dcc52660.2022.00034openalex-snapshot
Succinct Data Structure for Path Graphs
inferred← citeshttps://doi.org/10.1109/dcc52660.2022.00036openalex-snapshot
Speeding up compact planar graphs by using shallower trees
inferred← citeshttps://doi.org/10.1109/innovate-data.2017.9openalex-snapshot
Practical String Dictionary Compression Using String Dictionary Encoding
inferred← citeshttps://doi.org/10.1109/ispdc52870.2021.9521630openalex-snapshot
Towards an Elastic Lock-Free Hash Trie Design
inferred← citeshttps://doi.org/10.1137/1.9781611972931.15openalex-snapshot
Practical Batch-Updatable External Hashing with Sorting
inferred← citeshttps://doi.org/10.1145/2187980.2187997openalex-snapshot
Binary RDF for scalable publishing, exchanging and consumption in the web of data
inferred← citeshttps://doi.org/10.1145/2911451.2914802openalex-snapshot
Succinct Data Structures in Information Retrieval
inferred← citeshttps://doi.org/10.1145/3357384.3357972openalex-snapshot
Improved Compressed String Dictionaries
inferred← citeshttps://doi.org/10.1145/3478289openalex-snapshot
The Concurrent Learned Indexes for Multicore Data Storage
inferred← citeshttps://doi.org/10.14257/ijdta.2014.7.3.02openalex-snapshot
A Succinct String Dictionary Index in External Memory
inferred← citeshttps://doi.org/10.1504/ijbis.2018.10013682openalex-snapshot
Predictive auto-completion for query in search engine
inferred← citeshttps://doi.org/10.3390/app10155266openalex-snapshot
An Efficient Two-Level-Partitioning-Based Double Array and Its Parallelization
inferred← citeshttps://doi.org/10.3390/jmse11081521openalex-snapshot
An Efficient Dual-Stage Compression Model for Maritime Safety Information Based on BeiDou Short-Message Communication
inferred← citeshttps://doi.org/10.35376/10324/4361openalex-snapshot
Binary RDF for Scalable Publishing, Exchanging and Consumption in the Web of Data
inferred← citeshttps://doi.org/10.48550/arxiv.1911.08372openalex-snapshot
Improved Compressed String Dictionaries
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.