Browsing by Author STEPHAN,FRANK CHRISTIAN

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


Showing results 93 to 106 of 106 < previous 
Issue DateTitleAuthor(s)
2005The dot-depth and the polynomial hierarchies correspond on the delta levelsBorchert, B.; Lange, K.-J.; Stephan, F. ; Tesson, P.; Thérien, D.
2004The dot-depth and the polynomial hierarchy correspond on the delta levelsBorchert, B.; Lange, K.-J.; Stephan, F. ; Tesson, P.; Thérien, D.
Apr-2010Topological aspects of poset spacesMummert, C.; Stephan, F. 
2009Uncountable automatic classes and learningJain, S. ; Luo, Q.; Semukhin, P. ; Stephan, F. 
2011Uncountable automatic classes and learningJain, S. ; Luo, Q.; Semukhin, P. ; Stephan, F. 
18-Jan-2006Unifying logic, topology and learning in Parametric logicMartin, E.; Sharma, A.; Stephan, F. 
2008Universal recursively enumerable sets of stringsCalude, C.S.; Nies, A.; Staiger, L.; Stephan, F. 
13-May-2011Universal recursively enumerable sets of stringsCalude, C.S.; Nies, A.; Staiger, L.; Stephan, F. 
Jun-2007Using random sets as oraclesHirschfeldt, D.R.; Nies, A.; Stephan, F. 
2011Van Lambalgen's theorem and high degreesFranklin, J.N.Y.; Stephan, F. 
2005Variations on U-shaped learningCarlucci, L.; Jain, S. ; Kinber, E.; Stephan, F. 
2006Variations on U-shaped learningCarlucci, L.; Jain, S. ; Kinber, E.; Stephan, F. 
May-2008When unlearning helpsBaligat, G.; Case, J.; Merkle, W.; Stephan, F. ; Wiehagen, R.
Nov-2008Π1 0 classes, L R degrees and Turing degreesBarmpalias, G.; Lewis, A.E.M.; Stephan, F.