On the public citation graph

Almost-Optimal Gossip-Based Aggregate Computation

0 signed · 46 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/3-540-45518-3_18openalex-snapshot
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
inferredcites →https://doi.org/10.1007/978-3-642-14162-1_10openalex-snapshot
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
inferredcites →https://doi.org/10.1007/978-3-642-14162-1_11openalex-snapshot
Efficient Information Exchange in the Random Phone-Call Model
inferredcites →https://doi.org/10.1007/s00453-007-9029-2openalex-snapshot
Choosing a Random Peer in Chord
inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1109/icdcsw.2002.1030829openalex-snapshot
The impact of data aggregation in wireless sensor networks
inferredcites →https://doi.org/10.1109/mobhoc.2006.278671openalex-snapshot
Smart Gossip: An Adaptive Gossip-based Broadcasting Service for Sensor Networks
inferredcites →https://doi.org/10.1109/sfcs.2000.892324openalex-snapshot
Randomized rumor spreading
inferredcites →https://doi.org/10.1109/sfcs.2003.1238221openalex-snapshot
Gossip-based computation of aggregate information
inferredcites →https://doi.org/10.1109/tit.2006.874516openalex-snapshot
Randomized gossip algorithms
inferredcites →https://doi.org/10.1109/tpds.2006.128openalex-snapshot
Robust Computation of Aggregates in Wireless Sensor Networks: Distributed Randomized Algorithms and Analysis
inferredcites →https://doi.org/10.1109/tpds.2008.40openalex-snapshot
Analysis of Distributed Random Grouping for Aggregate Computation on Wireless Sensor Networks with Randomly Changing Graphs
inferredcites →https://doi.org/10.1137/0147013openalex-snapshot
On Spreading a Rumor
inferredcites →https://doi.org/10.1137/1.9780898719772openalex-snapshot
Distributed Computing: A Locality-Sensitive Approach
inferredcites →https://doi.org/10.1137/s0097539793250767openalex-snapshot
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
inferredcites →https://doi.org/10.1145/1031495.1031524openalex-snapshot
Medians and beyond
inferredcites →https://doi.org/10.1145/1031495.1031525openalex-snapshot
Synopsis diffusion for robust aggregation in sensor networks
inferredcites →https://doi.org/10.1145/1073814.1073828openalex-snapshot
Efficient lookup on unstructured topologies
inferredcites →https://doi.org/10.1145/1082469.1082470openalex-snapshot
Gossip-based aggregation in large dynamic networks
inferredcites →https://doi.org/10.1145/1127777.1127791openalex-snapshot
Geographic gossip
inferredcites →https://doi.org/10.1145/1142351.1142395openalex-snapshot
Efficient gossip-based aggregate computation
inferredcites →https://doi.org/10.1145/1146381.1146401openalex-snapshot
Computing separable functions via gossip
inferredcites →https://doi.org/10.1145/1151374.1151386openalex-snapshot
Random walk based node sampling in self-organizing networks
inferredcites →https://doi.org/10.1145/1236360.1236413openalex-snapshot
Hierarchical spatial gossip for multi-resolution representations in sensor networks
inferredcites →https://doi.org/10.1145/1236360.1236414openalex-snapshot
Sparse data aggregation in sensor networks
inferredcites →https://doi.org/10.1145/1400751.1400837openalex-snapshot
Gossip-based aggregate computation
inferredcites →https://doi.org/10.1145/383059.383071openalex-snapshot
Chord
inferredcites →https://doi.org/10.1145/41840.41841openalex-snapshot
Epidemic algorithms for replicated database maintenance
inferredcites →https://doi.org/10.1145/844128.844142openalex-snapshot
TAG

What points at this work

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

inferred← citeshttps://doi.org/10.1002/rsa.20621openalex-snapshot
Discovery Through Gossip
inferred← citeshttps://doi.org/10.1007/978-3-030-91014-3_6openalex-snapshot
Weak Amnesiac Flooding of Multiple Messages
inferred← citeshttps://doi.org/10.1007/s11071-022-07889-3openalex-snapshot
Design of active network filters as hysteretic sensors
inferred← citeshttps://doi.org/10.1109/et2ecn.2014.7044964openalex-snapshot
Consensus achievement in multiagent system using adapted firefly algorithm
inferred← citeshttps://doi.org/10.1109/ipdps.2015.32openalex-snapshot
On the Influence of Graph Density on Randomized Gossiping
inferred← citeshttps://doi.org/10.1109/ispdc52870.2021.9521629openalex-snapshot
Weak Amnesiac Flooding
inferred← citeshttps://doi.org/10.1145/2486159.2486197openalex-snapshot
Coalescing-branching random walks on graphs
inferred← citeshttps://doi.org/10.1145/2817830openalex-snapshot
Coalescing-Branching Random Walks on Graphs
inferred← citeshttps://doi.org/10.1145/2935764.2935785openalex-snapshot
Fast Distributed Algorithms for Connectivity and MST in Large Graphs
inferred← citeshttps://doi.org/10.1145/2935764.2935791openalex-snapshot
Better Bounds for Coalescing-Branching Random Walks
inferred← citeshttps://doi.org/10.1145/3209688openalex-snapshot
Better Bounds for Coalescing-Branching Random Walks
inferred← citeshttps://doi.org/10.1145/3209689openalex-snapshot
Fast Distributed Algorithms for Connectivity and MST in Large Graphs
inferred← citeshttps://doi.org/10.1145/3212734.3212770openalex-snapshot
Optimal Gossip Algorithms for Exact and Approximate Quantile Computations
inferred← citeshttps://doi.org/10.1145/3491003.3491011openalex-snapshot
Distributed Algorithms for Connectivity and MST in Large Graphs with Efficient Local Computation
inferred← citeshttps://doi.org/10.4230/lipics.disc.2019.33openalex-snapshot
Distributed Data Summarization in Well-Connected Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1503.02353openalex-snapshot
Fast Distributed Algorithms for Connectivity and MST in Large Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1603.06109openalex-snapshot
Better bounds for coalescing-branching random walks
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.