On the public citation graph
Hat Guessing Games
0 signed · 43 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01272517openalex-snapshot
On the power of small-depth threshold circuits
inferredcites →https://doi.org/10.1016/0022-0000(92)90047-mopenalex-snapshot
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
inferredcites →https://doi.org/10.1016/j.dam.2003.07.007openalex-snapshot
Minimizing maximum indegree
inferredcites →https://doi.org/10.1016/s0166-218x(02)00462-6openalex-snapshot
On the orientation of graphs and hypergraphs
inferredcites →https://doi.org/10.1109/focs.2006.42openalex-snapshot
Index Coding with Side Information
inferredcites →https://doi.org/10.1109/focs.2007.45openalex-snapshot
Inferring Local Homology from Sampled Stratified Spaces
inferredcites →https://doi.org/10.1109/focs.2008.41openalex-snapshot
Broadcasting with Side Information
inferredcites →https://doi.org/10.1109/tit.2006.874540openalex-snapshot
Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients
inferredcites →https://doi.org/10.1109/tit.2009.2023702openalex-snapshot
Nonlinear Index Coding Outperforming the Linear Optimum
inferredcites →https://doi.org/10.1112/jlms/s1-22.2.107openalex-snapshot
The Factorization of Linear Graphs
inferredcites →https://doi.org/10.1137/0222016openalex-snapshot
Rounds in Communication Complexity Revisited
inferredcites →https://doi.org/10.1145/1008299.1008302openalex-snapshot
On the time required to recognize properties of graphs
inferredcites →https://doi.org/10.1145/800116.803747openalex-snapshot
A generalization and proof of the Aanderaa-Rosenberg conjecture
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/etep.2188openalex-snapshot
On a fair distribution of consumer's flexibility between market parties with conflicting interests
inferred← citeshttps://doi.org/10.1007/978-3-030-26176-4_28openalex-snapshot
On 1-Factorizations of Bipartite Kneser Graphs
inferred← citeshttps://doi.org/10.1007/s10623-011-9507-zopenalex-snapshot
A note on marking lines in [k] n
inferred← citeshttps://doi.org/10.1007/s10958-018-4128-yopenalex-snapshot
For Which Graphs the Sages Can Guess Correctly the Color of at Least One Hat
inferred← citeshttps://doi.org/10.1007/s10958-021-05348-9openalex-snapshot
Cliques and Constructors in “Hats” Game. I
inferred← citeshttps://doi.org/10.1007/s10958-021-05349-8openalex-snapshot
Cliques and Constructors in “Hats” Game. II
inferred← citeshttps://doi.org/10.1007/s11128-022-03451-7openalex-snapshot
Hat problem: a new strategy based on quantum stabilizer codes
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113820openalex-snapshot
Hat guessing number for the class of planar graphs is at least 22
inferred← citeshttps://doi.org/10.1016/j.jcta.2011.02.003openalex-snapshot
Hypercube orientations with only two in-degrees
inferred← citeshttps://doi.org/10.1109/allerton.2009.5394861openalex-snapshot
Decentralized team decision via coding
inferred← citeshttps://doi.org/10.1109/cdc.2010.5717470openalex-snapshot
Hat guessing games and the use of coding for decentralized control
inferred← citeshttps://doi.org/10.1109/cdc.2011.6161001openalex-snapshot
Coding strategies for a class of decentralized control problems with limited communication
inferred← citeshttps://doi.org/10.1109/tg.2020.3009359openalex-snapshot
Operationalizing Intentionality to Play Hanabi With Human Players
inferred← citeshttps://doi.org/10.1137/22m1479154openalex-snapshot
Hat Guessing Numbers of Strongly Degenerate Graphs
inferred← citeshttps://doi.org/10.1145/3406499.3415086openalex-snapshot
Concordance of Risk Tendency Increases User's Satisfaction
inferred← citeshttps://doi.org/10.1145/3744715.3744721openalex-snapshot
Guest Column: PAC Learning is just Bipartite Matching (Sort of)
inferred← citeshttps://doi.org/10.3389/frobt.2021.658348openalex-snapshot
Emergence of Cooperative Impression With Self-Estimation, Thinking Time, and Concordance of Risk Sensitivity in Playing Hanabi
inferred← citeshttps://doi.org/10.3390/math10244703openalex-snapshot
Latin Matchings and Ordered Designs OD(n−1, n, 2n−1)
inferred← citeshttps://doi.org/10.37236/9851openalex-snapshot
Guessing Numbers and Extremal Graph Theory
inferred← citeshttps://doi.org/10.4169/math.mag.88.5.323openalex-snapshot
How to Make the Perfect Fireworks Display: Two Strategies for Hanabi
inferred← citeshttps://doi.org/10.48550/arxiv.1007.2311openalex-snapshot
Hypercube orientations with only two in-degrees
inferred← citeshttps://doi.org/10.48550/arxiv.2004.09605openalex-snapshot
Cliques and constructors in "Hats'"game
inferred← citeshttps://doi.org/10.65109/bdaz3089openalex-snapshot
Cooperation via Codes in Restricted Hat Guessing Games
inferred← citeshttps://doi.org/10.70675/09efd050z2221z47c2z96e9zb50278b8e5acopenalex-snapshot
Simulations intrinsèques et complexités dans les réseaux d'automates
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.