Sciweavers

2200 search results - page 120 / 440
» Bloch's Constant is Computable
Sort
View
CORR
2008
Springer
108views Education» more  CORR 2008»
15 years 6 months ago
Approximability and parameterized complexity of minmax values
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen,...
TCS
2008
15 years 6 months ago
Expanders and time-restricted branching programs
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
Stasys Jukna
SAC
2008
ACM
15 years 5 months ago
Synchronization of strongly pulse-coupled oscillators with refractory periods and random medium access
The weakly pulse-coupled oscillator framework has proven to be a valuable resource for the development of peer-to-peer synchronization algorithms [9]. But leveraging it in a pract...
Julius Degesys, Prithwish Basu, Jason Redi
IACR
2011
115views more  IACR 2011»
14 years 6 months ago
Multi-Server Oblivious RAM
Secure two-party computation protocol allows two players, Alice with secret input x and Bob with secret input y, to jointly execute an arbitrary program π(x, y) such that only th...
Steve Lu, Rafail Ostrovsky
FOCS
2005
IEEE
16 years 1 days ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks