1 citations · 2 across the 6 of their papers we have counts for
8 papers
Exponential quantum space advantage in random data streams
Adam Bouland, Matthew Ding, Siddhartha Jain
We show two unconditional quantum space advantages in the random-order streaming model. First, we show the Yamakawa--Zhandry Code Intersection problem admits exponential quantum ad…
Optimizing Sparse SYK
Matthew Ding, Robbie King, Bobak T. Kiani +1
Finding the ground state of strongly-interacting fermionic systems is often the prerequisite for fully understanding both quantum chemistry and condensed matter systems. The Sachde…
Random Serial Dictatorship with Transfers
Sudharsan Sundar, Eric Gao, Trevor Chow +1
It is well known that Random Serial Dictatorship is strategy-proof and leads to a Pareto-Efficient outcome. We show that this result breaks down when individuals are allowed to mak…
Network Fault-tolerant and Byzantine-resilient Social Learning via Collaborative Hierarchical Non-Bayesian Learning
Connor Mclaughlin, Matthew Ding, Denis Edogmus +1
As the network scale increases, existing fully distributed solutions start to lag behind the real-world challenges such as (1) slow information propagation, (2) network communicati…
Fast and Robust State Estimation and Tracking via Hierarchical Learning
Connor Mclaughlin, Matthew Ding, Deniz Erdogmus +1
Fast and reliable state estimation and tracking are essential for real-time situation awareness in Cyber-Physical Systems (CPS) operating in tactical environments or complicated ci…
BeeGees: stayin' alive in chained BFT
Ittai Abraham, Natacha Crooks, Neil Giridharan +2
Modern chained Byzantine Fault Tolerant (BFT) systems leverage a combination of pipelining and leader rotation to obtain both efficiency and fairness. These protocols, however, req…
An Analysis of Multi-hop Iterative Approximate Byzantine Consensus with Local Communication
Matthew Ding
Iterative Approximate Byzantine Consensus (IABC) is a fundamental problem of fault-tolerant distributed computing where machines seek to achieve approximate consensus to arbitrary…
Relay Protocol for Approximate Byzantine Consensus
Matthew Ding
Approximate byzantine consensus is a fundamental problem of distributed computing. This paper presents a novel algorithm for approximate byzantine consensus, called Relay-ABC. The…