World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
31
Citations
4152
World Ranking
13655
National Ranking
5445

Overview

Hung Q. Ngo is affiliated with the University at Buffalo, State University of New York in the United States. Their research predominantly focuses on computer science, with contributions spanning various subfields and topics.

The main fields of study for Hung Q. Ngo include:

  • Artificial Intelligence
  • Signal Processing
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Information Systems

Main topics of work encompass:

  • Semantic Web and Ontologies
  • Data Management and Algorithms
  • Advanced Database Systems and Queries
  • Artificial Intelligence in Law
  • Complexity and Algorithms in Graphs
  • Data Mining Algorithms and Applications
  • Logic, Reasoning, and Knowledge

Hung Q. Ngo has published research in various venues, frequently including:

  • arXiv (Cornell University)
  • ACM Transactions on Database Systems
  • Forensic Science International Digital Investigation
  • ACM SIGMOD Record
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Recent publications from Hung Q. Ngo and close collaborators include:

  • ProtoSound: A Personalized and Scalable Sound Recognition System for Deaf and Hard-of-Hearing Users, 2022, published at CHI Conference on Human Factors in Computing Systems
  • Knowledge representation in digital agriculture: A step towards standardised model, 2022, published in Computers and Electronics in Agriculture
  • Maintaining Triangle Queries under Updates, 2020, published in ACM Transactions on Database Systems
  • Domain Specific Entity Recognition With Semantic-Based Deep Learning Approach, 2021, published in IEEE Access
  • Decision Problems in Information Theory, 2020, published on arXiv (Cornell University)

Frequent collaborators in their research include:

  • Nhien-An Le-Khac
  • Mahmoud Abo Khamis
  • Hien D. Nguyen
  • Dan Suciu
  • Benjamin Moseley

Best Publications

  • BioCaster: detecting public health rumors with a Web-based text mining system

    Nigel Collier;Son Doan;Ai Kawazoe;Reiko Matsuda Goodwin;Reiko Matsuda Goodwin

  • Worst-case Optimal Join Algorithms

    Hung Q. Ngo;Ely Porat;Christopher Ré;Atri Rudra

  • Skew strikes back: new developments in the theory of join algorithms

    Hung Q Ngo;Christopher Ré;Atri Rudra

  • FAQ: Questions Asked Frequently

    Mahmoud Abo Khamis;Hung Q. Ngo;Atri Rudra

  • Worst-case optimal join algorithms: [extended abstract]

    Hung Q. Ngo;Ely Porat;Christopher Ré;Atri Rudra

  • A data-centric approach to insider attack detection in database systems

    Sunu Mathew;Michalis Petropoulos;Hung Q. Ngo;Shambhu Upadhyaya

  • Towards a theory of insider threat assessment

    R. Chinchani;A. Iyer;H.Q. Ngo;S. Upadhyaya

  • A Survey on Combinatorial Group Testing Algorithms with Applications to DNA Library Screening

    Hung Q. Ngo;Ding-Zhu Du

  • On handling negative transfer and imbalanced distributions in multiple source transfer learning

    Liang Ge;Jing Gao;Hung Ngo;Kang Li

  • Efficiently decodable non-adaptive group testing

    Piotr Indyk;Hung Q. Ngo;Atri Rudra

  • Steiner Trees in Industry

    Xiuzhen Cheng;Yingshu Li;Ding-Zhu Du;Hung Q. Ngo

  • Semi-Markov conditional random fields for accelerometer-based activity recognition

    Sungyoung Lee;Hung Xuan Le;Hung Quoc Ngo

  • What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another?

    Mahmoud Abo Khamis;Hung Q. Ngo;Dan Suciu

  • New constructions of non-adaptive and error-tolerance pooling designs

    Hung Q. Ngo;Ding-Zhu Du;Ding-Zhu Du

  • The Graph of Things

    Danh Le-Phuoc;Hoan Nguyen Mau Quoc;Hung Ngo Quoc;Tuan Tran Nhat

  • Joins via Geometric Resolutions: Worst Case and Beyond

    Mahmoud Abo Khamis;Hung Q. Ngo;Christopher Ré;Atri Rudra

  • Worst-case Optimal Join Algorithms

    Hung Q. Ngo;Ely Porat;Christopher Ré;Atri Rudra

  • On a Routing Problem Within Probabilistic Graphs and its Application to Intermittently Connected Networks

    J. Ghosh;H.Q. Ngo;Seokhoon Yoon;Chunming Qiao

  • Efficiently decodable error-correcting list disjunct matrices and applications

    Hung Q. Ngo;Ely Porat;Atri Rudra

  • CQMP: a mesh-based multicast routing protocol with consolidated query packets

    H. Dhillon;H.Q. Ngo

  • Statistical Databases

    Unknown

  • On profiling mobility and predicting locations of wireless users

    Joy Ghosh;Matthew J. Beal;Hung Q. Ngo;Chunming Qiao

  • In-Database Learning with Sparse Tensors

    Mahmoud Abo Khamis;Hung Q. Ngo;XuanLong Nguyen;Dan Olteanu

  • Developing Context-Aware Ubiquitous Computing Systems with a Unified Middleware Framework

    Hung Q. Ngo;Anjum Shehzad;Saad Liaquat;Maria Riaz

  • Mobility profile based routing within intermittently connected mobile ad hoc networks (ICMAN)

    Joy Ghosh;Hung Q. Ngo;Chunming Qiao

  • Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract).

    Hung Q. Ngo;Ely Porat;Atri Rudra

Frequent Co-Authors

Atri Rudra
Atri Rudra University at Buffalo, State University of New York
Dan Olteanu
Dan Olteanu University of Zurich
Christopher Ré
Christopher Ré Stanford University
Chunming Qiao
Chunming Qiao University at Buffalo, State University of New York
Ding-Zhu Du
Ding-Zhu Du The University of Texas at Dallas
Dan Suciu
Dan Suciu University of Washington
Jaideep Srivastava
Jaideep Srivastava University of Minnesota
Ely Porat
Ely Porat Bar-Ilan University
Shambhu Upadhyaya
Shambhu Upadhyaya University at Buffalo, State University of New York
Aidong Zhang
Aidong Zhang University of Virginia

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degrees in Computer Science unlocks a world of possibilities, regardless of your academic or financial background. Today, students have access to affordable online colleges that offer flexibility without breaking the bank. These programs make it easier for learners to start a tech-driven career without incurring significant debt.

If you’re concerned about your previous academic performance, there are online colleges that accept 2.0 gpa, helping more students gain admission and pursue their educational goals. Many of these institutions offer robust support services, ensuring you’re set up for success.

Fast-track options are also available—for those eager to join the workforce quickly, consider pursuing one of the accelerated cs degree programs. These enable students to earn a recognized credential in less time.

Additionally, a Computer Science background opens doors in varied fields. If you’re interested in combining technology with other interests, see how skills in tech, data, or analytics can also pave the way for impactful roles similar to those explored in what can i do with an environmental science degree.

Best Scientists Citing Hung Q. Ngo

Trending Scientists

Recently Published Articles