BibSonomy
::
author
::
tag
user
group
author
concept
BibTeX key
search:all
A blue social bookmark and publication sharing system.
tags
·
relations
·
groups
·
popular
help
·
blog
·
about
username:
password:
myFriends
myRelations
mySearch
myPDF
myDuplicates
myBibTeX
login
·
register
bookmarks
publications
(20)
previous | 1
2
|
next
Random reals and Lipschitz continuity.
Andrew E. M.
Lewis
and George
Barmpalias
Mathematical Structures in Computer Science
16
737-749 (2006)
to
dblp
by
dblp
on 2008-06-19 00:00:00
|
URL
|
BibTeX
Algorithmic randomness of continuous functions.
George
Barmpalias
and Paul
Brodhead
and Douglas A.
Cenzer
and Jeffrey B.
Remmel
and Rebecca
Weber
Arch. Math. Log.
46
533-546 (2008)
to
dblp
by
dblp
on 2008-05-27 00:00:00
|
URL
|
BibTeX
Algorithmic Randomness of Closed Sets.
George
Barmpalias
and Paul
Brodhead
and Douglas
Cenzer
and Seyyed
Dashti
and Rebecca
Weber
J. Log. Comput.
17
1041-1062 (2007)
to
dblp
by
dblp
on 2008-01-14 00:00:00
|
URL
|
BibTeX
Post's Programme for the Ershov Hierarchy.
Bahareh
Afshari
and George
Barmpalias
and S.
Barry Cooper
and Frank
Stephan
J. Log. Comput.
17
1025-1040 (2007)
to
dblp
by
dblp
on 2008-01-14 00:00:00
|
URL
|
BibTeX
Working with the LR Degrees.
George
Barmpalias
and Andrew E. M.
Lewis
and Mariya Ivanova
Soskova
TAMC
89-99 (2007)
to
dblp
by
dblp
on 2007-08-19 00:00:00
|
URL
|
BibTeX
K -Trivial Closed Sets and Continuous Functions.
George
Barmpalias
and Douglas A.
Cenzer
and Jeffrey B.
Remmel
and Rebecca
Weber
CiE
135-145 (2007)
to
dblp
by
dblp
on 2007-08-02 00:00:00
|
URL
|
BibTeX
Random non-cupping revisited.
George
Barmpalias
J. Complexity
22
850-857 (2006)
to
dblp
by
dblp
on 2007-05-09 00:00:00
|
URL
|
BibTeX
Randomness and the linear degrees of computability.
Andrew E. M.
Lewis
and George
Barmpalias
Ann. Pure Appl. Logic
145
252-257 (2007)
to
dblp
by
dblp
on 2007-02-27 00:00:00
|
URL
|
BibTeX
The ibT degrees of computably enumerable sets are not dense.
George
Barmpalias
and Andrew E. M.
Lewis
Ann. Pure Appl. Logic
141
51-60 (2006)
to
dblp
by
dblp
on 2007-02-27 00:00:00
|
URL
|
BibTeX
A Cappable Almost Everywhere Dominating Computably Enumerable Degree.
George
Barmpalias
and Antonio
Montalbán
Electr. Notes Theor. Comput. Sci.
167
17-31 (2007)
to
dblp
by
dblp
on 2007-02-12 00:00:00
|
URL
|
BibTeX
previous | 1
2
|
next
Showing 10 items per page. Show
10
,
25
,
50
,
100
items per page.
tags
dblp