- Online and o ine preemptive two-machine job shop schedul-Tracy Kimbrel
- Nonnegative Integral Subset Representations of Integer Michael J. Collins
- Choosing a Random Peer [Extended Abstract]
- Responsive Algorithms for Defending Reconfigurable Networks I-Ching Boman
- Choosing a Random Peer [Extended Abstract]
- Dynamically Fault-Tolerant Content Addressable Networks Jared Saia Amos Fiat y Steve Gribble Anna R. Karlin Stefan Saroiu
- arXiv:0710.2532v1[cs.DS]12Oct2007 Sleeping on the Job
- Scalable Mechanisms for Rational Secret Sharing Varsha Dani
- Conflict on a Communication Channel Valerie King Jared Saia Maxwell Young
- Approximation Algorithms for Minimizing Segments in Radiation Therapy
- Algorithms for Managing Data in Distributed Systems A dissertation submitted in partial fulfillment of
- THEORY OF COMPUTING, Volume 0 (2007), pp. 78101 http://theoryofcomputing.org
- Towards Secure and Scalable Computation in Peer-to-Peer Networks Valerie King
- An Empirical Study of a Scalable Byzantine Agreement Algorithm Olumuyiwa Oluwasanmi, Jared Saia
- Spectral Analysis for Information Retrieval and Data Mining June 29, 2000
- Data Migration with Edge Capacities and Machine Speeds Jared C. Saia
- Reducing Communication Costs in Robust Peer-to-Peer Networks
- Scalable Byzantine Agreement Cli#ord Scott Lewis # Jared Saia #
- The Forgiving Graph: A distributed data structure for low stretch under adversarial attack
- A Computational Approach to Animal Breeding Tanya Y. Berger-Wolf1,2
- Dynamically Fault-Tolerant Content Addressable Networks Jared Saia
- Fear in Mediation: Exploiting the "Windfall of Malice" D. Mitsche
- A Framework for Analysis of Dynamic Social Networks Tanya Y. Berger-Wolf
- Censorship Resistant Peer-to-Peer Content Addressable Networks Thomas Hobbes, Rene Descartes, Francis Bacon,
- Attack-Resistant Frequency Counting Valerie King
- Breaking the O(n2 ) Bit Barrier: Scalable
- Load balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
- From almost everywhere to everywhere: Byzantine agreement with ~O(n3/2
- Picking up the Pieces: Self-Healing in Reconfigurable Networks Jared Saia
- Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?
- Choosing a Random Peer in Chord Valerie King
- Scalable Leader Election Valerie King
- Discrete Sensor Placement Problems in Distribution Networks
- Scalable Byzantine Agreement Clifford Scott Lewis
- Making Chord Robust to Byzantine Attacks , Jared Saia2
- Breaking the O(n2) Bit Barrier: Scalable Byzantine Agreement
- arXiv:cs.LG/0511011v12Nov2005 The Impact of Social Networks on Multi-Agent
- The Forgiving Tree: A Self-Healing Distributed Data Structure Navin Rustagi
- Breaking the O(n2 ) Bit Barrier: Scalable Byzantine
- Breaking the O(nm) Bit Barrier: Secure Multiparty Computation with a Static Adversary
