research
∙
07/18/2023
Scalable Auction Algorithms for Bipartite Maximum Matching Problems
In this paper, we give new auction algorithms for maximum weighted bipar...
share
research
∙
07/17/2023
The Predicted-Deletion Dynamic Model: Taking Advantage of ML Predictions, for Free
The main bottleneck in designing efficient dynamic algorithms is the unk...
research
∙
04/17/2023
An Algorithmic Approach to Address Course Enrollment Challenges
Massive surges of enrollments in courses have led to a crisis in several...
research
∙
12/25/2022
A Note on Improved Results for One Round Distributed Clique Listing
In this note, we investigate listing cliques of arbitrary sizes in bandw...
research
∙
11/20/2022
Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs
Differentially private algorithms allow large-scale data analytics while...
research
∙
08/22/2021
The Power of Random Symmetry-Breaking in Nakamoto Consensus
Nakamoto consensus underlies the security of many of the world's largest...
research
∙
08/05/2021
Scheduling with Communication Delay in Near-Linear Time
We consider the problem of efficiently scheduling jobs with precedence c...
research
∙
06/07/2021
Parallel Batch-Dynamic k-Core Decomposition
Maintaining a k-core decomposition quickly in a dynamic graph is an impo...
research
∙
10/30/2020
Dynamic Distributed MIS with Improved Bounds
The problem of maintaining a maximal independent set (MIS) in a dynamic ...
research
∙
04/04/2020
A Lower Bound for Byzantine Agreement and Consensus for Adaptive Adversaries using VDFs
Large scale cryptocurrencies require the participation of millions of pa...
research
∙
03/30/2020
Parallel Batch-Dynamic k-Clique Counting
In this paper, we study new batch-dynamic algorithms for k-clique counti...
research
∙
03/18/2020
Tatamibari is NP-complete
In the Nikoli pencil-and-paper game Tatamibari, a puzzle consists of an ...
research
∙
02/19/2020
Parallel Algorithms for Small Subgraph Counting
Subgraph counting is a fundamental problem in analyzing massive graphs, ...
research
∙
10/04/2019
Fully Dynamic (Δ+1)-Coloring in Constant Update Time
The problem of (vertex) (Δ+1)-coloring a graph of maximum degree Δ has b...
research
∙
06/07/2018
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
We develop a new framework for generalizing approximation algorithms fro...
research
∙
02/21/2018
Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling
Pebble games were originally formulated to study time-space tradeoffs in...
research
∙
11/21/2017
Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy
This paper initiates the study of I/O algorithms (minimizing cache misse...
research
∙
08/22/2017
Upward Partitioned Book Embeddings
We analyze a directed variation of the book embedding problem when the p...
research
∙
07/20/2017
