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
(37)
Pavan Aduri
14
Vikraman Arvind
10
John M. Hitchcock
9
Raghunath Tewari
7
Chris Bourke
6
Conferences
(15)
FSTTCS
3
ALT
2
STACS
2
COCOON
2
FCT
2
Journals
(15)
TCS
7
ECCC
7
IPL
3
CORR
3
MST
2
Keywords
(97)
Embed
Subscribe
Academic
Authors
N. Variyam Vinodchandran
Edit
N. Variyam Vinodchandran
University of Nebraska Lincoln
Publications: 62
|
Citations: 384
|
G-Index: 17
|
H-Index: 11
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
,
Networks & Communications
View FAQ about top research area and research interests
Collaborated with
37 co-authors
from 1994 to 2011
; Cited by
274 authors
Homepage
|
Bing
Cumulative
Annual
Order by:
Publications
(62)
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
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs
Samir Datta
,
Raghav Kulkarni
,
Raghunath Tewari
,
N. Variyam Vinodchandran
Conference:
Symposium on Theoretical Aspects of Computer Science - STACS
, pp. 579-590, 2011
ReachFewL = ReachUL
Brady GarvinDerrick Stolee
,
Raghunath Tewari
,
N. V. Vinodchandran
,
Derrick Stolee
Published in 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
Resource-bounded Dimension in Computational Learning Theory
Ricard Gavaldà
,
María López-Valdés
,
Elvira Mayordomo
,
N. V. Vinodchandran
Journal:
Computing Research Repository - CORR
, vol. abs/1010.5, 2010
Order by:
Citations
(384 times by 276 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
Non-uniform ACC Circuit Lower Bounds
(
Citations: 6
)
Ryan Williams
Conference:
Annual IEEE Conference on Computational Complexity - CCC
, pp. 115-125, 2011
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
(
Citations: 4
)
Eric Allender
,
Michal Koucký
,
Detlef Ronneburger
,
Sambuddha Roy
Journal:
Journal of Computer and System Sciences - JCSS
, vol. 77, no. 1, pp. 14-40, 2011
Possibilities and impossibilities in Kolmogorov complexity extraction
(
Citations: 2
)
Marius Zimand
Journal:
Computing Research Repository - CORR
, vol. abs/1104.0, 2011
Predicting MHC-II Binding Affinity Using Multiple Instance Regression
(
Citations: 1
)
Yasser EL-Manzalawy
,
Drena Dobbs
,
Vasant Honavar
Journal:
IEEE/ACM Transactions on Computational Biology and Bioinformatics - TCBB
, vol. 8, no. 4, pp. 1067-1079, 2011
Comments