On the public citation graph

Random Closed Sets

0 signed · 16 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/bf01203155openalex-snapshot
Grundlagen der Wahrscheinlichkeitsrechnung
inferredcites →https://doi.org/10.1016/0304-3975(76)90005-0openalex-snapshot
Information-theoretic characterizations of recursive infinite strings
inferredcites →https://doi.org/10.1016/s0019-9958(66)80018-9openalex-snapshot
The definition of random sequences
inferredcites →https://doi.org/10.1016/s0049-237x(98)80046-3openalex-snapshot
Chapter 13 Π10 classes in mathematics
inferredcites →https://doi.org/10.1142/5186openalex-snapshot
Proceedings of the 7th and 8th Asian Logic Conferences

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-540-73001-9_14openalex-snapshot
K-Trivial Closed Sets and Continuous Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_12openalex-snapshot
Immunity for Closed Sets
inferred← citeshttps://doi.org/10.1007/s00153-007-0060-4openalex-snapshot
Algorithmic randomness of continuous functions
inferred← citeshttps://doi.org/10.1007/s00224-012-9416-1openalex-snapshot
Effective Randomness of Unions and Intersections
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.08.016openalex-snapshot
Random Continuous Functions
inferred← citeshttps://doi.org/10.1016/j.ic.2008.12.009openalex-snapshot
Computability of probability measures and Martin-Löf randomness over metric spaces
inferred← citeshttps://doi.org/10.1093/logcom/exm033openalex-snapshot
Algorithmic Randomness of Closed Sets
inferred← citeshttps://doi.org/10.1093/logcom/exn021openalex-snapshot
K-Triviality of Closed Sets and Continuous Functions
inferred← citeshttps://doi.org/10.2168/lmcs-7(3:16)2011openalex-snapshot
Algorithmic Randomness and Capacity of Closed Sets
inferred← citeshttps://doi.org/10.32513/tbilisi/1528768843openalex-snapshot
Immunity and Non-Cupping for Closed Sets
inferred← citeshttps://doi.org/10.3990/1.9789061643289openalex-snapshot
Random sets to model uncertainty in remotely sensed objects
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.