Frank Stephan

Frank Stephan's AcademicInfluence.com Rankings

Frank Stephan

Computer Science

#6413

World Rank

#6762

Historical Rank

Machine Learning

#2072

World Rank

#2099

Historical Rank

Artificial Intelligence

#2332

World Rank

#2372

Historical Rank

Database

#3501

World Rank

#3648

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Frank Stephan Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Frank Stephan's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Set Theory (2021) (1276)
Deciding parity games in quasipolynomial time (2017) (198)
Randomness, relativization and Turing degrees (2005) (155)
Theory and Applications of Models of Computation (2012) (136)
Trivial Reals (2002) (108)
Automatic structures: richness and limitations (2004) (107)
Using random sets as oracles (2007) (102)
Kolmogorov Complexity and the Recursion Theorem (2006) (95)
Approximable sets (1995) (93)
A Cohesive Set which is not High (1993) (69)
Automatic linear orders and trees (2005) (67)
An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space (2017) (65)
Kolmogorov-Loveland randomness and stochasticity (2005) (65)
Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity (1995) (60)
Lowness for the Class of Schnorr Random Reals (2005) (60)
Lowness properties and approximations of the jump (2008) (51)
Extremes in the Degrees of Inferability (1994) (50)
Kolmogorov complexity and the Recursion Theorem (2011) (48)
On the structure of degrees of inferability (1993) (46)
On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions (1998) (45)
Quantifying the Amount of Verboseness (1992) (42)
HIERARCHIES OF RANDOMNESS TESTS (2006) (42)
Definability and Regularity in Automatic Structures (2004) (40)
Schnorr trivial sets and truth-table reducibility (2010) (39)
Hausdorff dimension in exponential time (2001) (39)
Lowness for Weakly 1-generic and Kurtz-Random (2006) (37)
On automatic partial orders (2003) (37)
Series Randomness , Relativization and Turing Degrees (2004) (36)
Recursion Theoretic Properties of Frequency Computation and Bounded Queries (1995) (32)
Language Learning from Texts: Mind Changes, Limited Memory and Monotonicity (Extended Abstract). (1995) (30)
Learning algebraic structures from text (2001) (29)
Martin-Löf random and PA-complete sets (2016) (29)
Predictive Learning Models for Concept Drift (1998) (28)
Algorithmic Aspects of Lipschitz Functions (2014) (28)
On existentially first-order definable languages and their relation to NP (1998) (28)
Unlearning Helps (2000) (27)
Representation of left-computable ε-random reals (2011) (26)
Enumerations of the Kolmogorov function (2006) (26)
Noisy Inference and Oracles (1995) (26)
Non U-Shaped Vacillatory and Team Learning (2005) (25)
Generalized notions of mind change complexity (1997) (25)
Results on memory-limited U-shaped learning (2007) (24)
Randomness and universal machines (2006) (23)
Relativizations of randomness and genericity notions (2011) (23)
Learnability of automatic classes (2010) (22)
Reducibilities among equivalence relations induced by recursively enumerable structures (2016) (22)
Graphs realised by r.e. equivalence relations (2014) (22)
Avoiding coding tricks by hyperrobust learning (1999) (21)
Automatic Functions, Linear Time and Learning (2012) (21)
On one-sided versus two-sided classification (2001) (21)
Iterative learning of simple external contextual languages (2008) (20)
I classes, LR degrees and Turing degrees (2008) (20)
When unlearning helps (2008) (20)
Robust learning aided by context (1998) (18)
How Powerful Are Integer-Valued Martingales? (2010) (18)
Post's Programme for the Ershov Hierarchy (2007) (18)
Effective Search Problems (1994) (18)
Pillay's conjecture and its solution—a survey (2010) (17)
Constructive Dimension and Turing Degrees (2007) (17)
Infinitely-Often Autoreducible Sets (2003) (16)
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory (1997) (16)
Continual Learning (2010) (16)
Automatic Structures — Recent Results and Open Questions (2015) (15)
TURING DEGREES AND THE ERSHOV HIERARCHY (2009) (15)
Computable categoricity and the Ershov hierarchy (2008) (14)
Topological aspects of poset spaces (2009) (14)
Behavioural Approximations for Restricted Linear Differential Hybrid Automata (2006) (13)
Variations on U-shaped learning (2006) (13)
Correction to “A Cohesive Set which is not High” (1997) (13)
Immunological Computation (2010) (13)
Semiautomatic Structures (2017) (13)
Anti-Complex Sets and Reducibilities with Tiny Use (2011) (13)
Reductions between types of numberings (2019) (13)
Finite state incompressible infinite sequences (2014) (12)
The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels (2004) (12)
Inductive Inference (2010) (12)
On the structures inside truth-table degrees (2001) (12)
The Power of Frequency Computation (Extended Abstract) (1995) (11)
Vacillatory and BC learning on noisy data (1996) (11)
Regular patterns, regular languages and context-free languages (2010) (11)
Trees and learning (2004) (11)
Higher Kurtz randomness (2010) (11)
Learning via queries and oracles (1995) (11)
On C-Degrees, H-Degrees and T-Degrees (2007) (11)
Classification using information (1994) (11)
Universal recursively enumerable sets of strings (2008) (11)
Depth, Highness and DNR degrees (2015) (10)
Constructive Dimension and Weak Truth-Table Degrees (2007) (10)
On the Parameterised Complexity of Learning Patterns (2011) (10)
Van Lambalgen's Theorem and High Degrees (2011) (10)
Learning to Win Process-Control Games Watching Game-Masters (1998) (10)
Learning classes of approximations to non-recursive function (2002) (10)
On the learnability of vector spaces (2002) (10)
Uncountable automatic classes and learning (2009) (10)
Automatic Learners with Feedback Queries (2011) (10)
Inclusion Problems in Parallel Learning and Games (1996) (10)
The complexity of ODDnA (2000) (10)
Automatic Learning of Subclasses of Pattern Languages (2011) (10)
How to verify computation with a rational network (2016) (10)
Index sets and universal numberings (2009) (10)
ON AUTOMATIC FAMILIES (2011) (10)
Unifying logic, topology and learning in Parametric logic (2006) (10)
Presentations of K-Trivial Reals and Kolmogorov Complexity (2005) (9)
Cone avoidance and randomness preservation (2015) (9)
On the Query Complexity of Sets (1996) (9)
Robust learning--rich and poor (2004) (9)
Memory-Limited U-Shaped Learning (2006) (9)
An incomplete set of shortest descriptions (2012) (9)
Measure, Category and Learning Theory (1995) (8)
Automata on ordinals and automaticity of linear orders (2013) (8)
On the Classification of Computable Languages (1997) (8)
Learning in Logic with RichProlog (2002) (8)
On the role of update constraints and text-types in iterative learning (2014) (8)
Refuting Learning Revisited (2001) (8)
The Complexity of Verbal Languages over Groups (2012) (8)
A General Theory of Deduction, Induction, and Learning (2001) (8)
Learning in Friedberg numberings (2007) (8)
Immunity and Hyperimmunity for Sets of Minimal Indices (2008) (8)
Prescribed Learning of R.E. Classes (2007) (7)
U-shaped learning may be necessary 3 (2004) (7)
Weakly Semirecursive Sets and r.e. Orderings (1993) (7)
Non-U-shaped vacillatory and team learning (2008) (7)
On the Relative Sizes of Learnable Sets (1998) (7)
On the Uniform Learnability of Approximations to Non-Recursive Functions (1999) (6)
Numberings optimal for learning (2008) (6)
Learning Pattern Languages over Groups (2017) (6)
Applications of Kolmogorov complexity to computable model theory (2007) (6)
The VC-Dimension of Subclasses of PatternLanguages ? (1999) (6)
Hausdorff-dimension and weak truth-table reducibility (2007) (6)
Characterizations of Recursively Enumerable Languages by Programmed Grammars With Unconditional Transfer (1999) (6)
Robust Learning of Automatic Classes of Languages (2011) (6)
Learning Families of Closed Sets in Matroids (2012) (6)
Learning, Logic, and Topology in a Common Framework (2002) (6)
Language learning from texts (extended abstract): mind changes, limited memory and monotonicity (1995) (6)
The Complexity of the Set of Nonrandom Numbers (2007) (6)
Degrees of Weakly Computable Reals (2006) (6)
The VC-Dimension of Subclasses of Pattern (1999) (6)
How Powerful is Unconditional Transfer? - When UT meets AC (1997) (6)
Cost-Sensitive Classification (2010) (5)
Robust learning with infinite additional information (1997) (5)
Inclusion problems in parallel learning and games (extended abstract) (1994) (5)
Initial segment complexities of randomness notions (2010) (5)
Recursion Theoretic Properties of Frequency Computation and Bounded Queries (Extended Abstract) (1993) (5)
Learning a subclass of regular patterns in polynomial time (2006) (5)
Finitely Generated Semiautomatic Groups (2016) (5)
Structural measures for games and process control in the branch learning model (1997) (4)
Things that can be made into themselves (2012) (4)
The complexity of oddan (2000) (4)
Learning Algebraic Structures from Text Using Semantical Knowledge (1998) (4)
Complexity of Inductive Inference (2010) (4)
The Complexity of Universal Text-Learners (1997) (4)
The dot-depth and the polynomial hierarchies correspond on the delta levels (2005) (4)
Weakly Represented Families in Reverse Mathematics (2017) (4)
Effectivity Questions for Kleene's Recursion Theorem (2013) (4)
On Conservative Learning of Recursively Enumerable Languages (2013) (4)
Tree-automatic scattered linear orders (2016) (4)
Inductive inference and reverse mathematics (2016) (4)
Arithmetic complexity via effective names for random sequences (2010) (4)
On a Question of Ambos-Spies and Kucera (2003) (4)
Confident and consistent partial learning of recursive functions (2012) (4)
Bi-immunity over different size alphabets (2021) (3)
Closed left-r.e. sets (2011) (3)
Covering the recursive sets (2015) (3)
Counting Extensional Differences in BC-Learning (2000) (3)
Cooperative Coevolution (2010) (3)
Automata on Ordinals and Linear Orders (2011) (3)
Consistent Partial Identification (2009) (3)
Learning by switching type of information (2001) (3)
Resource bounded next value and explanatory identification: learning automata, patterns and polynomials on-line (1997) (3)
Ordered Semiautomatic Rings with Applications to Geometry (2020) (3)
Computational aspects of the hyperimmune-free degrees (2013) (3)
Partial learning of recursively enumerable languages (2013) (3)
The Complexity of Learning Branches and Strategies from Queries (1997) (3)
Learning Automatic Families of Languages (2016) (3)
On ordinal VC-dimension and some notions of complexity (2006) (3)
Mitotic Classes in Inductive Inference (2008) (3)
Content-Based Filtering (2010) (3)
Computable irrational numbers with representations of surprising complexity (2021) (3)
Algorithmic Learning Theory, 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, Proceedings (2006) (2)
Classification Learning (2009) (2)
[Chlorpromazine-induced agranulocytosis: a case report]. (2009) (2)
CHAITIN’S Ω AS A CONTINUOUS FUNCTION (2020) (2)
Subrecursive Approximations of Irrational Numbers by Variable Base Sums (2018) (2)
A Tour of Robust Learning (2003) (2)
Clustering Ensembles (2010) (2)
On the Values for Factor Complexity (2018) (2)
On the order dimension of locally countable partial orderings (2019) (2)
Classes bounded by incomplete sets (2002) (2)
A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT (2019) (2)
Automatic Learning from Repetitive Texts (2017) (2)
Numerical Study of Beam Dynamics in PITZ Bunch Compressor (2021) (2)
Idiot's Bayes (2010) (2)
Randomness and Solovay degrees (2018) (2)
Looking for an Analogue of Rice's Theorem in Complexity Theory (1996) (2)
On the classification of recursive languages (2004) (2)
Learning power and language expressiveness (2003) (2)
Algorithmic learning theory : 24th International Conference, ALT 2013, Singapore, October 6-9, 2013, proceedings (2013) (1)
Alternating Automatic Register Machines (2021) (1)
Algorithmic Learning Theory, 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings (2010) (1)
Correlation-Based Learning (2010) (1)
A reducibility related to being hyperimmune-free (2014) (1)
Selection by Recursively Enumerable Sets (2013) (1)
Context-Sensitive Learning (2010) (1)
A Survey on Recent Results on Partial Learning (2015) (1)
Classes with Easily Learnable Subclasses (2002) (1)
Computational Complexity of Learning (2010) (1)
Randomness and Initial Segment Complexity for Probability Measures (2019) (1)
Algorithmic learning of probability distributions from random data in the limit (2017) (1)
Limit-depth and DNR degrees (2018) (1)
Deduction, Induction, and beyond in Parametric Logic (2007) (1)
Some Recent Results in U-Shaped Learning (2006) (1)
Click-Through Rate (CTR) (2010) (1)
Learning and classifying (2011) (1)
Automatic linear orders and trees (Revised) (2003) (1)
Identifying Clusters from Positive Data (2004) (1)
A Polynomial Time Learner for a Subclass of Regular Patterns (2004) (1)
A weak randomness notion for probability measures (2019) (1)
Measure and Conquer for Max Hamming Distance XSAT (2019) (1)
Prescribed Learning of Indexed Families (2008) (1)
Query-Based Learning (2010) (1)
Series Universal Recursively Enumerable Sets of Strings (2009) (1)
On Martin's pointed tree theorem (2014) (1)
The Complexity of Recursive Splittings of Random Sets (2014) (1)
Learning How to Separate (2001) (1)
Robust Learning - Rich and Poor (2001) (1)
Competitive Coevolution (2010) (1)
Average-Case Complexity of Learning Polynomials (2000) (1)
FLASH Progress Report (2007) (1)
Semiautomatic Structures (2017) (1)
Strong Reductions and Immunity for Exponential Time (2003) (1)
Partial functions and domination (2015) (1)
Topological aspects of numberings (2003) (1)
On block pumpable languages (2016) (1)
Enumerating randoms (2010) (1)
On General Sum Approximations of Irrational Numbers (2018) (1)
Learners Based on Transducers (2018) (1)
Cross-Language Question Answering (2010) (1)
Models and Computability: A Techniques Oriented Survey of Bounded Queries (1999) (1)
Theory and applications of models of computation : 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015 : proceedings (2015) (1)
Combining Models of Approximation with Partial Learning (2015) (1)
Searching for shortest and least programs (2020) (1)
On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data (2012) (1)
Deterministic Frequency Pushdown Automata (2015) (1)
Equivalences between learning of data and probability distributions, and their applications (2018) (1)
Complex Adaptive System (2010) (1)
A Computation Model with Automatic Functions and Relations as Primitive Operations (2022) (1)
Absolute versus probabilistic classification in a logical setting (2005) (1)
RANDOMNESS AND COMPUTABILITY: OPEN QUESTIONS ANNOTATED VERSION JUNE 2007 (2007) (1)
PITZ: our ARD portfolio. (2017) (0)
Categorical Attribute (2010) (0)
Randomness and initial segment complexity for measures (2021) (0)
On Trees Without Hyperimmune Branches (2022) (0)
Quantitative Attribute (2010) (0)
Candidate-Elimination Algorithm (2010) (0)
Closest Point (2010) (0)
PITZ overview: the PITZ portfolio (2017) (0)
Comparable Corpus (2010) (0)
Immune Computing (2010) (0)
Word automatic groups of nilpotency class 2 (2023) (0)
Cost Function (2010) (0)
Instance Language (2010) (0)
Is More General Than (2010) (0)
Clustering with Side Information (2010) (0)
Immune-Inspired Computing (2010) (0)
Numerical simulation and modelling of experimental dynamos (2008) (0)
Connection Strength (2010) (0)
Instance Space (2010) (0)
A New Method of Soldering (1903) (0)
Indirect Reinforcement Learning (2010) (0)
Cannot-Link Constraint (2010) (0)
Immune Network (2010) (0)
City Block Distance (2010) (0)
Inductive Inference Rules (2010) (0)
Status of Accelerator RD @ PITZ: progress and plans (2017) (0)
Looking for an Analogue of (2000) (0)
Content Match (2010) (0)
Inverse Entailment (2010) (0)
Clause Learning (2010) (0)
Coevolutionary Computation (2010) (0)
Consensus Clustering (2020) (0)
Content-Based Recommending (2010) (0)
A Faster Exact Algorithm to Count X3SAT Solutions (2020) (0)
Clustering of Nonnumerical Data (2010) (0)
Cost-to-Go Function Approximation (2010) (0)
Induction as Inverted Deduction (2010) (0)
An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space (2019) (0)
Cross-Language Document Categorization (2010) (0)
Cluster Optimization (2010) (0)
Cluster Ensembles (2010) (0)
Learnability of Co-r.e. Classes (2012) (0)
Cluster Editing (2010) (0)
RF Gun experience at PITZ/FLASH. (2006) (0)
Compositional Coevolution (2010) (0)
Clustering with Advice (2010) (0)
Modeling the Magnetic Field of the LCLS-I Undulator for THz@PITZ (2021) (0)
Iterative Classification (2010) (0)
Languages given by Finite Automata over the Unary Alphabet (2023) (0)
Exact Satisfiabitity with Jokers (2019) (0)
Forschungsberichte Mathematische Logik Noisy Inference and Oracles Universitt at Heidelberg Mathematisches Institut Noisy Inference and Oracles (1996) (0)
Definability and Regularity in Automatic Presentations of Subsystems of Arithmetic (2003) (0)
The isomorphism problem for tree-automatic ordinals with addition (2018) (0)
Learning a Subclass of Regular Patterns in (2007) (0)
Simple sets and ideals under m-reducibility (2016) (0)
Competitive Learning (2010) (0)
Random Subgroups of Rationals (2019) (0)
Inverse Resolution (2010) (0)
Finding Isolated Cliques by Queries -- An Approach to Fault Diagnosis with Many Faults (2004) (0)
Complexity of Randomness Notions (2010) (0)
Weakly Represented Families in the Context of Reverse Mathematics (2016) (0)
Collapsing Polynomial-Time Degrees (2007) (0)
Inductive Bias (2010) (0)
SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC (2013) (0)
Priced Learning (2015) (0)
An Overview on Recent Results of Semiautomatic Groups and Semigroups (2016) (0)
A General Theory of Dedu tion , Indu tion , andLearning ? (2001) (0)
Closure of resource-bounded randomness notions under polynomial time permutations (2017) (0)
Effective Hausdorff dimension (2016) (0)
Highness, locally noncappability and nonboundings (2013) (0)
Inverse Optimal Control (2010) (0)
Quadratic Loss (2010) (0)
Splitting of Learnable Classes (2010) (0)
On Conservative Learning of R . e . Languages (2012) (0)
In-Sample Evaluation (2010) (0)
Learning from Streams (2009) (0)
ROBUSTNESS OF RESOURCE BOUNDED RANDOMNESS NOTIONS UNDER POLYNOMIAL TIME PERMUTATIONS (2018) (0)
Research Report Series Graphs Realised by R . E . Equivalence Relations (2014) (0)
Editors' Introduction (2010) (0)
Series Deterministic Frequency Pushdown Automata (2013) (0)
Special issue on the conference Theory and Applications of Models of Computation (2017) (0)
Enlarging learnable classes (2012) (0)
Proceedings of the 24th International Conference on Algorithmic Learning Theory - Volume 8139 (2013) (0)
Editors’ Introduction (2019) (0)
The Discrete Time Behaviour of Restricted Linear Hybrid Automata (2012) (0)
Addition Machines, Automatic Functions and Open Problems of Floyd and Knuth (2021) (0)
Preface (2008) (0)
WHEN IS X STRONGLY HYPERIMMUNE-FREE RELATIVE TO Y (2011) (0)
Speakers and Titles (2010) (0)
Pumping, with or Without Choice (2019) (0)
On the Help of Bounded Shot Verifiers , Comparers , and Standardisers in Inductive Inference (2017) (0)
Learnability and Positive Equivalence Relations (2020) (0)
Forschungsberichte Mathematische Logik Learning via Queries and Oracles Universitt at Heidelberg Mathematisches Institut Learning via Queries and Oracles (1996) (0)
Series Representation of Left-Computable ε – Random (2009) (0)
The importance of $\Pi 1^0$ classes in effective randomness. The Journal of Symbolic Logic, vol. 75 (2012) (0)
Members of thin $\Pi ^0_1$ classes and generic degrees (2020) (0)
Covering Algorithm (2010) (0)
Preface: Guest Editors' foreword (2013) (0)
OF KOLMOGOROV COMPLEXITY TO COMPUTABLE MODEL THEORY (2007) (0)
Logic Colloquium 2007: Introduction (2010) (0)
Learning from Context without Coding-tricks (2007) (0)
Towards an automatic geometer. (2022) (0)
Ju l 2 01 8 Equivalences between learning of data and probability distributions , and their applications ∗ (2018) (0)
Guest Editors' foreword (2016) (0)
Implementing fragments of ZFC within an r.e. Universe (2018) (0)
Input-Dependence in Function-Learning (2007) (0)
CDMTCS Research Report Series Universal Recursively Enumerable Sets of Strings (0)
On the data consumption benefits of accepting increased uncertainty (2007) (0)
The Comlexity of OddAn (2000) (0)
M. Gitik Blowing up power of a singular cardinalYwider gaps 1 D. Pitteloud Algebraic properties of rings of generalized power series 39 (2002) (0)
Automatic models of first order theories (2013) (0)
Lower bounds for the strong n-conjecture (2020) (0)
Cardinal structure under AD (2010) (0)
Improved Algorithms for the General Exact Satisfiability Problem (2021) (0)
On the amount of nonconstructivity in learning formal languages from text (2020) (0)
Mitotic Classes (2007) (0)
Instructions for use Title Learning a subclass of regular patterns in polynomial time Author ( s ) Case , (2017) (0)
Proceedings of the 17th international conference on Algorithmic Learning Theory (2006) (0)
The Comlexity of Odd A n . (2000) (0)
Learning with ordinal-bounded memory from positive data (2012) (0)
On the Help of Bounded Shot Verifiers, Comparators and Standardisers for Learnability in Inductive Inference (2018) (0)
Invertible Classes (2006) (0)
Some Results on U-shaped , Vacillatory and Team Learning (0)
Editors' Introduction (2006) (0)
Committee Machines (2010) (0)
Lamplighter groups and automata (2022) (0)
Intent Recognition (2010) (0)
Contrast Set Mining (2010) (0)
Continuous Attribute (2010) (0)
Co-reference Resolution (2010) (0)
Qualitative Attribute (2010) (0)
Commercial Email Filtering (2010) (0)
Accelerator RD status at PITZ (2017) (0)
String Compression in FA-Presentable Structures (2023) (0)
Lamplighter groups and automata (2022) (0)
How Powerful Are Integer-Valued Martingales? (2011) (0)
Improvement Curve (2010) (0)
Certainty Equivalence Principle (2010) (0)
Computational Discovery of Quantitative Laws (2010) (0)
Is More Specific Than (2010) (0)

This paper list is powered by the following services:

Other Resources About Frank Stephan

www.comp.nus.edu.sg

What Schools Are Affiliated With Frank Stephan?

Frank Stephan is affiliated with the following schools:

National University of Singapore

Frank Stephan's Academic­Influence.com Rankings

Why Is Frank Stephan Influential?

Frank Stephan's Published Works

Published Works

Other Resources About Frank Stephan

What Schools Are Affiliated With Frank Stephan?

Frank Stephan's AcademicInfluence.com Rankings