( en | de | ru )

 

Disambiguation of "Pavan, Aduri"

Author of the publication

copydeleteadd this publication to your clipboard
Redundancy in Complete Sets.

, , , and . STACS, volume 3884 of Lecture Notes in Computer Science, page 444-454. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Pavan Kumar

Chiara Pavan

G Pavan Kumar Reddy

Pavan Kumar

Pavan Ramkumar

 

Other publications of authors with the same name

Robustness of PSPACE-complete sets., and . Inf. Process. Lett., 103 (3): 102-104 (2007)On Pseudodeterministic Approximation Algorithms., , and . MFCS, volume 117 of LIPIcs, page 61:1-61:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy., , , and . Theor. Comput. Sci., 385 (1-3): 167-178 (2007)Model Counting Meets Distinct Elements in a Data Stream., , , and . SIGMOD Rec., 51 (1): 87-94 (2022)Bi-immunity separates strong NP-completeness notions., and . Inf. Comput., 188 (1): 116-126 (2004)Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws, , , , and . Electron. Colloquium Comput. Complex., (2005)Distributionally Hard Languages., , and . Theory Comput. Syst., 34 (3): 245-261 (2001)Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses., , and . Theory Comput. Syst., 51 (2): 248-265 (2012)Kolmogorov Complexity in Randomness Extraction., , and . TOCT, 3 (1): 1:1-1:12 (2011)Strong Reductions and Isomorphism of Complete Sets., , and . FSTTCS, volume 4855 of Lecture Notes in Computer Science, page 168-178. Springer, (2007)