Search the dblp DataBase

Publications of Author

1. Amos Fiat, Jared Saia, Maxwell Young
   Making Chord Robust to Byzantine Attacks. [Citation Graph (0, 0)][DBLP]
   ESA, 2005, pp:803-814 [Conf]
   
2. Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee
   Towards Secure and Scalable Computation in Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP]
   FOCS, 2006, pp:87-98 [Conf]
   
3. Jared Saia, Amos Fiat, Steven D. Gribble, Anna R. Karlin, Stefan Saroiu
   Dynamically Fault-Tolerant Content Addressable Networks. [Citation Graph (0, 0)][DBLP]
   IPTPS, 2002, pp:270-279 [Conf]
   
4. Tanya Y. Berger-Wolf, Jared Saia
   A framework for analysis of dynamic social networks. [Citation Graph (0, 0)][DBLP]
   KDD, 2006, pp:523-528 [Conf]
   
5. Valerie King, Jared Saia
   Choosing a random peer. [Citation Graph (0, 0)][DBLP]
   PODC, 2004, pp:125-130 [Conf]
   
6. Amos Fiat, Jared Saia
   Censorship resistant peer-to-peer content addressable networks. [Citation Graph (0, 0)][DBLP]
   SODA, 2002, pp:94-103 [Conf]
   
7. Joseph Hall, Jason D. Hartline, Anna R. Karlin, Jared Saia, John Wilkes
   On algorithms for efficient data migration. [Citation Graph (0, 0)][DBLP]
   SODA, 2001, pp:620-629 [Conf]
   
8. Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee
   Scalable leader election. [Citation Graph (0, 0)][DBLP]
   SODA, 2006, pp:990-999 [Conf]
   
9. Yossi Azar, Amos Fiat, Anna R. Karlin, Frank McSherry, Jared Saia
   Spectral analysis of data. [Citation Graph (0, 0)][DBLP]
   STOC, 2001, pp:619-626 [Conf]
   
10. Eric J. Anderson, Joseph Hall, Jason D. Hartline, Michael Hobbs, Anna R. Karlin, Jared Saia, Ram Swaminathan, John Wilkes
    An Experimental Study of Data Migration Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2001, pp:145-158 [Conf]
    
11. Zhiqiang Chen, Andrew T. Holle, Bernard M. E. Moret, Jared Saia, Ali Boroujerdi
    Network Routing Models Applied to Aircraft Routing Problems. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 1995, pp:1200-1206 [Conf]
    
12. Shuang Luan, Jared Saia, Maxwell Young
    Approximation algorithms for minimizing segments in radiation therapy. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:101, n:6, pp:239-244 [Journal]
    
13. Michael J. Collins, David Kempe, Jared Saia, Maxwell Young
    Nonnegative integral subset representations of integer sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:101, n:3, pp:129-133 [Journal]
    
14. Iching Boman, Jared Saia, Chaouki T. Abdallah, Edl Schamiloglu
    Brief Announcement: Self-healing Algorithms for Reconfigurable Networks. [Citation Graph (0, 0)][DBLP]
    SSS, 2006, pp:563-565 [Conf]
    
15. Valerie King, Cynthia Phillips, Jared Saia, Maxwell Young
    Sleeping on the Job: Energy-Efficient Broadcast for Radio Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
    
16. 
    Picking up the Pieces: Self-Healing in reconfigurable networks. [Citation Graph (, )][DBLP]
    
    
17. 
    Finding Spread Blockers in Dynamic Networks. [Citation Graph (, )][DBLP]
    
    
18. 
    Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?. [Citation Graph (, )][DBLP]
    
    
19. 
    Sleeping on the job: energy-efficient and robust broadcast for radio networks. [Citation Graph (, )][DBLP]
    
    
20. 
    Brief announcement: fast scalable Byzantine agreement in the full information model with a nonadaptive adversary. [Citation Graph (, )][DBLP]
    
    
21. 
    The forgiving tree: a self-healing distributed data structure. [Citation Graph (, )][DBLP]
    
    
22. 
    The forgiving graph: a distributed data structure for low stretch under adversarial attack. [Citation Graph (, )][DBLP]
    
    
23. 
    Breaking the O(n²) bit barrier: scalable byzantine agreement with an adaptive adversary. [Citation Graph (, )][DBLP]
    
    
24. 
    Fast asynchronous byzantine agreement and leader election with full information. [Citation Graph (, )][DBLP]
    
    
25. 
    From Almost Everywhere to Everywhere: Byzantine Agreement with Õ(n^3/2) Bits. [Citation Graph (, )][DBLP]
    
    
26. 
    On the Power of Mediators. [Citation Graph (, )][DBLP]
    
    
27. 
    Choosing a Random Peer in Chord. [Citation Graph (, )][DBLP]
    
    
28. 
    Algorithms for Data Migration. [Citation Graph (, )][DBLP]
    
    
29. 
    The Impact of Social Networks on Multi-Agent Recommender Systems [Citation Graph (, )][DBLP]
    
    
30. 
    Parameters Affecting the Resilience of Scale-Free Networks to Random Failures [Citation Graph (, )][DBLP]
    
    
31. 
    Picking up the Pieces: Self-Healing in Reconfigurable Networks [Citation Graph (, )][DBLP]
    
    
32. 
    The Forgiving Tree: A Self-Healing Distributed Data Structure [Citation Graph (, )][DBLP]
    
    
33. 
    The Forgiving Graph: A distributed data structure for low stretch under adversarial attack [Citation Graph (, )][DBLP]
    
    
34. 
    Fixed-Parameter Tractability and Improved Approximations for Segment Minimization [Citation Graph (, )][DBLP]
    
    
35. 
    Combinatorial Auctions with Budgets [Citation Graph (, )][DBLP]
    
    
36. 
    Breaking the O(n^2) Bit Barrier: Scalable Byzantine agreement with an Adaptive Adversary [Citation Graph (, )][DBLP]