id: 05631970
dt: a
an: 05631970
au: Doerr, Benjamin
ti: Introducing quasirandomness to computer science.
so: Albers, Susanne (ed.) et al., Efficient algorithms. Essays dedicated to
    Kurt Mehlhorn on the occasion of his 60th birthday. Berlin: Springer
    (ISBN 978-3-642-03455-8/pbk). Lecture Notes in Computer Science 5760,
    99-111 (2009).
py: 2009
pu: Berlin: Springer
la: EN
cc: 
ut: 
ci: 
li: doi:10.1007/978-3-642-03456-5_6
ab: Summary: The paradigm of quasirandomness led to dramatic progress in
    different areas of mathematics, with the invention of quasi-Monte Carlo
    methods in numerical integration probably being the best known example.
    In the last two decades, discrete mathematics heavily used quasirandom
    ideas, leading, e.g., to notions like quasirandom graphs. We feel that
    it is now time to exploit quasirandomness in computer science. As a
    first application, we propose and analyze a quasirandom analogue of the
    classical randomized rumor spreading protocol to disseminate
    information in networks.
rv: