On the public citation graph

Enhanced Byte Codes with Restricted Prefix Properties

https://doi.org/10.1007/11575832_1
0 signed · 53 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/3-540-36618-0_33openalex-snapshot
An Efficient Compression Code for Text Databases
inferredcites →https://doi.org/10.1007/3-540-45452-7_5openalex-snapshot
String Matching with Stopper Encoding and Code Splitting
inferredcites →https://doi.org/10.1007/978-3-540-39984-1_10openalex-snapshot
(S,C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases
inferredcites →https://doi.org/10.1007/978-3-642-16321-0_27openalex-snapshot
Extracting Powers and Periods in a String from Its Runs Structure
inferredcites →https://doi.org/10.1109/dcc.2003.1194028openalex-snapshot
Optimal alphabet partitioning for semi-adaptive coding of sources of unknown sparse distributions
inferredcites →https://doi.org/10.1109/dcc.2003.1194030openalex-snapshot
Hybrid prefix codes for practical use
inferredcites →https://doi.org/10.1109/tit.1966.1053907openalex-snapshot
Run-length encodings (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1995.476344openalex-snapshot
Managing Gigabytes: Compressing and Indexing Documents and Images
inferredcites →https://doi.org/10.1145/1076034.1076076openalex-snapshot
Efficiently decodable and searchable natural language adaptive compression
inferredcites →https://doi.org/10.1145/348751.348754openalex-snapshot
Fast and flexible word searching on compressed text
inferredcites →https://doi.org/10.1145/564376.564416openalex-snapshot
Compression of inverted indexes For fast query evaluation

What points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.1112openalex-snapshot
Revisiting bounded context block‐sorting transformations
inferred← citeshttps://doi.org/10.1002/spe.882openalex-snapshot
New adaptive compressors for natural language text
inferred← citeshttps://doi.org/10.1002/spe.v38:13openalex-snapshot
inferred← citeshttps://doi.org/10.1007/11880561_28openalex-snapshot
Phrase-Based Pattern Matching in Compressed Text
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_84openalex-snapshot
Compressing Integer Sequences and Sets
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_84openalex-snapshot
Compressing Integer Sequences
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_31openalex-snapshot
Binary Mixed-Digit Data Compression Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-00887-0_63openalex-snapshot
Reducing Space Requirements for Disk Resident Suffix Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-04346-8_27openalex-snapshot
A Compressed Self-indexed Representation of XML Documents
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_84-2openalex-snapshot
Compressing Integer Sequences
inferred← citeshttps://doi.org/10.1007/s10559-024-00641-2openalex-snapshot
Natural-Language Text Compression Using Reverse Multi-Delimiter Codes
inferred← citeshttps://doi.org/10.1007/s10791-012-9184-1openalex-snapshot
Implicit indexing of natural language text by reorganizing bytecodes
inferred← citeshttps://doi.org/10.1016/j.dam.2013.05.028openalex-snapshot
Tight and simple Web graph compression for forward and reverse neighbor queries
inferred← citeshttps://doi.org/10.1016/j.dam.2024.03.003openalex-snapshot
Lossless text compression by means of binary-coded ternary number representation
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.07.014openalex-snapshot
ODC: Frame for definition of Dense codes
inferred← citeshttps://doi.org/10.1016/j.ipm.2014.07.002openalex-snapshot
Indexing and Self-indexing sequences of IEEE 754 double precision numbers
inferred← citeshttps://doi.org/10.1016/j.ipm.2022.103248openalex-snapshot
Efficient immediate-access dynamic indexing
inferred← citeshttps://doi.org/10.1093/comjnl/bxr096openalex-snapshot
Boosting Text Compression with Word-Based Statistical Encoding
inferred← citeshttps://doi.org/10.1109/ccp.2011.25openalex-snapshot
Natural Language Compression per Blocks
inferred← citeshttps://doi.org/10.1109/dcc.2008.14openalex-snapshot
Word-Based Statistical Compressors as Natural Language Compression Boosters
inferred← citeshttps://doi.org/10.1109/dcc47342.2020.00025openalex-snapshot
Reverse Multi-Delimiter Compression Codes
inferred← citeshttps://doi.org/10.1109/dcc52660.2022.00050openalex-snapshot
Binary-Coded Ternary Number Representation in Natural Language Text Compression
inferred← citeshttps://doi.org/10.1109/dexa.2007.118openalex-snapshot
A New Approach for Document Indexing UsingWavelet Trees
inferred← citeshttps://doi.org/10.1109/dexa.2007.13openalex-snapshot
Incrementally-Updatable Stream Processors for XPath Queries based on Merging Automata via Ordered Hash-keys
inferred← citeshttps://doi.org/10.1109/tkde.2006.99openalex-snapshot
Improved word-aligned binary compression for text indexing
inferred← citeshttps://doi.org/10.1145/1132956.1132959openalex-snapshot
Inverted files for text search engines
inferred← citeshttps://doi.org/10.1145/1390334.1390360openalex-snapshot
Reorganizing compressed text
inferred← citeshttps://doi.org/10.1145/1777432.1777433openalex-snapshot
Dynamic lightweight text compression
inferred← citeshttps://doi.org/10.1145/2094072.2094073openalex-snapshot
Word-based self-indexes for natural language text
inferred← citeshttps://doi.org/10.1145/2348283.2348317openalex-snapshot
Efficient in-memory top-k document retrieval
inferred← citeshttps://doi.org/10.1145/2629554openalex-snapshot
XXS
inferred← citeshttps://doi.org/10.1145/3007186openalex-snapshot
Inverted Treaps
inferred← citeshttps://doi.org/10.1145/3132847.3132888openalex-snapshot
ANS-Based Index Compression
inferred← citeshttps://doi.org/10.1145/3159652.3159663openalex-snapshot
Index Compression Using Byte-Aligned ANS Coding and Two-Dimensional Contexts
inferred← citeshttps://doi.org/10.1145/3289600.3290962openalex-snapshot
Fast Dictionary-Based Compression for Inverted Indexes
inferred← citeshttps://doi.org/10.1145/3415148openalex-snapshot
Techniques for Inverted Index Compression
inferred← citeshttps://doi.org/10.25439/rmt.27354450openalex-snapshot
Scalable succinct indexing for large text collections
inferred← citeshttps://doi.org/10.3390/e24030375openalex-snapshot
A Review of the Asymmetric Numeral System and Its Applications to Digital Images
inferred← citeshttps://doi.org/10.34229/kca2522-9664.24.1.1openalex-snapshot
NATURAL-LANGUAGE TEXT COMPRESSION USING REVERSE MULTI-DELIMITER CODES
inferred← citeshttps://doi.org/10.3906/elk-1410-124openalex-snapshot
A new dictionary-based preprocessor that uses radix-190 numbering
inferred← citeshttps://doi.org/10.48550/arxiv.1006.0809openalex-snapshot
Tight and simple Web graph compression
inferred← citeshttps://doi.org/10.5555/1937055.1937092openalex-snapshot
An efficient implementation of a flexible XPath extension
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.