Mohit Daga
About me
See https://sites.google.com/view/mohitdaga/home
Working papers and pre-prints
- Thin Trees via k-Respecting Cut Identities
under submission, subsumes the k-respecting identities note (ArXiv: 2210.13320)
arxiv link, updated 14th October 2025 - Thin Trees Beyond Laminar Families
arxiv link, coming soon
Accepted / Published
- Error Bounds for Network Scale-Up Methods
Sergio Díaz-Aranda, Juan Marcos Ramirez, Mohit Daga, Jaya Prakash Champati, Jose Aguilar, Rosa E. Lillo, Antonio F. Anta
ACM SIGKDD 2025
[arXiv link / ACM]
Applies local inference and probabilistic methods to error quantification in networked sampling. - Distributed Small Cuts using Semigroups
with John Augustine
26th Int’l Conference on Distributed Computing and Networking (ICDCN 2025)
[arxiv-link / ACM]
Explores algebraic representations for distributed detection of sparse cuts. - Distributed Edge Connectivity in Sublinear Time
with Danupon Nanongkai, Monika Henzinger, Thatchaphol Saranurak
ACM STOC 2019
[arxiv link / ACM]
Introduces first sublinear-time algorithms for certifying edge-connectivity in distributed settings. - Methods and Systems for Assigning Resources to a Task
with Manoj Gupta, Koyel Mukherjee, Shailesh Vaya
US Patent US20170017522A1
Patented work from Xerox Research India: FPTAS-based resource allocation in crowdsourced BPMN. - 2-SiMDoM: A 2-Sieve Model for Detection of Mitosis in Multispectral Breast Cancer Imagery
with Ardhendu S. Tripathi, Atin Mathur, Manohar Kuse, Oscar C. Au
IEEE ICIP 2013, IEEE Link
Deep learning before its time: multispectral mitosis detection using sparse feature sieves.
Courses
Advanced Algorithms (DD2440), assistant
Algorithms and Complexity (DD2352), assistant
Introduction to the Philosophy of Science and Research Methodology for Computer Scientists (DA2210), assistant
Logic for Computer Scientists (DD1351), assistant
Principles of Programming Languages (DD2481), assistant