A survey on combinatorial group testing algorithms with applications to DNA Library Screening. - Hung Q. Ngo 001; Ding-Zhu Du (Discrete Mathematical Problems with Medical Applications, 1999)

Error Spreading: Reducing Bursty Errors in Continuous Media Streaming. - Hung Q. Ngo 001; Srivatsan Varadarajan; Jaideep Srivastava (ICMCS, Vol. 1, 1999)

An Adaptive, Perception-Driven Error Spreading Scheme in Continuous Media Streaming. - Srivatsan Varadarajan; Hung Q. Ngo 001; Jaideep Srivastava (ICDCS, 2000)

New Bounds on a Hypercube Coloring Problem and Linear Codes. - Hung Quang Ngo; Ding-Zhu Du; Ronald L. Graham (ITCC, 2001)

Optimal Consecutive-k-out-of-(2k+1): G Cycle. - Ding-Zhu Du; Frank K. Hwang; Yunjae Jung; Hung Q. Ngo 001 (J. Glob. Optim., 2001)

On connectivity of consecutive-d digraphs. - Ding-Zhu Du; D. Frank Hsu; Hung Quang Ngo; G. W. Peck (Discret. Math., 2002)

New constructions of non-adaptive and error-tolerance pooling designs. - Hung Q. Ngo 001; Ding-Zhu Du (Discret. Math., 2002)

New bounds on a hypercube coloring problem. - Hung Q. Ngo 001; Ding-Zhu Du; Ronald L. Graham (Inf. Process. Lett., 2002)

Optimal Consecutive-k-out-of-n: G Cycle for n leq 2k+1. - Ding-Zhu Du; Frank K. Hwang; Xiaohua Jia; Hung Q. Ngo 001 (SIAM J. Discret. Math., 2002)

Error spreading: a perception-driven approach to handling error in continuous media streaming. - Srivatsan Varadarajan; Hung Q. Ngo 001; Jaideep Srivastava (IEEE/ACM Trans. Netw., 2002)

MIP3S: algorithms for power-conserving multicasting in static wireless ad hoc networks. - Purnima M. Mavinkurve; Hung Q. Ngo 001; Himanshu Mehra (ICON, 2003)

Dip3s: a Distributed Routing Algorithm for Power-conserving Broadcasting in Wireless Ad Hoc Networks. - Vikas P. Verma; Amit A. Chandak; Hung Q. Ngo 001 (MWCN, 2003)

Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs. - Hung Q. Ngo 001; Van H. Vu (SIAM J. Comput., 2003)

Super link-connectivity of iterated line digraphs. - Maggie Xiaoyan Cheng; Xiufeng Du; Manki Min; Hung Q. Ngo 001; Lu Ruan 001; Jianhua Sun; Weili Wu 001 (Theor. Comput. Sci., 2003)

A new routing algorithm for multirate rearrangeable Clos networks. - Hung Q. Ngo 001 (Theor. Comput. Sci., 2003)

Cost-effective constructions for nonblocking WDM multicast switching networks. - Dazhen Pan; Vishal Anand 001; Hung Q. Ngo 001 (ICC, 2004)

Nonblocking WDM Switches Based on Arrayed Waveguide Grating and Limited Wavelength Conversion. - Hung Q. Ngo 001; Dazhen Pan; Chunming Qiao (INFOCOM, 2004)

Transmission fault-tolerance of iterated line digraphs. - Lu Ruan 001; Shitou Han; Deying Li 001; Hung Q. Ngo 001; Scott C.-H. Huang (J. Interconnect. Networks, 2004)

Towards a Theory of Insider Threat Assessment. - Ramkumar Chinchani; Anusha Iyer; Hung Q. Ngo 001; Shambhu J. Upadhyaya (DSN, 2005)

CQMP: a mesh-based multicast routing protocol with consolidated query packets. - Harleen Dhillon; Hung Q. Ngo 001 (WCNC, 2005)

On the Hardness of Approximating the Min-Hack Problem. - Ramkumar Chinchani; Duc T. Ha; Anusha Iyer; Hung Q. Ngo 001; Shambhu J. Upadhyaya (J. Comb. Optim., 2005)

