On the public citation graph
Querying and Embedding Compressed Texts
0 signed · 57 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/jcss.1996.0023openalex-snapshot
Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files
inferredcites →https://doi.org/10.1006/jcss.2002.1852openalex-snapshot
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts
inferredcites →https://doi.org/10.1007/3-540-47849-3_3openalex-snapshot
Algorithms on Compressed Strings and Arrays
inferredcites →https://doi.org/10.1007/3-540-48340-3_5openalex-snapshot
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts
inferredcites →https://doi.org/10.1007/3-540-61422-2_148openalex-snapshot
Efficient algorithms for Lempel-Ziv encoding
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_5openalex-snapshot
Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_76openalex-snapshot
Word Problems on Compressed Words
inferredcites →https://doi.org/10.1007/978-3-642-60207-8_23openalex-snapshot
Complexity of Language Recognition Problems for Compressed Words
inferredcites →https://doi.org/10.1007/bfb0049431openalex-snapshot
Testing equivalence of morphisms on context-free languages
inferredcites →https://doi.org/10.1016/0304-3975(87)90049-1openalex-snapshot
More complicated questions about maxima and minima, and some closures of NP
inferredcites →https://doi.org/10.1016/0890-5401(89)90008-4openalex-snapshot
The iterated mod problem
inferredcites →https://doi.org/10.1016/j.ipl.2004.01.002openalex-snapshot
A PTIME-complete matching problem for SLP-compressed words
inferredcites →https://doi.org/10.1016/s0097-8485(00)80014-5openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1016/s0304-3975(02)00777-6openalex-snapshot
Application of Lempel–Ziv factorization to the approximation of grammar-based compression
inferredcites →https://doi.org/10.1016/s1570-8667(03)00036-4openalex-snapshot
Regular expression searching on compressed text
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1093/oso/9780195085914.001.0001openalex-snapshot
Limits to Parallel Computation
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/5.892712openalex-snapshot
Compressed and fully compressed pattern matching in one and two dimensions
inferredcites →https://doi.org/10.1109/tit.1977.1055714openalex-snapshot
A universal algorithm for sequential data compression
inferredcites →https://doi.org/10.1137/s0097539704445950openalex-snapshot
Word Problems and Membership Problems on Compressed Words
inferredcites →https://doi.org/10.1137/s0097539793249530openalex-snapshot
Finite Monoids: From Word to Circuit Evaluation
inferredcites →https://doi.org/10.5860/choice.33-3959openalex-snapshot
Limits to parallel computation: P-completeness theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11753728_15openalex-snapshot
Window Subsequence Problems for Compressed Texts
inferred← citeshttps://doi.org/10.1007/978-1-4939-0748-9openalex-snapshot
The Compressed Word Problem for Groups
inferred← citeshttps://doi.org/10.1007/978-1-4939-0748-9_3openalex-snapshot
Algorithms on Compressed Words
inferred← citeshttps://doi.org/10.1007/978-3-031-57228-9openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-57228-9_5openalex-snapshot
Parity Games on Temporal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-23660-5_2openalex-snapshot
Equality Testing of Compressed Strings
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_24openalex-snapshot
Processing Compressed Texts: A Tractability Border
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_31openalex-snapshot
Computing Longest Common Substring and All Palindromes from Compressed Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_21openalex-snapshot
Compressed Membership in Automata with Compressed Labels
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_32openalex-snapshot
Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition
inferred← citeshttps://doi.org/10.1007/978-3-642-21458-5_27openalex-snapshot
Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_45openalex-snapshot
Faster Fully Compressed Pattern Matching by Recompression
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_13openalex-snapshot
Unary Pushdown Automata and Straight-Line Programs
inferred← citeshttps://doi.org/10.1007/s00224-013-9443-6openalex-snapshot
The Complexity of Compressed Membership Problems for Finite Automata
inferred← citeshttps://doi.org/10.1007/s00453-011-9590-6openalex-snapshot
Unified Compression-Based Acceleration of Edit-Distance Computation
inferred← citeshttps://doi.org/10.1007/s00453-013-9830-zopenalex-snapshot
Fast Distance Multiplication of Unit-Monge Matrices
inferred← citeshttps://doi.org/10.1007/s10958-009-9396-0openalex-snapshot
Faster subsequence recognition in compressed strings
inferred← citeshttps://doi.org/10.1016/j.ic.2011.01.009openalex-snapshot
Leaf languages and string compression
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.016openalex-snapshot
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
inferred← citeshttps://doi.org/10.1142/s012905411000757xopenalex-snapshot
COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA
inferred← citeshttps://doi.org/10.1142/s0218196712400073openalex-snapshot
COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS
inferred← citeshttps://doi.org/10.1145/2631920openalex-snapshot
Faster Fully Compressed Pattern Matching by Recompression
inferred← citeshttps://doi.org/10.1145/3569708openalex-snapshot
Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems
inferred← citeshttps://doi.org/10.1515/gcc-2012-0016openalex-snapshot
Algorithmics on SLP-compressed strings: A survey
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2009.1804openalex-snapshot
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2012.136openalex-snapshot
Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P)
inferred← citeshttps://doi.org/10.48550/arxiv.0902.2649openalex-snapshot
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
inferred← citeshttps://doi.org/10.48550/arxiv.1004.1194openalex-snapshot
Unified Compression-Based Acceleration of Edit-Distance Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1403.0509openalex-snapshot
Unary Pushdown Automata and Straight-Line Programs
inferred← citeshttps://doi.org/10.82444/warw.33496630openalex-snapshot
Fast distance multiplication of unit-Monge matrices
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.