35 search results - page 7 / 7 » Communication Complexity Towards Lower Bounds on Circuit Dep... |
81
Voted
STOC
2007
ACM
15 years 11 months ago
2007
ACM
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
97
Voted
SPAA
2005
ACM
15 years 4 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
113
click to vote
INFOCOM
2010
IEEE
14 years 9 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
85
Voted
LATIN
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
114
click to vote
DIALM
2005
ACM
15 years 26 days ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...