default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHung Q. Ngo 0001
Hung Quang Ngo
Person information
- affiliation: RelationalAI, USA
- affiliation: University at Buffalo, Department of Computer Science and Engineering
- affiliation: University of Minnesota, Department of Computer Science
Other persons with the same name
- Hung Q. Ngo — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j38]Mahmoud Abo Khamis
, Hung Q. Ngo, Reinhard Pichler, Dan Suciu, Yisu Remy Wang:
Convergence of datalog over (Pre-) Semirings. J. ACM 71(2): 8:1-8:55 (2024)- [j37]Amir Shaikhha, Dan Suciu, Maximilian Schleich, Hung Q. Ngo:
Optimizing Nested Recursive Queries. Proc. ACM Manag. Data 2(1): 16:1-16:27 (2024) - [c64]Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs:
On the Convergence Rate of Linear Datalog ^∘ over Stable Semirings. ICDT 2024: 11:1-11:20 - [i32]Mahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu:
PANDA: Query Evaluation in Submodular Width. CoRR abs/2402.02001 (2024) - 2023
- [j36]Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu, Yisu Remy Wang:
Convergence of Datalog over (Pre-) Semirings. SIGMOD Rec. 52(1): 75-82 (2023) - [e3]Floris Geerts, Hung Q. Ngo, Stavros Sintos:
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2023, Seattle, WA, USA, June 18-23, 2023. ACM 2023 [contents] - [i31]Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs:
On the Convergence Rate of Linear Datalogo over Stable Semirings. CoRR abs/2311.17664 (2023) - [i30]Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs:
Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs. CoRR abs/2312.14063 (2023) - 2022
- [j35]Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu, Yisu Remy Wang:
Datalog in Wonderland. SIGMOD Rec. 51(2): 6-17 (2022) - [c63]Hung Q. Ngo:
On an Information Theoretic Approach to Cardinality Estimation (Invited Talk). ICDT 2022: 1:1-1:21 - [c62]Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu, Yisu Remy Wang:
Convergence of Datalog over (Pre-) Semirings. PODS 2022: 105-117 - [c61]Yisu Remy Wang, Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu:
Optimizing Recursive Queries with Progam Synthesis. SIGMOD Conference 2022: 79-93 - [i29]Yisu Remy Wang, Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu:
Optimizing Recursive Queries with Program Synthesis. CoRR abs/2202.10390 (2022) - [i28]Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs, Alireza Samadian:
Optimizing Polymatroid Functions. CoRR abs/2211.08381 (2022) - 2021
- [j34]Mahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo, Dan Suciu:
Bag Query Containment and Information Theory. ACM Trans. Database Syst. 46(3): 12:1-12:39 (2021) - [c60]Mahmoud Abo Khamis, Ryan R. Curtin, Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs, Alireza Samadian:
An Approximation Algorithm for the Matrix Tree Multiplication Problem. MFCS 2021: 6:1-6:14 - [i27]Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu, Yisu Remy Wang:
Convergence of Datalog over (Pre-) Semirings. CoRR abs/2105.14435 (2021) - 2020
- [j33]Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
Learning Models over Relational Data Using Sparse Tensors and Functional Dependencies. ACM Trans. Database Syst. 45(2): 7:1-7:66 (2020) - [j32]Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Maintaining Triangle Queries under Updates. ACM Trans. Database Syst. 45(3): 11:1-11:46 (2020) - [j31]Mahmoud Abo Khamis, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
Functional Aggregate Queries with Additive Inequalities. ACM Trans. Database Syst. 45(4): 17:1-17:41 (2020) - [c59]Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
Rk-means: Fast Clustering for Relational Data. AISTATS 2020: 2742-2752 - [c58]Mahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo, Dan Suciu:
Decision Problems in Information Theory. ICALP 2020: 106:1-106:20 - [c57]Shikha Singh, Sergey Madaminov, Michael A. Bender, Michael Ferdman, Ryan Johnson, Benjamin Moseley, Hung Q. Ngo, Dung Nguyen, Soeren Olesen, Kurt Stirewalt, Geoffrey Washburn:
A Scheduling Approach to Incremental Maintenance of Datalog Programs. IPDPS 2020: 864-873 - [c56]Mahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo, Dan Suciu:
Bag Query Containment and Information Theory. PODS 2020: 95-112 - [e2]David Maier, Rachel Pottinger, AnHai Doan, Wang-Chiew Tan, Abdussalam Alawini, Hung Q. Ngo:
Proceedings of the 2020 International Conference on Management of Data, SIGMOD Conference 2020, online conference [Portland, OR, USA], June 14-19, 2020. ACM 2020, ISBN 978-1-4503-6735-6 [contents] - [i26]Ahmet Kara, Milos Nikolic, Hung Q. Ngo, Dan Olteanu, Haozhe Zhang:
Maintaining Triangle Queries under Updates. CoRR abs/2004.03716 (2020) - [i25]Mahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo, Dan Suciu:
Decision Problems in Information Theory. CoRR abs/2004.08783 (2020)
2010 – 2019
- 2019
- [c55]Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Counting Triangles under Updates in Worst-Case Optimal Time. ICDT 2019: 4:1-4:18 - [c54]Mahmoud Abo Khamis, Hung Q. Ngo, Dan Olteanu, Dan Suciu:
Boolean Tensor Decomposition for Conjunctive Queries with Negation. ICDT 2019: 21:1-21:19 - [c53]Mahmoud Abo Khamis, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
On Functional Aggregate Queries with Additive Inequalities. PODS 2019: 414-431 - [c52]Maximilian Schleich, Dan Olteanu, Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen:
A Layered Aggregate Engine for Analytics Workloads. SIGMOD Conference 2019: 1642-1659 - [c51]Maximilian Schleich, Dan Olteanu, Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen:
Learning Models over Relational Data: A Brief Tutorial. SUM 2019: 423-432 - [i24]Maximilian Schleich, Dan Olteanu, Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen:
A Layered Aggregate Engine for Analytics Workloads. CoRR abs/1906.08687 (2019) - [i23]Mahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo, Dan Suciu:
Bag Query Containment and Information Theory. CoRR abs/1906.09727 (2019) - [i22]Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
Rk-means: Fast Clustering for Relational Data. CoRR abs/1910.04939 (2019) - [i21]Maximilian Schleich, Dan Olteanu, Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen:
Learning Models over Relational Data: A Brief Tutorial. CoRR abs/1911.06577 (2019) - 2018
- [j30]Vishrawas Gopalakrishnan, Kishlay Jha, Guangxu Xun, Hung Q. Ngo, Aidong Zhang:
Towards self-learning based hypotheses generation in biomedical text domain. Bioinform. 34(12): 2103-2115 (2018) - [j29]Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra:
Worst-case Optimal Join Algorithms. J. ACM 65(3): 16:1-16:40 (2018) - [c50]Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Counting Triangles under Updates. AMW 2018 - [c49]Hung Q. Ngo:
Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems. PODS 2018: 111-124 - [c48]Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
In-Database Learning with Sparse Tensors. PODS 2018: 325-340 - [c47]Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
AC/DC: In-Database Learning Thunderstruck. DEEM@SIGMOD 2018: 8:1-8:10 - [i20]Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
AC/DC: In-Database Learning Thunderstruck. CoRR abs/1803.07480 (2018) - [i19]Hung Q. Ngo:
Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems. CoRR abs/1803.09930 (2018) - [i18]Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Counting Triangles under Updates in Worst-Case Optimal Time. CoRR abs/1804.02780 (2018) - [i17]Mahmoud Abo Khamis, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
On Functional Aggregate Queries with Additive Inequalities. CoRR abs/1812.09526 (2018) - 2017
- [j28]Mahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra:
Juggling Functions Inside a Database. SIGMOD Rec. 46(1): 6-13 (2017) - [c46]Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
In-Database Factorized Learning. AMW 2017 - [c45]Mahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu:
What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another? PODS 2017: 429-444 - [i16]Mahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra:
Juggling Functions Inside a Database. CoRR abs/1703.03147 (2017) - [i15]Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
In-Database Learning with Sparse Tensors. CoRR abs/1703.04780 (2017) - [i14]Mahmoud Abo Khamis, Hung Q. Ngo, Dan Olteanu, Dan Suciu:
Boolean Tensor Decomposition for Conjunctive Queries with Negation. CoRR abs/1712.07445 (2017) - 2016
- [j27]Mahmoud Abo Khamis, Hung Q. Ngo, Christopher Ré, Atri Rudra:
Joins via Geometric Resolutions: Worst Case and Beyond. ACM Trans. Database Syst. 41(4): 22:1-22:45 (2016) - [c44]Devansh Arpit, Yingbo Zhou, Hung Q. Ngo, Venu Govindaraju:
Why Regularized Auto-Encoders learn Sparse Representation? ICML 2016: 136-144 - [c43]Mahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra:
FAQ: Questions Asked Frequently. PODS 2016: 13-28 - [c42]Mahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu:
Computing Join Queries with Functional Dependencies. PODS 2016: 327-342 - [r2]Hung Q. Ngo, Atri Rudra:
Efficient Decodable Group Testing. Encyclopedia of Algorithms 2016: 614-618 - [i13]Mahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu:
Computing Join Queries with Functional Dependencies. CoRR abs/1604.00111 (2016) - [i12]Devansh Arpit, Hung Q. Ngo, Yingbo Zhou, Nils Napp, Venu Govindaraju:
Towards Optimality Conditions for Non-Linear Networks. CoRR abs/1605.07145 (2016) - [i11]Mahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu:
What do Shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another? CoRR abs/1612.02503 (2016) - 2015
- [c41]Mahmoud Abo Khamis, Hung Q. Ngo, Christopher Ré, Atri Rudra:
Joins via Geometric Resolutions: Worst-case and Beyond. PODS 2015: 213-228 - [c40]Dung T. Nguyen, Molham Aref, Martin Bravenboer, George Kollias, Hung Q. Ngo, Christopher Ré, Atri Rudra:
Join Processing for Graph Patterns: An Old Dog with New Tricks. GRADES@SIGMOD/PODS 2015: 2:1-2:8 - [i10]Dung T. Nguyen, Molham Aref, Martin Bravenboer, George Kollias, Hung Q. Ngo, Christopher Ré, Atri Rudra:
Join Processing for Graph Patterns: An Old Dog with New Tricks. CoRR abs/1503.04169 (2015) - [i9]Mahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra:
FAQ: Questions Asked Frequently. CoRR abs/1504.04044 (2015) - [i8]Devansh Arpit, Yingbo Zhou, Hung Q. Ngo, Venu Govindaraju:
Why Regularized Auto-Encoders learn Sparse Representation? CoRR abs/1505.05561 (2015) - 2014
- [j26]Long H. Pham, Giang V. Trinh, Mai H. Dinh, Nam P. Mai, Tho T. Quan, Hung Q. Ngo:
Assisting Students in Finding Bugs and their Locations in Programming Solutions. Int. J. Qual. Assur. Eng. Technol. Educ. 3(2): 12-27 (2014) - [j25]Nikhil Londhe, Vishrawas Gopalakrishnan, Aidong Zhang, Hung Q. Ngo, Rohini K. Srihari:
Matching Titles with Cross Title Web-Search Enrichment and Community Detection. Proc. VLDB Endow. 7(12): 1167-1178 (2014) - [j24]Liang Ge, Jing Gao, Hung Q. Ngo, Kang Li, Aidong Zhang:
On handling negative transfer and imbalanced distributions in multiple source transfer learning. Stat. Anal. Data Min. 7(4): 254-271 (2014) - [c39]Yingbo Zhou, Utkarsh Porwal, Ce Zhang, Hung Q. Ngo, Long Nguyen, Christopher Ré, Venu Govindaraju:
Parallel Feature Selection Inspired by Group Testing. NIPS 2014: 3554-3562 - [c38]Hung Q. Ngo, Dung T. Nguyen, Christopher Ré, Atri Rudra:
Beyond worst-case analysis for joins with minesweeper. PODS 2014: 234-245 - [i7]Mahmoud Abo Khamis, Hung Q. Ngo, Christopher Ré, Atri Rudra:
Joins via Geometric Resolutions: Worst-case and Beyond. CoRR abs/1404.0703 (2014) - [i6]Mahmoud Abo Khamis, Anna C. Gilbert, Hung Q. Ngo, Atri Rudra:
Sparse Approximation, List Decoding, and Uncertainty Principles. CoRR abs/1404.5190 (2014) - 2013
- [j23]Hung Q. Ngo, Duong Hieu Phan, David Pointcheval:
Black-Box Trace&Revoke Codes. Algorithmica 67(3): 418-448 (2013) - [j22]Hung Q. Ngo, Christopher Ré, Atri Rudra:
Skew strikes back: new developments in the theory of join algorithms. SIGMOD Rec. 42(4): 5-16 (2013) - [c37]Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss:
ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk. ICALP (1) 2013: 461-472 - [c36]Jing Gao, Liang Ge, Kang Li, Hung Q. Ngo, Aidong Zhang:
On Handling Negative Transfer and Imbalanced Distributions in Multiple Source Transfer Learning. SDM 2013: 261-269 - [c35]Denisa Duma, Mary Wootters, Anna C. Gilbert, Hung Q. Ngo, Atri Rudra, Matthew Alpert, Timothy J. Close, Gianfranco Ciardo, Stefano Lonardi:
Accurate Decoding of Pooled Sequenced Data Using Compressed Sensing. WABI 2013: 70-84 - [i5]Hung Q. Ngo, Dung T. Nguyen, Christopher Ré, Atri Rudra:
Towards Instance Optimal Join Algorithms for Data in Indexes. CoRR abs/1302.0914 (2013) - [i4]Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss:
L2/L2-foreach sparse recovery with low risk. CoRR abs/1304.6232 (2013) - [i3]Hung Q. Ngo, Christopher Ré, Atri Rudra:
Skew Strikes Back: New Developments in the Theory of Join Algorithms. CoRR abs/1310.3314 (2013) - 2012
- [j21]Yang Wang, Hung Q. Ngo, Thanh-Nhan Nguyen:
Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors. J. Comb. Optim. 24(4): 468-484 (2012) - [c34]Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra:
Worst-case optimal join algorithms: [extended abstract]. PODS 2012: 37-48 - [c33]Hung Q. Ngo, Ely Porat, Atri Rudra:
Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion. STACS 2012: 230-241 - [c32]Enlong Che, Hoang Duong Tuan, Ha Hoang Kha, Hung Q. Ngo:
Bregman divergence based sensor selections for spectrum sensing. WCNC 2012: 2648-2652 - [i2]Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra:
Worst-case Optimal Join Algorithms. CoRR abs/1203.1952 (2012) - [i1]Hung Q. Ngo, Atri Rudra, Anh N. Le, Thanh-Nhan Nguyen:
Analyzing Nonblocking Switching Networks using Linear Programming (Duality). CoRR abs/1204.3180 (2012) - 2011
- [j20]Hung Q. Ngo, Anh Le, Yang Wang:
A linear programming duality approach to analyzing strictly nonblocking d-ary multilog networks under general crosstalk constraints. J. Comb. Optim. 21(1): 108-123 (2011) - [c31]Hung Q. Ngo, Ely Porat, Atri Rudra:
Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract). ICALP (1) 2011: 557-568 - 2010
- [c30]Hung Q. Ngo, Atri Rudra, Anh N. Le, Thanh-Nhan Nguyen:
Analyzing Nonblocking Switching Networks using Linear Programming (Duality). INFOCOM 2010: 2696-2704 - [c29]Sunu Mathew, Michalis Petropoulos, Hung Q. Ngo, Shambhu J. Upadhyaya:
A Data-Centric Approach to Insider Attack Detection in Database Systems. RAID 2010: 382-401 - [c28]Piotr Indyk, Hung Q. Ngo, Atri Rudra:
Efficiently Decodable Non-adaptive Group Testing. SODA 2010: 1126-1142 - [c27]Arunabha Sen, Sujogya Banerjee, Pavel Ghosh, Sudheendra Murthy, Hung Q. Ngo:
Brief announcement: on regenerator placement problems in optical networks. SPAA 2010: 178-180
2000 – 2009
- 2009
- [j19]Hung Q. Ngo, Thanh-Nhan Nguyen, Duc T. Ha:
Analyzing Nonblocking Multilog Networks with the köNIG-Egevarý Theorem. Discret. Math. Algorithms Appl. 1(1): 127-140 (2009) - [j18]Hung Q. Ngo, Yang Wang, Dazhen Pan:
Rearrangeable and nonblocking [w, f] -distributors. IEEE/ACM Trans. Netw. 17(3): 990-1001 (2009) - [j17]Seokhoon Yoon, Duc T. Ha, Hung Q. Ngo, Chunming Qiao:
MoPADS: A Mobility Profile Aided File Downloading Service in Vehicular Networks. IEEE Trans. Veh. Technol. 58(9): 5235-5246 (2009) - [j16]Duc T. Ha, Hung Q. Ngo:
On the trade-off between speed and resiliency of Flash worms and similar malcodes. J. Comput. Virol. 5(4): 309-320 (2009) - [c26]Duc T. Ha, Guanhua Yan, Stephan J. Eidenbenz, Hung Q. Ngo:
On the effectiveness of structural detection and defense against P2P-based botnets. DSN 2009: 297-306 - [c25]Hung Q. Ngo, Thanh-Nhan Nguyen, Dahai Xu:
Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem. INFOCOM 2009: 774-782 - [e1]Hung Q. Ngo:
Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings. Lecture Notes in Computer Science 5609, Springer 2009, ISBN 978-3-642-02881-6 [contents] - [r1]Ding-Zhu Du, Bing Lu, Hung Q. Ngo, Panos M. Pardalos:
Steiner Tree Problems. Encyclopedia of Optimization 2009: 3723-3736 - 2008
- [j15]Hung Q. Ngo:
On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design. J. Comb. Optim. 15(1): 61-76 (2008) - [c24]Hung Q. Ngo, Yang Wang, Anh Le:
A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints. COCOON 2008: 510-520 - [c23]Sunu Mathew, Shambhu J. Upadhyaya, Duc T. Ha, Hung Q. Ngo:
Insider abuse comprehension through capability acquisition graphs. FUSION 2008: 1-8 - [c22]Duc T. Ha, Hung Q. Ngo, Madhusudhanan Chandrasekaran:
CRESTBOT: A New Family of Resilient Botnets. GLOBECOM 2008: 2148-2153 - [c21]Hung Q. Ngo, Thanh-Nhan Nguyen, Duc T. Ha:
Crosstalk-Free Widesense Nonblocking Multicast Photonic Switching Networks. GLOBECOM 2008: 2643-2647 - [c20]Thanh-Nhan Nguyen, Hung Q. Ngo, Yang Wang:
Strictly Nonblocking f-Cast Photonic Switching Networks under General Crosstalk Constraints. GLOBECOM 2008: 2807-2811 - [c19]Yang Wang, Hung Q. Ngo, Xiaohong Jiang:
Strictly Nonblocking Function-Cast d-Ary Multi-Log Networks under Fanout and Crosstalk Constraints. ICC 2008: 5407-5411 - 2007
- [j14]Hung Q. Ngo, Dazhen Pan, Yuanyuan Yang:
Optical switching networks with minimum number of limited-range wavelength converters. IEEE/ACM Trans. Netw. 15(4): 969-979 (2007) - [c18]Duc T. Ha, Shambhu J. Upadhyaya, Hung Q. Ngo, Suranjan Pramanik, Ramkumar Chinchani, Sunu Mathew:
Insider Threat Analysis Using Information-Centric Modeling. IFIP Int. Conf. Digital Forensics 2007: 55-73 - [c17]Joy Ghosh, Hung Q. Ngo, Seokhoon Yoon, Chunming Qiao:
On a Routing Problem Within Probabilistic Graphs and its Application to Intermittently Connected Networks. INFOCOM 2007: 1721-1729 - 2006
- [j13]Hung Q. Ngo, Dazhen Pan, Chunming Qiao:
Constructions and analyses of nonblocking WDM switches based on arrayed waveguide grating and limited wavelength conversion. IEEE/ACM Trans. Netw. 14(1): 205-217 (2006) - [c16]Sumesh J. Philip, Joy Ghosh, Hung Q. Ngo, Chunming Qiao:
Routing on Overlay Graphs in Mobile Ad Hoc Networks. GLOBECOM 2006 - [c15]Joy Ghosh, Hung Q. Ngo, Chunming Qiao:
Mobility profile based routing within intermittently connected mobile ad hoc networks (ICMAN). IWCMC 2006: 551-556 - [c14]Joy Ghosh, Matthew J. Beal, Hung Q. Ngo, Chunming Qiao:
On profiling mobility and predicting locations of wireless users. REALMAN@MobiHoc 2006: 55-62 - [c13]Peng Lin, Hung Q. Ngo, Chunming Qiao, Xin Wang, Ting Wang, DaYou Qian:
Minimum Cost Wireless Broadband Overlay Network Planning. WOWMOM 2006: 228-236 - 2005
- [j12]Ramkumar Chinchani, Duc T. Ha, Anusha Iyer, Hung Q. Ngo, Shambhu J. Upadhyaya:
On the Hardness of Approximating the Min-Hack Problem. J. Comb. Optim. 9(3): 295-311 (2005) - [j11]Hung Quang Ngo:
WDM Switching Networks, Rearrangeable and Nonblocking [w, f]-connectors. SIAM J. Comput. 35(3): 766-785 (2005) - [c12]Ramkumar Chinchani, Anusha Iyer, Hung Q. Ngo, Shambhu J. Upadhyaya:
Towards a Theory of Insider Threat Assessment. DSN 2005: 108-117 - [c11]Hung Q. Ngo, Dazhen Pan, Yuanyuan Yang:
Optical switching networks with minimum number of limited range wavelength converters. INFOCOM 2005: 1128-1138 - [c10]Harleen Dhillon, Hung Q. Ngo:
CQMP: a mesh-based multicast routing protocol with consolidated query packets. WCNC 2005: 2168-2174 - 2004
- [j10]Lu Ruan, Shitou Han, Deying Li, Hung Q. Ngo, Scott C.-H. Huang:
Transmission fault-tolerance of iterated line digraphs. J. Interconnect. Networks 5(4): 475-487 (2004) - [c9]Dazhen Pan, Vishal Anand, Hung Q. Ngo:
Cost-effective constructions for nonblocking WDM multicast switching networks. ICC 2004: 1801-1805 - [c8]Hung Q. Ngo, Dazhen Pan, Chunming Qiao:
Nonblocking WDM Switches Based on Arrayed Waveguide Grating and Limited Wavelength Conversion. INFOCOM 2004: 1352-1362 - 2003
- [j9]Hung Q. Ngo, Van H. Vu:
Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs. SIAM J. Comput. 32(4): 1040-1049 (2003) - [j8]Hung Q. Ngo:
A new routing algorithm for multirate rearrangeable Clos networks. Theor. Comput. Sci. 290(3): 2157-2167 (2003) - [j7]Maggie Xiaoyan Cheng, Xiufeng Du, Manki Min, Hung Q. Ngo, Lu Ruan, Jianhua Sun, Weili Wu:
Super link-connectivity of iterated line digraphs. Theor. Comput. Sci. 304(1-3): 461-469 (2003) - [c7]Purnima M. Mavinkurve, Hung Q. Ngo, Himanshu Mehra:
MIP3S: algorithms for power-conserving multicasting in static wireless ad hoc networks. ICON 2003: 143-148 - [c6]Vikas P. Verma, Amit A. Chandak, Hung Q. Ngo:
Dip3s: a Distributed Routing Algorithm for Power-conserving Broadcasting in Wireless Ad Hoc Networks. MWCN 2003 - [c5]Hung Q. Ngo, Van H. Vu:
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs. SODA 2003: 834-840 - 2002
- [j6]Hung Q. Ngo, Ding-Zhu Du:
New constructions of non-adaptive and error-tolerance pooling designs. Discret. Math. 243(1-3): 161-170 (2002) - [j5]Ding-Zhu Du, D. Frank Hsu, Hung Quang Ngo, G. W. Peck:
On connectivity of consecutive-d digraphs. Discret. Math. 257(2-3): 371-384 (2002) - [j4]Hung Q. Ngo, Ding-Zhu Du, Ronald L. Graham:
New bounds on a hypercube coloring problem. Inf. Process. Lett. 84(5): 265-269 (2002) - [j3]Ding-Zhu Du, Frank K. Hwang, Xiaohua Jia, Hung Q. Ngo:
Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1. SIAM J. Discret. Math. 15(3): 305-316 (2002) - [j2]Srivatsan Varadarajan, Hung Q. Ngo, Jaideep Srivastava:
Error spreading: a perception-driven approach to handling error in continuous media streaming. IEEE/ACM Trans. Netw. 10(1): 139-152 (2002) - 2001
- [j1]Ding-Zhu Du, Frank K. Hwang, Yunjae Jung, Hung Q. Ngo:
Optimal Consecutive-k-out-of-(2k+1): G Cycle. J. Glob. Optim. 19(1): 51-60 (2001) - [c4]Hung Quang Ngo, Ding-Zhu Du, Ronald L. Graham:
New Bounds on a Hypercube Coloring Problem and Linear Codes. ITCC 2001: 542-546 - 2000
- [c3]Srivatsan Varadarajan, Hung Q. Ngo, Jaideep Srivastava:
An Adaptive, Perception-Driven Error Spreading Scheme in Continuous Media Streaming. ICDCS 2000: 475-483
1990 – 1999
- 1999
- [c2]Hung Q. Ngo, Ding-Zhu Du:
A survey on combinatorial group testing algorithms with applications to DNA Library Screening. Discrete Mathematical Problems with Medical Applications 1999: 171-182 - [c1]Hung Q. Ngo, Srivatsan Varadarajan, Jaideep Srivastava:
Error Spreading: Reducing Bursty Errors in Continuous Media Streaming. ICMCS, Vol. 1 1999: 314-319
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
