Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Coauthors
(55)
Pavan Aduri
18
Jack Lutz
13
N. Variyam Vinodchandran
10
Elvira Mayordomo
9
Ryan C. Harkins
5
Conferences
(10)
ICALP
4
STACS
3
FSTTCS
2
CCC
2
ISPD
1
Journals
(14)
ECCC
11
TCS
6
MST
4
CORR
4
SIAMCOMP
3
Keywords
(54)
Embed
Subscribe
Academic
Authors
John M. Hitchcock
John M. Hitchcock,University of Wyoming,Algorithms & Theory,Scientific Computing,Data Mining
Edit
John M. Hitchcock
University of Wyoming
Publications:
72

Citations:
552
Fields:
Algorithms & Theory
,
Scientific Computing
,
Data Mining
View FAQ about top research areas and Fields of study
Collaborated with
55 coauthors
from 1987 to 2011

Cited by
155 authors
Cumulative
Annual
Sort by:
Publications
(72)
BibTeX

RIS

RefWorks
Download
Extracting Kolmogorov complexity with applications to dimension zeroone 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. 627636, 2011
Kolmogorov Complexity in Randomness Extraction
John M. Hitchcock
,
A. Pavan
,
N. V. Vinodchandran
Journal:
ACM Transactions on Computation Theory  TOCT
, pp. 112, 2011
Dimension, Halfspaces, and the Density of Hard Sets
Ryan C. Harkins
,
John M. Hitchcock
Journal:
Theory of Computing Systems / Mathematical Systems Theory  MST
, vol. 49, no. 3, pp. 601614, 2011
Lower Bounds for Reducibility to the Kolmogorov Random Strings
(
Citations: 1
)
John M. Hitchcock
Conference:
Conference on Computability in Europe  CIE
, pp. 195200, 2010
A note on exponential circuit lower bounds from derandomizing ArthurMerlin games
Scott Aaronson
,
Baris Aydinlioglu
,
Harry Buhrman
,
John M. Hitchcock
,
Dieter van Melkebeek
Journal:
Electronic Colloquium on Computational Complexity  ECCC
, vol. 17, 2010
Sort by:
Citations
(552 times by 176 publications)
Extracting information is hard: A Turing degree of nonintegral effective Hausdorff dimension
(
Citations: 8
)
Joseph S. Miller
Journal:
Advances in Mathematics  ADVAN MATH
, vol. 226, no. 1, pp. 373384, 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. 521527, 2011
Extracting Kolmogorov complexity with applications to dimension zeroone 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. 627636, 2011
DEM–CFD simulation of the particle dispersion in a gas–solid twophase flow for a fuelrich/lean burner
Hao Zhou
,
Guiyuan Mo
,
Jiapei Zhao
,
Kefa Cen
Journal:
Fuel
, vol. 90, no. 4, pp. 15841590, 2011
Comments