On the public citation graph
Recompression
0 signed · 100 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.1007/3-540-55124-7_4openalex-snapshot
Makanin's algorithm for word equations-two improvements and a generalization
inferredcites →https://doi.org/10.1007/978-3-319-06686-8_1openalex-snapshot
Finding All Solutions of Equations in Free Groups and Monoids with Involution
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_36openalex-snapshot
Solving Two-Variable Word Equations
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-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/bfb0055097openalex-snapshot
Application of Lempel-Ziv encodings to the solution of word equations
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.1007/s00453-009-9375-3openalex-snapshot
On Word Equations in One Variable
inferredcites →https://doi.org/10.1007/s00453-014-9931-3openalex-snapshot
One-Variable Word Equations in Linear Time
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/j.tcs.2015.05.027openalex-snapshot
Approximation of grammar-based compression via recompression
inferredcites →https://doi.org/10.1016/j.tcs.2015.12.032openalex-snapshot
A really simple approximation of smallest grammar
inferredcites →https://doi.org/10.1070/sm1977v032n02abeh002376openalex-snapshot
THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
inferredcites →https://doi.org/10.1090/s0002-9939-1978-0500555-0openalex-snapshot
A Bound on Solutions of Linear Integer Equalities and Inequalities
inferredcites →https://doi.org/10.1109/dcc.1999.755679openalex-snapshot
Offline dictionary-based compression
inferredcites →https://doi.org/10.1109/sfcs.1998.743434openalex-snapshot
Satisfiability of word equations with constants is in exponential space
inferredcites →https://doi.org/10.1142/s0129054111008088openalex-snapshot
WORD EQUATIONS WITH ONE UNKNOWN
inferredcites →https://doi.org/10.1145/1132516.1132584openalex-snapshot
An efficient algorithm for solving word equations
inferredcites →https://doi.org/10.1145/234533.234543openalex-snapshot
Complexity of Makanin's algorithm
inferredcites →https://doi.org/10.1145/2631920openalex-snapshot
Faster Fully Compressed Pattern Matching by Recompression
inferredcites →https://doi.org/10.1145/301250.301443openalex-snapshot
Satisfiability of word equations with constants is in NEXPTIME
inferredcites →https://doi.org/10.1145/78935.78938openalex-snapshot
Minimal and complete word unification
inferredcites →https://doi.org/10.1145/990308.990312openalex-snapshot
Satisfiability of word equations with constants is in PSPACE
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.2014.445openalex-snapshot
Approximation of smallest linear tree grammar
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-02768-1_19openalex-snapshot
A Decision Procedure for String Logic with Quadratic Equations, Regular Expressions and Length Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-02768-1_5openalex-snapshot
Complexity Analysis of Tree Share Structure
inferred← citeshttps://doi.org/10.1007/978-3-030-24886-4_2openalex-snapshot
Deciding Context Unification (with Regular Constraints)
inferred← citeshttps://doi.org/10.1007/978-3-030-28796-2_1openalex-snapshot
Matching Patterns with Variables
inferred← citeshttps://doi.org/10.1007/978-3-030-28796-2_4openalex-snapshot
Independent Systems of Word Equations: From Ehrenfeucht to Eighteen
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-031-05578-2_2openalex-snapshot
Word Equations in the Context of String Solving
inferred← citeshttps://doi.org/10.1007/978-3-031-27481-7_23openalex-snapshot
Word Equations in Synergy with Regular Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-37703-7_2openalex-snapshot
Decision Procedures for Sequence Theories
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-031-98668-0_10openalex-snapshot
$$\textsf{HornStr}$$: Invariant Synthesis for Regular Model Checking as Constrained Horn Clauses
inferred← citeshttps://doi.org/10.1007/978-3-032-06085-3_7openalex-snapshot
On Solving String Equations via Powers and Parikh Images
inferred← citeshttps://doi.org/10.1007/978-3-319-06686-8_1openalex-snapshot
Finding All Solutions of Equations in Free Groups and Monoids with Involution
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-642-39212-2_30openalex-snapshot
One-Variable Word Equations in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_11openalex-snapshot
Solution Sets for Equations over Free Groups are EDT0L Languages
inferred← citeshttps://doi.org/10.1007/978-3-662-53132-7_25openalex-snapshot
On the Solvability Problem for Restricted Classes of Word Equations
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-013-9443-6openalex-snapshot
The Complexity of Compressed Membership Problems for Finite Automata
inferred← citeshttps://doi.org/10.1007/s00224-016-9693-1openalex-snapshot
Equations Over Free Inverse Monoids with Idempotent Variables
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-021-10058-5openalex-snapshot
On the structure of solution-sets to regular word equations
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-021-00821-yopenalex-snapshot
Internal Dictionary Matching
inferred← citeshttps://doi.org/10.1007/s10601-025-09379-wopenalex-snapshot
Word equations in synergy with regular constraints (extended version)
inferred← citeshttps://doi.org/10.1007/s11390-025-4684-9openalex-snapshot
A Separation Logic for Sequences in Block-Based Cloud Storage Systems and Its Decidability
inferred← citeshttps://doi.org/10.1007/s11856-021-2232-zopenalex-snapshot
The complexity of solution sets to equations in hyperbolic groups
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.is.2018.03.002openalex-snapshot
Grammar-based graph compression
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2024.04.003openalex-snapshot
The Diophantine problem in Chevalley groups
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.08.001openalex-snapshot
Word equations in non-deterministic linear space
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100747openalex-snapshot
Associative unification in Maude
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.10.023openalex-snapshot
On PSPACE generation of a solution set of a word equation and its applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115372openalex-snapshot
Expressive completeness of separation logic in block-based cloud storage systems
inferred← citeshttps://doi.org/10.1070/im9104openalex-snapshot
The Diophantine problem in the classical matrix groups
inferred← citeshttps://doi.org/10.1109/ase63991.2025.00027openalex-snapshot
Relia: Accelerating the Analysis of Cloud Access Control Policies
inferred← citeshttps://doi.org/10.1109/focs.2017.26openalex-snapshot
Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00095openalex-snapshot
Faster Approximate Pattern Matching: A Unified Approach
inferred← citeshttps://doi.org/10.1109/lics.2017.8005141openalex-snapshot
Decidability, complexity, and expressiveness of first-order logic over the subword ordering
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.9781611977073.110openalex-snapshot
Pattern Matching on Grammar-Compressed Strings in Linear Time
inferred← citeshttps://doi.org/10.1137/23m1567618openalex-snapshot
Internal Pattern Matching Queries in a Text and Applications
inferred← citeshttps://doi.org/10.1142/s0129054118420108openalex-snapshot
On the Complexity of Solving Restricted Word Equations
inferred← citeshttps://doi.org/10.1142/s0218196720500198openalex-snapshot
Solutions to twisted word equations and equations in virtually free groups
inferred← citeshttps://doi.org/10.1142/s1664360720500058openalex-snapshot
Diophantine problems in solvable groups
inferred← citeshttps://doi.org/10.1145/3158092openalex-snapshot
String constraints with concatenation and transducers solved efficiently
inferred← citeshttps://doi.org/10.1145/3290362openalex-snapshot
Decision procedures for path feasibility of string-manipulating programs with complex operations
inferred← citeshttps://doi.org/10.1145/3313276.3316368openalex-snapshot
String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure
inferred← citeshttps://doi.org/10.1145/3484198openalex-snapshot
A Survey on String Constraint Solving
inferred← citeshttps://doi.org/10.1145/3497775.3503691openalex-snapshot
CertiStr: a certified string solver
inferred← citeshttps://doi.org/10.1145/3517804.3524159openalex-snapshot
Data Path Queries over Embedded Graph Databases
inferred← citeshttps://doi.org/10.1145/3622872openalex-snapshot
Solving String Constraints with Lengths by Stabilization
inferred← citeshttps://doi.org/10.1145/3729273openalex-snapshot
A Uniform Framework for Handling Position Constraints in String Solving
inferred← citeshttps://doi.org/10.1145/3763165openalex-snapshot
The Power of Regular Constraint Propagation
inferred← citeshttps://doi.org/10.1145/3832221openalex-snapshot
Solving String Split Constraints via Structural Relaxation
inferred← citeshttps://doi.org/10.23638/lmcs-15(2:6)2019openalex-snapshot
The height of piecewise-testable languages and the complexity of the logic of subwords
inferred← citeshttps://doi.org/10.25209/2079-3316-2018-9-2-3-21openalex-snapshot
On solving quadratic word equations
inferred← citeshttps://doi.org/10.4204/eptcs.341.4openalex-snapshot
Program Specialization as a Tool for Solving Word Equations
inferred← citeshttps://doi.org/10.4213/im9104openalex-snapshot
Диофантовы проблемы в классических матричных группах
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.icalp.2019.110openalex-snapshot
Solutions Sets to Systems of Equations in Hyperbolic Groups Are EDT0L in PSPACE (Track B: Automata, Logic, Semantics, and Theory of Programming)
inferred← citeshttps://doi.org/10.48550/arxiv.1111.3244openalex-snapshot
Faster fully compressed pattern matching by recompression
inferred← citeshttps://doi.org/10.48550/arxiv.1309.4958openalex-snapshot
Approximation of smallest linear tree grammar
inferred← citeshttps://doi.org/10.48550/arxiv.1605.09442openalex-snapshot
Undecidability of a Theory of Strings, Linear Arithmetic over Length, and String-Number Conversion
inferred← citeshttps://doi.org/10.48550/arxiv.1702.00736openalex-snapshot
Word equations in linear space
inferred← citeshttps://doi.org/10.48550/arxiv.1805.09123openalex-snapshot
Decidable Logics Combining Word Equations, Regular Expressions and Length Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.2007.12247openalex-snapshot
On Solving Word Equations via Program Transformation
inferred← citeshttps://doi.org/10.48550/arxiv.2010.15975openalex-snapshot
String Constraints with Concatenation and Transducers Solved Efficiently (Technical Report)
inferred← citeshttps://doi.org/10.5555/3329995.3330076openalex-snapshot
Decidability, complexity, and expressiveness of first-order logic over the subword ordering
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.