# Jared Saia

According to our database

Collaborative distances:

^{1}, Jared Saia authored at least 105 papers between 1995 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Interactive communication with unknown noise rate.

Inf. Comput., 2018

A resource-competitive jamming defense.

Distributed Computing, 2018

Communication-efficient randomized consensus.

Distributed Computing, 2018

Tiny Groups Tackle Byzantine Adversaries.

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Proof of Work Without All the Work.

Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

Sending a Message with Unknown Noise.

Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017

Secure Multi-Party Computation in Large Networks.

IACR Cryptology ePrint Archive, 2017

Distributed Computing with Channel Noise.

IACR Cryptology ePrint Archive, 2017

A theoretical and empirical evaluation of an algorithm for self-healing computation.

Distributed Computing, 2017

Secure multi-party computation in large networks.

Distributed Computing, 2017

Proof of Work Without All the Work.

CoRR, 2017

Good Things Come in LogLog(n)-Sized Packages: Robustness with Small Quorums.

CoRR, 2017

TorBricks: Blocking-Resistant Tor Bridge Distribution.

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

2016

Editorial to the Special Issue on SODA'12.

ACM Trans. Algorithms, 2016

Byzantine Agreement in Expected Polynomial Time.

J. ACM, 2016

TorBricks: Blocking-Resistant Tor Bridge Distribution.

CoRR, 2016

Secure one-way interactive communication.

CoRR, 2016

Secure Multiparty Interactive Communication with Unknown Noise Rate.

CoRR, 2016

2015

Resource-Competitive Algorithms.

SIGACT News, 2015

Secure Multi-Party Shuffling.

IACR Cryptology ePrint Archive, 2015

Scalable mechanisms for rational secret sharing.

Distributed Computing, 2015

Interactive Communication with Unknown Noise Rate.

CoRR, 2015

Recent Results in Scalable Multi-Party Computation.

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Secure Multi-party Shuffling.

Proceedings of the Structural Information and Communication Complexity, 2015

Cooperative Computing for Autonomous Data Centers.

Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Shuffle to Baffle: Towards Scalable Protocols for Secure Multi-party Shuffling.

Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

Interactive Communication with Unknown Noise Rate.

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Millions of Millionaires: Multiparty Computation in Large Networks.

IACR Cryptology ePrint Archive, 2014

Recent Results in Scalable Multi-Party Computation.

IACR Cryptology ePrint Archive, 2014

Self-Healing Computation.

CoRR, 2014

Secure Anonymous Broadcast.

CoRR, 2014

Secure Anonymous Broadcast.

Proceedings of the Distributed Computing - 28th International Symposium, 2014

Communication-Efficient Randomized Consensus.

Proceedings of the Distributed Computing - 28th International Symposium, 2014

Self-healing Computation.

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

(Near) optimal resource-competitive broadcast with jamming.

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Faster Agreement via a Spectral Method for Detecting Malicious Behavior.

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation.

Proceedings of the Distributed Computing and Networking - 15th International Conference, 2014

2013

The Power of Mediation in an Extended El Farol Game.

CoRR, 2013

Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation.

CoRR, 2013

Towards Provably-Secure Scalable Anonymous Broadcast.

Proceedings of the 3rd USENIX Workshop on Free and Open Communications on the Internet, 2013

Byzantine agreement in polynomial expected time: [extended abstract].

Proceedings of the Symposium on Theory of Computing Conference, 2013

Self-Healing of Byzantine Faults.

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

The Power of Mediation in an Extended El Farol Game.

Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

Brief announcement: byzantine agreement with a strong adversary in polynomial expected time.

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Brief announcement: scalable anonymous communication with byzantine adversary.

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012

The Forgiving Graph: a distributed data structure for low stretch under adversarial attack.

Distributed Computing, 2012

Self-Healing Algorithms for Byzantine Faults

CoRR, 2012

Scalable Mechanisms for Rational Secret Sharing

CoRR, 2012

Breaking the O(nm) Bit Barrier: Secure Multiparty Computation with a Static Adversary

CoRR, 2012

Resource-Competitive Communication

CoRR, 2012

Whiskey, Weed, and Wukan on the World Wide Web: On Measuring Censors' Resources and Motivations.