WDM Switching Networks, Rearrangeable and Nonblocking [w, f]-connectors. - Hung Quang Ngo (SIAM J. Comput., 2005)

Routing on Overlay Graphs in Mobile Ad Hoc Networks. - Sumesh J. Philip; Joy Ghosh; Hung Q. Ngo 001; Chunming Qiao (GLOBECOM, 2006)

Mobility profile based routing within intermittently connected mobile ad hoc networks (ICMAN). - Joy Ghosh; Hung Q. Ngo 001; Chunming Qiao (IWCMC, 2006)

On profiling mobility and predicting locations of wireless users. - Joy Ghosh; Matthew J. Beal; Hung Q. Ngo 001; Chunming Qiao (REALMAN@MobiHoc, 2006)

Minimum Cost Wireless Broadband Overlay Network Planning. - Peng Lin; Hung Q. Ngo 001; Chunming Qiao; Xin Wang 001; Ting Wang 016; DaYou Qian (WOWMOM, 2006)

Constructions and analyses of nonblocking WDM switches based on arrayed waveguide grating and limited wavelength conversion. - Hung Q. Ngo 001; Dazhen Pan; Chunming Qiao (IEEE/ACM Trans. Netw., 2006)

Insider Threat Analysis Using Information-Centric Modeling. - Duc T. Ha; Shambhu J. Upadhyaya; Hung Q. Ngo 001; Suranjan Pramanik; Ramkumar Chinchani; Sunu Mathew (IFIP Int. Conf. Digital Forensics, 2007)

On a Routing Problem Within Probabilistic Graphs and its Application to Intermittently Connected Networks. - Joy Ghosh; Hung Q. Ngo 001; Seokhoon Yoon; Chunming Qiao (INFOCOM, 2007)

Optical switching networks with minimum number of limited-range wavelength converters. - Hung Q. Ngo 001; Dazhen Pan; Yuanyuan Yang 001 (IEEE/ACM Trans. Netw., 2007)

A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints. - Hung Q. Ngo 001; Yang Wang 014; Anh Le (COCOON, 2008)

Insider abuse comprehension through capability acquisition graphs. - Sunu Mathew; Shambhu J. Upadhyaya; Duc T. Ha; Hung Q. Ngo 001 (FUSION, 2008)

CRESTBOT: A New Family of Resilient Botnets. - Duc T. Ha; Hung Q. Ngo 001; Madhusudhanan Chandrasekaran (GLOBECOM, 2008)

Crosstalk-Free Widesense Nonblocking Multicast Photonic Switching Networks. - Hung Q. Ngo 001; Thanh-Nhan Nguyen; Duc T. Ha (GLOBECOM, 2008)

Strictly Nonblocking f-Cast Photonic Switching Networks under General Crosstalk Constraints. - Thanh-Nhan Nguyen; Hung Q. Ngo 001; Yang Wang 014 (GLOBECOM, 2008)

Strictly Nonblocking Function-Cast d-Ary Multi-Log Networks under Fanout and Crosstalk Constraints. - Yang Wang 014; Hung Q. Ngo 001; Xiaohong Jiang 001 (ICC, 2008)

On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design. - Hung Q. Ngo 001 (J. Comb. Optim., 2008)

On the effectiveness of structural detection and defense against P2P-based botnets. - Duc T. Ha; Guanhua Yan; Stephan J. Eidenbenz; Hung Q. Ngo 001 (DSN, 2009)

Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem. - Hung Q. Ngo 001; Thanh-Nhan Nguyen; Dahai Xu (INFOCOM, 2009)

Analyzing Nonblocking Multilog Networks with the köNIG-Egevarý Theorem. - Hung Q. Ngo 001; Thanh-Nhan Nguyen; Duc T. Ha (Discret. Math. Algorithms Appl., 2009)

Rearrangeable and nonblocking [w, f] -distributors. - Hung Q. Ngo 001; Yang Wang 014; Dazhen Pan (IEEE/ACM Trans. Netw., 2009)

