Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
complete networks
Description:
Networks in which every pair of distinct nodes is connected by an edge, a concept in graph theory and network analysis.
Related topics:
Distributed systems and fault tolerance (14%),
Game Theory and Applications (12%),
Complex Network Analysis Techniques (11%),
Complexity and Algorithms in Graphs (8%),
Interconnection Networks and Systems (7%)
OpenAlex ID:
keywords/complete-networks
Completeness theorems for non-cryptographic fault-tolerant distributed computation
1988
·
Michael Ben-Or
, Avi Wigderson
·
ACM Symposium on Theory of Computing (STOC)
·
3,034
PDF
Sharing memory robustly in message-passing systems
1995
·
Hagit Attiya
, Amotz Bar-Noy
, et al.
·
Journal of the ACM
·
634
PDF
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)
·
Michael Ben-or
, Shafi Goldwasser
, et al.
·
493
Methods and problems of communication in usual networks
1994
·
Pierre Fraigniaud
, Emmanuel Lazard
·
Discrete Applied Mathematics
·
428
PDF
Networks of Collaboration in Oligopoly
·
Sumit Joshi
·
RePEc: Research Papers in Economics
·
388
Algebraic Models for Social Networks
1993
·
Philippa Pattison
·
Cambridge University Press eBooks
·
181
On algorithms for finding the k shortest paths in a network
1979
·
D. R. Shier
·
Networks
·
176
The multicast policy and its relationship to replicated data placement
1991
·
Ouri Wolfson
, Amir Milo
·
ACM Transactions on Database Systems
·
156
PDF
Lower bounds for the broadcast problem in mobile radio networks
1997
·
Danilo Bruschi
, Massimiliano Del Pinto
·
Distributed Computing
·
149
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
1984
·
E. Korach
, S. Moran
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
131
PDF
Computational Statistical Methods for Social Network Models
2012
·
David R. Hunter
, Pavel N. Krivitsky
, et al.
·
Journal of Computational and Graphical Statistics
·
124
Question-order effects in social network name generators
2009
·
James E. Pustejovsky
, James P. Spillane
·
Social Networks
·
106
Extended impossibility results for asynchronous complete networks
1987
·
Shlomo Moran
, Yaron Wolfstahl
·
Information Processing Letters
·
104
Utility and dynamic social networks
2000
·
Norman P Hummon
·
Social Networks
·
100
Social network properties and self-rated health in later life: comparisons from the Korean social life, health, and aging project and the national social life, health and aging project
2014
·
Yoosik Youm
, Edward O Laumann
, et al.
·
BMC Geriatrics
·
99
PDF
On algorithms for efficient data migration
2001
·
Joseph L. Hall
, Jason D. Hartline
, et al.
·
Symposium on Discrete Algorithms
·
98
Consensus in networked multi-agent systems with adversaries
2011
·
Heath J. LeBlanc
, Xenofon D. Koutsoukos
·
International Conference on Hybrid Systems: computation and control
·
95
A modular technique for the design of efficient distributed leader finding algorithms
1990
·
E. Korach
, S. Kutten
, et al.
·
ACM Transactions on Programming Languages and Systems
·
92
PDF
There is no non-zero stable fixed point for dense networks in the homogeneous Kuramoto model
2012
·
Richard Taylor
·
Journal of Physics A Mathematical and Theoretical
·
86
PDF
An Experimental Study of Data Migration Algorithms
2001
·
Eric Anderson
, Joe Hall
, et al.
·
Lecture notes in computer science
·
82
Election in a complete network with a sense of direction
1986
·
Michael C. Loui
, Teresa A. Matsushita
, et al.
·
Information Processing Letters
·
73
Towards Optimal Control of Evolutionary Games on Networks
2016
·
James R. Riehl
, Ming Cao
·
IEEE Transactions on Automatic Control
·
71
A generalization of Brayton-Moser's mixed potential function
1998
·
L. Weiss
, W. Mathis
, et al.
·
IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications
·
68
Análisis De Redes Sociales Y Trabajo Social
2008
·
Ainhoa de Federico de la Rúa
·
Portularia
·
65
Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
1991
·
Yehuda Afek
, Eli Gafni
·
SIAM Journal on Computing
·
62
Show more works
View as search
Works count:
281
Citation count:
8,932
Year
Topic
Type