Gossip-based computation of aggregate information
The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Abstract
Over the last decade, we have seen a revolution in connectivity between computers, and a resulting paradigm shift from centralized to highly distributed systems. With massive scale also comes massive instability, as node and link failures become the norm rather than the exception. For such highly volatile systems, decentralized gossip-based protocols are emerging as an approach to maintaining simplicity and scalability while achieving fault-tolerant information dissemination. In this paper, we study the problem of computing aggregates with gossip-style protocols. Our first contribution is an analysis of simple gossip-based protocols for the computation of sums, averages, random samples, quantiles, and other aggregate functions, and we show that our protocols converge exponentially fast to the true answer when using uniform gossip. Our second contribution is the definition of a precise notion of the speed with which a node's data diffuses through the network. We show that this diffusion speed is at the heart of the approximation guarantees for all of the above problems. We analyze the diffusion speed of uniform gossip in the presence of node and link failures, as well as for flooding-based mechanisms. The latter expose interesting connections to random walks on graphs.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“As previously remarked, our protocol is a perturbation of the so-called 'push-sum' protocol for averaging studied in [1], [4], [10].”
From Distributed Optimization Over Time-Varying Directed Graphs (2015) · cites this paper as [10]
In the citing paper
“Instead, if every agent knows its out-degree, it is possible for the agents to construct a column stochastic matrix C and perform the following recursions with initialization u (0) = x (0) and v (0) = 1 to achieve the average (push-sum protocol [27]):”
From Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (2017) · cites this paper as [27]
Citations
Cites
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Rowstron, A., & Druschel, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45518-3_18 · Cited by 7,276
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Wireless integrated network sensors
Pottie, G. J., & Kaiser, W. J. (2000) · Communications of the ACM · doi:10.1145/332833.332838 · Cited by 3,219
Chord: a scalable peer-to-peer lookup protocol for internet applications
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., & Balakrishnan, H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.808407 · Cited by 3,133
TAG: a Tiny AGgregation service for ad-hoc sensor networks
Madden, S., Franklin, M. J., Hellerstein, J. M., & Hong, W. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844142 · Cited by 2,719
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Zhao, B. Y., Kubiatowicz, J. D., & Joseph, A. D. (2001) · UC Berkeley · Cited by 2,266
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing
Zhao, B. Y., Kubiatowicz, J. D., & Joseph, A. D. (2001) · Cited by 2,146
Freenet: A Distributed Anonymous Information Storage and Retrieval System
Clarke, I., Sandberg, O., Wiley, B., & Hong, T. W. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_4 · Cited by 2,109
The Mathematical Theory of Infectious Diseases and its applications
Ling, N. R. (1978) · Immunology · Cited by 1,934
Research works printed but not linked: 2
- fong, 2000, An approximate lp-difference algorithm for massive data streams, Proc 17th STACS, 193
- feigenbaum, 1999, An approximate l1-difference algorithm for massive data streams, Proc of 40th IEEE FOCS, 501
Cited by
Items 801–900 of 1,004
Information Storage, Reduction and Dissemination in Sensor Networks: A Survey
Le‐Trung, Q., Taherkordi, A., Skeie, T., Pham, H. N., & Engelstad, P. E. (2009) · IEEE Consumer Communications and Networking Conference · doi:10.1109/ccnc.2009.4784934 · Cited by 9
Fast range-summable random variables for efficient aggregate estimation
Rusu, F., & Dobra, A. (2006) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1142473.1142496 · Cited by 9
Self-citationAggregate Sum Retrieval in Sensor Network by Distributed Prefix Sum Data Cube
Lee, L. H., & Wong, M. H. (2005) · International Conference on Advanced Information Networking and Applications (AINA) · doi:10.1109/aina.2005.82 · Cited by 9
Randomized Sequential Algorithms for Data Aggregation in Sensor Networks
Savas, O., Alanyali, M., & Saligrama, V. (2006) · Conference on Information Sciences and Systems · doi:10.1109/ciss.2006.286455 · Cited by 9
Plurality Consensus via Shuffling: Lessons Learned from Load BalancingPreprint
Berenbrink, P., Friedetzky, T., Kling, P., Mallmann-Trenn, F., & Wastell, C. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.01342 · Cited by 9
A Privacy Preserving Randomized Gossip Algorithm via Controlled Noise InsertionPreprint
Hanzely, F., Konečný, J., Loizou, N., Richtárik, P., & Grishchenko, D. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.09367 · Cited by 9
On the Linear Speedup of the Push-Pull Method for Decentralized Optimization over DigraphsPreprint
Liang, L., Luo, G., & Yuan, K. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2506.18075 · Cited by 9
Decentralized Constrained Optimization: Double Averaging and Gradient Projection
Shahriari-Mehr, F., Bosch, D. D., & Panahi, A. (2021) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc45484.2021.9683355 · Cited by 8
Subgradient-Push Is of the Optimal Convergence Rate
Lin, Y., & Liu, J. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9992842 · Cited by 8
Adaptive Consensus: A Network Pruning Approach for Decentralized Optimization
Shah, S. M., Berahas, A. S., & Bollapragada, R. (2024) · SIAM Journal on Optimization · doi:10.1137/23m1599379 · Cited by 8
He, Z., He, J., Chen, C., & Guan, X. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2024.3395723 · Cited by 8
Distributed infinite‐horizon optimal control of continuous‐time linear systems over network
Battilotti, S., Cacace, F., & d’Angelo, M. (2020) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.5316 · Cited by 8
Xiang, M., Ioannidis, S., Yeh, E. M., Joe‐Wong, C., & Su, L. (2025) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2025.3526782 · Cited by 8
Toward Optimal Network Topology Design for Fast and Secure Distributed Computation
Liu, J., & Başar, T. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-12601-2_13 · Cited by 8
To reach consensus using uninorm aggregation operator: A gossip-based protocol
Huang, Z., & Huang, Q. (2012) · International Journal of Intelligent Systems · doi:10.1002/int.21528 · Cited by 8
A Study of Consensus Formation using Kinetic Theory
Monica, S., & Bergenti, F. (2016) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-40162-1_23 · Cited by 8
Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution
Almeida, P. S., Baquero, C., Farach-Colton, M., Jesus, P., & Mosteiro, M. A. (2016) · Distributed Computing · doi:10.1007/s00446-016-0288-5 · Cited by 8
Tang, C. Y., & Lu, J. (2009) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2009.5160728 · Cited by 8
Harnessing HARQ Retransmissions for Fast Average Consensus Over Unreliable Communication Channels
Makridis, E., Charalambous, T., & Hadjicostis, C. N. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10383677 · Cited by 8
Decentralized Dictionary Learning Over Time-Varying DigraphsPreprint
Daneshmand, A., Sun, Y., Scutari, G., Facchinei, F., & Sadler, B. M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.05933 · Cited by 8
Random Walks on Small World Networks
Dyer, M., Galanis, A., Goldberg, L. A., Jerrum, M., & Vigoda, E. (2020) · ACM Transactions on Algorithms · doi:10.1145/3382208 · Cited by 8
Beznosikov, A. N., Stepanov, I., Voronov, A., & Gasnikov, A. V. (2025) · Optimization methods & software · doi:10.1080/10556788.2025.2502829 · Cited by 8
Decentralized Word2Vec Using Gossip Learning
Alkathiri, A. A., Giaretta, L., Girdzijauskas, Š., & Sahlgren, M. (2021) · DSpace repository (University of Tartu) · doi:10.5281/zenodo.4679360 · Cited by 8
A Token-Based Approach for Distributed Computation in Sensor Networks
Saligrama, V., & Alanyali, M. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2125776 · Cited by 8
Zhu, Z., Huang, Y., Wang, X., & Xu, J. (2024) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2024/635 · Cited by 8
Slavov, V., & Rao, P. R. (2013) · The VLDB Journal · doi:10.1007/s00778-013-0314-1 · Cited by 8
Peerswap: A Peer-Sampler with Randomness Guarantees
Guerraoui, R., Kermarrec, A.-M., Kucherenko, A., Pinot, R., & de Vos, M. (2024) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/srds64841.2024.00034 · Cited by 8
Overhead of a decentralized gossip algorithm on the performance of HPC applications
Levy, E., Barak, A., Shiloh, A., Lieber, M., Weinhold, C., & Härtig, H. (2014) · International Workshop on Runtime and Operating Systems for Supercomputers · doi:10.1145/2612262.2612271 · Cited by 8
Ren, C., Mao, X., Xu, P., Dai, G., & Li, Z. (2009) · IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) · doi:10.1109/mobhoc.2009.5337024 · Cited by 8
Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables
Wette, P., & Graffi, K. (2013) · International Conference on Networked Systems (NetSys) · doi:10.1109/netsys.2013.9 · Cited by 8
Self-organized aggregation in irregular wireless networks
Geibig, J., & Bradler, D. (2010) · IFIP Wireless Days · doi:10.1109/wd.2010.5657705 · Cited by 8
Monitoring Dynamic Mobile Ad-Hoc Networks: A Fully Distributed Hybrid Architecture
Alvarez, J., Maag, S., & Zaïdi, F. (2017) · International Conference on Advanced Information Networking and Applications (AINA) · doi:10.1109/aina.2017.74 · Cited by 8
SkyEye: A tree-based peer-to-peer monitoring approach
Graffi, K., & Disterhöft, A. (2017) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2017.07.003 · Cited by 8
Faster Rumor Spreading: Breaking the logn Barrier
Avin, C., & Elsässer⋆, R. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-41527-2_15 · Cited by 8
When Do Gossip Algorithms Converge in Finite Time
Shi, G., Li, B., Johansson, M., & Johansson, K. H. (2014) · ANU Open Research (Australian National University) · Cited by 8
Network Coding Based Information Spreading in Dynamic Networks With Correlated Data
Cohen, A., Haeupler, B., Avin, C., & Médard, M. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.2384293 · Cited by 8
Benchmarking decentralized monitoring mechanisms in peer-to-peer systems
Stingl, D., Groß, C., Saller, K., Kaune, S., & Steinmetz, R. (2012) · ACM/SPEC International Conference on Performance Engineering (ICPE) · doi:10.1145/2188286.2188317 · Cited by 8
Time-critical event dissemination in geographically distributed clouds
Wu, C., Ho, J.-M., & Chen⋆, M.-S. (2011) · IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) · doi:10.1109/infcomw.2011.5928894 · Cited by 8
Rates of Convergence for Distributed Average Consensus with Probabilistic Quantization
Aysal, T. C., Coates, M., & Rabbat, M. G. (2007) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 8
Liebau, N. (2008) · Technischen Universität Darmstadt · doi:10.26083/tuprints-00001193 · Cited by 8
Survey on Distributed Data Mining in P2P NetworksPreprint
Rekha Sunny, T., & Thampi, S. M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.3231 · Cited by 8
Rumor Spreading with Bounded In-DegreePreprint
Daum, S., Kühn, F., & Maus, Y. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.00828 · Cited by 8
Liang, L., Chen, X., Luo, G., & Yuan, K. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2506.04600 · Cited by 8
A Semantic Overlay Network Based Robust Data-Infrastructure, Applied to the Electric Power Grid
Vanthournout, K. (2006) · Lirias · Cited by 8
Averaging Over General Random Networks
Cai, K. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2199181 · Cited by 7
Distributed optimization on random graphs
Rezaeinia, P., Gharesifard, B., Linder, T., & Touri, B. (2018) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2018.12.067 · Cited by 7
Dynamic Average Diffusion With Randomized Coordinate Updates
Ying, B., Yuan, K., & Sayed, A. H. (2019) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2019.2942191 · Cited by 7
Rate of Convergence for Distributed Optimization with Uncertain CommunicationsPreprint
Rezaeinia, P., & Gharesifard, B. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.10342 · Cited by 7
Private and Robust Distributed Nonconvex Optimization via Polynomial Approximation
He, Z., He, J., Chen, C., & Guan, X. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2024.3354875 · Cited by 7
Adaptive Weighting Push-SUM for Decentralized Optimization With Statistical Diversity
Zhou, Y., Cheng, Y., Xu, L., & Chen, E. (2025) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2025.3566329 · Cited by 7
GradConsensus: Linearly Convergent Algorithm for Reducing Disagreement in Multi-Agent Optimization
Khatana, V., Saraswat, G., Patel, S., & Salapaka, M. V. (2023) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2023.3321757 · Cited by 7
Gradient-Consensus: Linearly Convergent Distributed Optimization Algorithm over Directed GraphsPreprint
Khatana, V., Saraswat, G., Patel, S., & Salapaka, M. V. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.10070 · Cited by 7
Tatarenko, T., Zimmermann, J., Willert, V., & Adamy, J. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9029861 · Cited by 7
Decentralized SGD with Asynchronous, Local and Quantized UpdatesPreprint
Nadiradze, G., Sabour, A., Davies, P. M., Markov, I., Li, S., & Alistarh, D. (2021) · arXiv (Cornell University) · Cited by 7
Distributed stopping for average consensus using double linear iterative strategies
Manitara, N. E., & Hadjicostis, C. N. (2014) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2014.7028528 · Cited by 7
Random walks on binary strings applied to the somatic hypermutation of B-cells
Balelli, I., Milišić, V., & Wainrib, G. (2018) · Mathematical Biosciences · doi:10.1016/j.mbs.2018.03.022 · Cited by 7
Limits for Rumor Spreading in Stochastic Populations
Boczkowski, L., Feinerman, O., Korman, A., & Natale, E. (2017) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itcs.2018.49 · Cited by 7
Robust Policy-Based Distributed Voltage Control Provided by PV-Battery Inverters
Almasalma, H., & Deconinck, G. (2020) · IEEE Access · doi:10.1109/access.2020.3007849 · Cited by 7
Pritchard, D. (2005) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 7
Non-Asymptotic Analysis of an Optimal Algorithm for Network-Constrained Averaging With Noisy Links
Noorshams, N., & Wainwright, M. J. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2122241 · Cited by 7
Distributed Rate Limiting Under Decentralized Cloud Networks
Hu, X., Xu, T., Chen, L., Jiang, X., Yang, Y., Ye, L., Wang, X., Lv, Y., Jia, C., Wu, Y., et al. (2025) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2025.3610314 · Cited by 7
Consensus Analysis of Random Subgraphs for Distributed Filtering With Link Failures
Battilotti, S., Cacace, F., & d’Angelo, M. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3311709 · Cited by 7
Bearing-Based Network Localization Under Randomized Gossip Protocol
Le-Phan, N.-M., Trinh, M. H., & Nguyen, P. D. (2023) · International Conference on Control, Automation and Information Sciences (ICCAIS) · doi:10.1109/iccais59597.2023.10382296 · Cited by 7
Decentralized and optimal control of shared resource pools
Loureiro, E., Nixon, P., & Dobson, S. (2012) · ACM Transactions on Autonomous and Adaptive Systems · doi:10.1145/2168260.2168274 · Cited by 7
Peer-to-peer aggregation techniques dissected
Ogston, E., & Jarvis, S. A. (2010) · International Journal of Parallel Emergent and Distributed Systems · doi:10.1080/17445760903155071 · Cited by 7
Decentralized Utility Maximization for Adaptive Management of Shared Resource Pools
Loureiro, E., Nixon, P., & Dobson, S. (2009) · International Conference on Intelligent Networking and Collaborative Systems (INCoS) · doi:10.1109/incos.2009.65 · Cited by 7
Averaging Emulated Time-Series Data Using Approximate Histograms in Peer to Peer Networks
Nugroho, S., Weinmann, A., Schindelhauer, C., & Christ, A. (2020) · Communications in computer and information science · doi:10.1007/978-3-030-51999-5_28 · Cited by 7
Gossip-based distributed stochastic bandit algorithms
Balázs, S., Busa‐Fekete, R., István, H., Róbert, O., Mark, J., & Kégl, B. (2013) · SZTE Publicatio Repozitórium (University of Szeged) · Cited by 7
Convergence acceleration of gossip protocols applied for decentralized distribution grid management
Koukoula, D. I., & Hatziargyriou, N. D. (2015) · doi:10.1109/ptc.2015.7232276 · Cited by 7
Spectra: Robust Estimation of Distribution Functions in Networks
Borges, M., Jesus, P., Baquero, C., & Almeida, P. S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30823-9_8 · Cited by 7
Stehr, M.-O., Kim, M., & Talcott, C. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-54624-2_20 · Cited by 7
Situated vs. global aggregation schemes for autonomous management systems
Makhloufi, R., Doyen, G., Bonnet, G., & Gaïti, D. (2011) · IFIP/IEEE International Symposium on Integrated Network Management (IM) · doi:10.1109/inm.2011.5990525 · Cited by 7
Quasirandom Rumor Spreading on Expanders
Doerr, B., Friedrich, T., & Sauerwald, T. (2009) · Electronic Notes in Discrete Mathematics · doi:10.1016/j.endm.2009.07.040 · Cited by 7
Improving Fault Tolerance and Accuracy of a Distributed Reduction Algorithm
Niederbrucker, G., Straková, H., & Gansterer, W. N. (2012) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc.companion.2012.89 · Cited by 7
Tamburri, D. A., Razo-Zapata, I. S., Fernández, H., & Tedeschi, C. (2012) · VU Research Portal · doi:10.5555/2666048.2666049 · Cited by 7
Birk, Y., Keidar, I., Liss, L., & Schuster, A. (2006) · Lecture notes in computer science · doi:10.1007/11864219_7 · Cited by 7
Local silencing rules for randomized gossip
Daher, A., Rabbat, M., & Lau, V. K. N. (2011) · International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT) · doi:10.1109/dcoss.2011.5982171 · Cited by 7
Sketches for aggregate estimations over data streams
Dobra, A., & Rusu, F. (2009) · Cited by 7
Self-citationEnforcing fair grid energy access for controllable distributed solar capacity
Bashir, N., Irwin, D., Shenoy, P. J., & Taneja, J. (2017) · ACM International Conference on Systems for Energy-Efficient Buildings, Cities, and Transportation (BuildSys) · doi:10.1145/3137133.3137147 · Cited by 7
Supporting asynchronous update for distributed data cubes
Wu, D., Cheong, C. H., & Wong, M. H. (2009) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2008.12.002 · Cited by 7
On the Push&Pull Protocol for Rumour Spreading
Acan, H., Collevecchio, A., Mehrabian, A., & Wormald, N. (2017) · Trends in mathematics · doi:10.1007/978-3-319-51753-7_1 · Cited by 7
Performance of Gossip Algorithms in Wireless Sensor Networks
Baldi, M., Chiaraluce, F., & Zanaj, E. (2011) · Lecture notes in electrical engineering · doi:10.1007/978-94-007-0638-5_1 · Cited by 7
Semantic indexing in structured peer-to-peer networks
Ferreira, R. A., Koyutürk, M., Jagannathan, S., & Grama, A. Y. (2007) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2007.06.003 · Cited by 7
GRAT: Group Reputation Aggregation Trust for Unstructured Peer-to-Peer Networks
Yasutomi, M., Mashimo, Y., & Shigeno, H. (2010) · IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW) · doi:10.1109/icdcsw.2010.46 · Cited by 7
Brief Announcement: Convergence Analysis of Scalable Gossip Protocols
Patterson, S., Bamieh, B. A., & Abbadi, A. E. (2006) · Lecture notes in computer science · doi:10.1007/11864219_39 · Cited by 7
Investigating the Cost of Anonymity on Dynamic NetworksPreprint
Luna, G. A. D., & Baldoni, R. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1505.03509 · Cited by 7
Garofalakis, M. (2016) · Springer eBooks · doi:10.1007/978-1-4899-7993-3_137-2 · Cited by 7
Garofalakis, M. (2009) · Springer eBooks · doi:10.1007/978-0-387-39940-9_137 · Cited by 7
A decentralised architecture for secure exchange of assets in data spaces: The case of SEDIMARK
Duriakova, E., O’Reilly-Morgan, D., Bahri, M., Costalonga, M., Danciu, G. M., Nechifor, S. C., Jarcau, S., Elsaleh, T., Wu, P., Gall, F. L., et al. (2025) · Data in Brief · doi:10.1016/j.dib.2025.111757 · Cited by 7
Randomized Primitives For Linear Algebra and Applications
Zouzias, A. (2013) · TSpace (University of Toronto) · Cited by 7
Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach
Feinerman, O., & Korman, A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-25258-2_2 · Cited by 6
Privacy-Preserving Distributed Coordination of Distributed Energy Resources
Zholbaryssov, M., Hadjicostis, C. N., & Domínguez-García, A. D. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9303977 · Cited by 6
Distributed Optimization with Gradient Tracking Over Heterogeneous Delay-Prone Directed Networks
Makridis, E., Oliva, G., Narahari, K. R., Doostmohammadian, M., Khan, U. A., & Charalambous, T. (2024) · European Control Conference (ECC) · doi:10.23919/ecc64448.2024.10590963 · Cited by 6
Finite-time error bounds for distributed linear stochastic approximation
Lin, Y., Gupta, V., & Liu, J. (2023) · Automatica · doi:10.1016/j.automatica.2023.111368 · Cited by 6
Random Walking Snakes for Decentralized Learning at Edge Networks
Ardic, A. B., Seferoğlu, H., Rouayheb, S. E., & Koyuncu, E. (2023) · IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) · doi:10.1109/lanman58293.2023.10189426 · Cited by 6
Consensus with linear objective maps
Chen, X., Belabbas, M.-A., & Başar, T. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402648 · Cited by 6
Request-based gossiping without deadlocks
Liu, J., Mou, S., Morse, A. S., Anderson, B. D. O., & Yu, C. B. (2018) · Automatica · doi:10.1016/j.automatica.2018.03.001 · Cited by 6
Consensus-Based Chernoff Test in Sensor Networks
Rangi, A., Franceschetti, M., & Maranò, S. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8618910 · Cited by 6
A general formalism for the analysis of distributed algorithms
Slučiak, O., Hilaire, T., & Rupp, M. (2010) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2010.5496169 · Cited by 6
Tu, J., Zhou, J., & Ren, D. (2022) · Computer Communications · doi:10.1016/j.comcom.2022.09.010 · Cited by 6
Metadata
- Authors
- Kempe, D., Dobra, A., & Gehrke, J.
- Affiliations
- Cornell University (US)
- Venue
- 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
- Publisher
- IEEE Computer. Soc
- Published
- 2004-03-01
- Pages
- 482-491
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2110100895
- Cited by
- 1,480
- References
- 45
- Citations by year
- 2026: 13 · 2025: 34 · 2024: 46 · 2023: 38 · 2022: 40 · 2021: 71 · 2020: 66 · 2019: 70 · 2018: 75 · 2017: 79 · 2016: 80 · 2015: 76 · 2014: 75 · 2013: 88 · 2012: 100
- FWCI
- 26.31
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Annual Symposium on Foundations of Computer Science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Distributed systems and fault tolerance
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Keywords
- gossip protocols, distributed aggregation, diffusion rate, fault tolerance, node and link failures, floods, random walks on graphs, approximation guarantees, exponential convergence, random sampling, quantile estimation, distributed computing
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.