Sciweavers

5084 search results - page 953 / 1017
» Proving Possibility Properties
Sort
View
PODC
2012
ACM
13 years 3 months ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
PODC
2012
ACM
13 years 3 months ago
On the (limited) power of non-equivocation
In recent years, there have been a few proposals to add a small amount of trusted hardware at each replica in a Byzantine fault tolerant system to cut back replication factors. Th...
Allen Clement, Flavio Junqueira, Aniket Kate, Rodr...
103
Voted
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
16 years 28 days ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
107
Voted
KDD
2007
ACM
149views Data Mining» more  KDD 2007»
16 years 1 months ago
Distributed classification in peer-to-peer networks
This work studies the problem of distributed classification in peer-to-peer (P2P) networks. While there has been a significant amount of work in distributed classification, most o...
Ping Luo, Hui Xiong, Kevin Lü, Zhongzhi Shi
88
Voted
APPROX
2007
Springer
77views Algorithms» more  APPROX 2007»
15 years 6 months ago
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...