Proceedings of the 2nd USENIX Workshop on Free and Open Communications on the Internet, 2012

Scalable Byzantine Agreement with a Random Beacon.

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

Brief announcement: breaking the O(nm) bit barrier, secure multiparty computation with a static adversary.

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Resource-competitive analysis: a new perspective on attack-resistant distributed computing.

Proceedings of the FOMC'12, 2012

2011

J. ACM, 2011

A note on improving the performance of approximation algorithms for radiation therapy.

Inf. Process. Lett., 2011

Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio Networks.

Algorithmica, 2011

Three Researchers, Five Conjectures: An Empirical Analysis of TOM-Skype Censorship and Surveillance.

Proceedings of the USENIX Workshop on Free and Open Communications on the Internet, 2011

Single valued combinatorial auctions with budgets.

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Conflict on a communication channel.

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Scalable rational secret sharing.

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information.

Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

2010

Fast asynchronous Byzantine agreement and leader election with full information.

ACM Trans. Algorithms, 2010

Scalable byzantine computation.

SIGACT News, 2010

Breaking the O(n^2) Bit Barrier: Scalable Byzantine agreement with an Adaptive Adversary

CoRR, 2010

Combinatorial Auctions with Budgets

CoRR, 2010

Algorithms for Data Migration.

Algorithmica, 2010

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Attack-resistant frequency counting.

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

An empirical study of a scalable Byzantine agreement algorithm.

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

2009

Fixed-Parameter Tractability and Improved Approximations for Segment Minimization

CoRR, 2009

The Forgiving Graph: A distributed data structure for low stretch under adversarial attack

CoRR, 2009

On the Power of Mediators.

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

From Almost Everywhere to Everywhere: Byzantine Agreement with Õ(n

^{3/2}) Bits.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Brief announcement: fast scalable Byzantine agreement in the full information model with a nonadaptive adversary.

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

The forgiving graph: a distributed data structure for low stretch under adversarial attack.

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008

Reducing communication costs in robust peer-to-peer networks.

Inf. Process. Lett., 2008

The Forgiving Tree: A Self-Healing Distributed Data Structure

CoRR, 2008

Picking up the Pieces: Self-Healing in Reconfigurable Networks

CoRR, 2008

Fast asynchronous byzantine agreement and leader election with full information.

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Sleeping on the job: energy-efficient and robust broadcast for radio networks.

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

The forgiving tree: a self-healing distributed data structure.

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Finding Spread Blockers in Dynamic Networks.

Proceedings of the Advances in Social Network Mining and Analysis, 2008

Picking up the Pieces: Self-Healing in reconfigurable networks.

Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

2007

Censorship Resistant Peer-to-Peer Networks.

Theory of Computing, 2007

Approximation algorithms for minimizing segments in radiation therapy.

Inf. Process. Lett., 2007

Nonnegative integral subset representations of integer sets.

Inf. Process. Lett., 2007

Sleeping on the Job: Energy-Efficient Broadcast for Radio Networks

CoRR, 2007

Choosing a Random Peer in Chord.

Algorithmica, 2007

Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?.

Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

2006

Brief Announcement: Self-healing Algorithms for Reconfigurable Networks.

Proceedings of the Stabilization, 2006

Scalable leader election.

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

A framework for analysis of dynamic social networks.

Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006

Towards Secure and Scalable Computation in Peer-to-Peer Networks.

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

Discrete sensor placement problems in distribution networks.

Mathematical and Computer Modelling, 2005

Parameters Affecting the Resilience of Scale-Free Networks to Random Failures

CoRR, 2005

The Impact of Social Networks on Multi-Agent Recommender Systems

CoRR, 2005

Making Chord Robust to Byzantine Attacks.

Proceedings of the Algorithms, 2005

2004

Choosing a random peer.

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2002

Censorship resistant peer-to-peer content addressable networks.

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Dynamically Fault-Tolerant Content Addressable Networks.

Proceedings of the Peer-to-Peer Systems, First International Workshop, 2002

2001

An Experimental Study of Data Migration Algorithms.

Proceedings of the Algorithm Engineering, 2001

Spectral analysis of data.

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

On algorithms for efficient data migration.

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

1995

Network Routing Models Applied to Aircraft Routing Problems.

Proceedings of the 27th conference on Winter simulation, 1995