On the public citation graph

On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts

https://doi.org/10.1006/jcss.2002.1852

0 signed · 59 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.1006/jagm.1997.0860openalex-snapshot

Optimal Two-Dimensional Compressed Matching

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.1007/3-540-09519-5_73openalex-snapshot

Probabilistic algorithms for sparse polynomials

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-61422-2_148openalex-snapshot

Efficient algorithms for Lempel-Ziv encoding

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

On the complexity of pattern matching for highly compressed two-dimensional texts

inferredcites →https://doi.org/10.1007/978-3-642-82456-2openalex-snapshot

Combinatorial Algorithms on Words

inferredcites →https://doi.org/10.1007/978-3-662-03088-2_3openalex-snapshot

Computational Complexity

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

Testing equivalence of morphisms on context-free languages

inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot

Randomized Algorithms

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

Efficient two-dimensional compressed matching

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

On the Complexity of Finite Sequences

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

A universal algorithm for sequential data compression

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

String matching in Lempel-Ziv compressed strings

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

Fast Probabilistic Algorithms for Verification of Polynomial Identities

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

Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs

inferredcites →https://doi.org/10.5860/choice.26-1566openalex-snapshot

Data compression: methods and theory

inferredcites →https://doi.org/10.5860/choice.32-5696openalex-snapshot

Text algorithms

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/11821069_59openalex-snapshot

Querying and Embedding Compressed Texts

inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_246openalex-snapshot

Multidimensional Compressed Pattern Matching

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

Generalization of Repetitiveness Measures for Two-Dimensional Strings

inferred← citeshttps://doi.org/10.1007/978-3-319-06686-8_19openalex-snapshot

Processing Succinct Matrices and Vectors

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-642-13509-5_4openalex-snapshot

Small-Space 2D Compressed Dictionary Matching

inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_41openalex-snapshot

Compressed Word Problems for Inverse Monoids

inferred← citeshttps://doi.org/10.1007/978-3-642-38536-0_29openalex-snapshot

Quantum Alternation

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/978-3-662-48054-0_37openalex-snapshot

Parallel Identity Testing for Skew Circuits with Big Powers and Applications

inferred← citeshttps://doi.org/10.1007/s00224-015-9666-9openalex-snapshot

Processing Succinct Matrices and Vectors

inferred← citeshttps://doi.org/10.1007/s00224-020-10013-wopenalex-snapshot

On the Complexity of the Smallest Grammar Problem over Fixed Alphabets

inferred← citeshttps://doi.org/10.1007/s00224-025-10244-9openalex-snapshot

Generalization of Repetitiveness Measures for Two-Dimensional Strings

inferred← citeshttps://doi.org/10.1007/s13218-018-0545-9openalex-snapshot

Aggregates in Answer Set Programming

inferred← citeshttps://doi.org/10.1016/j.artint.2020.103401openalex-snapshot

Protecting Elections by Recounting Ballots

inferred← citeshttps://doi.org/10.1016/j.ipl.2012.01.008openalex-snapshot

Fast equality test for straight-line compressed strings

inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103748openalex-snapshot

Core stability in additively separable hedonic games of low treewidth

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

Context-free commutative grammars with integer counters and resets

inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00196-8openalex-snapshot

The complexity of compressing subsegments of images described by finite automata

inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00777-6openalex-snapshot

Application of Lempel–Ziv factorization to the approximation of grammar-based compression

inferred← citeshttps://doi.org/10.1017/s0960129518000208openalex-snapshot

Linear pattern matching of compressed terms and polynomial rewriting

inferred← citeshttps://doi.org/10.1017/s1471068415000228openalex-snapshot

Rewriting recursive aggregates in answer set programming: back to monotonicity

inferred← citeshttps://doi.org/10.1017/s1471068422000047openalex-snapshot

Aggregate Semantics for Propositional Answer Set Programs

inferred← citeshttps://doi.org/10.1137/s0097539704445950openalex-snapshot

Word Problems and Membership Problems on Compressed Words

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/1970398.1970402openalex-snapshot

Unification and matching on compressed terms

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

Identity Testing for Radical Expressions

inferred← citeshttps://doi.org/10.1515/gcc-2012-0016openalex-snapshot

Algorithmics on SLP-compressed strings: A survey

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

Pattern Matching in Compressed Texts and Images

inferred← citeshttps://doi.org/10.4204/eptcs.110.5openalex-snapshot

Linear Compressed Pattern Matching for Polynomial Rewriting (Extended Abstract)

inferred← citeshttps://doi.org/10.4230/dagsemproc.06201.7openalex-snapshot

Solving Classical String Problems an Compressed Texts

inferred← citeshttps://doi.org/10.4230/lipics.rta.2012.272openalex-snapshot

Matching of Compressed Patterns with Character-Variables

inferred← citeshttps://doi.org/10.46298/dmtcs.526openalex-snapshot

Grammatical compression: compressed equivalence and other problems

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

Compressed word problems for inverse monoids

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

Processing Succinct Matrices and Vectors

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

Unary Pushdown Automata and Straight-Line Programs

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

Parallel Identity Testing for Skew Circuits with Big Powers and Applications

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

Solving Classical String Problems on Compressed Texts

inferred← citeshttps://doi.org/10.70675/6d6d43caz5529z49a5zada4z1791b21f2fb7openalex-snapshot

Zero problems in polynomial models

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.