On the public citation graph

A highly asynchronous minimum spanning tree protocol

https://doi.org/10.1007/bf02242717
0 signed · 26 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.1109/sfcs.1985.7openalex-snapshot
An almost linear time and O(nlogn+e) Messages distributed algorithm for minimum-weight spanning trees
inferredcites →https://doi.org/10.1145/28395.28421openalex-snapshot
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems
inferredcites →https://doi.org/10.1145/323596.323612openalex-snapshot
Improvements in the time complexity of two message-optimal election algorithms
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/800057.808719openalex-snapshot
The impact of synchronous communication on the problem of electing a leader in a ring

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-61422-2_136openalex-snapshot
Optimal cost-sensitive distributed minimum spanning tree algorithm
inferred← citeshttps://doi.org/10.1007/3-540-61769-8_15openalex-snapshot
Maintaining a dynamic set of processors in a distributed system
inferred← citeshttps://doi.org/10.1007/978-1-4613-0255-1_10openalex-snapshot
Steiner Tree Based Distributed Multicast Routing in Networks
inferred← citeshttps://doi.org/10.1007/s00446-004-0107-2openalex-snapshot
A linear-time optimal-message distributed algorithm for minimum spanning trees
inferred← citeshttps://doi.org/10.1007/s00446-020-00387-yopenalex-snapshot
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model
inferred← citeshttps://doi.org/10.1007/s11036-009-0152-yopenalex-snapshot
Safe and Distributed Kinodynamic Replanning for Vehicular Networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2012.01.002openalex-snapshot
Topology control strategies on P2P live video streaming service with peer churning
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.11.006openalex-snapshot
Latency, capacity, and distributed minimum spanning trees
inferred← citeshttps://doi.org/10.1109/icdcs47774.2020.00055openalex-snapshot
Latency, Capacity, and Distributed Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1109/icpads.1996.517551openalex-snapshot
What features really make distributed minimum spanning tree algorithms efficient?
inferred← citeshttps://doi.org/10.1109/infcom.2004.1354512openalex-snapshot
Overlay mesh construction using interleaved spanning trees
inferred← citeshttps://doi.org/10.1109/mahss.2005.1542821openalex-snapshot
Resource allocation using multiple edgesharing multicast trees
inferred← citeshttps://doi.org/10.1109/tvt.2007.913183openalex-snapshot
Resource Allocation Using Multiple Edge-Sharing Multicast Trees
inferred← citeshttps://doi.org/10.1145/224964.225474openalex-snapshot
Optimal distributed algorithm for minimum spanning trees revisited
inferred← citeshttps://doi.org/10.1145/3087801.3087823openalex-snapshot
A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities
inferred← citeshttps://doi.org/10.1145/3380546openalex-snapshot
A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities
inferred← citeshttps://doi.org/10.2991/csic-15.2015.47openalex-snapshot
A Novel Efficient SDN Based Broadcast Scheme
inferred← citeshttps://doi.org/10.2991/icca-16.2016.16openalex-snapshot
A Novel Efficient Host Detecting Scheme in SDN
inferred← citeshttps://doi.org/10.4108/icst.robocomm2007.2087openalex-snapshot
A Distributed Protocol for Safe Real-Time Planning of Communicating Vehicles with Second-Order Dynamics
inferred← citeshttps://doi.org/10.48550/arxiv.1902.08979openalex-snapshot
Latency, Capacity, and Distributed MST
inferred← citeshttps://doi.org/10.5555/1377868.1377880openalex-snapshot
A distributed protocol for safe real-time planning of communicating vehicles with second-order dynamics
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.