MoPADS: A Mobility Profile Aided File Downloading Service in Vehicular Networks. - Seokhoon Yoon; Duc T. Ha; Hung Q. Ngo 001; Chunming Qiao (IEEE Trans. Veh. Technol., 2009)

On the trade-off between speed and resiliency of Flash worms and similar malcodes. - Duc T. Ha; Hung Q. Ngo 001 (J. Comput. Virol., 2009)

Steiner Tree Problems. - Ding-Zhu Du; Bing Lu; Hung Q. Ngo 001; Panos M. Pardalos (Encyclopedia of Optimization, 2009)

Analyzing Nonblocking Switching Networks using Linear Programming (Duality). - Hung Q. Ngo 001; Atri Rudra; Anh N. Le; Thanh-Nhan Nguyen (INFOCOM, 2010)

A Data-Centric Approach to Insider Attack Detection in Database Systems. - Sunu Mathew; Michalis Petropoulos; Hung Q. Ngo 001; Shambhu J. Upadhyaya (RAID, 2010)

Efficiently Decodable Non-adaptive Group Testing. - Piotr Indyk; Hung Q. Ngo 001; Atri Rudra (SODA, 2010)

Brief announcement: on regenerator placement problems in optical networks. - Arunabha Sen; Sujogya Banerjee; Pavel Ghosh; Sudheendra Murthy; Hung Q. Ngo 001 (SPAA, 2010)

Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract). - Hung Q. Ngo 001; Ely Porat; Atri Rudra (ICALP (1), 2011)

A linear programming duality approach to analyzing strictly nonblocking d-ary multilog networks under general crosstalk constraints. - Hung Q. Ngo 001; Anh Le; Yang Wang 014 (J. Comb. Optim., 2011)

Worst-case optimal join algorithms: [extended abstract]. - Hung Q. Ngo 001; Ely Porat; Christopher Ré; Atri Rudra (PODS, 2012)

Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion. - Hung Q. Ngo 001; Ely Porat; Atri Rudra (STACS, 2012)

Bregman divergence based sensor selections for spectrum sensing. - Enlong Che; Hoang Duong Tuan; Ha Hoang Kha; Hung Q. Ngo 001 (WCNC, 2012)

Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors. - Yang Wang 014; Hung Q. Ngo 001; Thanh-Nhan Nguyen (J. Comb. Optim., 2012)

ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk. - Anna C. Gilbert; Hung Q. Ngo 001; Ely Porat; Atri Rudra; Martin J. Strauss (ICALP (1), 2013)

Accurate Decoding of Pooled Sequenced Data Using Compressed Sensing. - Denisa Duma; Mary Wootters; Anna C. Gilbert; Hung Q. Ngo 001; Atri Rudra; Matthew Alpert; Timothy J. Close; Gianfranco Ciardo; Stefano Lonardi (WABI, 2013)

Black-Box Trace&Revoke Codes. - Hung Q. Ngo 001; Duong Hieu Phan; David Pointcheval (Algorithmica, 2013)

Towards Instance Optimal Join Algorithms for Data in Indexes - Hung Q. Ngo 001; Dung T. Nguyen; Christopher Ré; Atri Rudra (CoRR, 2013)

Skew strikes back: new developments in the theory of join algorithms. - Hung Q. Ngo 001; Christopher Ré; Atri Rudra (SIGMOD Rec., 2013)

Parallel Feature Selection Inspired by Group Testing. - Yingbo Zhou; Utkarsh Porwal; Ce Zhang 001; Hung Q. Ngo 001; XuanLong Nguyen; Christopher Ré; Venu Govindaraju (NIPS, 2014)

Beyond worst-case analysis for joins with minesweeper. - Hung Q. Ngo 001; Dung T. Nguyen; Christopher Ré; Atri Rudra (PODS, 2014)

Sparse Approximation, List Decoding, and Uncertainty Principles. - Mahmoud Abo Khamis; Anna C. Gilbert; Hung Q. Ngo 001; Atri Rudra (CoRR, 2014)

