No. |
Title |
Author |
Year |
---|

1 |
A Direct Product Theorem for One-Way Quantum Communication |
Jain, Rahul et al. |
2021 |

2 |
Reachability and Matching in Single Crossing Minor Free Graphs |
Datta, Samir et al. |
2021 |

3 |
Space-Efficient Algorithms for Reachability in Directed Geometric Graphs |
Bhore, Sujoy et al. |
2021 |

4 |
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs |
Gupta, Chetan et al. |
2021 |

5 |
An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability |
Jain, Rahul et al. |
2019 |

6 |
Reachability in High Treewidth Graphs |
Jain, Rahul et al. |
2019 |

7 |
Unambiguous Catalytic Computation |
Gupta, Chetan et al. |
2019 |

8 |
A Composition Theorem for Randomized Query Complexity |
Anshu, Anurag et al. |
2018 |

9 |
Separating Quantum Communication and Approximate Rank |
Anshu, Anurag et al. |
2017 |

10 |
Partition Bound Is Quadratically Tight for Product Distributions |
Harsha, Prahladh et al. |
2016 |

11 |
Unidirectional Input/Output Streaming Complexity of Reversal and Sorting |
François, Nathanaël et al. |
2014 |

12 |
A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound |
Harsha, Prahladh et al. |
2013 |