Get started
Keyword

message complexity

Description: A measure of the number or amount of messages required by a distributed algorithm or communication process to complete a task.
OpenAlex ID: keywords/message-complexity
A Distributed Algorithm for Minimum-Weight Spanning Trees
1983 · R. G. Gallager, P. A. Humblet, et al. · ACM Transactions on Programming Languages and Systems · 1,129
PDF
A √N algorithm for mutual exclusion in decentralized systems
1985 · Mamoru Maekawa · ACM Transactions on Computer Systems · 733
PDF
Randomized rumor spreading
2002 · R. Karp, C. Schindelhauer, et al. · Annual Symposium on Foundations of Computer Science · 725
Information Overload and the Message Dynamics of Online Interaction Spaces: A Theoretical Model and Empirical Exploration
2004 · Quentin Jones, Gilad Ravid, et al. · Information Systems Research · 721
An optimal algorithm for mutual exclusion in computer networks
1981 · Glenn Ricart, Ashok K. Agrawala · Communications of the ACM · 670
PDF
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
2004 · Peng-Jun Wan, Khaled M. Alzoubi, et al. · Mobile Networks and Applications · 657
Authenticated Algorithms for Byzantine Agreement
1983 · D. Dolev, H. R. Strong · SIAM Journal on Computing · 655
Distributed construction of connected dominating set in wireless ad hoc networks
2003 · Peng-Jun Wan, K.M. Alzoubi, et al. · Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) · 628
Supporting cooperative caching in ad hoc networks
2006 · Liangzhong Yin, Guohong Cao · IEEE Transactions on Mobile Computing · 509
Sensor relocation in mobile sensor networks
2005 · Guiling Wang, Guohong Cao, et al. · 502
A tree-based algorithm for distributed mutual exclusion
1989 · Kerry Raymond · ACM Transactions on Computer Systems · 436
PDF
Sharing the Cost of Multicast Transmissions
2001 · Joan Feigenbaum, Christos H. Papadimitriou, et al. · Journal of Computer and System Sciences · 406
Message-optimal connected dominating sets in mobile ad hoc networks
2002 · Khaled M. Alzoubi, Peng-Jun Wan, et al. · 405
An improved algorithm for decentralized extrema-finding in circular configurations of processes
1979 · Ernest Chang, Rosemary Roberts · Communications of the ACM · 350
A survey of geocast routing protocols
2004 · Christian Maihofer · IEEE Communications Surveys & Tutorials · 348
A distributed mutual exclusion algorithm
1985 · Ichiro Suzuki, Tadao Kasami · ACM Transactions on Computer Systems · 312
PDF
Loop-free routing using diffusing computations
1993 · J.J. Garcia-Lunes-Aceves · IEEE/ACM Transactions on Networking · 302
Speed of speech and persuasion.
1976 · Norman Miller, Geoffrey Maruyama, et al. · Journal of Personality and Social Psychology · 297
Mix and Match: Secure Function Evaluation via Ciphertexts
2000 · Markus Jakobsson, Ari Juels · Lecture notes in computer science · 282
PDF
DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad Hoc Networks
2009 · I. Rhee, A. Warrier, et al. · IEEE Transactions on Mobile Computing · 278
Communication complexity of group key distribution
1998 · Klaus Becker, Uta Wille · Proceedings of the ACM Conference on Computer and Communications Security · 278
PDF
New distributed algorithm for connected dominating set in wireless ad hoc networks
2003 · K.M. Alzoubi, Peng-Jun Wan, et al. · Proceedings of the ... Annual Hawaii International Conference on System Sciences/Proceedings of the Annual Hawaii International Conference on System Sciences · 273
Deadlock detection in distributed systems
1989 · M. Singhal · Computer · 270
Informed content delivery across adaptive overlay networks
2002 · John Byers, Jeffrey Considine, et al. · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · 264
DRAND
2006 · Injong Rhee, Ajit Warrier, et al. · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · 253
Works count: 3,146
Citation count: 48,860
Year
Topic
Type