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
(28)
Rod Downey
13
Joseph S. Miller
6
Antonio Montalban (Antonio Montalbán)
4
Peter A. Cholak
3
Richard A. Shore
2
Conferences
(1)
TAMC
1
Journals
(11)
JSYML
5
APAL
2
NDJFL
2
TRANS AMER MATH SOC
2
IPL
1
Keywords
(29)
Embed
Subscribe
Academic
Authors
Noam Greenberg
Edit
Noam Greenberg
Victoria University of Wellington
Publications: 29
|
Citations: 80
|
G-Index: 7
|
H-Index: 4
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:
Mathematics
,
Scientific Computing
,
Algorithms & Theory
View FAQ about top research area and research interests
Collaborated with
28 co-authors
from 1994 to 2011
; Cited by
86 authors
Homepage
|
Bing
Cumulative
Annual
Order by:
Publications
(29)
BibTeX
|
RIS
|
RefWorks
Download
Benign cost functions and lowness properties
(
Citations: 2
)
Noam Greenberg
,
André Nies
Published in 2011.
A random set which only computes strongly jump-traceable c.e. sets
Noam Greenberg
Journal:
Journal of Symbolic Logic - JSYML
, vol. 76, no. 2, pp. 700-718, 2011
Lowness for Kurtz randomness
(
Citations: 12
)
Noam Greenberg
,
Joseph S. Miller
Journal:
Journal of Symbolic Logic - JSYML
, vol. 74, no. 2, pp. 665-678, 2009
DIAGONALLY NON-RECURSIVE FUNCTIONS AND EFFECTIVE HAUSDORFF DIMENSION
(
Citations: 4
)
NOAM GREENBERG
,
JOSEPH S. MILLER
Published in 2009.
$K$-trivial degrees and the jump-traceability hierarchy
(
Citations: 2
)
George Barmpalias
,
Rod Downey
,
Noam Greenberg
Journal:
Proceedings of The American Mathematical Society - PROC AMER MATH SOC
, vol. 137, no. 06, pp. 2099-2109, 2009
Order by:
Citations
(80 times by 59 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
Benign cost functions and lowness properties
(
Citations: 2
)
Noam Greenberg
,
André Nies
Published in 2011.
Demuth randomness and computational complexity
Antonín Kucera
,
André Nies
Journal:
Annals of Pure and Applied Logic - APAL
, vol. 162, no. 7, pp. 504-513, 2011
Upper bounds on ideals in the computably enumerable Turing degrees
George Barmpalias
,
André Nies
Journal:
Annals of Pure and Applied Logic - APAL
, vol. 162, no. 6, pp. 465-473, 2011
Van Lambalgen's Theorem and High Degrees
Johanna N. Y. Franklin
,
Frank Stephan
Journal:
Notre Dame Journal of Formal Logic - NDJFL
, vol. 52, no. 2, pp. 173-185, 2011
Comments