1369 search results - page 56 / 274 » Lattice computations for random numbers |
162
Voted
STACS
1999
Springer
15 years 9 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
146
click to vote
FOCS
1990
IEEE
15 years 9 months ago
1990
IEEE
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
115
click to vote
STACS
2010
Springer
16 years 17 days ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
164
click to vote
BROADNETS
2005
IEEE
15 years 7 months ago
2005
IEEE
— We present a game-theoretical model of a wireless communication system with multiple competing users sharing a multiaccess fading channel. With a specified capture rule and a ...
162
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...