research
∙
08/19/2022
Packet Forwarding with a Locally Bursty Adversary
We consider packet forwarding in the adversarial queueing theory (AQT) m...
share
research
∙
08/15/2022
Training-Time Attacks against k-Nearest Neighbors
Nearest neighbor-based methods are commonly used for classification task...
research
∙
08/02/2022
Bias Reduction for Sum Estimation
In classical statistics and distribution testing, it is often assumed th...
research
∙
04/08/2022
Finding a Winning Strategy for Wordle is NP-complete
In this paper, we give a formal definition of the popular word-guessing ...
research
∙
12/07/2020
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling Cliques is Harder Than Counting
In this work, we consider the problem of sampling a k-clique in a graph ...
research
∙
08/19/2020
Stable Matchings with Restricted Preferences: Structure and Complexity
It is well known that every stable matching instance I has a rotation po...
research
∙
08/19/2020
Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth
In this paper, we consider the problem of counting and sampling structur...
research
∙
03/11/2020
PALS: Plesiochronous and Locally Synchronous Systems
Consider an arbitrary network of communicating modules on a chip, each r...
research
∙
07/18/2019
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems
Consider a graph problem that is locally checkable but not locally solva...
research
∙
02/21/2019
The Arboricity Captures the Complexity of Sampling Edges
In this paper, we revisit the problem of sampling edges in an unknown gr...
research
∙
02/21/2019
With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing
We consider the Adversarial Queuing Theory (AQT) model, where packet arr...
research
∙
02/21/2019
Fault Tolerant Gradient Clock Synchronization
Synchronizing clocks in distributed systems is well-understood, both in ...
research
∙
09/13/2017
