On the public citation graph

Gossiping and broadcasting versus computing functions in networks

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.

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.1002/net.3230180205openalex-snapshot

Generalizations of broadcasting and gossiping

inferredcites →https://doi.org/10.1002/net.3230180406openalex-snapshot

A survey of gossiping and broadcasting in communication networks

inferredcites →https://doi.org/10.1007/978-1-4757-2491-2_5openalex-snapshot

Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping)

inferredcites →https://doi.org/10.1007/978-3-642-46908-4_52openalex-snapshot

Quick Gossiping by Multi-Telegraphs

inferredcites →https://doi.org/10.1007/bf01908630openalex-snapshot

Optimal algorithms for dissemination of information in some interconnection networks

inferredcites →https://doi.org/10.1007/bfb0020419openalex-snapshot

Distributed Algorithms: 8th International Workshop, Wdag'1994 Terschelling, the Netherlands September 29-October 1, 1994 : Proceedings

inferredcites →https://doi.org/10.1016/0166-218x(93)90180-vopenalex-snapshot

Fast information sharing in a complete network

inferredcites →https://doi.org/10.1016/0166-218x(94)90180-5openalex-snapshot

Methods and problems of communication in usual networks

inferredcites →https://doi.org/10.1016/0166-218x(94)90184-8openalex-snapshot

Broadcasting in butterfly and deBruijn networks

inferredcites →https://doi.org/10.1016/0304-3975(86)90083-6openalex-snapshot

Properties of complexity measures for PRAMs and WRAMs

inferredcites →https://doi.org/10.1016/0304-3975(96)00032-1openalex-snapshot

Exploiting storage redundancy to speed up randomized shared memory simulations

inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot

Parallel Algorithms for Shared-Memory Machines

inferredcites →https://doi.org/10.1016/s0022-0000(05)80003-0openalex-snapshot

Exact lower time bounds for computing Boolean functions on CREW PRAMs

inferredcites →https://doi.org/10.1016/s0304-3975(97)00199-0openalex-snapshot

ERCW PRAMs and optical communication

inferredcites →https://doi.org/10.1137/0214024openalex-snapshot

Trade-Offs between Depth and Width in Parallel Computation

inferredcites →https://doi.org/10.1137/0215006openalex-snapshot

Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes

inferredcites →https://doi.org/10.1137/0220062openalex-snapshot

CREW PRAM s and Decision Trees

inferredcites →https://doi.org/10.1137/0221010openalex-snapshot

Gossiping in Minimal Time

inferredcites →https://doi.org/10.1137/s0097539790192672openalex-snapshot

Parallel Information Dissemination by Packets

inferredcites →https://doi.org/10.1137/s0097539791224285openalex-snapshot

Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines

inferredcites →https://doi.org/10.1137/s0097539793259483openalex-snapshot

Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers

inferredcites →https://doi.org/10.1137/s0097539795290507openalex-snapshot

An Optical Simulation of Shared Memory

inferredcites →https://doi.org/10.1142/s0129626493000046openalex-snapshot

AN OPTIMAL ALGORITHM FOR COMPUTING CENSUS FUNCTIONS IN MESSAGE-PASSING SYSTEMS

inferredcites →https://doi.org/10.1142/s012962649300037xopenalex-snapshot

EFFICIENT GLOBAL COMBINE OPERATIONS IN MULTI-PORT MESSAGE-PASSING SYSTEMS

inferredcites →https://doi.org/10.1142/s012962649400017xopenalex-snapshot

INFORMATION BROADCASTING BY EXCLUSIVE-READ PRAMS

inferredcites →https://doi.org/10.1145/165231.165246openalex-snapshot

Simple, efficient shared memory simulations

inferredcites →https://doi.org/10.1145/165231.166108openalex-snapshot

A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer

inferredcites →https://doi.org/10.1145/181014.181406openalex-snapshot

An optical simulation of shared memory

inferredcites →https://doi.org/10.1145/72935.72969openalex-snapshot

On the number of rounds necessary to disseminate information

inferredcites →https://doi.org/10.1145/97444.97678openalex-snapshot

Exact time bounds for computing boolean functions on PRAMs without simultaneous writes

What points at this work

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

inferred← citeshttps://doi.org/10.1002/nem.1875openalex-snapshot

A survey and performance evaluation of decentralized aggregation schemes for autonomic management

inferred← citeshttps://doi.org/10.1002/net.20270openalex-snapshot

A linear algorithm for finding the k‐broadcast center of a tree

inferred← citeshttps://doi.org/10.1007/978-3-642-05006-0_10openalex-snapshot

Decentralized Aggregation Protocols in Peer-to-Peer Networks: A Survey

inferred← citeshttps://doi.org/10.1007/978-3-642-21484-4_17openalex-snapshot

Impact of Dynamics on Situated and Global Aggregation Schemes

inferred← citeshttps://doi.org/10.1007/s10489-021-02793-6openalex-snapshot

Intelligent neighbor selection for efficient query routing in unstructured P2P networks using Q-learning

inferred← citeshttps://doi.org/10.1109/inm.2011.5990525openalex-snapshot

Situated vs. global aggregation schemes for autonomous management systems

inferred← citeshttps://doi.org/10.1109/tmc.2019.2940025openalex-snapshot

Throughput-Optimal Broadcast in Wireless Networks with Point-to-Multipoint Transmissions

inferred← citeshttps://doi.org/10.1145/3084041.3084064openalex-snapshot

Throughput-Optimal Broadcast in Wireless Networks with Point-to-Multipoint Transmissions

inferred← citeshttps://doi.org/10.1155/2011/428290openalex-snapshot

Performance Evaluation of Some Distributed Averaging Algorithms for Sensor Networks

inferred← citeshttps://doi.org/10.32604/cmc.2022.021941openalex-snapshot

Deep Q-Learning Based Optimal Query Routing Approach for Unstructured P2P Network

inferred← citeshttps://doi.org/10.3390/fi11120253openalex-snapshot

Reinforcement Learning Based Query Routing Approach for P2P Systems

inferred← citeshttps://doi.org/10.5220/0006583601840191openalex-snapshot

Area Protection in Adversarial Path-finding Scenarios with Multiple Mobile Agents on Graphs - A Theoretical and Experimental Study of Strategies for Defense Coordination

inferred← citeshttps://doi.org/10.5281/zenodo.202266openalex-snapshot

FIGURE 5 in Pele ramseyi, a new genus and new species of anchialine swimming crab (Crustacea: Brachyura: Portunidae) from the Hawaiian Islands

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.