On the public citation graph

Faster Fully Compressed Pattern Matching by Recompression

https://doi.org/10.1145/2631920

0 signed · 77 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11821069_59openalex-snapshot

Querying and Embedding Compressed Texts

inferredcites →https://doi.org/10.1007/3-540-48452-3_3openalex-snapshot

Pattern Matching in Text Compressed by Using Antidictionaries

inferredcites →https://doi.org/10.1007/3-540-60044-2_44openalex-snapshot

Pattern-matching for strings with short descriptions

inferredcites →https://doi.org/10.1007/3-540-61258-0_3openalex-snapshot

Randomized efficient algorithms for compressed strings: the finger-print approach

inferredcites →https://doi.org/10.1007/3-540-61422-2_148openalex-snapshot

Efficient algorithms for Lempel-Ziv encoding

inferredcites →https://doi.org/10.1007/3-540-63220-4_45openalex-snapshot

An improved pattern matching algorithm for strings in terms of straight-line programs

inferredcites →https://doi.org/10.1007/978-3-540-73437-6_24openalex-snapshot

Processing Compressed Texts: A Tractability Border

inferredcites →https://doi.org/10.1007/978-3-642-20712-9_21openalex-snapshot

Compressed Membership in Automata with Compressed Labels

inferredcites →https://doi.org/10.1007/978-3-642-23719-5_36openalex-snapshot

Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic

inferredcites →https://doi.org/10.1007/978-3-642-31265-6_19openalex-snapshot

Simple and Efficient LZW-Compressed Multiple Pattern Matching

inferredcites →https://doi.org/10.1007/978-3-642-34109-0_34openalex-snapshot

Grammar Precompression Speeds Up Burrows–Wheeler Compression

inferredcites →https://doi.org/10.1007/978-3-642-39212-2_30openalex-snapshot

One-Variable Word Equations in Linear Time

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/978-3-662-43951-7_21openalex-snapshot

Context Unification is in PSPACE

inferredcites →https://doi.org/10.1007/bf02522825openalex-snapshot

Maintaining dynamic sequences under equality tests in polylogarithmic time

inferredcites →https://doi.org/10.1007/bfb0049431openalex-snapshot

Testing equivalence of morphisms on context-free languages

inferredcites →https://doi.org/10.1007/s00224-013-9443-6openalex-snapshot

The Complexity of Compressed Membership Problems for Finite Automata

inferredcites →https://doi.org/10.1016/j.jda.2004.08.016openalex-snapshot

A fully linear-time approximation algorithm for grammar-based compression

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.1017/cbo9780511813603openalex-snapshot

Probability and Computing

inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot

Lecture Notes in Computer Science 1205

inferredcites →https://doi.org/10.1109/dcc.1999.755679openalex-snapshot

Offline dictionary-based compression

inferredcites →https://doi.org/10.1109/dcc.1999.755681openalex-snapshot

Almost-optimal fully LZW-compressed pattern matching

inferredcites →https://doi.org/10.1109/spire.2000.878188openalex-snapshot

Fully compressed pattern matching algorithm for balanced straight-line programs

inferredcites →https://doi.org/10.1109/tit.2005.850116openalex-snapshot

The Smallest Grammar Problem

inferredcites →https://doi.org/10.1145/2483699.2483705openalex-snapshot

Optimal Pattern Matching in LZW Compressed Strings

inferredcites →https://doi.org/10.1613/jair.374openalex-snapshot

Identifying Hierarchical Structure in Sequences: A linear-time algorithm

inferredcites →https://doi.org/10.4230/lipics.stacs.2012.136openalex-snapshot

Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P)

inferredcites →https://doi.org/10.4230/lipics.stacs.2013.233openalex-snapshot

Recompression: a simple and powerful technique for word equations

inferredcites →https://doi.org/10.4230/lipics.stacs.2014.445openalex-snapshot

Approximation of smallest linear tree grammar

inferredcites →https://doi.org/10.48550/arxiv.1109.4034openalex-snapshot

Tying up the loose ends in fully LZW-compressed pattern matching

inferredcites →https://doi.org/10.48550/arxiv.1302.3481openalex-snapshot

One-variable word equations in linear time

inferredcites →https://doi.org/10.5555/1622776.1622780openalex-snapshot

Identifying hierarchical structure in sequences

inferredcites →https://doi.org/10.5555/338219.338645openalex-snapshot

Pattern matching in dynamic texts

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_4openalex-snapshot

Recompression: Technique for Word Equations and Compressed Data

inferred← citeshttps://doi.org/10.1007/978-3-030-59212-7_2openalex-snapshot

Navigating Forest Straight-Line Programs in Constant Time

inferred← citeshttps://doi.org/10.1007/978-3-030-68195-1_26openalex-snapshot

Cadences in Grammar-Compressed Strings

