On the public citation graph

Intersections ofk-element sets

https://doi.org/10.1007/bf02579460
0 signed · 17 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.1017/cbo9780511606267openalex-snapshot
The Theory of Information and Coding

What points at this work

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

inferred← citeshttps://doi.org/10.1002/rsa.3240070305openalex-snapshot
On the independence number of sparse graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_17openalex-snapshot
Systems of Linear Equations over $\mathbb{F}_2$ and Problems Parameterized above Average
inferred← citeshttps://doi.org/10.1007/bf00992674openalex-snapshot
Lower Bound Methods and Separation Results for On-Line Learning Models
inferred← citeshttps://doi.org/10.1007/bf02228856openalex-snapshot
Exhaustive testing of almost all devices with outputs depending on limited number of inputs
inferred← citeshttps://doi.org/10.1007/bf02772959openalex-snapshot
Families of finite sets in which no set is covered by the union ofr others
inferred← citeshttps://doi.org/10.1007/s00373-016-1731-xopenalex-snapshot
Notes on use of Generalized Entropies in Counting
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90128-1openalex-snapshot
A construction for large families of k-element sets having the Erdös intersection property
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90161-5openalex-snapshot
Explicit construction of exponential sized families of k-independent sets
inferred← citeshttps://doi.org/10.1016/0097-3165(82)90004-8openalex-snapshot
Families of finite sets in which no set is covered by the union of two others
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00596-4openalex-snapshot
Kleitman and combinatorics
inferred← citeshttps://doi.org/10.1016/s0195-6698(84)80025-6openalex-snapshot
Union-free Hypergraphs and Probability Theory
inferred← citeshttps://doi.org/10.1109/sfcs.1987.20openalex-snapshot
Distributive graph algorithms Global solutions from local data
inferred← citeshttps://doi.org/10.1137/0221015openalex-snapshot
Locality in Distributed Graph Algorithms
inferred← citeshttps://doi.org/10.1145/167088.167156openalex-snapshot
Locality based graph coloring
inferred← citeshttps://doi.org/10.37236/562openalex-snapshot
Strongly Cancellative and Recovering Sets on Lattices
inferred← citeshttps://doi.org/10.37236/9336openalex-snapshot
Covering Small Subgraphs of (Hyper)Tournaments with Spanning Acyclic Subgraphs
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.