Assisting Students in Finding Bugs and their Locations in Programming Solutions. - Long H. Pham; Giang V. Trinh; Mai H. Dinh; Nam P. Mai; Tho T. Quan; Hung Q. Ngo 001 (Int. J. Qual. Assur. Eng. Technol. Educ., 2014)

Matching Titles with Cross Title Web-Search Enrichment and Community Detection. - Nikhil Londhe; Vishrawas Gopalakrishnan; Aidong Zhang; Hung Q. Ngo 001; Rohini K. Srihari (Proc. VLDB Endow., 2014)

On handling negative transfer and imbalanced distributions in multiple source transfer learning. - Liang Ge; Jing Gao 004; Hung Q. Ngo 001; Kang Li 003; Aidong Zhang (Stat. Anal. Data Min., 2014)

Join Processing for Graph Patterns: An Old Dog with New Tricks. - Dung T. Nguyen; Molham Aref; Martin Bravenboer; George Kollias; Hung Q. Ngo 001; Christopher Ré; Atri Rudra (GRADES@SIGMOD/PODS, 2015)

Why Regularized Auto-Encoders learn Sparse Representation? - Devansh Arpit; Yingbo Zhou; Hung Q. Ngo 001; Venu Govindaraju (ICML, 2016)

FAQ: Questions Asked Frequently. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Atri Rudra (PODS, 2016)

Computing Join Queries with Functional Dependencies. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Dan Suciu (PODS, 2016)

Towards Optimality Conditions for Non-Linear Networks. - Devansh Arpit; Hung Q. Ngo 001; Yingbo Zhou; Nils Napp; Venu Govindaraju (CoRR, 2016)

Joins via Geometric Resolutions: Worst Case and Beyond. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Christopher Ré; Atri Rudra (ACM Trans. Database Syst., 2016)

Efficient Decodable Group Testing. - Hung Q. Ngo 001; Atri Rudra (Encyclopedia of Algorithms, 2016)

In-Database Factorized Learning. - Hung Q. Ngo 001; XuanLong Nguyen; Dan Olteanu; Maximilian Schleich (AMW, 2017)

What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another? - Mahmoud Abo Khamis; Hung Q. Ngo 001; Dan Suciu (PODS, 2017)

Juggling Functions Inside a Database. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Atri Rudra (SIGMOD Rec., 2017)

Counting Triangles under Updates. - Ahmet Kara 002; Hung Q. Ngo 001; Milos Nikolic 001; Dan Olteanu; Haozhe Zhang 001 (AMW, 2018)

Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems. - Hung Q. Ngo 001 (PODS, 2018)

In-Database Learning with Sparse Tensors. - Mahmoud Abo Khamis; Hung Q. Ngo 001; XuanLong Nguyen; Dan Olteanu; Maximilian Schleich (PODS, 2018)

AC/DC: In-Database Learning Thunderstruck. - Mahmoud Abo Khamis; Hung Q. Ngo 001; XuanLong Nguyen; Dan Olteanu; Maximilian Schleich (DEEM@SIGMOD, 2018)

Towards self-learning based hypotheses generation in biomedical text domain. - Vishrawas Gopalakrishnan; Kishlay Jha; Guangxu Xun; Hung Q. Ngo 001; Aidong Zhang (Bioinform., 2018)

Worst-case Optimal Join Algorithms. - Hung Q. Ngo 001; Ely Porat; Christopher Ré; Atri Rudra (J. ACM, 2018)

Counting Triangles under Updates in Worst-Case Optimal Time. - Ahmet Kara 002; Hung Q. Ngo 001; Milos Nikolic 001; Dan Olteanu; Haozhe Zhang 001 (ICDT, 2019)

Boolean Tensor Decomposition for Conjunctive Queries with Negation. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Dan Olteanu; Dan Suciu (ICDT, 2019)

A Layered Aggregate Engine for Analytics Workloads. - Maximilian Schleich; Dan Olteanu; Mahmoud Abo Khamis; Hung Q. Ngo 001; XuanLong Nguyen (SIGMOD Conference, 2019)

