Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Huy N. Nguyen
@article{DBLP:journals/bioinformatics/NguyenJEF19, author = {Huy N. Nguyen and Ashish Jain and Oliver Eulenstein and Iddo Friedberg}, title = {Tracing the ancestry of operons in bacteria}, journal = {Bioinform.}, volume = {35}, number = {17}, pages = {2998--3004}, year = {2019}, url = {https://doi.org/10.1093/bioinformatics/btz053}, doi = {10.1093/BIOINFORMATICS/BTZ053}, timestamp = {Mon, 02 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/bioinformatics/NguyenJEF19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isscc/LuijtenPCCNP15, author = {Ronald P. Luijten and Dae Pham and Rolf Clauberg and Matteo Cossale and Huy N. Nguyen and Mihir Pandya}, title = {4.4 Energy-efficient microserver based on a 12-core 1.8GHz 188K-CoreMark 28nm bulk {CMOS} 64b SoC for big-data applications with 159GB/S/L memory bandwidth system density}, booktitle = {2015 {IEEE} International Solid-State Circuits Conference, {ISSCC} 2015, Digest of Technical Papers, San Francisco, CA, USA, February 22-26, 2015}, pages = {1--3}, publisher = {{IEEE}}, year = {2015}, url = {https://doi.org/10.1109/ISSCC.2015.7062933}, doi = {10.1109/ISSCC.2015.7062933}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isscc/LuijtenPCCNP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/BaNNR11, author = {Khanh Do Ba and Huy L. Nguyen and Huy N. Nguyen and Ronitt Rubinfeld}, title = {Sublinear Time Algorithms for Earth Mover's Distance}, journal = {Theory Comput. Syst.}, volume = {48}, number = {2}, pages = {428--442}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9265-8}, doi = {10.1007/S00224-010-9265-8}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/BaNNR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/EdelmanHNO11, author = {Alan Edelman and Avinatan Hassidim and Huy N. Nguyen and Krzysztof Onak}, editor = {Leslie Ann Goldberg and Klaus Jansen and R. Ravi and Jos{\'{e}} D. P. Rolim}, title = {An Efficient Partitioning Oracle for Bounded-Treewidth Graphs}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, {APPROX} 2011, and 15th International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6845}, pages = {530--541}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22935-0\_45}, doi = {10.1007/978-3-642-22935-0\_45}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/EdelmanHNO11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/siam/11/NguyenKE11, author = {Huy N. Nguyen and Jeremy Kepner and Alan Edelman}, editor = {Jeremy Kepner and John R. Gilbert}, title = {Visualizing Large Kronecker Graphs}, booktitle = {Graph Algorithms in the Language of Linear Algebra}, series = {Software, environments, tools}, volume = {22}, pages = {241--250}, publisher = {{SIAM}}, year = {2011}, url = {https://doi.org/10.1137/1.9780898719918.ch11}, doi = {10.1137/1.9780898719918.CH11}, timestamp = {Tue, 02 Jul 2019 08:09:44 +0200}, biburl = {https://dblp.org/rec/books/siam/11/NguyenKE11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1106-4587, author = {Alan Edelman and Avinatan Hassidim and Huy N. Nguyen and Krzysztof Onak}, title = {An Efficient Partitioning Oracle for Bounded-Treewidth Graphs}, journal = {CoRR}, volume = {abs/1106.4587}, year = {2011}, url = {http://arxiv.org/abs/1106.4587}, eprinttype = {arXiv}, eprint = {1106.4587}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1106-4587.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/HassidimKNO09, author = {Avinatan Hassidim and Jonathan A. Kelner and Huy N. Nguyen and Krzysztof Onak}, title = {Local Graph Partitions for Approximation and Testing}, booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2009, October 25-27, 2009, Atlanta, Georgia, {USA}}, pages = {22--31}, publisher = {{IEEE} Computer Society}, year = {2009}, url = {https://doi.org/10.1109/FOCS.2009.77}, doi = {10.1109/FOCS.2009.77}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/HassidimKNO09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0904-0292, author = {Khanh Do Ba and Huy L. Nguyen and Huy N. Nguyen and Ronitt Rubinfeld}, title = {Sublinear Time Algorithms for Earth Mover's Distance}, journal = {CoRR}, volume = {abs/0904.0292}, year = {2009}, url = {http://arxiv.org/abs/0904.0292}, eprinttype = {arXiv}, eprint = {0904.0292}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0904-0292.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/NguyenO08, author = {Huy N. Nguyen and Krzysztof Onak}, title = {Constant-Time Approximation Algorithms via Local Improvements}, booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2008, October 25-28, 2008, Philadelphia, PA, {USA}}, pages = {327--336}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/FOCS.2008.81}, doi = {10.1109/FOCS.2008.81}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/NguyenO08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.