On the public citation graph

Computing boolean functions on anonymous networks

0 signed · 34 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/0-387-32792-4openalex-snapshot
Non-negative Matrices and Markov Chains
inferredcites →https://doi.org/10.1007/3-540-51687-5_42openalex-snapshot
Simple and efficient election algorithms for anonymous networks
inferredcites →https://doi.org/10.1007/bf01048273openalex-snapshot
Bounds on the cover time
inferredcites →https://doi.org/10.1007/bf01371410openalex-snapshot
Automorphism groups of graphs
inferredcites →https://doi.org/10.1007/bfb0019812openalex-snapshot
Randomized function evaluation on a ring
inferredcites →https://doi.org/10.1007/bfb0028993openalex-snapshot
Distributed computing on transitive networks: The torus
inferredcites →https://doi.org/10.1007/bfb0032037openalex-snapshot
Computing boolean functions on anonymous networks
inferredcites →https://doi.org/10.1016/0024-3795(81)90003-3openalex-snapshot
Bounds for eigenvalues of certain stochastic matrices
inferredcites →https://doi.org/10.1016/0196-6774(91)90002-gopenalex-snapshot
Better computing on the anonymous ring
inferredcites →https://doi.org/10.1017/cbo9780511608704openalex-snapshot
Algebraic Graph Theory
inferredcites →https://doi.org/10.1109/sct.1989.41803openalex-snapshot
Boolean functions, invariance groups and parallel complexity
inferredcites →https://doi.org/10.1109/sfcs.1987.60openalex-snapshot
Two lower bounds in asynchronous distributed computation
inferredcites →https://doi.org/10.1137/0111059openalex-snapshot
The Number of Transitivity Sets of Boolean Functions
inferredcites →https://doi.org/10.1145/10590.10602openalex-snapshot
Gap theorems for distributed computing
inferredcites →https://doi.org/10.1145/1634.1889openalex-snapshot
Lower Bounds for Distributed Maximum-Finding Algorithms
inferredcites →https://doi.org/10.1145/323596.323614openalex-snapshot
Computing on an anonymous ring
inferredcites →https://doi.org/10.1145/62546.62568openalex-snapshot
Computing on an anonymous network
inferredcites →https://doi.org/10.1145/72981.73004openalex-snapshot
Calling names in nameless networks
inferredcites →https://doi.org/10.1145/73007.73063openalex-snapshot
On the second eigenvalue of random regular graphs
inferredcites →https://doi.org/10.1145/800141.804655openalex-snapshot
Local and global properties in networks of processors (Extended Abstract)

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11945529_27openalex-snapshot
Computing on a Partially Eponymous Ring
inferred← citeshttps://doi.org/10.1007/bf01192691openalex-snapshot
Computing functions on asynchronous anonymous networks
inferred← citeshttps://doi.org/10.1007/s002240000081openalex-snapshot
Computing functions on asynchronous anonymous networks
inferred← citeshttps://doi.org/10.1016/0166-218x(93)e0133-jopenalex-snapshot
Universal covers of graphs: Isomorphism to depth n − 1 implies isomorphism to all depths
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115397openalex-snapshot
Minimum algorithm sizes for the gathering and related problems of autonomous mobile robots
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00051-1openalex-snapshot
Symmetries and sense of direction in labeled graphs
inferred← citeshttps://doi.org/10.1109/71.481599openalex-snapshot
Computing on anonymous networks. I. Characterizing the solvable cases
inferred← citeshttps://doi.org/10.1109/allerton.2009.5394487openalex-snapshot
Distributed anonymous function computation in information fusion and multiagent systems
inferred← citeshttps://doi.org/10.1109/spdp.1991.218191openalex-snapshot
Distributed computing on anonymous hypercube networks
inferred← citeshttps://doi.org/10.1109/tac.2011.2163874openalex-snapshot
Distributed Anonymous Discrete Function Computation
inferred← citeshttps://doi.org/10.4086/cjtcs.2014.010openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.1004.2102openalex-snapshot
Distributed anonymous discrete function computation
inferred← citeshttps://doi.org/10.48550/arxiv.1009.6036openalex-snapshot
Efficient Information Aggregation Strategies for Distributed Control and Signal Processing
showing the first 13 of 14 · page through all 14
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.