On the public citation graph

Tree Structure Compression with RePair

https://doi.org/10.1109/dcc.2011.42

0 signed · 51 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/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-73437-6_24openalex-snapshot

Processing Compressed Texts: A Tractability Border

inferredcites →https://doi.org/10.1007/978-3-642-00596-1_16openalex-snapshot

Parameter Reduction in Grammar-Compressed Trees

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

Testing equivalence of morphisms on context-free languages

inferredcites →https://doi.org/10.1016/b978-012722442-8/50021-5openalex-snapshot

Path Queries on Compressed XML

inferredcites →https://doi.org/10.1016/j.datak.2006.01.002openalex-snapshot

A space efficient XML DOM parser

inferredcites →https://doi.org/10.1016/j.ipm.2006.07.001openalex-snapshot

Using structural contexts to compress semistructured text collections

inferredcites →https://doi.org/10.1016/j.is.2008.01.004openalex-snapshot

Efficient memory representation of XML document trees

inferredcites →https://doi.org/10.1016/j.tcs.2006.07.024openalex-snapshot

The complexity of tree automata and XPath on grammar-compressed trees

inferredcites →https://doi.org/10.1016/s0022-0000(02)00030-2openalex-snapshot

Typechecking for XML transformers

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

Off-line dictionary-based compression

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

Compression by induction of hierarchical grammars

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

Offline dictionary-based compression

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

Compressing XML with multiplexed hierarchical PPM models

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

Tree Structure Compression with RePair

inferredcites →https://doi.org/10.1109/dexa.2008.41openalex-snapshot

XML Tree Structure Compression

inferredcites →https://doi.org/10.1109/lics.2003.1210058openalex-snapshot

Query evaluation on compressed trees

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

The Smallest Grammar Problem

inferredcites →https://doi.org/10.1137/1.9781611972900.9openalex-snapshot

Succinct Trees in Practice

inferredcites →https://doi.org/10.1137/1.9781611973075.13openalex-snapshot

Fully-Functional Succinct Trees

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

Taxonomy of XML schema languages using formal language theory

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

XMill

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

XMill

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

Automata theory for XML researchers

inferredcites →https://doi.org/10.17487/rfc1951openalex-snapshot

DEFLATE Compressed Data Format Specification version 1.3

inferredcites →https://doi.org/10.3233/fi-2011-565openalex-snapshot

Self-Indexed Grammar-Based Compression

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

Tree structure compression with RePair

inferredcites →https://doi.org/10.5220/0002877901420150openalex-snapshot

CLUX - Clustering XML Sub-trees

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.1007/978-3-319-07959-2_36openalex-snapshot

Faster Compressed Suffix Trees for Repetitive Text Collections

inferred← citeshttps://doi.org/10.1007/978-3-319-20424-6_18openalex-snapshot

ECST – Extended Context-Free Straight-Line Tree Grammars

inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_14openalex-snapshot

Tree Compression with Top Trees

inferred← citeshttps://doi.org/10.1007/978-3-642-39467-6_15openalex-snapshot

Fast Multi-update Operations on Compressed XML Data

inferred← citeshttps://doi.org/10.1007/s10990-013-9093-zopenalex-snapshot

Functional programs as compressed data

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

Tree compression with top trees

inferred← citeshttps://doi.org/10.1016/j.is.2013.06.006openalex-snapshot

XML tree structure compression using RePair

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

Parameter reduction and automata evaluation for grammar-compressed trees

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

Linear pattern matching of compressed terms and polynomial rewriting

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

Approximation of trees by self-nested trees

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

Functional programs as compressed data

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

XML compression via DAGs

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

Faster Compressed Suffix Trees for Repetitive Collections

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

Compact bit encoding schemes for simply-typed lambda-terms

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

Compact bit encoding schemes for simply-typed lambda-terms

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

Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars

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

Algorithmics on SLP-compressed strings: A survey

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

A Review of Fruit Tree Canopy Branch Feature Extraction and 3D Reconstruction Algorithms

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

First-Order Unification on Compressed Terms

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

Compression of Rewriting Systems for Termination Analysis

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

Approximation of trees by self-nested trees

showing the first 21 of 22 · page through all 22

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.