Sciweavers

277 search results - page 12 / 56
» Israel
Sort
View
MOC
2002
77views more  MOC 2002»
13 years 7 months ago
Directional Newton methods in n variables
Directional Newton methods for functions f of n variables are shown to converge, under standard assumptions, to a solution of f(x) = 0. The rate of convergence is quadratic, for ne...
Yuri Levin, Adi Ben-Israel
TCC
2009
Springer
146views Cryptology» more  TCC 2009»
14 years 8 months ago
An Optimally Fair Coin Toss
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
Tal Moran, Moni Naor, Gil Segev
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
14 years 8 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
COLT
1995
Springer
13 years 11 months ago
Exactly Learning Automata with Small Cover Time
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
Dana Ron, Ronitt Rubinfeld
COCO
2008
Springer
118views Algorithms» more  COCO 2008»
13 years 9 months ago
Quantum Expanders: Motivation and Constructions
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma