I agree that this site is using cookies. You can find further informations here.
X
Merkliste 
 1 Ergebnisse 
 
1

The round complexity of two-party random selection:

, In: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing,
Sanghvi, Saurabh ; Vadhan, Salil - p. 338-347 , 2005
Link: https://dl.acm.org/doi/10.1145/1060590.1060641