<--- Back to Details
First PageDocument Content
Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / IP / Random walk / Markov chain / Quantum Byzantine agreement / Statistics / Theoretical computer science / Probability theory
Date: 2011-01-19 07:00:55
Analysis of algorithms
Probabilistic complexity theory
Randomized algorithm
IP
Random walk
Markov chain
Quantum Byzantine agreement
Statistics
Theoretical computer science
Probability theory

Noncryptographic Selection Protocols (Extended Abstract) Uriel Feige

Add to Reading List

Source URL: www.disco.ethz.ch

Download Document from Source Website

File Size: 141,89 KB

Share Document on Facebook

Similar Documents

Designing Robust Software Systems through Parametric Markov Chain Synthesis ˇ ska† , Simos Gerasimou∗ , Marta Kwiatkowska‡ and Nicola Paoletti§ Radu Calinescu∗ , Milan Ceˇ ∗ Department of Computer Science, U

DocID: 1xTt6 - View Document

Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes Nima Anari ∗

DocID: 1vbSk - View Document

Mean field and fluid approaches to Markov chain analysis Jeremy T. Bradley ∗ Department of Computing, Imperial College London, UK Representing the explicit state space of performance models has inheren

DocID: 1v7u1 - View Document

ODE approximations to some Markov chain models Perla Sousi January 13, 2009

DocID: 1uW7y - View Document

Compiling Markov Chain Monte Carlo Algorithms for Probabilistic Modeling Daniel Huang Jean-Baptiste Tristan

DocID: 1uvqp - View Document