Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all domains
Limit my searches in the following domains
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Co-authors
(51)
Alan Selman
19
John M. Hitchcock
16
N. Variyam Vinodchandran
14
Lance Fortnow
12
Christian Glasser (Christian Glaßer)
11
Conferences
(12)
STACS
4
FSTTCS
4
COCOON
2
CCC
2
IEDM
2
Journals
(14)
ECCC
10
SIAMCOMP
5
IANDC
4
MST
4
IPL
2
Keywords
(75)
Embed
Subscribe
Academic
Authors
Pavan Aduri
Edit
Pavan Aduri
Iowa State University
Publications: 69
|
Citations: 329
|
G-Index: 14
|
H-Index: 10
The information is calculated based on the tens of millions of scholarly articles currently discoverable within Microsoft Academic Search. As more content gets indexed, the accuracy and completeness will continue to improve.
Interests:
Algorithms & Theory
,
Scientific Computing
,
Data Mining
View FAQ about top research area and research interests
Collaborated with
51 co-authors
from 1993 to 2011
; Cited by
188 authors
Homepage
|
Bing
Cumulative
Annual
Order by:
Publications
(69)
BibTeX
|
RIS
|
RefWorks
Download
Extracting Kolmogorov complexity with applications to dimension zero-one laws
Lance Fortnow
,
John M. Hitchcock
,
Aduri Pavan
,
N. V. Vinodchandran
,
Fengming Wang
Journal:
Information and Computation/information and Control - IANDC
, vol. 209, no. 4, pp. 627-636, 2011
The fault tolerance of NP-hard problems
Christian Glaßer
,
Aduri Pavan
,
Stephen D. Travers
Journal:
Information and Computation/information and Control - IANDC
, vol. 209, no. 3, pp. 443-455, 2011
On the Power of Unambiguity in Logspace
(
Citations: 2
)
Aduri Pavan
,
Raghunath Tewari
,
N. V. Vinodchandran
Journal:
Computing Research Repository - CORR
, vol. abs/1001.2, 2010
Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses
Xiaoyang Gu
,
John M. Hitchcock
,
Aduri Pavan
Conference:
Symposium on Theoretical Aspects of Computer Science - STACS
, pp. 429-440, 2010
Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses
Xiaoyang Gu
,
John M. Hitchcock
,
Aduri Pavan
Journal:
Computing Research Repository - CORR
, vol. abs/1001.0, 2010
Order by:
Citations
(329 times by 184 publications)
Extracting information is hard: A Turing degree of non-integral effective Hausdorff dimension
(
Citations: 8
)
Joseph S. Miller
Journal:
Advances in Mathematics - ADVAN MATH
, vol. 226, no. 1, pp. 373-384, 2011
Possibilities and impossibilities in Kolmogorov complexity extraction
(
Citations: 2
)
Marius Zimand
Journal:
Computing Research Repository - CORR
, vol. abs/1104.0, 2011
On P vs. NP and geometric complexity theory: Dedicated to Sri Ramakrishna
Ketan D. Mulmuley
Journal:
Journal of The ACM - JACM
, vol. 58, no. 2, pp. 1-26, 2011
Extracting Kolmogorov complexity with applications to dimension zero-one laws
Lance Fortnow
,
John M. Hitchcock
,
Aduri Pavan
,
N. V. Vinodchandran
,
Fengming Wang
Journal:
Information and Computation/information and Control - IANDC
, vol. 209, no. 4, pp. 627-636, 2011
Soft Decoding, Dual BCH Codes, and Better List-Decodable varepsilon-Biased Codes
Venkatesan Guruswami
,
Atri Rudra
Journal:
IEEE Transactions on Information Theory - TIT
, vol. 57, no. 2, pp. 705-717, 2011
Comments