Learning Models over Relational Data: A Brief Tutorial. - Maximilian Schleich; Dan Olteanu; Mahmoud Abo Khamis; Hung Q. Ngo 001; XuanLong Nguyen (SUM, 2019)

Rk-means: Fast Clustering for Relational Data. - Ryan R. Curtin; Benjamin Moseley; Hung Q. Ngo 001; XuanLong Nguyen; Dan Olteanu; Maximilian Schleich (AISTATS, 2020)

Decision Problems in Information Theory. - Mahmoud Abo Khamis; Phokion G. Kolaitis; Hung Q. Ngo 001; Dan Suciu (ICALP, 2020)

A Scheduling Approach to Incremental Maintenance of Datalog Programs. - Shikha Singh 002; Sergey Madaminov; Michael A. Bender; Michael Ferdman; Ryan Johnson; Benjamin Moseley; Hung Q. Ngo 001; Dung Nguyen; Soeren Olesen; Kurt Stirewalt; Geoffrey Washburn (IPDPS, 2020)

Maintaining Triangle Queries under Updates. - Ahmet Kara 002; Hung Q. Ngo 001; Milos Nikolic 001; Dan Olteanu; Haozhe Zhang 001 (ACM Trans. Database Syst., 2020)

Functional Aggregate Queries with Additive Inequalities. - Mahmoud Abo Khamis; Ryan R. Curtin; Benjamin Moseley; Hung Q. Ngo 001; XuanLong Nguyen; Dan Olteanu; Maximilian Schleich (ACM Trans. Database Syst., 2020)

Learning Models over Relational Data Using Sparse Tensors and Functional Dependencies. - Mahmoud Abo Khamis; Hung Q. Ngo 001; XuanLong Nguyen; Dan Olteanu; Maximilian Schleich (ACM Trans. Database Syst., 2020)

An Approximation Algorithm for the Matrix Tree Multiplication Problem. - Mahmoud Abo Khamis; Ryan R. Curtin; Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs; Alireza Samadian (MFCS, 2021)

Bag Query Containment and Information Theory. - Mahmoud Abo Khamis; Phokion G. Kolaitis; Hung Q. Ngo 001; Dan Suciu (ACM Trans. Database Syst., 2021)

On an Information Theoretic Approach to Cardinality Estimation (Invited Talk). - Hung Q. Ngo 001 (ICDT, 2022)

Optimizing Recursive Queries with Progam Synthesis. - Yisu Remy Wang; Mahmoud Abo Khamis; Hung Q. Ngo 001; Reinhard Pichler; Dan Suciu (SIGMOD Conference, 2022)

Optimizing Recursive Queries with Program Synthesis. - Yisu Remy Wang; Mahmoud Abo Khamis; Hung Q. Ngo 001; Reinhard Pichler; Dan Suciu (CoRR, 2022)

Optimizing Polymatroid Functions. - Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs; Alireza Samadian (CoRR, 2022)

Datalog in Wonderland. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Reinhard Pichler; Dan Suciu; Yisu Remy Wang (SIGMOD Rec., 2022)

On the Convergence Rate of Linear Datalogo over Stable Semirings. - Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs (CoRR, 2023)

Convergence of Datalog over (Pre-) Semirings. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Reinhard Pichler; Dan Suciu; Yisu Remy Wang (SIGMOD Rec., 2023)

Database Theory Column. - Hung Q. Ngo 001 (SIGACT News, 2023)

On the Convergence Rate of Linear Datalog ^∘ over Stable Semirings. - Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs (ICDT, 2024)

Optimizing Nested Recursive Queries. - Amir Shaikhha; Dan Suciu; Maximilian Schleich; Hung Q. Ngo 001 (Proc. ACM Manag. Data, 2024)

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs. - Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs (Proc. ACM Manag. Data, 2024)

Targeted Least Cardinality Candidate Key for Relational Databases. - Vasileios Nakos; Hung Q. Ngo 001; Charalampos E. Tsourakakis (ICDT, 2025)

PANDA: Query Evaluation in Submodular Width. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Dan Suciu (TheoretiCS, 2025)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints. - Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs (Proc. ACM Manag. Data, 2025)