On the public citation graph

Compendious and Optimized Succinct Data Structures for Big Data Store

0 signed · 24 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-62034-6_35openalex-extracted

Tables

inferredcites →https://doi.org/10.1007/s00453-004-1146-6openalex-extracted

Representing Trees of Higher Degree

inferredcites →https://doi.org/10.1016/j.ic.2016.06.009openalex-extracted

CNF and DNF succinct graph encodings

inferredcites →https://doi.org/10.1016/j.ipl.2017.10.001openalex-extracted

Succinct data structures for nearest colored node in a tree

inferredcites →https://doi.org/10.1016/j.jda.2015.10.004openalex-extracted

GLOUDS: Representing tree-like graphs

inferredcites →https://doi.org/10.1016/j.jda.2016.09.002openalex-extracted

Improved Range Minimum Queries

inferredcites →https://doi.org/10.1016/j.jda.2016.10.002openalex-extracted

A succinct data structure for self-indexing ternary relations

inferredcites →https://doi.org/10.1016/j.jda.2016.12.001openalex-extracted

A space efficient direct access data structure

inferredcites →https://doi.org/10.1016/j.jda.2017.04.002openalex-extracted

Preface – Compact Data Structures

inferredcites →https://doi.org/10.1016/j.tcs.2007.07.042openalex-extracted

Compressed data structures: Dictionaries and data-aware measures

inferredcites →https://doi.org/10.1016/j.tcs.2013.09.031openalex-extracted

Succinct encoding of arbitrary graphs

inferredcites →https://doi.org/10.1016/j.tcs.2015.12.028openalex-extracted

Succinctness and tractability of closure operator representations

inferredcites →https://doi.org/10.1016/j.tcs.2016.04.031openalex-extracted

Simple and efficient fully-functional succinct trees

inferredcites →https://doi.org/10.1109/dcc.2006.12openalex-extracted

Compressed Data Structures: Dictionaries and Data-Aware Measures

inferredcites →https://doi.org/10.1109/sfcs.1989.63533openalex-extracted

Space-efficient static trees and graphs

inferredcites →https://doi.org/10.1145/1052796.1052804openalex-extracted

Guest Column: NP-complete problems and physical reality

inferredcites →https://doi.org/10.1145/1198513.1198516openalex-extracted

Succinct ordinal trees with level-ancestor queries

inferredcites →https://doi.org/10.1561/0400000002openalex-extracted

Data Streams: Algorithms and Applications

inferredcites →https://doi.org/10.1561/9781933019604openalex-extracted

Data Streams: Algorithms and Applications

inferredcites →https://doi.org/10.48550/arxiv.1106.3767openalex-extracted

Rewriting Ontological Queries into Small Nonrecursive Datalog Programs

inferredcites →https://doi.org/10.5555/644108.644250openalex-extracted

High-order entropy-compressed text indexes

inferredcites →https://doi.org/10.5555/982792.982812openalex-extracted

Who says you have to look at the input?: the brave new world of sublinear computing

inferredcites →https://doi.org/10.7287/peerj.preprints.1947v1/supp-1openalex-extracted

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-981-15-1275-9_37openalex-snapshot

Compendious and Succinct Data Structures for Big Data

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.