50 search results - page 2 / 10 » On the Computational Complexity of Coin Flipping |
FOCS
1990
IEEE
13 years 10 months ago
1990
IEEE
d abstract) Noga Alon IBM Almaden Research Center, San Jose, CA 95120 and Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel Moni Naor IBM Almaden Research Ce...
ICQNM
2008
IEEE
14 years 21 days ago
2008
IEEE
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
SPDP
1990
IEEE
13 years 10 months ago
1990
IEEE
Abstract. This article presents a randomized algorithm for leader election which uses bidirectionality of an asynchronous ring to force a node to "commit" to a coin flip ...
COMGEO
2006
ACM
13 years 6 months ago
2006
ACM
We consider combinatorial and computational issues that are related to the problem of moving coins from one configuration to another. Coins are defined as non-overlapping discs, an...
NOSSDAV
2009
Springer
14 years 24 days ago
2009
Springer
Peer-to-peer distributed virtual environments (DVE's) distribute state tracking and state transitions. Many DVE's - such as online games - require ways to fairly determi...