Yinzhan Xu | DeepAI

DeepAI AI Chat

Featured Co-authors

Erik D. Demaine
69 publications
Virginia Vassilevska Williams
37 publications
Timothy M. Chan
25 publications
Shyam Narayanan
24 publications
Akari Asai
20 publications
Wang-Chiew Tan
20 publications
Nicole Wein
19 publications
Adam Polak
19 publications
Ce Jin
18 publications
Yoshihiko Suhara
16 publications
Lijie Chen
16 publications

∙ 02/24/2023

Optimal Bounds for Noisy Sorting

Sorting is a fundamental problem in computer science. In the classical s...

0 Yuzhou Gu, et al. ∙

∙ 12/29/2022

Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules

We present an almost optimal algorithm for the classic Chamberlin-Couran...

0 Krzysztof Sornat, et al. ∙

∙ 11/14/2022

Removing Additive Structure in 3SUM-Based Reductions

Our work explores the hardness of 3SUM instances without certain additiv...

0 Ce Jin, et al. ∙

∙ 09/15/2022

Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failures

This paper considers a natural fault-tolerant shortest paths problem: fo...

0 Virginia Vassilevska Williams, et al. ∙

∙ 04/22/2022

Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds

The AP-LCA problem asks, given an n-node directed acyclic graph (DAG), t...

0 Surya Mathialagan, et al. ∙

∙ 04/05/2022

All-Pairs Shortest Path Distances with Differential Privacy: Improved Algorithms for Bounded and Unbounded Weights

We revisit the problem of privately releasing the all-pairs shortest pat...

0 Justin Y. Chen, et al. ∙

∙ 03/16/2022

Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV

The 3SUM hypothesis, the APSP hypothesis and SETH are the three main hyp...

0 Timothy M. Chan, et al. ∙

∙ 02/23/2022

Tight Dynamic Problem Lower Bounds from Generalized BMM and OMv

The main theme of this paper is using k-dimensional generalizations of t...

0 Ce Jin, et al. ∙

∙ 05/06/2021

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths

One of the most basic graph problems, All-Pairs Shortest Paths (APSP) is...

0 Yuzhou Gu, et al. ∙

∙ 03/05/2021

Fine-Grained Complexity and Algorithms for the Schulze Voting Method

We study computational aspects of a well-known single-winner voting rule...

9 Krzysztof Sornat, et al. ∙

∙ 02/11/2021

Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths

APSP with small integer weights in undirected graphs [Seidel'95, Galil a...

0 Timothy M. Chan, et al. ∙

∙ 07/18/2020

Monochromatic Triangles, Triangle Listing and APSP

One of the main hypotheses in fine-grained complexity is that All-Pairs ...

0 Virginia Vassilevska Williams, et al. ∙

∙ 04/19/2020

Faster Dynamic Range Mode

In the dynamic range mode problem, we are given a sequence a of length b...

0 Bryce Sandlund, et al. ∙

∙ 10/10/2019

Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications

The goal of this paper is to get truly subcubic algorithms for Min-Plus ...

0 Virginia Vassilevska Williams, et al. ∙

∙ 04/25/2019

Approximation Algorithms for Min-Distance Problems

We study fundamental graph parameters such as the Diameter and Radius in...

0 Mina Dalirrooyfard, et al. ∙

∙ 04/18/2018

Nearly Optimal Separation Between Partially And Fully Retroactive Data Structures

Since the introduction of retroactive data structures at SODA 2004, a ma...

0 Lijie Chen, et al. ∙

∙ 01/23/2018

HappyDB: A Corpus of 100,000 Crowdsourced Happy Moments

The science of happiness is an area of positive psychology concerned wit...

0 Akari Asai, et al. ∙