19 research outputs found

    On Randomization in Sequential and Distributed Algorithms

    No full text
    Probabilistic, or randomized, algorithms are fast becoming as commonplace as conventional deterministic algorithms. This survey presents five techniques that have been widely used in the design of randomized algorithms. These techniques are illustrated using 12 randomized algorithms --- both sequential and distributed --- that span a wide range of applications, including: primality testing (a classical problem in number theory), universal hashing (choosing the hash function dynamically and at random) , interactive probabilistic proof systems (a new method of program testing), dining philosophers (a classical problem in distributed computing), and Byzantine agreement (reaching agreement in the presence of malicious processors). Included with each algorithm is a discussion of its correctness and its computational complexity. Several related topics of interest are also addressed, including the theory of probabilistic automata, probabilistic analysis of conventional algorithms, determinis..

    Oeuvres complètes de M. le vicomte de Chateaubriand /

    No full text
    Includes translation of Milton's Paradise lost.Mode of access: Internet
    corecore