On the public citation graph
On the use of synchronizers for asynchronous communication networks
0 signed · 25 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.1002/net.3230150404openalex-snapshot
Reducing complexities of the distributed max‐flow and breadth‐first‐search algorithms by means of network synchronization
inferredcites →https://doi.org/10.1007/3-540-18088-5_29openalex-snapshot
Guessing games and distributed computations in synchronous networks
inferredcites →https://doi.org/10.1007/bfb0024003openalex-snapshot
A single source shortest path algorithm for a planar distributed network
inferredcites →https://doi.org/10.1016/0020-0190(87)90228-6openalex-snapshot
A time-optimal message-efficient distributed algorithm for depth-first-search
inferredcites →https://doi.org/10.1109/milcom.1986.4805648openalex-snapshot
Perspectives on Distributed Network Protocols: A Case for Building Blocks
inferredcites →https://doi.org/10.1109/tit.1983.1056620openalex-snapshot
Distributed network protocols
inferredcites →https://doi.org/10.1109/tit.1987.1057314openalex-snapshot
A new distributed algorithm to find breadth first search trees
inferredcites →https://doi.org/10.1109/tse.1982.235573openalex-snapshot
Echo Algorithms: Depth Parallel Operations on General Graphs
inferredcites →https://doi.org/10.1145/358690.358717openalex-snapshot
Distributed computation on graphs
inferredcites →https://doi.org/10.1145/4221.4227openalex-snapshot
Complexity of network synchronization
inferredcites →https://doi.org/10.1145/579.585openalex-snapshot
Distributed algorithms for finding centers and medians in networks
inferredcites →https://doi.org/10.21236/ada117808openalex-snapshot
Distributed Minimum Hop Algorithms
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-50403-6_50openalex-snapshot
Optimal synchronization of ABD networks
inferred← citeshttps://doi.org/10.1007/978-3-642-38123-2_9openalex-snapshot
Simulating Synchrony on Top of Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/bfb0020436openalex-snapshot
Low complexity network synchronization
inferred← citeshttps://doi.org/10.1016/0166-3615(95)00005-oopenalex-snapshot
Simulating fieldbus applications with drugh simulator
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00022-gopenalex-snapshot
Hyper-ring connection machines
inferred← citeshttps://doi.org/10.1109/32.24713openalex-snapshot
An efficient distributed protocol for finding shortest paths in networks with negative weights
inferred← citeshttps://doi.org/10.1109/apads.1993.588733openalex-snapshot
Implementing synchronous network model on a FIP network
inferred← citeshttps://doi.org/10.1109/fscs.1990.89572openalex-snapshot
Network synchronization with polylogarithmic overhead
inferred← citeshttps://doi.org/10.1109/icdcs.1994.302420openalex-snapshot
A synchronizer with low memory overhead
inferred← citeshttps://doi.org/10.1109/wfcs.1995.482692openalex-snapshot
On the necessary real-time conditions for the producer-distributor-consumer model
inferred← citeshttps://doi.org/10.1145/129712.129767openalex-snapshot
Adapting to asynchronous dynamic networks (extended abstract)
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.