Pavan Aduri
Pavan Aduri
Verified email at cs.iastate.edu - Homepage
Title
Cited by
Cited by
Year
Counting and sampling triangles from a graph stream
A Pavan, S Tirthapura
1732013
Lecture notes in computer science
A Demirkol, Z Demir, E Emre
SPRINGER-VERLAG BERLIN, 2005
154*2005
On the hardness of permanent
JY Cai, A Pavan, D Sivakumar
Annual Symposium on Theoretical Aspects of Computer Science, 90-99, 1999
691999
Parallel triangle counting in massive streaming graphs
K Tangwongsan, A Pavan, S Tirthapura
Proceedings of the 22nd ACM international conference on Information …, 2013
482013
Extracting Kolmogorov complexity with applications to dimension zero-one laws
L Fortnow, JM Hitchcock, A Pavan, NV Vinodchandran, F Wang
International Colloquium on Automata, Languages, and Programming, 335-345, 2006
382006
Separation of NP-completeness notions
A Pavan, AL Selman
Proceedings 16th Annual IEEE Conference on Computational Complexity, 78-89, 2001
382001
Range-efficient counting of distinct elements in a massive data stream
A Pavan, S Tirthapura
SIAM Journal on Computing 37 (2), 359-379, 2007
322007
On the NP-completeness of the minimum circuit size problem
JM Hitchcock, A Pavan
35th IARCS Annual Conference on Foundations of Software Technology and …, 2015
312015
Range-efficient computation of F/sub 0/over massive data streams
A Pavan, S Tirthapura
21st International Conference on Data Engineering (ICDE'05), 32-43, 2005
302005
An O (n½+?)-Space and Polynomial-Time Algorithm for Directed Planar Reachability
T Imai, K Nakagawa, A Pavan, NV Vinodchandran, O Watanabe
2013 IEEE Conference on Computational Complexity, 277-286, 2013
262013
New time-space upperbounds for directed reachability in high-genus and h-minor-free graphs
D Chakraborty, A Pavan, R Tewari, NV Vinodchandran, LF Yang
34th International Conference on Foundation of Software Technology and …, 2014
252014
Autoreducibility, mitoticity, and immunity
C Glaßer, M Ogihara, A Pavan, AL Selman, L Zhang
Journal of Computer and System Sciences 73 (5), 735-754, 2007
252007
Hardness hypotheses, derandomization, and circuit complexity
JM Hitchcock, A Pavan
International Conference on Foundations of Software Technology and …, 2004
232004
Some results on derandomization
H Buhrman, L Fortnow, A Pavan
Annual Symposium on Theoretical Aspects of Computer Science, 212-222, 2003
22*2003
Kolmogorov complexity in randomness extraction
JM Hitchcock, A Pavan, NV Vinodchandran
ACM Transactions on Computation Theory (TOCT) 3 (1), 1-12, 2011
212011
Proving SAT does not have small circuits with an application to the two queries problem
L Fortnow, A Pavan, S Sengupta
Journal of Computer and System Sciences 74 (3), 358-363, 2008
212008
Properties of NP-complete sets
C Glaßer, A Pavan, AL Selman, S Sengupta
SIAM Journal on Computing 36 (2), 516-542, 2006
212006
Comparison of reductions and completeness notions
A Pavan
SIGACT News 34 (2), 27-41, 2003
172003
Space-efficient estimation of statistics over sub-sampled streams
A McGregor, A Pavan, S Tirthapura, D Woodruff
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of …, 2012
162012
Comparing reductions to NP-complete sets
JM Hitchcock, A Pavan
Information and Computation 205 (5), 694-706, 2007
162007
The system can't perform the operation now. Try again later.
Articles 1–20