Sciweavers

FOCS
2010
IEEE
13 years 10 months ago
On the Computational Complexity of Coin Flipping
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai
FOCS
2010
IEEE
13 years 10 months ago
The Coin Problem and Pseudorandomness for Branching Programs
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Joshua Brody, Elad Verbin
ENTCS
2008
94views more  ENTCS 2008»
13 years 11 months ago
On the Convergence of Reduction-based and Model-based Methods in Proof Theory
In the recent past, the reduction-based and the model-based methods to prove cut elimination have converged, so that they now appear just as two sides of the same coin. This paper...
Gilles Dowek
COMGEO
2006
ACM
14 years 15 days ago
Moving coins
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...
Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Al...
CORR
2010
Springer
45views Education» more  CORR 2010»
14 years 17 days ago
Solution to the Counterfeit Coin Problem and its Generalization
: This work deals with a classic problem: "Given a set of coins among which there is a counterfeit coin of a different weight, find this counterfeit coin using ordinary balanc...
Juan Dominguez-Montes
COLT
2004
Springer
14 years 4 months ago
The Budgeted Multi-armed Bandit Problem
straction of the following scenarios: choosing from among a set of alternative treatments after a fixed number of clinical trials, determining the best parameter settings for a pro...
Omid Madani, Daniel J. Lizotte, Russell Greiner
ISTCS
1997
Springer
14 years 4 months ago
Exact Analysis of Exact Change
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
Pat Frankel