BibTeX records: Troy Lee

download as .bib file

@article{DBLP:journals/corr/abs-2311-16401,
  author       = {Jonathan Allcock and
                  Jinge Bao and
                  Aleksandrs Belovs and
                  Troy Lee and
                  Miklos Santha},
  title        = {On the quantum time complexity of divide and conquer},
  journal      = {CoRR},
  volume       = {abs/2311.16401},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2311.16401},
  doi          = {10.48550/ARXIV.2311.16401},
  eprinttype    = {arXiv},
  eprint       = {2311.16401},
  timestamp    = {Wed, 29 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2311-16401.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/ws/SzegedyNL22,
  author       = {Mario Szegedy and
                  Ilan Newman and
                  Troy Lee},
  title        = {Query Complexity},
  publisher    = {WorldScientific},
  year         = {2022},
  url          = {https://doi.org/10.1142/10525},
  doi          = {10.1142/10525},
  isbn         = {9789813223202},
  timestamp    = {Wed, 31 Mar 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/ws/SzegedyNL22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ApersGL22,
  author       = {Simon Apers and
                  Pawel Gawrychowski and
                  Troy Lee},
  editor       = {Amit Chakrabarti and
                  Chaitanya Swamy},
  title        = {Finding the {KT} Partition of a Weighted Graph in Near-Linear Time},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
                  of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {245},
  pages        = {32:1--32:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.32},
  doi          = {10.4230/LIPICS.APPROX/RANDOM.2022.32},
  timestamp    = {Mon, 26 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/ApersGL22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ApersEGLMN22,
  author       = {Simon Apers and
                  Yuval Efron and
                  Pawel Gawrychowski and
                  Troy Lee and
                  Sagnik Mukhopadhyay and
                  Danupon Nanongkai},
  title        = {Cut Query Algorithms with Star Contraction},
  booktitle    = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2022, Denver, CO, USA, October 31 - November 3, 2022},
  pages        = {507--518},
  publisher    = {{IEEE}},
  year         = {2022},
  url          = {https://doi.org/10.1109/FOCS54457.2022.00055},
  doi          = {10.1109/FOCS54457.2022.00055},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/focs/ApersEGLMN22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-05674,
  author       = {Simon Apers and
                  Yuval Efron and
                  Pawel Gawrychowski and
                  Troy Lee and
                  Sagnik Mukhopadhyay and
                  Danupon Nanongkai},
  title        = {Cut query algorithms with star contraction},
  journal      = {CoRR},
  volume       = {abs/2201.05674},
  year         = {2022},
  url          = {https://arxiv.org/abs/2201.05674},
  eprinttype    = {arXiv},
  eprint       = {2201.05674},
  timestamp    = {Thu, 20 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2201-05674.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/quantum/ArunachalamCLPW21,
  author       = {Srinivasan Arunachalam and
                  Sourav Chakraborty and
                  Troy Lee and
                  Manaswi Paraashar and
                  Ronald de Wolf},
  title        = {Two new results about quantum exact learning},
  journal      = {Quantum},
  volume       = {5},
  pages        = {587},
  year         = {2021},
  url          = {https://doi.org/10.22331/q-2021-11-24-587},
  doi          = {10.22331/Q-2021-11-24-587},
  timestamp    = {Mon, 26 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/quantum/ArunachalamCLPW21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeeLSZ21,
  author       = {Troy Lee and
                  Tongyang Li and
                  Miklos Santha and
                  Shengyu Zhang},
  editor       = {Valentine Kabanets},
  title        = {On the Cut Dimension of a Graph},
  booktitle    = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
                  2021, Toronto, Ontario, Canada (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {200},
  pages        = {15:1--15:35},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2021.15},
  doi          = {10.4230/LIPICS.CCC.2021.15},
  timestamp    = {Thu, 02 Feb 2023 13:27:03 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/LeeLSZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ApersL21,
  author       = {Simon Apers and
                  Troy Lee},
  editor       = {Valentine Kabanets},
  title        = {Quantum Complexity of Minimum Cut},
  booktitle    = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
                  2021, Toronto, Ontario, Canada (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {200},
  pages        = {28:1--28:33},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2021.28},
  doi          = {10.4230/LIPICS.CCC.2021.28},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ApersL21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LeeSZ21,
  author       = {Troy Lee and
                  Miklos Santha and
                  Shengyu Zhang},
  editor       = {D{\'{a}}niel Marx},
  title        = {Quantum algorithms for graph problems with cut queries},
  booktitle    = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2021, Virtual Conference, January 10 - 13, 2021},
  pages        = {939--958},
  publisher    = {{SIAM}},
  year         = {2021},
  url          = {https://doi.org/10.1137/1.9781611976465.59},
  doi          = {10.1137/1.9781611976465.59},
  timestamp    = {Thu, 01 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/LeeSZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-02115,
  author       = {Arinta Auza and
                  Troy Lee},
  title        = {On the query complexity of connectivity with global queries},
  journal      = {CoRR},
  volume       = {abs/2109.02115},
  year         = {2021},
  url          = {https://arxiv.org/abs/2109.02115},
  eprinttype    = {arXiv},
  eprint       = {2109.02115},
  timestamp    = {Mon, 20 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2109-02115.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-15587,
  author       = {Simon Apers and
                  Arinta Auza and
                  Troy Lee},
  title        = {A sublinear time quantum algorithm for s-t minimum cut on dense simple
                  graphs},
  journal      = {CoRR},
  volume       = {abs/2110.15587},
  year         = {2021},
  url          = {https://arxiv.org/abs/2110.15587},
  eprinttype    = {arXiv},
  eprint       = {2110.15587},
  timestamp    = {Tue, 02 Nov 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2110-15587.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-01378,
  author       = {Simon Apers and
                  Pawel Gawrychowski and
                  Troy Lee},
  title        = {Finding the {KT} partition of a weighted graph in near-linear time},
  journal      = {CoRR},
  volume       = {abs/2111.01378},
  year         = {2021},
  url          = {https://arxiv.org/abs/2111.01378},
  eprinttype    = {arXiv},
  eprint       = {2111.01378},
  timestamp    = {Fri, 05 Nov 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2111-01378.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/JainKKLSSV20,
  author       = {Rahul Jain and
                  Hartmut Klauck and
                  Srijita Kundu and
                  Troy Lee and
                  Miklos Santha and
                  Swagato Sanyal and
                  Jevgenijs Vihrovs},
  title        = {Quadratically Tight Relations for Randomized Query Complexity},
  journal      = {Theory Comput. Syst.},
  volume       = {64},
  number       = {1},
  pages        = {101--119},
  year         = {2020},
  url          = {https://doi.org/10.1007/s00224-019-09935-x},
  doi          = {10.1007/S00224-019-09935-X},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/JainKKLSSV20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-06439,
  author       = {Aleksandrs Belovs and
                  Troy Lee},
  title        = {The quantum query complexity of composition with a relation},
  journal      = {CoRR},
  volume       = {abs/2004.06439},
  year         = {2020},
  url          = {https://arxiv.org/abs/2004.06439},
  eprinttype    = {arXiv},
  eprint       = {2004.06439},
  timestamp    = {Thu, 23 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2004-06439.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-08285,
  author       = {Troy Lee and
                  Miklos Santha and
                  Shengyu Zhang},
  title        = {Quantum algorithms for graph problems with cut queries},
  journal      = {CoRR},
  volume       = {abs/2007.08285},
  year         = {2020},
  url          = {https://arxiv.org/abs/2007.08285},
  eprinttype    = {arXiv},
  eprint       = {2007.08285},
  timestamp    = {Thu, 01 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2007-08285.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-05085,
  author       = {Troy Lee and
                  Tongyang Li and
                  Miklos Santha and
                  Shengyu Zhang},
  title        = {On the cut dimension of a graph},
  journal      = {CoRR},
  volume       = {abs/2011.05085},
  year         = {2020},
  url          = {https://arxiv.org/abs/2011.05085},
  eprinttype    = {arXiv},
  eprint       = {2011.05085},
  timestamp    = {Thu, 01 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2011-05085.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-09823,
  author       = {Simon Apers and
                  Troy Lee},
  title        = {Quantum query complexity of edge connectivity},
  journal      = {CoRR},
  volume       = {abs/2011.09823},
  year         = {2020},
  url          = {https://arxiv.org/abs/2011.09823},
  eprinttype    = {arXiv},
  eprint       = {2011.09823},
  timestamp    = {Thu, 26 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2011-09823.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Arunachalam0LPW19,
  author       = {Srinivasan Arunachalam and
                  Sourav Chakraborty and
                  Troy Lee and
                  Manaswi Paraashar and
                  Ronald de Wolf},
  editor       = {Christel Baier and
                  Ioannis Chatzigiannakis and
                  Paola Flocchini and
                  Stefano Leonardi},
  title        = {Two New Results About Quantum Exact Learning},
  booktitle    = {46th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2019, July 9-12, 2019, Patras, Greece},
  series       = {LIPIcs},
  volume       = {132},
  pages        = {16:1--16:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2019.16},
  doi          = {10.4230/LIPICS.ICALP.2019.16},
  timestamp    = {Tue, 27 Dec 2022 09:06:31 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/Arunachalam0LPW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GavinskyLSS19,
  author       = {Dmitry Gavinsky and
                  Troy Lee and
                  Miklos Santha and
                  Swagato Sanyal},
  editor       = {Christel Baier and
                  Ioannis Chatzigiannakis and
                  Paola Flocchini and
                  Stefano Leonardi},
  title        = {A Composition Theorem for Randomized Query Complexity via Max-Conflict
                  Complexity},
  booktitle    = {46th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2019, July 9-12, 2019, Patras, Greece},
  series       = {LIPIcs},
  volume       = {132},
  pages        = {64:1--64:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2019.64},
  doi          = {10.4230/LIPICS.ICALP.2019.64},
  timestamp    = {Mon, 08 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/GavinskyLSS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/LeeRS19,
  author       = {Troy Lee and
                  Maharshi Ray and
                  Miklos Santha},
  editor       = {Avrim Blum},
  title        = {Strategies for Quantum Races},
  booktitle    = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
                  2019, January 10-12, 2019, San Diego, California, {USA}},
  series       = {LIPIcs},
  volume       = {124},
  pages        = {51:1--51:21},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.ITCS.2019.51},
  doi          = {10.4230/LIPICS.ITCS.2019.51},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/innovations/LeeRS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BanninkBBLL19,
  author       = {Tom Bannink and
                  Jop Bri{\"{e}}t and
                  Harry Buhrman and
                  Farrokh Labib and
                  Troy Lee},
  editor       = {Rolf Niedermeier and
                  Christophe Paul},
  title        = {Bounding Quantum-Classical Separations for Classes of Nonlocal Games},
  booktitle    = {36th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2019, March 13-16, 2019, Berlin, Germany},
  series       = {LIPIcs},
  volume       = {126},
  pages        = {12:1--12:11},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2019.12},
  doi          = {10.4230/LIPICS.STACS.2019.12},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/BanninkBBLL19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ledger/AggarwalBLST18,
  author       = {Divesh Aggarwal and
                  Gavin K. Brennen and
                  Troy Lee and
                  Miklos Santha and
                  Marco Tomamichel},
  title        = {Quantum Attacks on Bitcoin, and How to Protect Against Them},
  journal      = {Ledger},
  volume       = {3},
  year         = {2018},
  url          = {https://doi.org/10.5195/ledger.2018.127},
  doi          = {10.5195/LEDGER.2018.127},
  timestamp    = {Wed, 24 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ledger/AggarwalBLST18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/0001KKLSSV18,
  author       = {Rahul Jain and
                  Hartmut Klauck and
                  Srijita Kundu and
                  Troy Lee and
                  Miklos Santha and
                  Swagato Sanyal and
                  Jevgenijs Vihrovs},
  editor       = {Fedor V. Fomin and
                  Vladimir V. Podolskii},
  title        = {Quadratically Tight Relations for Randomized Query Complexity},
  booktitle    = {Computer Science - Theory and Applications - 13th International Computer
                  Science Symposium in Russia, {CSR} 2018, Moscow, Russia, June 6-10,
                  2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10846},
  pages        = {207--219},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-90530-3\_18},
  doi          = {10.1007/978-3-319-90530-3\_18},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/csr/0001KKLSSV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-02226,
  author       = {Dmitry Gavinsky and
                  Troy Lee and
                  Miklos Santha},
  title        = {On the randomised query complexity of composition},
  journal      = {CoRR},
  volume       = {abs/1801.02226},
  year         = {2018},
  url          = {http://arxiv.org/abs/1801.02226},
  eprinttype    = {arXiv},
  eprint       = {1801.02226},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1801-02226.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-03671,
  author       = {Troy Lee and
                  Maharshi Ray and
                  Miklos Santha},
  title        = {Strategies for quantum races},
  journal      = {CoRR},
  volume       = {abs/1809.03671},
  year         = {2018},
  url          = {http://arxiv.org/abs/1809.03671},
  eprinttype    = {arXiv},
  eprint       = {1809.03671},
  timestamp    = {Fri, 05 Oct 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1809-03671.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-00481,
  author       = {Srinivasan Arunachalam and
                  Sourav Chakraborty and
                  Troy Lee and
                  Ronald de Wolf},
  title        = {Two new results about quantum exact learning},
  journal      = {CoRR},
  volume       = {abs/1810.00481},
  year         = {2018},
  url          = {http://arxiv.org/abs/1810.00481},
  eprinttype    = {arXiv},
  eprint       = {1810.00481},
  timestamp    = {Thu, 01 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1810-00481.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-10752,
  author       = {Dmitry Gavinsky and
                  Troy Lee and
                  Miklos Santha and
                  Swagato Sanyal},
  title        = {A composition theorem for randomized query complexity via max conflict
                  complexity},
  journal      = {CoRR},
  volume       = {abs/1811.10752},
  year         = {2018},
  url          = {http://arxiv.org/abs/1811.10752},
  eprinttype    = {arXiv},
  eprint       = {1811.10752},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1811-10752.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LeeMS17,
  author       = {Troy Lee and
                  Fr{\'{e}}d{\'{e}}ric Magniez and
                  Miklos Santha},
  title        = {Improved Quantum Query Algorithms for Triangle Detection and Associativity
                  Testing},
  journal      = {Algorithmica},
  volume       = {77},
  number       = {2},
  pages        = {459--486},
  year         = {2017},
  url          = {https://doi.org/10.1007/s00453-015-0084-9},
  doi          = {10.1007/S00453-015-0084-9},
  timestamp    = {Sat, 31 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/LeeMS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BraunJLP17,
  author       = {G{\'{a}}bor Braun and
                  Rahul Jain and
                  Troy Lee and
                  Sebastian Pokutta},
  title        = {Information-theoretic approximations of the nonnegative rank},
  journal      = {Comput. Complex.},
  volume       = {26},
  number       = {1},
  pages        = {147--197},
  year         = {2017},
  url          = {https://doi.org/10.1007/s00037-016-0125-z},
  doi          = {10.1007/S00037-016-0125-Z},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/BraunJLP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AmbainisBBLSS17,
  author       = {Andris Ambainis and
                  Kaspars Balodis and
                  Aleksandrs Belovs and
                  Troy Lee and
                  Miklos Santha and
                  Juris Smotrovs},
  title        = {Separations in Query Complexity Based on Pointer Functions},
  journal      = {J. {ACM}},
  volume       = {64},
  number       = {5},
  pages        = {32:1--32:24},
  year         = {2017},
  url          = {https://doi.org/10.1145/3106234},
  doi          = {10.1145/3106234},
  timestamp    = {Sat, 08 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/AmbainisBBLSS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LeeWW17,
  author       = {Troy Lee and
                  Zhaohui Wei and
                  Ronald de Wolf},
  title        = {Some upper and lower bounds on PSD-rank},
  journal      = {Math. Program.},
  volume       = {162},
  number       = {1-2},
  pages        = {495--521},
  year         = {2017},
  url          = {https://doi.org/10.1007/s10107-016-1052-0},
  doi          = {10.1007/S10107-016-1052-0},
  timestamp    = {Wed, 26 Jul 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/LeeWW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AnshuBGJKL17,
  author       = {Anurag Anshu and
                  Shalev Ben{-}David and
                  Ankit Garg and
                  Rahul Jain and
                  Robin Kothari and
                  Troy Lee},
  editor       = {Ryan O'Donnell},
  title        = {Separating Quantum Communication and Approximate Rank},
  booktitle    = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
                  Riga, Latvia},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {24:1--24:33},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2017.24},
  doi          = {10.4230/LIPICS.CCC.2017.24},
  timestamp    = {Thu, 02 Feb 2023 13:27:05 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/AnshuBGJKL17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AnshuGJKLMSS17,
  author       = {Anurag Anshu and
                  Dmitry Gavinsky and
                  Rahul Jain and
                  Srijita Kundu and
                  Troy Lee and
                  Priyanka Mukhopadhyay and
                  Miklos Santha and
                  Swagato Sanyal},
  editor       = {Satya V. Lokam and
                  R. Ramanujam},
  title        = {A Composition Theorem for Randomized Query Complexity},
  booktitle    = {37th {IARCS} Annual Conference on Foundations of Software Technology
                  and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
                  Kanpur, India},
  series       = {LIPIcs},
  volume       = {93},
  pages        = {10:1--10:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.10},
  doi          = {10.4230/LIPICS.FSTTCS.2017.10},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/fsttcs/AnshuGJKLMSS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AnshuG0KLMSS17,
  author       = {Anurag Anshu and
                  Dmitry Gavinsky and
                  Rahul Jain and
                  Srijita Kundu and
                  Troy Lee and
                  Priyanka Mukhopadhyay and
                  Miklos Santha and
                  Swagato Sanyal},
  title        = {A Composition Theorem for Randomized Query Complexity},
  journal      = {CoRR},
  volume       = {abs/1706.00335},
  year         = {2017},
  url          = {http://arxiv.org/abs/1706.00335},
  eprinttype    = {arXiv},
  eprint       = {1706.00335},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AnshuG0KLMSS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-00822,
  author       = {Dmitry Gavinsky and
                  Rahul Jain and
                  Hartmut Klauck and
                  Srijita Kundu and
                  Troy Lee and
                  Miklos Santha and
                  Swagato Sanyal and
                  Jevgenijs Vihrovs},
  title        = {Quadratically Tight Relations for Randomized Query Complexity},
  journal      = {CoRR},
  volume       = {abs/1708.00822},
  year         = {2017},
  url          = {http://arxiv.org/abs/1708.00822},
  eprinttype    = {arXiv},
  eprint       = {1708.00822},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1708-00822.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AnshuGJKLMSS17,
  author       = {Anurag Anshu and
                  Dmitry Gavinsky and
                  Rahul Jain and
                  Srijita Kundu and
                  Troy Lee and
                  Priyanka Mukhopadhyay and
                  Miklos Santha and
                  Swagato Sanyal},
  title        = {A Composition Theorem for Randomized Query complexity},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR17-107}},
  year         = {2017},
  url          = {https://eccc.weizmann.ac.il/report/2017/107},
  eprinttype    = {ECCC},
  eprint       = {TR17-107},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/AnshuGJKLMSS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GavinskyJKKLSSV17,
  author       = {Dmitry Gavinsky and
                  Rahul Jain and
                  Hartmut Klauck and
                  Srijita Kundu and
                  Troy Lee and
                  Miklos Santha and
                  Swagato Sanyal and
                  Jevgenijs Vihrovs},
  title        = {Quadratically Tight Relations for Randomized Query Complexity},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR17-123}},
  year         = {2017},
  url          = {https://eccc.weizmann.ac.il/report/2017/123},
  eprinttype    = {ECCC},
  eprint       = {TR17-123},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/GavinskyJKKLSSV17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LeeLSW16,
  author       = {Troy Lee and
                  Nikos Leonardos and
                  Michael E. Saks and
                  Fengming Wang},
  title        = {Hellinger volume and number-on-the-forehead communication complexity},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {82},
  number       = {6},
  pages        = {1064--1074},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.jcss.2016.03.005},
  doi          = {10.1016/J.JCSS.2016.03.005},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/LeeLSW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeePWY16,
  author       = {Troy Lee and
                  Anupam Prakash and
                  Ronald de Wolf and
                  Henry Yuen},
  editor       = {Ran Raz},
  title        = {On the Sum-of-Squares Degree of Symmetric Quadratic Functions},
  booktitle    = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
                  June 1, 2016, Tokyo, Japan},
  series       = {LIPIcs},
  volume       = {50},
  pages        = {17:1--17:31},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2016.17},
  doi          = {10.4230/LIPICS.CCC.2016.17},
  timestamp    = {Thu, 02 Feb 2023 13:27:05 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/LeePWY16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AnshuBBG0KLS16,
  author       = {Anurag Anshu and
                  Aleksandrs Belovs and
                  Shalev Ben{-}David and
                  Mika G{\"{o}}{\"{o}}s and
                  Rahul Jain and
                  Robin Kothari and
                  Troy Lee and
                  Miklos Santha},
  editor       = {Irit Dinur},
  title        = {Separations in Communication Complexity Using Cheat Sheets and Information
                  Complexity},
  booktitle    = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
                  2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
                  {USA}},
  pages        = {555--564},
  publisher    = {{IEEE} Computer Society},
  year         = {2016},
  url          = {https://doi.org/10.1109/FOCS.2016.66},
  doi          = {10.1109/FOCS.2016.66},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/AnshuBBG0KLS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AmbainisBBLSS16,
  author       = {Andris Ambainis and
                  Kaspars Balodis and
                  Aleksandrs Belovs and
                  Troy Lee and
                  Miklos Santha and
                  Juris Smotrovs},
  editor       = {Daniel Wichs and
                  Yishay Mansour},
  title        = {Separations in query complexity based on pointer functions},
  booktitle    = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
                  of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
  pages        = {800--813},
  publisher    = {{ACM}},
  year         = {2016},
  url          = {https://doi.org/10.1145/2897518.2897524},
  doi          = {10.1145/2897518.2897524},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/AmbainisBBLSS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeePWY16,
  author       = {Troy Lee and
                  Anupam Prakash and
                  Ronald de Wolf and
                  Henry Yuen},
  title        = {On the sum-of-squares degree of symmetric quadratic functions},
  journal      = {CoRR},
  volume       = {abs/1601.02311},
  year         = {2016},
  url          = {http://arxiv.org/abs/1601.02311},
  eprinttype    = {arXiv},
  eprint       = {1601.02311},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/LeePWY16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AnshuBBGJKLS16,
  author       = {Anurag Anshu and
                  Aleksandrs Belovs and
                  Shalev Ben{-}David and
                  Mika G{\"{o}}{\"{o}}s and
                  Rahul Jain and
                  Robin Kothari and
                  Troy Lee and
                  Miklos Santha},
  title        = {Separations in communication complexity using cheat sheets and information
                  complexity},
  journal      = {CoRR},
  volume       = {abs/1605.01142},
  year         = {2016},
  url          = {http://arxiv.org/abs/1605.01142},
  eprinttype    = {arXiv},
  eprint       = {1605.01142},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AnshuBBGJKLS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AnshuBG0KL16,
  author       = {Anurag Anshu and
                  Shalev Ben{-}David and
                  Ankit Garg and
                  Rahul Jain and
                  Robin Kothari and
                  Troy Lee},
  title        = {Separating quantum communication and approximate rank},
  journal      = {CoRR},
  volume       = {abs/1611.05754},
  year         = {2016},
  url          = {http://arxiv.org/abs/1611.05754},
  eprinttype    = {arXiv},
  eprint       = {1611.05754},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AnshuBG0KL16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AnshuBBGJKLS16,
  author       = {Anurag Anshu and
                  Aleksandrs Belovs and
                  Shalev Ben{-}David and
                  Mika G{\"{o}}{\"{o}}s and
                  Rahul Jain and
                  Robin Kothari and
                  Troy Lee and
                  Miklos Santha},
  title        = {Separations in communication complexity using cheat sheets and information
                  complexity},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR16-072}},
  year         = {2016},
  url          = {https://eccc.weizmann.ac.il/report/2016/072},
  eprinttype    = {ECCC},
  eprint       = {TR16-072},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/AnshuBBGJKLS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FriesenHLT15,
  author       = {Mirjam Friesen and
                  Aya Hamed and
                  Troy Lee and
                  Dirk Oliver Theis},
  title        = {Fooling-sets and rank},
  journal      = {Eur. J. Comb.},
  volume       = {48},
  pages        = {143--153},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ejc.2015.02.016},
  doi          = {10.1016/J.EJC.2015.02.016},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/FriesenHLT15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KaniewskiLW15,
  author       = {Jedrzej Kaniewski and
                  Troy Lee and
                  Ronald de Wolf},
  editor       = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Kazuo Iwama and
                  Naoki Kobayashi and
                  Bettina Speckmann},
  title        = {Query Complexity in Expectation},
  booktitle    = {Automata, Languages, and Programming - 42nd International Colloquium,
                  {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {9134},
  pages        = {761--772},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-47672-7\_62},
  doi          = {10.1007/978-3-662-47672-7\_62},
  timestamp    = {Fri, 27 Mar 2020 09:02:59 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/KaniewskiLW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AmbainisBBLSS15,
  author       = {Andris Ambainis and
                  Kaspars Balodis and
                  Aleksandrs Belovs and
                  Troy Lee and
                  Miklos Santha and
                  Juris Smotrovs},
  title        = {Separations in Query Complexity Based on Pointer Functions},
  journal      = {CoRR},
  volume       = {abs/1506.04719},
  year         = {2015},
  url          = {http://arxiv.org/abs/1506.04719},
  eprinttype    = {arXiv},
  eprint       = {1506.04719},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AmbainisBBLSS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/KlauckLTT15,
  author       = {Hartmut Klauck and
                  Troy Lee and
                  Dirk Oliver Theis and
                  Rekha R. Thomas},
  title        = {Limitations of convex programming: lower bounds on extended formulations
                  and factorization ranks (Dagstuhl Seminar 15082)},
  journal      = {Dagstuhl Reports},
  volume       = {5},
  number       = {2},
  pages        = {109--127},
  year         = {2015},
  url          = {https://doi.org/10.4230/DagRep.5.2.109},
  doi          = {10.4230/DAGREP.5.2.109},
  timestamp    = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dagstuhl-reports/KlauckLTT15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AmbainisBBLSS15,
  author       = {Andris Ambainis and
                  Kaspars Balodis and
                  Aleksandrs Belovs and
                  Troy Lee and
                  Miklos Santha and
                  Juris Smotrovs},
  title        = {Separations in Query Complexity Based on Pointer Functions},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR15-098}},
  year         = {2015},
  url          = {https://eccc.weizmann.ac.il/report/2015/098},
  eprinttype    = {ECCC},
  eprint       = {TR15-098},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/AmbainisBBLSS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AlonLS14,
  author       = {Noga Alon and
                  Troy Lee and
                  Adi Shraibman},
  editor       = {Klaus Jansen and
                  Jos{\'{e}} D. P. Rolim and
                  Nikhil R. Devanur and
                  Cristopher Moore},
  title        = {The Cover Number of a Matrix and its Algorithmic Applications},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
                  Spain},
  series       = {LIPIcs},
  volume       = {28},
  pages        = {34--47},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2014},
  url          = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.34},
  doi          = {10.4230/LIPICS.APPROX-RANDOM.2014.34},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/AlonLS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JainLV14,
  author       = {Rahul Jain and
                  Troy Lee and
                  Nisheeth K. Vishnoi},
  title        = {A quadratically tight partition bound for classical communication
                  complexity and query complexity},
  journal      = {CoRR},
  volume       = {abs/1401.4512},
  year         = {2014},
  url          = {http://arxiv.org/abs/1401.4512},
  eprinttype    = {arXiv},
  eprint       = {1401.4512},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/JainLV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeeWW14,
  author       = {Troy Lee and
                  Zhaohui Wei and
                  Ronald de Wolf},
  title        = {Some upper and lower bounds on PSD-rank},
  journal      = {CoRR},
  volume       = {abs/1407.4308},
  year         = {2014},
  url          = {http://arxiv.org/abs/1407.4308},
  eprinttype    = {arXiv},
  eprint       = {1407.4308},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/LeeWW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeeLSW14,
  author       = {Troy Lee and
                  Nikos Leonardos and
                  Michael E. Saks and
                  Fengming Wang},
  title        = {Hellinger volume and number-on-the-forehead communication complexity},
  journal      = {CoRR},
  volume       = {abs/1407.5425},
  year         = {2014},
  url          = {http://arxiv.org/abs/1407.5425},
  eprinttype    = {arXiv},
  eprint       = {1407.5425},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/LeeLSW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeeW14a,
  author       = {Troy Lee and
                  Zhaohui Wei},
  title        = {The square root rank of the correlation polytope is exponential},
  journal      = {CoRR},
  volume       = {abs/1411.6712},
  year         = {2014},
  url          = {http://arxiv.org/abs/1411.6712},
  eprinttype    = {arXiv},
  eprint       = {1411.6712},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/LeeW14a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KaniewskiLW14,
  author       = {Jedrzej Kaniewski and
                  Troy Lee and
                  Ronald de Wolf},
  title        = {Query complexity in expectation},
  journal      = {CoRR},
  volume       = {abs/1411.7280},
  year         = {2014},
  url          = {http://arxiv.org/abs/1411.7280},
  eprinttype    = {arXiv},
  eprint       = {1411.7280},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/KaniewskiLW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LeeR13,
  author       = {Troy Lee and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {A strong direct product theorem for quantum query complexity},
  journal      = {Comput. Complex.},
  volume       = {22},
  number       = {2},
  pages        = {429--462},
  year         = {2013},
  url          = {https://doi.org/10.1007/s00037-013-0066-8},
  doi          = {10.1007/S00037-013-0066-8},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/LeeR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/BrietBLV13,
  author       = {Jop Bri{\"{e}}t and
                  Harry Buhrman and
                  Troy Lee and
                  Thomas Vidick},
  title        = {Multipartite entanglement in {XOR} games},
  journal      = {Quantum Inf. Comput.},
  volume       = {13},
  number       = {3-4},
  pages        = {334--360},
  year         = {2013},
  url          = {https://doi.org/10.26421/QIC13.3-4-11},
  doi          = {10.26421/QIC13.3-4-11},
  timestamp    = {Thu, 29 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/qic/BrietBLV13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/LeeS13,
  author       = {Troy Lee and
                  Adi Shraibman},
  editor       = {Christopher J. C. Burges and
                  L{\'{e}}on Bottou and
                  Zoubin Ghahramani and
                  Kilian Q. Weinberger},
  title        = {Matrix Completion From any Given Set of Observations},
  booktitle    = {Advances in Neural Information Processing Systems 26: 27th Annual
                  Conference on Neural Information Processing Systems 2013. Proceedings
                  of a meeting held December 5-8, 2013, Lake Tahoe, Nevada, United States},
  pages        = {1781--1787},
  year         = {2013},
  url          = {https://proceedings.neurips.cc/paper/2013/hash/892c91e0a653ba19df81a90f89d99bcd-Abstract.html},
  timestamp    = {Mon, 16 May 2022 15:41:51 +0200},
  biburl       = {https://dblp.org/rec/conf/nips/LeeS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LeeMS13,
  author       = {Troy Lee and
                  Fr{\'{e}}d{\'{e}}ric Magniez and
                  Miklos Santha},
  editor       = {Sanjeev Khanna},
  title        = {Improved quantum query algorithms for triangle finding and associativity
                  testing},
  booktitle    = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
                  2013},
  pages        = {1486--1502},
  publisher    = {{SIAM}},
  year         = {2013},
  url          = {https://doi.org/10.1137/1.9781611973105.107},
  doi          = {10.1137/1.9781611973105.107},
  timestamp    = {Tue, 02 Feb 2021 17:07:29 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/LeeMS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlonLSV13,
  author       = {Noga Alon and
                  Troy Lee and
                  Adi Shraibman and
                  Santosh S. Vempala},
  editor       = {Dan Boneh and
                  Tim Roughgarden and
                  Joan Feigenbaum},
  title        = {The approximate rank of a matrix and its algorithmic applications:
                  approximate rank},
  booktitle    = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
                  USA, June 1-4, 2013},
  pages        = {675--684},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2488608.2488694},
  doi          = {10.1145/2488608.2488694},
  timestamp    = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/AlonLSV13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-4147,
  author       = {LeRoy Beasely and
                  Troy Lee and
                  Hartmut Klauck and
                  Dirk Oliver Theis},
  title        = {Dagstuhl Report 13082: Communication Complexity, Linear Optimization,
                  and lower bounds for the nonnegative rank of matrices},
  journal      = {CoRR},
  volume       = {abs/1305.4147},
  year         = {2013},
  url          = {http://arxiv.org/abs/1305.4147},
  eprinttype    = {arXiv},
  eprint       = {1305.4147},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1305-4147.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HamedL13,
  author       = {Aya Hamed and
                  Troy Lee},
  title        = {Rank and fooling set size},
  journal      = {CoRR},
  volume       = {abs/1310.7321},
  year         = {2013},
  url          = {http://arxiv.org/abs/1310.7321},
  eprinttype    = {arXiv},
  eprint       = {1310.7321},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/HamedL13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BeasleyKLT13,
  author       = {LeRoy B. Beasley and
                  Hartmut Klauck and
                  Troy Lee and
                  Dirk Oliver Theis},
  title        = {Communication Complexity, Linear Optimization, and lower bounds for
                  the nonnegative rank of matrices (Dagstuhl Seminar 13082)},
  journal      = {Dagstuhl Reports},
  volume       = {3},
  number       = {2},
  pages        = {127--143},
  year         = {2013},
  url          = {https://doi.org/10.4230/DagRep.3.2.127},
  doi          = {10.4230/DAGREP.3.2.127},
  timestamp    = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dagstuhl-reports/BeasleyKLT13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BraunJLP13,
  author       = {G{\'{a}}bor Braun and
                  Rahul Jain and
                  Troy Lee and
                  Sebastian Pokutta},
  title        = {Information-theoretic approximations of the nonnegative rank},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR13-158}},
  year         = {2013},
  url          = {https://eccc.weizmann.ac.il/report/2013/158},
  eprinttype    = {ECCC},
  eprint       = {TR13-158},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/BraunJLP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/LeeMS12,
  author       = {Troy Lee and
                  Fr{\'{e}}d{\'{e}}ric Magniez and
                  Miklos Santha},
  title        = {Learning graph based quantum query algorithms for finding constant-size
                  subgraphs},
  journal      = {Chic. J. Theor. Comput. Sci.},
  volume       = {2012},
  year         = {2012},
  url          = {http://cjtcs.cs.uchicago.edu/articles/2012/10/contents.html},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cjtcs/LeeMS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeeR12,
  author       = {Troy Lee and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {A Strong Direct Product Theorem for Quantum Query Complexity},
  booktitle    = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
                  2012, Porto, Portugal, June 26-29, 2012},
  pages        = {236--246},
  publisher    = {{IEEE} Computer Society},
  year         = {2012},
  url          = {https://doi.org/10.1109/CCC.2012.17},
  doi          = {10.1109/CCC.2012.17},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/LeeR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/LeeT12,
  author       = {Troy Lee and
                  Dirk Oliver Theis},
  editor       = {Andreas Brieden and
                  Zafer{-}Korcan G{\"{o}}rg{\"{u}}l{\"{u}} and
                  Tino Krug and
                  Erik Kropat and
                  Silja Meyer{-}Nieberg and
                  Goran Mihelcic and
                  Stefan Wolfgang Pickl},
  title        = {Lower Bounds for Sizes of Semidefinite Formulations for Some Combinatorial
                  Optimization Problems},
  booktitle    = {11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
                  Munich, Germany, May 29-31, 2012. Extended Abstracts},
  pages        = {176--180},
  year         = {2012},
  timestamp    = {Thu, 16 May 2013 15:41:40 +0200},
  biburl       = {https://dblp.org/rec/conf/colognetwente/LeeT12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/IvanyosKLSW12,
  author       = {G{\'{a}}bor Ivanyos and
                  Hartmut Klauck and
                  Troy Lee and
                  Miklos Santha and
                  Ronald de Wolf},
  editor       = {Deepak D'Souza and
                  Telikepalli Kavitha and
                  Jaikumar Radhakrishnan},
  title        = {New bounds on the classical and quantum communication complexity of
                  some graph properties},
  booktitle    = {{IARCS} Annual Conference on Foundations of Software Technology and
                  Theoretical Computer Science, {FSTTCS} 2012, December 15-17, 2012,
                  Hyderabad, India},
  series       = {LIPIcs},
  volume       = {18},
  pages        = {148--159},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2012},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2012.148},
  doi          = {10.4230/LIPICS.FSTTCS.2012.148},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/fsttcs/IvanyosKLSW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-3961,
  author       = {Troy Lee and
                  Dirk Oliver Theis},
  title        = {Lower bounds for sizes of semidefinite formulations for some combinatorial
                  optimization problems},
  journal      = {CoRR},
  volume       = {abs/1203.3961},
  year         = {2012},
  url          = {http://arxiv.org/abs/1203.3961},
  eprinttype    = {arXiv},
  eprint       = {1203.3961},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1203-3961.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-4596,
  author       = {G{\'{a}}bor Ivanyos and
                  Hartmut Klauck and
                  Troy Lee and
                  Miklos Santha and
                  Ronald de Wolf},
  title        = {New bounds on the classical and quantum communication complexity of
                  some graph properties},
  journal      = {CoRR},
  volume       = {abs/1204.4596},
  year         = {2012},
  url          = {http://arxiv.org/abs/1204.4596},
  eprinttype    = {arXiv},
  eprint       = {1204.4596},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1204-4596.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeeMRSS11,
  author       = {Troy Lee and
                  Rajat Mittal and
                  Ben W. Reichardt and
                  Robert Spalek and
                  Mario Szegedy},
  editor       = {Rafail Ostrovsky},
  title        = {Quantum Query Complexity of State Conversion},
  booktitle    = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
                  2011, Palm Springs, CA, USA, October 22-25, 2011},
  pages        = {344--353},
  publisher    = {{IEEE} Computer Society},
  year         = {2011},
  url          = {https://doi.org/10.1109/FOCS.2011.75},
  doi          = {10.1109/FOCS.2011.75},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/LeeMRSS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-4468,
  author       = {Troy Lee and
                  J{\'{e}}r{\'{e}}mie Roland},
  title        = {A strong direct product theorem for quantum query complexity},
  journal      = {CoRR},
  volume       = {abs/1104.4468},
  year         = {2011},
  url          = {http://arxiv.org/abs/1104.4468},
  eprinttype    = {arXiv},
  eprint       = {1104.4468},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1104-4468.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-5135,
  author       = {Troy Lee and
                  Fr{\'{e}}d{\'{e}}ric Magniez and
                  Miklos Santha},
  title        = {A learning graph based quantum query algorithm for finding constant-size
                  subgraphs},
  journal      = {CoRR},
  volume       = {abs/1109.5135},
  year         = {2011},
  url          = {http://arxiv.org/abs/1109.5135},
  eprinttype    = {arXiv},
  eprint       = {1109.5135},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1109-5135.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/LeeZ10,
  author       = {Troy Lee and
                  Shengyu Zhang},
  editor       = {Samson Abramsky and
                  Cyril Gavoille and
                  Claude Kirchner and
                  Friedhelm Meyer auf der Heide and
                  Paul G. Spirakis},
  title        = {Composition Theorems in Communication Complexity},
  booktitle    = {Automata, Languages and Programming, 37th International Colloquium,
                  {ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
                  {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {6198},
  pages        = {475--489},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-14165-2\_41},
  doi          = {10.1007/978-3-642-14165-2\_41},
  timestamp    = {Thu, 01 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/LeeZ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1003-1443,
  author       = {Troy Lee and
                  Shengyu Zhang},
  title        = {Composition theorems in communication complexity},
  journal      = {CoRR},
  volume       = {abs/1003.1443},
  year         = {2010},
  url          = {http://arxiv.org/abs/1003.1443},
  eprinttype    = {arXiv},
  eprint       = {1003.1443},
  timestamp    = {Thu, 01 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1003-1443.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LeeS09,
  author       = {Troy Lee and
                  Adi Shraibman},
  title        = {Disjointness is Hard in the Multiparty Number-on-the-Forehead Model},
  journal      = {Comput. Complex.},
  volume       = {18},
  number       = {2},
  pages        = {309--336},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00037-009-0276-2},
  doi          = {10.1007/S00037-009-0276-2},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/LeeS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fttcs/LeeS09,
  author       = {Troy Lee and
                  Adi Shraibman},
  title        = {Lower Bounds in Communication Complexity},
  journal      = {Found. Trends Theor. Comput. Sci.},
  volume       = {3},
  number       = {4},
  pages        = {263--398},
  year         = {2009},
  url          = {https://doi.org/10.1561/0400000040},
  doi          = {10.1561/0400000040},
  timestamp    = {Thu, 20 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/fttcs/LeeS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeeSS09,
  author       = {Troy Lee and
                  Gideon Schechtman and
                  Adi Shraibman},
  title        = {Lower Bounds on Quantum Multiparty Communication Complexity},
  booktitle    = {Proceedings of the 24th Annual {IEEE} Conference on Computational
                  Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
  pages        = {254--262},
  publisher    = {{IEEE} Computer Society},
  year         = {2009},
  url          = {https://doi.org/10.1109/CCC.2009.24},
  doi          = {10.1109/CCC.2009.24},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/LeeSS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeeS09,
  author       = {Troy Lee and
                  Adi Shraibman},
  title        = {An Approximation Algorithm for Approximation Rank},
  booktitle    = {Proceedings of the 24th Annual {IEEE} Conference on Computational
                  Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
  pages        = {351--357},
  publisher    = {{IEEE} Computer Society},
  year         = {2009},
  url          = {https://doi.org/10.1109/CCC.2009.25},
  doi          = {10.1109/CCC.2009.25},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/LeeS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-4607,
  author       = {Troy Lee},
  title        = {A note on the sign degree of formulas},
  journal      = {CoRR},
  volume       = {abs/0909.4607},
  year         = {2009},
  url          = {http://arxiv.org/abs/0909.4607},
  eprinttype    = {arXiv},
  eprint       = {0909.4607},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0909-4607.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeeSS08,
  author       = {Troy Lee and
                  Adi Shraibman and
                  Robert Spalek},
  title        = {A Direct Product Theorem for Discrepancy},
  booktitle    = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
                  Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
  pages        = {71--80},
  publisher    = {{IEEE} Computer Society},
  year         = {2008},
  url          = {https://doi.org/10.1109/CCC.2008.25},
  doi          = {10.1109/CCC.2008.25},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/LeeSS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeeS08,
  author       = {Troy Lee and
                  Adi Shraibman},
  title        = {Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model},
  booktitle    = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
                  Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
  pages        = {81--91},
  publisher    = {{IEEE} Computer Society},
  year         = {2008},
  url          = {https://doi.org/10.1109/CCC.2008.29},
  doi          = {10.1109/CCC.2008.29},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/LeeS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/LeeM08,
  author       = {Troy Lee and
                  Rajat Mittal},
  editor       = {Luca Aceto and
                  Ivan Damg{\aa}rd and
                  Leslie Ann Goldberg and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Anna Ing{\'{o}}lfsd{\'{o}}ttir and
                  Igor Walukiewicz},
  title        = {Product Theorems Via Semidefinite Programming},
  booktitle    = {Automata, Languages and Programming, 35th International Colloquium,
                  {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
                  {I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
  series       = {Lecture Notes in Computer Science},
  volume       = {5125},
  pages        = {674--685},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-70575-8\_55},
  doi          = {10.1007/978-3-540-70575-8\_55},
  timestamp    = {Wed, 26 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/LeeM08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChildsL08,
  author       = {Andrew M. Childs and
                  Troy Lee},
  editor       = {Luca Aceto and
                  Ivan Damg{\aa}rd and
                  Leslie Ann Goldberg and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Anna Ing{\'{o}}lfsd{\'{o}}ttir and
                  Igor Walukiewicz},
  title        = {Optimal Quantum Adversary Lower Bounds for Ordered Search},
  booktitle    = {Automata, Languages and Programming, 35th International Colloquium,
                  {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
                  {I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
  series       = {Lecture Notes in Computer Science},
  volume       = {5125},
  pages        = {869--880},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-70575-8\_71},
  doi          = {10.1007/978-3-540-70575-8\_71},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/ChildsL08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/LeeS08,
  author       = {Troy Lee and
                  Adi Shraibman},
  editor       = {Peter Bro Miltersen and
                  R{\"{u}}diger Reischuk and
                  Georg Schnitger and
                  Dieter van Melkebeek},
  title        = {Approximation norms and duality for communication complexity lower
                  bounds},
  booktitle    = {Computational Complexity of Discrete Problems, 14.09. - 19.09.2008},
  series       = {Dagstuhl Seminar Proceedings},
  volume       = {08381},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
  year         = {2008},
  url          = {http://drops.dagstuhl.de/opus/volltexte/2008/1776/},
  timestamp    = {Thu, 10 Jun 2021 13:02:05 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/LeeS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0803-4206,
  author       = {Troy Lee and
                  Rajat Mittal},
  title        = {Product theorems via semidefinite programming},
  journal      = {CoRR},
  volume       = {abs/0803.4206},
  year         = {2008},
  url          = {http://arxiv.org/abs/0803.4206},
  eprinttype    = {arXiv},
  eprint       = {0803.4206},
  timestamp    = {Wed, 26 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0803-4206.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0809-2093,
  author       = {Troy Lee and
                  Adi Shraibman},
  title        = {An approximation algorithm for approximation rank},
  journal      = {CoRR},
  volume       = {abs/0809.2093},
  year         = {2008},
  url          = {http://arxiv.org/abs/0809.2093},
  eprinttype    = {arXiv},
  eprint       = {0809.2093},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0809-2093.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LeeS08,
  author       = {Troy Lee and
                  Adi Shraibman},
  title        = {Disjointness is hard in the multi-party number-on-the-forehead model},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR08-003}},
  year         = {2008},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-003/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR08-003},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/LeeS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Lee07,
  author       = {Troy Lee},
  editor       = {Wolfgang Thomas and
                  Pascal Weil},
  title        = {A New Rank Technique for Formula Size Lower Bounds},
  booktitle    = {{STACS} 2007, 24th Annual Symposium on Theoretical Aspects of Computer
                  Science, Aachen, Germany, February 22-24, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4393},
  pages        = {145--156},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-70918-3\_13},
  doi          = {10.1007/978-3-540-70918-3\_13},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Lee07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HoyerLS07,
  author       = {Peter H{\o}yer and
                  Troy Lee and
                  Robert Spalek},
  editor       = {David S. Johnson and
                  Uriel Feige},
  title        = {Negative weights make adversaries stronger},
  booktitle    = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
                  San Diego, California, USA, June 11-13, 2007},
  pages        = {526--535},
  publisher    = {{ACM}},
  year         = {2007},
  url          = {https://doi.org/10.1145/1250790.1250867},
  doi          = {10.1145/1250790.1250867},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/HoyerLS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0712-4279,
  author       = {Troy Lee and
                  Adi Shraibman},
  title        = {Disjointness is hard in the multi-party number on the forehead model},
  journal      = {CoRR},
  volume       = {abs/0712.4279},
  year         = {2007},
  url          = {http://arxiv.org/abs/0712.4279},
  eprinttype    = {arXiv},
  eprint       = {0712.4279},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0712-4279.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LaplanteLS06,
  author       = {Sophie Laplante and
                  Troy Lee and
                  Mario Szegedy},
  title        = {The Quantum Adversary Method and Classical Formula Size Lower Bounds},
  journal      = {Comput. Complex.},
  volume       = {15},
  number       = {2},
  pages        = {163--196},
  year         = {2006},
  url          = {https://doi.org/10.1007/s00037-006-0212-7},
  doi          = {10.1007/S00037-006-0212-7},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/LaplanteLS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FortnowLV06,
  author       = {Lance Fortnow and
                  Troy Lee and
                  Nikolai K. Vereshchagin},
  editor       = {Bruno Durand and
                  Wolfgang Thomas},
  title        = {Kolmogorov Complexity with Error},
  booktitle    = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
                  Science, Marseille, France, February 23-25, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3884},
  pages        = {137--148},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11672142\_10},
  doi          = {10.1007/11672142\_10},
  timestamp    = {Wed, 19 May 2021 12:05:43 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/FortnowLV06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BuhrmanLM05,
  author       = {Harry Buhrman and
                  Troy Lee and
                  Dieter van Melkebeek},
  title        = {Language compression and pseudorandom generators},
  journal      = {Comput. Complex.},
  volume       = {14},
  number       = {3},
  pages        = {228--255},
  year         = {2005},
  url          = {https://doi.org/10.1007/s00037-005-0199-5},
  doi          = {10.1007/S00037-005-0199-5},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/BuhrmanLM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeeR05,
  author       = {Troy Lee and
                  Andrei E. Romashchenko},
  title        = {Resource bounded symmetry of information revisited},
  journal      = {Theor. Comput. Sci.},
  volume       = {345},
  number       = {2-3},
  pages        = {386--405},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.07.017},
  doi          = {10.1016/J.TCS.2005.07.017},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LeeR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LaplanteLS05,
  author       = {Sophie Laplante and
                  Troy Lee and
                  Mario Szegedy},
  title        = {The Quantum Adversary Method and Classical Formula Size Lower Bounds},
  booktitle    = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
                  11-15 June 2005, San Jose, CA, {USA}},
  pages        = {76--90},
  publisher    = {{IEEE} Computer Society},
  year         = {2005},
  url          = {https://doi.org/10.1109/CCC.2005.29},
  doi          = {10.1109/CCC.2005.29},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/LaplanteLS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanLM04,
  author       = {Harry Buhrman and
                  Troy Lee and
                  Dieter van Melkebeek},
  title        = {Language Compression and Pseudorandom Generators},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {15--28},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313772},
  doi          = {10.1109/CCC.2004.1313772},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BuhrmanLM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LeeR04,
  author       = {Troy Lee and
                  Andrei E. Romashchenko},
  editor       = {Jir{\'{\i}} Fiala and
                  V{\'{a}}clav Koubek and
                  Jan Kratochv{\'{\i}}l},
  title        = {On Polynomially Time Bounded Symmetry of Information},
  booktitle    = {Mathematical Foundations of Computer Science 2004, 29th International
                  Symposium, {MFCS} 2004, Prague, Czech Republic, August 22-27, 2004,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3153},
  pages        = {463--475},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/978-3-540-28629-5\_35},
  doi          = {10.1007/978-3-540-28629-5\_35},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/LeeR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-002,
  author       = {Troy Lee and
                  Dieter van Melkebeek and
                  Harry Buhrman},
  title        = {Language Compression and Pseudorandom Generators},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR04-002}},
  year         = {2004},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-002/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR04-002},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR04-002.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-031,
  author       = {Troy Lee and
                  Andrei E. Romashchenko},
  title        = {On Polynomially Time Bounded Symmetry of Information},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR04-031}},
  year         = {2004},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-031/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR04-031},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR04-031.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-080,
  author       = {Lance Fortnow and
                  Troy Lee and
                  Nikolai K. Vereshchagin},
  title        = {Kolmogorov Complexity with Error},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR04-080}},
  year         = {2004},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-080/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR04-080},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR04-080.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/Lee03,
  author       = {Troy Lee},
  title        = {Arithmetical definability over finite structures},
  journal      = {Math. Log. Q.},
  volume       = {49},
  number       = {4},
  pages        = {385--392},
  year         = {2003},
  url          = {https://doi.org/10.1002/malq.200310041},
  doi          = {10.1002/MALQ.200310041},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mlq/Lee03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/osid/TereshkoL02,
  author       = {Valery Tereshko and
                  Troy Lee},
  title        = {How Information-Mapping Patterns Determine Foraging Behaviour of a
                  Honey Bee Colony},
  journal      = {Open Syst. Inf. Dyn.},
  volume       = {9},
  number       = {2},
  pages        = {181--194},
  year         = {2002},
  url          = {https://doi.org/10.1023/A:1015652810815},
  doi          = {10.1023/A:1015652810815},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/osid/TereshkoL02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics