Summary

Contact Information

Mailing Address:
Department of Computer Science and Engineering, SUNY Buffalo
338L Davis Hall
Buffalo, NY 14260-2500, U.S.A.

Phone: 716 645 4750

Email: hungngo [at] buffalo [dot] edu

Recent papers

  • Mahmoud Abo Khamis, Hung Q. Ngo, Christopher Ré, Atri Rudra, "FAQ: Questions Asked Frequently", [ ArXiV version ]
  • Mahmoud Abo Khamis, Anna C. Gilbert, Hung Q. Ngo, Atri Rudra, "Sparse Approximation, List Decoding, and Uncertainty Principles", [ ArXiV version ]
  • Dung 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". Graph Data-management Experiences & Systems Workshop (G rades 2015). Co-located with SIGMOD/PODS 2015. [ ArXiV version ]
  • Mahmoud Abo Khamis, Hung Q. Ngo, Christopher Ré, Atri Rudra, "Joins via Geometric Resolutions: Worst-case and Beyond", PODS 2015. [ ArXiV version ]
  • Hung Q. Ngo, Atri Rudra, "Efficiently decodable group testing," Encyclopedia of Algorithms, 2015.
  • Yingbo Zhou, Utkarsh Porwal, Ce Zhang, Hung Q. Ngo, XuanLong Nguyen, Christopher Ré, Venu Govindaraju, "Parallel feature selection inspired by group testing," NIPS 2014. [ pdf ]
  • Nikhil Londhe, Vishrawas Gopalakrishnan, Aidong Zhang, Hung Q. Ngo, and Rohini Srihari, "Matching Titles with Cross Title Web-Search Enrichment and Community Detection" VLDB 2014. [ pdf ]
  • Hung Q. Ngo, Dung Nguyen, Christopher Ré, Atri Rudra, "Beyond Worst-Case Analysis for Joins with Minesweeper," PODS 2014. [ ArXiV version ]
  • Hung Q. Ngo, Christopher Ré, Atri Rudra, "Skew Strikes Back: New Developments in the Theory of Join Algorithms", SIGMOD Records, vol. 42 (4), 2013. [ ArXiV Version ]
  • Denisa Duma, Mary Wootters, Anna C. Gilbert, Hung Q. Ngo, Atri Rudra, Matthew Alpert, Timothy J. Close, Gianfranco Ciardo, and Stefano Lonardi, "Accurate Decoding of Pooled Sequenced Data Using Compressed Sensing," WABI 2013. [ pdf ]
  • Hung Q. Ngo, Thanh-Nhan Nguyen, "Linear Programming Analysis of Switching Networks," Handbook of Combinatorial Optimization, 2013.
  • Anna Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin Strauss, "l2/l2-foreach sparse recovery with low risk," ICALP 2013. [ ArXiV Version ]
  • Liang Ge, Jing Gao, Hung Q. Ngo, Kang Li, Aidong Zhang, "On Handling Negative Transfer and Imbalanced Distributions in Multiple Source Transfer Learning," SIAM Conference on Data Mining (SDM 13)
    Invited to the SAM as one of the best papers from SDM 2013.
  • Hung Q. Ngo, Duong Hieu Phan, and David Pointcheval, "Black-box Trace&Revoke Codes," Algorithmica, Volume 67, Issue 3 (2013), Page 418--448. [ pdf ]
  • Hung Q. Ngo, Ely Porat, Christopher Ré, and Atri Rudra, Worst Case Optimal Join Algorithms, PODS 2012. (Best Paper Award!) [ conf version ] [ preliminary full version on ArXiv ]
    Invited to Journal of the ACM
  • Hung Q. Ngo, Ely Porat, and Atri Rudra, Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion, STACS 2012. [ pdf ]
  • Hung Q. Ngo, Ely Porat and Atri Rudra. Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications. ICALP 2011. [ pdf ]

Recent Professional Services

Some Quotes

"Sometimes it happens that a man's circle of horizon becomes smaller and smaller, and as the radius approaches zero it concentrates on one point. And then that becomes his point of view."
David Hilbert

"Hỏi rằng người ở quê đâu
Thưa rằng tôi ở rất lâu quê nhà"
Bùi Giáng

"Beauty is the first test: there is no permanent place in the world for ugly Mathematics."
A Mathematician's Apology (London 1941).
Godfrey Harold Hardy

"We can only see a short distance ahead, but we can see plenty there that needs to be done."
Computing Machinery and Intelligence (1950). (The paper)
Alan Turing