Akash Kumar
Akash Kumar
PhD student at Purdue
Bestätigte E-Mail-Adresse bei purdue.edu
Zitiert von
Zitiert von
Finding Forbidden Minors in Sublinear Time: A n^ 1/2+ o (1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs
A Kumar, C Seshadhri, A Stolman
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
Testing -Monotonicity: The Rise and Fall of Boolean Functions
CL Canonne, E Grigorescu, S Guo, A Kumar, K Wimmer
Theory of Computing 15 (1), 1-55, 2019
Random walks and forbidden minors II: a poly(d ε-1)-query tester for minor-closed properties of bounded degree graphs
A Kumar, C Seshadhri, A Stolman
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
Approximation algorithms for digraph width parameters
S Kintali, N Kothari, A Kumar
Theoretical Computer Science 562, 365-376, 2015
Finding pseudorandom colorings of pseudorandom graphs
A Kumar, A Louis, M Tulsiani
37th IARCS Annual Conference on Foundations of Software Technology and …, 2018
Flipping out with many flips: Hardness of testing k-monotonicity
E Grigorescu, A Kumar, K Wimmer
RANDOM, 2018
Random walks and forbidden minors III: poly (d/{\epsilon})-time partition oracles for minor-free graph classes
A Kumar, C Seshadhri, A Stolman
arXiv preprint arXiv:2102.00556, 2021
Spectral Approach to Modern Algorithm Design
A Kumar
Purdue University Graduate School, 2020
Review of combinatorial optimization by B. Korte and J. Vygen
A Kumar
ACM SIGACT News 44 (3), 31-35, 2013
Review of polynomia and related realms by Dan Kalman
A Kumar
ACM SIGACT News 43 (2), 15-20, 2012
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–10