The following pages link to Jared Saia (Q644797):
Displaying 50 items.
- Sleeping on the job: energy-efficient and robust broadcast for radio networks (Q644799) (← links)
- Nonnegative integral subset representations of integer sets (Q845914) (← links)
- Approximation algorithms for minimizing segments in radiation therapy (Q845938) (← links)
- Reducing communication costs in robust peer-to-peer networks (Q963355) (← links)
- On-line and off-line preemptive two-machine job shop scheduling (Q1592758) (← links)
- Interactive communication with unknown noise rate (Q1641020) (← links)
- A theoretical and empirical evaluation of an algorithm for self-healing computation (Q1682221) (← links)
- The forgiving graph: a distributed data structure for low stretch under adversarial attack (Q1938375) (← links)
- A note on improving the performance of approximation algorithms for radiation therapy (Q1944893) (← links)
- A resource-competitive jamming defense (Q2075623) (← links)
- Communication-efficient randomized consensus (Q2075627) (← links)
- A computational approach to animal breeding (Q2209102) (← links)
- Scalable mechanisms for rational secret sharing (Q2355325) (← links)
- Algorithms for data migration (Q2379927) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- Choosing a random peer in Chord (Q2461543) (← links)
- Discrete sensor placement problems in distribution networks (Q2489111) (← links)
- Bankrupting Sybil despite churn (Q2698290) (← links)
- (Q2768356) (← links)
- The Power of Mediation in an Extended El Farol Game (Q2856131) (← links)
- Fast asynchronous Byzantine agreement and leader election with full information (Q2930350) (← links)
- The forgiving tree (Q2934347) (← links)
- Sleeping on the job (Q2934350) (← links)
- Scalable rational secret sharing (Q2943397) (← links)
- Conflict on a communication channel (Q2943406) (← links)
- (Q3002776) (← links)
- Byzantine Agreement in Expected Polynomial Time (Q3177770) (← links)
- Secure Multi-party Shuffling (Q3460735) (← links)
- Scalable leader election (Q3581515) (← links)
- From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits (Q3646244) (← links)
- (Q4709172) (← links)
- (Q4785579) (← links)
- (Q4828919) (← links)
- Making social networks more human: A topological approach (Q4970288) (← links)
- Resource Burning for Permissionless Systems (Invited Paper) (Q5100943) (← links)
- ANTS on a Plane (Q5100945) (← links)
- Multiparty Interactive Communication with Private Channels (Q5145192) (← links)
- Bootstrapping Public Blockchains Without a Trusted Setup (Q5145236) (← links)
- The forgiving graph (Q5170309) (← links)
- Recent Results in Scalable Multi-Party Computation (Q5175095) (← links)
- Spectral analysis of data (Q5176020) (← links)
- Breaking the <i>O</i> ( <i>n</i> <sup>2</sup> ) bit barrier (Q5176217) (← links)
- Faster Agreement via a Spectral Method for Detecting Malicious Behavior (Q5384019) (← links)
- Breaking the <i>O</i> ( <i>n</i> <sup>2</sup> ) bit barrier (Q5395663) (← links)
- Algorithms – ESA 2005 (Q5475888) (← links)
- Byzantine agreement in polynomial expected time (Q5495810) (← links)
- Choosing a random peer (Q5501491) (← links)
- Brief announcement (Q5891980) (← links)
- Scalable and secure computation among strangers: message-competitive Byzantine protocols (Q6535030) (← links)
- Boundary sketching with asymptotically optimal distance and rotation (Q6589855) (← links)
