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
(53)
Pavan Aduri
16
Jack Lutz
11
N. Variyam Vinodchandran
9
Elvira Mayordomo
8
Ryan C. Harkins
5
Conferences
(10)
ICALP
4
STACS
3
FSTTCS
3
CCC
2
ISPD
1
Journals
(11)
ECCC
11
TCS
6
CORR
4
SIAMCOMP
3
MST
3
Keywords
(52)
Embed
Subscribe
Academic
Authors
John M. Hitchcock
Edit
John M. Hitchcock
University of Wyoming
Publications: 65
|
Citations: 552
|
G-Index: 20
|
H-Index: 15
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
53 co-authors
from 1987 to 2011
; Cited by
155 authors
Homepage
|
Bing
Cumulative
Annual
Order by:
Publications
(65)
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
Dimension, Halfspaces, and the Density of Hard Sets
Ryan C. Harkins
,
John M. Hitchcock
Published in 2011.
Lower Bounds for Reducibility to the Kolmogorov Random Strings
(
Citations: 1
)
John M. Hitchcock
Conference:
Conference on Computability in Europe - CIE
, pp. 195-200, 2010
A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games
Scott Aaronson
,
Baris Aydinlioglu
,
Harry Buhrman
,
John M. Hitchcock
,
Dieter van Melkebeek
Journal:
Electronic Colloquium on Computational Complexity - ECCC
, vol. 17, 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
Order by:
Citations
(552 times by 176 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
Behaviour of dolomite, olivine and alumina as primary catalysts in air–steam gasification of sewage sludge
(
Citations: 1
)
Juan Manuel de Andrés
,
Adolfo Narros
,
María Encarnación Rodríguez
Journal:
Fuel
, vol. 90, no. 2, pp. 521-527, 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
DEM–CFD simulation of the particle dispersion in a gas–solid two-phase flow for a fuel-rich/lean burner
Hao Zhou
,
Guiyuan Mo
,
Jiapei Zhao
,
Kefa Cen
Journal:
Fuel
, vol. 90, no. 4, pp. 1584-1590, 2011
Comments