Now showing items 1-2 of 2

    • Estimating Mixing Times: Techniques and Applications 

      Goel, Sharad (2005-06-21)
      How many times do you have to shuffle a deck of n cards before it is close to random? log n? n? n^3? Similar convergence rate questions for finite Markov chains are central to solving applied problems in diverse fields ...
    • Herbivore: A Scalable and Efficient Protocol for Anonymous Communication 

      Goel, Sharad; Robson, Mark; Polte, Milo; Sirer, Emin (Cornell University, 2003-01-28)
      Anonymity is increasingly important for networked applications amidst concerns over censorship and privacy. In this paper, we describe Herbivore, a peer-to-peer, scalable, tamper-resilient communication system that provides ...