On the public citation graph

Source encoding using syntactic information source models

https://doi.org/10.1109/18.9782
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.1016/0306-4573(81)90053-4openalex-snapshot
Coding and information theory
inferredcites →https://doi.org/10.1016/s0019-9958(70)90105-1openalex-snapshot
On the entropy of context-free languages
inferredcites →https://doi.org/10.1016/s0019-9958(74)90799-2openalex-snapshot
Entropies of probabilistic grammars
inferredcites →https://doi.org/10.1093/comjnl/30.6.541openalex-snapshot
Data Compression Using Dynamic Markov Modelling
inferredcites →https://doi.org/10.1109/tcom.1984.1096090openalex-snapshot
Data Compression Using Adaptive Coding and Partial String Matching
inferredcites →https://doi.org/10.1109/tit.1978.1055959openalex-snapshot
Variations on a theme by Huffman
inferredcites →https://doi.org/10.1109/tit.1979.1056107openalex-snapshot
Arithmetic stream coding using fixed precision registers
inferredcites →https://doi.org/10.1109/tit.1981.1056356openalex-snapshot
An efficient coding system for long source sequences
inferredcites →https://doi.org/10.1145/214762.214771openalex-snapshot
Arithmetic coding for data compression
inferredcites →https://doi.org/10.1145/357233.357235openalex-snapshot
Grammar-Based Definition of Metaprogramming Systems
inferredcites →https://doi.org/10.1147/rd.203.0198openalex-snapshot
Generalized Kraft Inequality and Arithmetic Coding
inferredcites →https://doi.org/10.1147/rd.232.0149openalex-snapshot
Arithmetic Coding

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-306-48102-2_28openalex-snapshot
A Tutorial on Hierarchical Lossless Data Compression
inferred← citeshttps://doi.org/10.1007/11605157_24openalex-snapshot
Compressing XML Documents Using Recursive Finite State Automata
inferred← citeshttps://doi.org/10.1007/3-540-49099-x_18openalex-snapshot
Polytypic Compact Printing and Parsing
inferred← citeshttps://doi.org/10.1007/978-3-540-45191-4_2openalex-snapshot
Chapter 2. Generic Haskell: Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_32openalex-snapshot
Bit-coded Regular Expression Parsing
inferred← citeshttps://doi.org/10.1007/978-3-642-22389-1_9openalex-snapshot
Simple Rules for Syllabification of Arabic Texts
inferred← citeshttps://doi.org/10.1007/b106473openalex-snapshot
Modeling uncertainty : an examination of stochastic theory, methods, and applications
inferred← citeshttps://doi.org/10.1016/b978-0-12-809474-7.00005-7openalex-snapshot
Dictionary Techniques
inferred← citeshttps://doi.org/10.1016/b978-0-12-809474-7.00028-8openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/b978-012443895-8/50009-xopenalex-snapshot
Data Compression
inferred← citeshttps://doi.org/10.1016/j.cosrev.2011.11.001openalex-snapshot
Textual data compression in computational biology: Algorithmic techniques
inferred← citeshttps://doi.org/10.1016/s0167-6423(01)00020-xopenalex-snapshot
Polytypic data conversion programs
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80458-xopenalex-snapshot
Towards Language-Agnostic Mobile Code
inferred← citeshttps://doi.org/10.1017/s0956796812000263openalex-snapshot
Every bit counts: The binary representation of typed data and programs
inferred← citeshttps://doi.org/10.1080/00207169808804677openalex-snapshot
Ranking and unranking left szilard languages
inferred← citeshttps://doi.org/10.1093/comjnl/46.5.476openalex-snapshot
Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code
inferred← citeshttps://doi.org/10.1109/18.144710openalex-snapshot
Entropies and combinatorics of random branching processes and context-free languages
inferred← citeshttps://doi.org/10.1109/18.841160openalex-snapshot
Grammar-based codes: a new class of universal lossless source codes
inferred← citeshttps://doi.org/10.1109/5.892710openalex-snapshot
On-line and off-line heuristics for inferring hierarchies of repetitions in sequences
inferred← citeshttps://doi.org/10.1109/adc.2001.904466openalex-snapshot
Effective compression for the Web: exploiting document linkages
inferred← citeshttps://doi.org/10.1109/dcc.1991.213348openalex-snapshot
Semantic data compression
inferred← citeshttps://doi.org/10.1109/dcc.2000.838155openalex-snapshot
Prediction by grammatical match
inferred← citeshttps://doi.org/10.1109/dcc.2001.917147openalex-snapshot
Compressing XML with multiplexed hierarchical PPM models
inferred← citeshttps://doi.org/10.1109/dcc47342.2020.00093openalex-snapshot
Grammar Compression with Probabilistic Context-Free Grammar
inferred← citeshttps://doi.org/10.1109/discex.2001.932172openalex-snapshot
Project TRANSPROSE: reconciling mobile-code security with execution efficiency
inferred← citeshttps://doi.org/10.1109/fits.2003.1264941openalex-snapshot
Making mobile code both safe and efficient
inferred← citeshttps://doi.org/10.1109/isit.1998.708922openalex-snapshot
Syntax-oriented coding (SoC): a new algorithm for the compression of messages constrained by syntax rules
inferred← citeshttps://doi.org/10.1109/sfcs.2005.69openalex-snapshot
Structuring labeled trees for optimal succinctness, and beyond
inferred← citeshttps://doi.org/10.1109/spire.2001.989759openalex-snapshot
On compression of parse trees
inferred← citeshttps://doi.org/10.1109/tcbb.2007.1017openalex-snapshot
Compression of Annotated Nucleotide Sequences
inferred← citeshttps://doi.org/10.1145/263699.263763openalex-snapshot
PolyP---a polytypic programming language extension
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/378795.378827openalex-snapshot
Bytecode compression via profiled grammar rewriting
inferred← citeshttps://doi.org/10.1145/381694.378827openalex-snapshot
Bytecode compression via profiled grammar rewriting
inferred← citeshttps://doi.org/10.1145/76894.76896openalex-snapshot
Modeling for text compression
inferred← citeshttps://doi.org/10.1145/859670.859699openalex-snapshot
Grammar-based compression of interpreted code
inferred← citeshttps://doi.org/10.4018/978-1-4666-5888-2.ch351openalex-snapshot
Techniques for Specialized Data Compression
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2020.22openalex-snapshot
Using Statistical Encoding to Achieve Tree Succinctness Never Seen Before
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.