Jared Saia

From MaRDI portal
(Redirected from Person:644797)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Defending hash tables from algorithmic complexity attacks with resource burning
Theoretical Computer Science
2024-10-07Paper
Boundary sketching with asymptotically optimal distance and rotation
Theoretical Computer Science
2024-08-20Paper
Boundary sketching with asymptotically optimal distance and rotation
Structural Information and Communication Complexity
2024-01-11Paper
Scalable and secure computation among strangers: message-competitive Byzantine protocols2023-11-02Paper
Bankrupting Sybil despite churn
Journal of Computer and System Sciences
2023-04-21Paper
Resource Burning for Permissionless Systems (Invited Paper)
Structural Information and Communication Complexity
2022-09-01Paper
ANTS on a Plane
Structural Information and Communication Complexity
2022-09-01Paper
A resource-competitive jamming defense
Distributed Computing
2022-02-15Paper
Communication-efficient randomized consensus
Distributed Computing
2022-02-15Paper
Multiparty Interactive Communication with Private Channels
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
2021-01-20Paper
Bootstrapping Public Blockchains Without a Trusted Setup
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
2021-01-20Paper
A computational approach to animal breeding
Journal of Theoretical Biology
2020-10-28Paper
Making social networks more human: A topological approach
Statistical Analysis and Data Mining: The ASA Data Science Journal
2020-10-14Paper
Faster agreement via a spectral method for detecting malicious behavior
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-06-20Paper
Byzantine Agreement in Expected Polynomial Time
Journal of the ACM
2018-08-02Paper
Interactive communication with unknown noise rate
Information and Computation
2018-06-14Paper
A theoretical and empirical evaluation of an algorithm for self-healing computation
Distributed Computing
2017-11-29Paper
Secure multi-party computation in large networks
Distributed Computing
2017-08-31Paper
Secure Multi-party Shuffling
Structural Information and Communication Complexity
2016-01-08Paper
Interactive communication with unknown noise rate
Lecture Notes in Computer Science
2015-11-04Paper
Conflict on a communication channel
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
2015-09-11Paper
Scalable rational secret sharing
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
2015-09-11Paper
Choosing a random peer
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
2015-08-03Paper
Scalable mechanisms for rational secret sharing
Distributed Computing
2015-07-22Paper
Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
2015-03-02Paper
Spectral analysis of data
Proceedings of the thirty-third annual ACM symposium on Theory of computing
2015-02-27Paper
Recent results in scalable multi-party computation
Lecture Notes in Computer Science
2015-02-20Paper
Sleeping on the job
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
2014-12-12Paper
The forgiving tree, a self-healing distributed data structure
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
2014-12-12Paper
Brief announcement: Breaking the \(O(nm)\) bit barrier, secure multiparty computation with a static adversary
Proceedings of the 2012 ACM symposium on Principles of distributed computing
2014-12-05Paper
Fast asynchronous Byzantine agreement and leader election with full information
ACM Transactions on Algorithms
2014-11-18Paper
Byzantine agreement in polynomial expected time (extended abstract)
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
2014-08-07Paper
The forgiving graph, a distributed data structure for low stretch under adversarial attack
Proceedings of the 28th ACM symposium on Principles of distributed computing
2014-07-23Paper
Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
Journal of the ACM
2014-02-17Paper
The power of mediation in an extended El Farol game
Algorithmic Game Theory
2013-10-23Paper
A note on improving the performance of approximation algorithms for radiation therapy
Information Processing Letters
2013-03-28Paper
The forgiving graph: a distributed data structure for low stretch under adversarial attack
Distributed Computing
2013-02-04Paper
Sleeping on the job: energy-efficient and robust broadcast for radio networks
Algorithmica
2011-11-07Paper
Censorship resistant peer-to-peer networks
Theory of Computing
2011-05-24Paper
Scalable leader election
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06
2010-08-16Paper
Reducing communication costs in robust peer-to-peer networks
Information Processing Letters
2010-04-19Paper
Algorithms for data migration
Algorithmica
2010-03-23Paper
Nonnegative integral subset representations of integer sets
Information Processing Letters
2010-01-29Paper
Approximation algorithms for minimizing segments in radiation therapy
Information Processing Letters
2010-01-29Paper
From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
Lecture Notes in Computer Science
2009-11-19Paper
Choosing a random peer in Chord
Algorithmica
2007-11-28Paper
Algorithms – ESA 2005
Lecture Notes in Computer Science
2006-06-27Paper
Discrete sensor placement problems in distribution networks
Mathematical and Computer Modelling
2006-05-16Paper
scientific article; zbMATH DE number 2119648 (Why is no real title available?)2004-11-29Paper
scientific article; zbMATH DE number 1931813 (Why is no real title available?)2003-06-20Paper
scientific article; zbMATH DE number 1848399 (Why is no real title available?)2003-01-05Paper
On algorithms for efficient data migration2002-01-30Paper
On-line and off-line preemptive two-machine job shop scheduling
Journal of Scheduling
2001-05-13Paper


Research outcomes over time


This page was built for person: Jared Saia