530 search results - page 13 / 106 » Universal randomized switching |
120
Voted
CRYPTO
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
108
Voted
JLP
2007
2007
Universality and semicomputability for nondeterministic programming languages over abstract algebras
15 years 1 months ago
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
MLQ
2006
15 years 1 months ago
2006
Abstract. We continue investigations of forcing notions with strong ccc properties introducing new methods of building sweet forcing notions. We also show that quotients of topolog...
239
click to vote
Publication
The ERICA switch algorithm has been discussed extensively in TM group in the past. However, over the last two years, the algorithm has been substantially modified. This contributio...
108
click to vote
NDJFL
2010
14 years 8 months ago
2010
Van Lambalgen's Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen's Theorem ...