inferred← citeshttps://doi.org/10.1007/978-3-031-55598-5_10openalex-snapshot

Space-Efficient Conversions from SLPs

inferred← citeshttps://doi.org/10.1007/978-3-031-72200-4_8openalex-snapshot

Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts

inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_25openalex-snapshot

Compressed Indexing with Signature Grammars

inferred← citeshttps://doi.org/10.1007/978-3-319-77525-8_56openalex-snapshot

Grammar-Based Compression

inferred← citeshttps://doi.org/10.1007/978-3-319-90530-3_11openalex-snapshot

Grammar-Based Compression of Unranked Trees

inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_30openalex-snapshot

One-Variable Word Equations in Linear Time

inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_44openalex-snapshot

Tree Compression Using String Grammars

inferred← citeshttps://doi.org/10.1007/978-981-16-4095-7_6openalex-snapshot

Information Processing on Compressed Data

inferred← citeshttps://doi.org/10.1007/s00224-026-10266-xopenalex-snapshot

Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts

inferred← citeshttps://doi.org/10.1007/s00453-017-0331-3openalex-snapshot

Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees

inferred← citeshttps://doi.org/10.1007/s00453-021-00821-yopenalex-snapshot

Internal Dictionary Matching

inferred← citeshttps://doi.org/10.1016/j.ic.2016.09.007openalex-snapshot

Approximation of smallest linear tree grammar

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.05.027openalex-snapshot

Approximation of grammar-based compression via recompression

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.032openalex-snapshot

A really simple approximation of smallest grammar

inferred← citeshttps://doi.org/10.1109/dcc.2016.13openalex-snapshot

Traversing Grammar-Compressed Trees with Constant Delay

inferred← citeshttps://doi.org/10.1109/dcc.2019.00060openalex-snapshot

RePair in Compressed Space and Time

inferred← citeshttps://doi.org/10.1109/focs.2019.00073openalex-snapshot

Balancing Straight-Line Programs

inferred← citeshttps://doi.org/10.1109/focs46700.2020.00095openalex-snapshot

Faster Approximate Pattern Matching: A Unified Approach

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/focs61266.2024.00122openalex-snapshot

Lempel-Ziv (LZ77) Factorization in Sublinear Time

inferred← citeshttps://doi.org/10.1109/ipdps64566.2025.00033openalex-snapshot

Tera-Scale Multilevel Graph Partitioning

inferred← citeshttps://doi.org/10.1137/1.9781611973730.36openalex-snapshot

Internal Pattern Matching Queries in a Text and Applications

inferred← citeshttps://doi.org/10.1137/1.9781611975031.99openalex-snapshot

Optimal Dynamic Strings

inferred← citeshttps://doi.org/10.1137/1.9781611975482.69openalex-snapshot

Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts

inferred← citeshttps://doi.org/10.1137/1.9781611977073.110openalex-snapshot

Pattern Matching on Grammar-Compressed Strings in Linear Time

inferred← citeshttps://doi.org/10.1137/1.9781611977073.112openalex-snapshot

How Compression and Approximation Affect Efficiency in String Distance Measures

inferred← citeshttps://doi.org/10.1137/23m1567618openalex-snapshot

Internal Pattern Matching Queries in a Text and Applications

inferred← citeshttps://doi.org/10.1142/s0218196718500431openalex-snapshot

Parallel identity testing for skew circuits with big powers and applications

inferred← citeshttps://doi.org/10.1145/2743014openalex-snapshot

Recompression

inferred← citeshttps://doi.org/10.1145/3356904openalex-snapshot

Deciding Context Unification

inferred← citeshttps://doi.org/10.1145/3607141openalex-snapshot

String Indexing with Compressed Patterns

inferred← citeshttps://doi.org/10.1561/2000000038openalex-snapshot

Pattern Matching in Compressed Texts and Images

inferred← citeshttps://doi.org/10.3390/a13040103openalex-snapshot

Practical Grammar Compression Based on Maximal Repeats

inferred← citeshttps://doi.org/10.4230/lipics.cpm.2021.8openalex-snapshot

Weighted Ancestors in Suffix Trees Revisited

inferred← citeshttps://doi.org/10.4230/lipics.cpm.2024.20openalex-snapshot

Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space

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.4230/lipics.stacs.2019.37openalex-snapshot

Compressed Decision Problems in Hyperbolic Groups

inferred← citeshttps://doi.org/10.48550/arxiv.1309.4958openalex-snapshot

Approximation of smallest linear tree grammar

inferred← citeshttps://doi.org/10.48550/arxiv.2010.14181openalex-snapshot

Impossibility Results for Grammar-Compressed Linear Algebra

inferred← citeshttps://doi.org/10.51382/978-3-96100-191-0openalex-snapshot

Combinatorial Properties of Periodic Patterns in Compressed Strings

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.