BibTeX records: Trinh Huynh

download as .bib file

@inproceedings{DBLP:conf/uemcom/HuynhWA23,
  author       = {Trinh Huynh and
                  James Walter and
                  Federica Aveta},
  editor       = {Satyajit Chakrabarti and
                  Rajashree Paul},
  title        = {RoboRover - {A} Jetson Nano Powered Robot Car for Object Following,
                  Obstacle Avoidance, and Wall Following},
  booktitle    = {14th {IEEE} Annual Ubiquitous Computing, Electronics {\&} Mobile
                  Communication Conference, {UEMCON} 2023, New York, NY, USA, October
                  12-14, 2023},
  pages        = {584--589},
  publisher    = {{IEEE}},
  year         = {2023},
  url          = {https://doi.org/10.1109/UEMCON59035.2023.10316007},
  doi          = {10.1109/UEMCON59035.2023.10316007},
  timestamp    = {Fri, 24 Nov 2023 20:33:22 +0100},
  biburl       = {https://dblp.org/rec/conf/uemcom/HuynhWA23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeameH12,
  author       = {Paul Beame and
                  Trinh Huynh},
  title        = {Multiparty Communication Complexity and Threshold Circuit Size of
                  sfAC\({}^{\mbox{0}}\)},
  journal      = {{SIAM} J. Comput.},
  volume       = {41},
  number       = {3},
  pages        = {484--518},
  year         = {2012},
  url          = {https://doi.org/10.1137/100792779},
  doi          = {10.1137/100792779},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BeameH12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/BeameH12,
  author       = {Paul Beame and
                  Trinh Huynh},
  title        = {The Value of Multiple Read/Write Streams for Approximating Frequency
                  Moments},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {3},
  number       = {2},
  pages        = {6:1--6:22},
  year         = {2012},
  url          = {https://doi.org/10.1145/2077336.2077339},
  doi          = {10.1145/2077336.2077339},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/BeameH12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HuynhN12,
  author       = {Trinh Huynh and
                  Jakob Nordstr{\"{o}}m},
  editor       = {Howard J. Karloff and
                  Toniann Pitassi},
  title        = {On the virtue of succinct proofs: amplifying communication complexity
                  hardness to time-space trade-offs in proof complexity},
  booktitle    = {Proceedings of the 44th Symposium on Theory of Computing Conference,
                  {STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
  pages        = {233--248},
  publisher    = {{ACM}},
  year         = {2012},
  url          = {https://doi.org/10.1145/2213977.2214000},
  doi          = {10.1145/2213977.2214000},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/HuynhN12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeameHP10,
  author       = {Paul Beame and
                  Trinh Huynh and
                  Toniann Pitassi},
  editor       = {Leonard J. Schulman},
  title        = {Hardness amplification in proof complexity},
  booktitle    = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
                  2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
  pages        = {87--96},
  publisher    = {{ACM}},
  year         = {2010},
  url          = {https://doi.org/10.1145/1806689.1806703},
  doi          = {10.1145/1806689.1806703},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BeameHP10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-0568,
  author       = {Paul Beame and
                  Trinh Huynh and
                  Toniann Pitassi},
  title        = {Hardness Amplification in Proof Complexity},
  journal      = {CoRR},
  volume       = {abs/0912.0568},
  year         = {2009},
  url          = {http://arxiv.org/abs/0912.0568},
  eprinttype    = {arXiv},
  eprint       = {0912.0568},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0912-0568.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeameH09,
  author       = {Paul Beame and
                  Trinh Huynh},
  title        = {Hardness Amplification in Proof Complexity},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR09-072}},
  year         = {2009},
  url          = {https://eccc.weizmann.ac.il/report/2009/072},
  eprinttype    = {ECCC},
  eprint       = {TR09-072},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/BeameH09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics