Skip navigation
IVLE
Email
Library
Map
Calendar
Home
Research Outputs
View research outputs
Deposit publication / dataset
Researchers
Help
FAQs
Contact us
Guidelines
Log in
ScholarBank@NUS
Research Outputs
Browsing by Author
STEPHAN,FRANK CHRISTIAN
Enter a last name
Select a letter below to browse by last name or type
0-9
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
Or
Results/Page
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
Showing results 101 to 120 of 133
< previous
next >
Refman
EndNote
Bibtex
RefWorks
Excel
CSV
PDF
Send via email
Issue Date
Title
Author(s)
2018
Randomness and Solovay degrees
Miyabe K.
;
Nies A.
;
Stephan F.
Dec-2006
Randomness and universal machines
Figueira, S.
;
Stephan, F.
;
Wu, G.
2005
Randomness, relativization and turing degrees
Nies, A.
;
Stephan, F.
;
Terwijn, S.A.
2016
Reducibilities among equivalence relations induced by recursively enumerable structures
Gavryushkin A.
;
Khoussainov B.
;
Stephan F.
2019
Reductions between types of numberings
Herbert I.
;
Jain S.
;
Lempp S.
;
Mustafa M.
;
Stephan F.
2010
Regular patterns, regular languages and context-free languages
Jain, S.
;
Ong, Y.S.
;
Stephan, F.
Aug-2011
Relativizations of randomness and genericity notions
Franklin, J.N.Y.
;
Stephan, F.
;
Yu, L.
Jul-2011
Representation of left-computable ε-random reals
Calude, C.S.
;
Hay, N.J.
;
Stephan, F.
2007
Results on memory-limited U-shaped learning
Carlucci, L.
;
Case, J.
;
Jain, S.
;
Stephan, F.
2011
Robust learning of automatic classes of languages
Jain, S.
;
Martin, E.
;
Stephan, F.
Jun-2010
Schnorr trivial sets and truth-table reducibility
Franklin, J.N.Y.
;
Stephan, F.
2020
Searching for shortest and least programs
Calude C.S.
;
Jain S.
;
Merkle W.
;
Stephan F.
2013
Selection by recursively enumerable sets
Merkle, W.
;
Stephan, F.
;
Teutsch, J.
;
Wang, W.
;
Yang, Y.
2017
Semiautomatic Structures
Jain S.
;
Khoussainov B.
;
Stephan F.
;
Teng D.
;
Zou S.
2006
Some recent results in U-shaped learning
Jain, S.
;
Stephan, F.
2010
Splitting of learnable classes
Li, H.
;
Stephan, F.
1-May-2019
The complexity of verbal languages over groups
Jain S.
;
Miasnikov A.
;
Stephan F.
2005
The dot-depth and the polynomial hierarchies correspond on the delta levels
Borchert, B.
;
Lange, K.-J.
;
Stephan, F.
;
Tesson, P.
;
Thérien, D.
2004
The dot-depth and the polynomial hierarchy correspond on the delta levels
Borchert, B.
;
Lange, K.-J.
;
Stephan, F.
;
Tesson, P.
;
Thérien, D.
2019
The isomorphism problem for tree-automatic ordinals with addition
Jain S.
;
Khoussainov B.
;
Schlicht P.
;
Stephan F.