On the public citation graph

Multicast tree construction in bus-based networks

0 signed · 58 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/978-3-642-46604-5_13openalex-snapshot
Distributed Transaction Processing and The Camelot System
inferredcites →https://doi.org/10.1007/978-3-7091-2301-0_3openalex-snapshot
Graphen und Matrizen
inferredcites →https://doi.org/10.1007/bf00288961openalex-snapshot
A fast algorithm for Steiner trees
inferredcites →https://doi.org/10.1016/0141-9331(86)90194-8openalex-snapshot
The Locus distributed system architecture
inferredcites →https://doi.org/10.1016/0165-6074(87)90155-4openalex-snapshot
Distributed operating systems: Theory and practice
inferredcites →https://doi.org/10.1016/0196-6774(81)90020-1openalex-snapshot
A linear-time approximation algorithm for the weighted vertex cover problem
inferredcites →https://doi.org/10.1016/0377-0427(93)90083-nopenalex-snapshot
Department of Computer Science
inferredcites →https://doi.org/10.1016/0743-7315(84)90002-9openalex-snapshot
Flux, sorting, and supercomputer organization for AI applications
inferredcites →https://doi.org/10.1016/s0196-8858(82)80004-3openalex-snapshot
The steiner problem in phylogeny is NP-complete
inferredcites →https://doi.org/10.1049/ip-e.1987.0050openalex-snapshot
Performance evaluation of spanning multiaccess channel hypercube interconnection network
inferredcites →https://doi.org/10.1109/65.3239openalex-snapshot
Bridges and routers
inferredcites →https://doi.org/10.1109/cns.1988.5006openalex-snapshot
Multicast routing in bus-based computer networks
inferredcites →https://doi.org/10.1109/ftcs.1988.5342openalex-snapshot
Minimum fault coverage in reconfigurable arrays
inferredcites →https://doi.org/10.1109/jsac.1983.1145994openalex-snapshot
Multichannel Local Area Network Protocols
inferredcites →https://doi.org/10.1109/mc.1984.1659029openalex-snapshot
An Autonomous, Decentralized Control System for Factory Automation
inferredcites →https://doi.org/10.1109/mc.1984.1659181openalex-snapshot
Guest Editors' Introduction: Effect of Hardware-Software Interaction on System Performance
inferredcites →https://doi.org/10.1109/milcom.1987.4795277openalex-snapshot
Multidestination Protocols for Tactical Radio Networks
inferredcites →https://doi.org/10.1109/ms.1985.230701openalex-snapshot
Multicast Communication on Network Computers
inferredcites →https://doi.org/10.1109/pccc.1989.37381openalex-snapshot
Multicast tree construction in bus-based networks
inferredcites →https://doi.org/10.1109/pccc.1995.472521openalex-snapshot
Proceedings International Phoenix Conference on Computers and Communications
inferredcites →https://doi.org/10.1109/proc.1987.13701openalex-snapshot
Issues in packet radio network design
inferredcites →https://doi.org/10.1109/proc.1987.13707openalex-snapshot
Future directions in packet radio architectures and protocols
inferredcites →https://doi.org/10.1109/tc.1981.1675774openalex-snapshot
Communication Structures for Large Networks of Microcomputers
inferredcites →https://doi.org/10.1109/tc.1984.1676437openalex-snapshot
Generalized Hypercube and Hyperbus Structures for a Computer Network
inferredcites →https://doi.org/10.1109/tc.1987.1676861openalex-snapshot
Tree-Based Broadcasting in Multihop Radio Networks
inferredcites →https://doi.org/10.1137/0132071openalex-snapshot
The Rectilinear Steiner Tree Problem is $NP$-Complete
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1145/1013812.18188openalex-snapshot
An architecture for a multimedia teleconferencing system
inferredcites →https://doi.org/10.1145/12130.12144openalex-snapshot
A new approach to the maximum flow problem
inferredcites →https://doi.org/10.1145/18172.18188openalex-snapshot
An architecture for a multimedia teleconferencing system
inferredcites →https://doi.org/10.1145/214419.214422openalex-snapshot
The integration of virtual memory management and interprocess communication in Accent
inferredcites →https://doi.org/10.1145/62297.62384openalex-snapshot
Distributed multi-destination routing in hypercube multiprocessors
inferredcites →https://doi.org/10.1145/633625.52428openalex-snapshot
The architecture of a Linda coprocessor
inferredcites →https://doi.org/10.1145/633625.52447openalex-snapshot
The Wisconsin multicube: a new large-scale cache-coherent multiprocessor
inferredcites →https://doi.org/10.1145/63404.63406openalex-snapshot
Decentralizing a global naming service for improved performance and fault tolerance
inferredcites →https://doi.org/10.1145/639624.802060openalex-snapshot
Datagram routing for internet multicasting
inferredcites →https://doi.org/10.1145/75246.75264openalex-snapshot
Group communication in multichannel networks with staircase interconnection topologies
inferredcites →https://doi.org/10.1145/800056.802060openalex-snapshot
Datagram routing for internet multicasting
inferredcites →https://doi.org/10.1287/moor.4.3.233openalex-snapshot
A Greedy Heuristic for the Set-Covering Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jpdc.1994.1151openalex-snapshot
Fault-Tolerant Multicasting on Hypercubes
inferred← citeshttps://doi.org/10.1007/978-3-540-36668-3_55openalex-snapshot
Large Quantity of Text Classification Based on the Improved Feature-Line Method
inferred← citeshttps://doi.org/10.1007/978-3-642-19853-3_16openalex-snapshot
Research on the Text Length’s Effect of the Text Similarity Measurement
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00012-3openalex-snapshot
Linear time optimization algorithms for P4-sparse graphs
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50016-4openalex-snapshot
Key references in distributed computer systems 1959–1989
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00085-1openalex-snapshot
A fast parallel algorithm to recognize P4-sparse graphs
inferred← citeshttps://doi.org/10.1016/s0360-8352(98)00101-6openalex-snapshot
A deadlock detection interface to a commercial simulation language
inferred← citeshttps://doi.org/10.1109/32.263751openalex-snapshot
Flow control for limited buffer multicast
inferred← citeshttps://doi.org/10.1109/4434.736426openalex-snapshot
Building a multicasting tree in a high-speed network
inferred← citeshttps://doi.org/10.1109/71.246072openalex-snapshot
Multicast communication in multicomputer networks
inferred← citeshttps://doi.org/10.1109/71.689441openalex-snapshot
Resource deadlocks and performance of wormhole multicast routing algorithms
inferred← citeshttps://doi.org/10.1109/88.345959openalex-snapshot
Communication issues in parallel computing across ATM networks
inferred← citeshttps://doi.org/10.1109/90.251893openalex-snapshot
A name model for nested group communication
inferred← citeshttps://doi.org/10.1109/hpc.1997.592155openalex-snapshot
Some heuristics and experiments for building a multicasting tree in a high-speed network
inferred← citeshttps://doi.org/10.1109/ipps.1996.508087openalex-snapshot
ECO: Efficient Collective Operations for communication on heterogeneous networks
inferred← citeshttps://doi.org/10.1109/pccc.1991.113856openalex-snapshot
Lightwave multichannel networks with grid-based topologies
inferred← citeshttps://doi.org/10.1109/real.2004.24openalex-snapshot
Hard Real-Time Communication in Bus-Based Networks
inferred← citeshttps://doi.org/10.1109/spdp.1990.143498openalex-snapshot
On the parallel recognition of some tree-representable graphs
inferred← citeshttps://doi.org/10.1109/spdp.1994.346103openalex-snapshot
On multicast wormhole routing in multicomputer networks
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.