Troy Lee | DeepAI

AI Chat

Featured Co-authors

Rahul Jain
52 publications
Paweł Gawrychowski
49 publications
Shengyu Zhang
48 publications
Danupon Nanongkai
37 publications
Tongyang Li
25 publications
Srinivasan Arunachalam
24 publications
Sourav Chakraborty
21 publications
Ronald de Wolf
16 publications
Simon Apers
15 publications
Miklos Santha
13 publications
Yuval Efron
10 publications

∙ 01/14/2022

Cut query algorithms with star contraction

We study the complexity of determining the edge connectivity of a simple...

0 Simon Apers, et al. ∙

∙ 11/02/2021

Finding the KT partition of a weighted graph in near-linear time

In a breakthrough work, Kawarabayashi and Thorup (J. ACM'19) gave a near...

0 Simon Apers, et al. ∙

∙ 10/29/2021

A sublinear time quantum algorithm for s-t minimum cut on dense simple graphs

An s-t minimum cut in a graph corresponds to a minimum weight subset of ...

0 Simon Apers, et al. ∙

∙ 09/05/2021

On the query complexity of connectivity with global queries

We study the query complexity of determining if a graph is connected wit...

0 Arinta Auza, et al. ∙

∙ 11/19/2020

Quantum query complexity of edge connectivity

The edge connectivity of a simple graph is the least number of edges who...

0 Simon Apers, et al. ∙

∙ 11/10/2020

On the cut dimension of a graph

Let G = (V,w) be a weighted undirected graph with m edges. The cut dimen...

0 Troy Lee, et al. ∙

∙ 07/16/2020

Quantum algorithms for graph problems with cut queries

Let G be an n-vertex graph with m edges. When asked a subset S of vertic...

0 Troy Lee, et al. ∙

∙ 04/14/2020

The quantum query complexity of composition with a relation

The negative weight adversary method, ADV^±(g), is known to characterize...

0 Aleksandrs Belovs, et al. ∙

∙ 11/27/2018

A composition theorem for randomized query complexity via max conflict complexity

Let R_ϵ(·) stand for the bounded-error randomized query complexity with ...

0 Dmitry Gavinsky, et al. ∙

∙ 09/30/2018

Two new results about quantum exact learning

We present two new results about exact learning by quantum computers. Fi...

0 Srinivasan Arunachalam, et al. ∙

∙ 09/11/2018

Strategies for quantum races

We initiate the study of quantum races, games where two or more quantum ...

0 Troy Lee, et al. ∙

∙ 01/07/2018

On the randomised query complexity of composition

Let f⊆{0,1}^n×Ξ be a relation and g:{0,1}^m→{0,1,*} be a promise functio...

0 Dmitry Gavinsky, et al. ∙

∙ 08/02/2017

Quadratically Tight Relations for Randomized Query Complexity

Let f:{0,1}^n →{0,1} be a Boolean function. The certificate complexity C...

0 Dmitry Gavinsky, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world