Rodney G. Downey

Mariya Ivanova Soskova

J. Log. Comput., 2026

The geometry of computable Banach spaces.

[BibT_eX]

[DOI]

Inf. Comput., 2026

Computable Structure Theory - In cooperation with the Association Computability in Europe

[BibT_eX]

[DOI]

Springer, ISBN: 978-3-031-92432-3, 2026

2025

Punctually presented structures II: comparing presentations.

[BibT_eX]

[DOI]

Marina Dorzhieva

Ellen Hammatt

Arch. Math. Log., February, 2025

Limit Complexities, Minimal Descriptions, and n-Randomness.

[BibT_eX]

[DOI]

J. Symb. Log., 2025

2024

Computability and Complexity - Foundations and Tools for Pursuing Scientific Applications

[BibT_eX]

[DOI]

Undergraduate Topics in Computer Science, Springer, ISBN: 978-3-031-53743-1, 2024

ON THE C.E. DEGREES REALIZABLE IN $\Pi ^0_1$ CLASSES.

[BibT_eX]

[DOI]

Barbara F. Csima

J. Symb. Log., 2024

Algorithmically random series.

[BibT_eX]

[DOI]

Andrew Tanggara

Comput., 2024

Lowness properties for strong reducibilities and the computational power of maximal sets.

[BibT_eX]

[DOI]

Klaus Ambos-Spies

Martin Monath

Comput., 2024

Some Open Questions and Recent Results on Computable Banach Spaces.

[BibT_eX]

[DOI]

Long Qian

Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2023

Online, computable and punctual structure theory.

[BibT_eX]

[DOI]

Matthew Askes

Log. J. IGPL, November, 2023

Computably Compact Metric Spaces.

[BibT_eX]

[DOI]

Bull. Symb. Log., June, 2023

2022

A Minimal Set Low for Speed.

[BibT_eX]

[DOI]

Matthew Harrison-Trainor

J. Symb. Log., December, 2022

Relationships between Computability-Theoretic Properties of Problems.

[BibT_eX]

[DOI]

Matthew Harrison-Trainor

Ludovic Patey

Dan Turetsky

J. Symb. Log., 2022

2021

Foundations of Online Structure Theory II: The Operator Approach.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2021

On Supersets of non-low 22_2 Sets.

[BibT_eX]

[DOI]

Klaus Ambos-Spies

Martin Monath

J. Symb. Log., 2021

Maximality and collapse in the hierarchy of α-c.a. degrees.

[BibT_eX]

[DOI]

Katherine Arthur

Comput., 2021

2020

Punctual Categoricity and Universality.

[BibT_eX]

[DOI]

Daniel Turetsky

J. Symb. Log., 2020

Graphs are not universal for online computability.

[BibT_eX]

[DOI]

Matthew Harrison-Trainor

Iskander Sh. Kalimullin

Daniel Turetsky

J. Comput. Syst. Sci., 2020

Computable Analysis and Classification Problems.

[BibT_eX]

[DOI]

Proceedings of the Beyond the Horizon of Computability, 2020

2019

Martin-Löf Randomness Implies Multiple Recurrence in Effectively Closed Sets.

[BibT_eX]

[DOI]

Satyadev Nandakumar

Notre Dame J. Formal Log., 2019

A Weakly 2-Generic which Bounds a Minimal degree.

[BibT_eX]

[DOI]

Satyadev Nandakumar

J. Symb. Log., 2019

Splitting theorems and low degrees.

[BibT_eX]

[DOI]

Ellen Chih

Comput., 2019

Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018.

[BibT_eX]

[DOI]

Comput., 2019

Algorithmic randomness.

[BibT_eX]

[DOI]

Commun. ACM, 2019

Foundations of Online Structure Theory.

[BibT_eX]

[DOI]

Nikolay Bazhenov

Iskander Sh. Kalimullin

Bull. Symb. Log., 2019

Categorical linearly ordered structures.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2019

2018

Preface.

[BibT_eX]

[DOI]

Bjørn Kjos-Hanssen

Theory Comput. Syst., 2018

Avoiding Effective Packing Dimension 1 below array Noncomputable C.E. Degrees.

[BibT_eX]

[DOI]

Jonathan Stephenson

J. Symb. Log., 2018

Degrees containing members of thin Π10 classes are dense and co-dense.

[BibT_eX]

[DOI]

Yue Yang

J. Math. Log., 2018

A Hierarchy of computably Enumerable Degrees.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2018

Splitting into degrees with low computational strength.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2018

On Low for Speed Oracles.

[BibT_eX]

[DOI]

Laurent Bienvenu

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

2017

Lowness and logical depth.

[BibT_eX]

[DOI]

Michael McInerney

Theor. Comput. Sci., 2017

Kobayashi compressibility.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Logic and Computational Complexity (NII Shonan Meeting 2017-13).

[BibT_eX]

[DOI]

Yijia Chen

Jörg Flum

NII Shonan Meet. Rep., 2017

Notes on Computable Analysis.

[BibT_eX]

[DOI]

Michelle Porter

Adam R. Day

Theory Comput. Syst., 2017

A Friedberg enumeration of equivalence structures.

[BibT_eX]

[DOI]

J. Math. Log., 2017

Courcelle's theorem for triangulations.

[BibT_eX]

[DOI]

Benjamin A. Burton

J. Comb. Theory A, 2017

Computability Theory (Dagstuhl Seminar 17081).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2017

Turing and randomness.

[BibT_eX]

Proceedings of the Turing Guide., 2017

2016

Abelian p-groups and the Halting problem.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2016

2015

Asymptotic density and the Ershov hierarchy.

[BibT_eX]

[DOI]

Math. Log. Q., 2015

Solovay functions and their applications in algorithmic randomness.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

Integer valued betting strategies and Turing degrees.

[BibT_eX]

[DOI]

Michael McInerney

J. Comput. Syst. Sci., 2015

The members of thin and minimal classes, their ranks and Turing degrees.

[BibT_eX]

[DOI]

Yue Yang

Ann. Pure Appl. Log., 2015

On -categoricity of equivalence relations.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2015

Myhill-Nerode Methods for Hypergraphs.

[BibT_eX]

[DOI]

Algorithmica, 2015

2014

Algorithmic Randomness and Complexity (NII Shonan Meeting 2014-10).

[BibT_eX]

[DOI]

NII Shonan Meet. Rep., 2014

Characterizing Lowness for Demuth Randomness.

[BibT_eX]

[DOI]

J. Symb. Log., 2014

Exact Pairs for the Ideal of the k-Trivial Sequences in the Turing Degrees.

[BibT_eX]

[DOI]

J. Symb. Log., 2014

Iterated effective embeddings of abelian p-groups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2014

Random strings and tt-degrees of Turing complete C.E. sets.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2014

Computability theory, algorithmic randomness and Turing's anticipation.

[BibT_eX]

[DOI]

Proceedings of the Turing's Legacy: Developments from Turing's Ideas in Logic, 2014

2013

Fundamentals of Parameterized Complexity.

[BibT_eX]

[DOI]

Texts in Computer Science, Springer, ISBN: 978-1-4471-5559-1, 2013

Computability, Complexity and Randomness.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Asymptotic density and computably Enumerable Sets.

[BibT_eX]

[DOI]

Carl G. Jockusch Jr.

Paul E. Schupp

J. Math. Log., 2013

2012

Lowness for bounded randomness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Computability, Complexity and Randomness (Dagstuhl Seminar 12021).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2012

A Parameterized Complexity Tutorial.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2012

Randomness, Computation and Mathematics.

[BibT_eX]

[DOI]

Proceedings of the How the World Computes, 2012

A Basic Parameterized Complexity Primer.

[BibT_eX]

[DOI]

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

The Birth and Early Years of Parameterized Complexity.

[BibT_eX]

[DOI]

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

Bounded Randomness.

[BibT_eX]

[DOI]

Paul Brodhead

Proceedings of the Computation, Physics and Beyond, 2012

2011

Euclidean Functions of Computable Euclidean Domains.

[BibT_eX]

[DOI]

Asher M. Kach

Notre Dame J. Formal Log., 2011

Limits on jump inversion for strong reducibilities.

[BibT_eX]

[DOI]

Barbara F. Csima

J. Symb. Log., 2011

Jump inversions inside effectively closed sets and applications to randomness.

[BibT_eX]

[DOI]

J. Symb. Log., 2011

Confronting intractability via parameters.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

Comput. Sci. Rev., 2011

Binary subtrees with few labeled paths.

[BibT_eX]

[DOI]

Comb., 2011

2010

Effective Packing Dimension and Traceability.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2010

Decidability and Computability of Certain Torsion-Free Abelian Groups.

[BibT_eX]

[DOI]

Daniel Turetsky

Notre Dame J. Formal Log., 2010

On the Complexity of the Successivity Relation in Computable linear Orderings.

[BibT_eX]

[DOI]

J. Math. Log., 2010

Algorithmic Randomness and Complexity.

[BibT_eX]

[DOI]

Theory and Applications of Computability, Springer, ISBN: 978-0-387-95567-4, 2010

2009

On computable self-embeddings of computable linear orderings.

[BibT_eX]

[DOI]

Bart Kastermans

J. Symb. Log., 2009

On problems without polynomial kernels.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2009

Space complexity of Abelian groups.

[BibT_eX]

[DOI]

Arch. Math. Log., 2009

Kolmogorov Complexity and Solovay Functions.

[BibT_eX]

[DOI]

Laurent Bienvenu

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Lowness for Demuth Randomness.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Theory and Computational Practice, 2009

2008

Turing degrees of reals of positive effective packing dimension.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Parameterized approximation of dominating set problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors.

[BibT_eX]

[DOI]

Michael A. Langston

Comput. J., 2008

The Complexity of Orbits of Computably Enumerable Sets.

[BibT_eX]

[DOI]

Leo Harrington

Bull. Symb. Log., 2008

The upward closure of a perfect thin class.

[BibT_eX]

[DOI]

Joseph S. Miller

Ann. Pure Appl. Log., 2008

On Problems without Polynomial Kernels (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Algorithmic randomness.

[BibT_eX]

[DOI]

Jan Reimann

Scholarpedia, 2007

Foreword.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

Totally ω-computably Enumerable Degrees and Bounding Critical Triples.

[BibT_eX]

[DOI]

Rebecca Weber

J. Math. Log., 2007

Online promise problems with online width metrics.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2007

Undecidability of the structure of the Solovay degrees of c.e. reals.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2007

Bounded fixed-parameter tractability and reducibility.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2007

07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007, 2007

07441 Summary -- Algorithmic-Logical Theory of Infinite Structures.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007, 2007

2006

Editorial.

[BibT_eX]

[DOI]

Michael A. Langston

Rolf Niedermeier

Theor. Comput. Sci., 2006

Lowness and Π20 nullsets.

[BibT_eX]

[DOI]

J. Symb. Log., 2006

Every 1-generic computes a properly 1-generic.

[BibT_eX]

[DOI]

J. Symb. Log., 2006

Calibrating Randomness.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2006

On self-embeddings of computable linear orderings.

[BibT_eX]

[DOI]

Carl G. Jockusch Jr.

Joseph S. Miller

Ann. Pure Appl. Log., 2006

Foreword.

[BibT_eX]

[DOI]

Robert Goldblatt

Ann. Pure Appl. Log., 2006

Arithmetical Sacks Forcing.

[BibT_eX]

[DOI]

Liang Yu

Arch. Math. Log., 2006

Totally < ωω Computably Enumerable and m-topped Degrees.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2006

Parameterized Approximation Problems.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

2005

Relativizing Chaitin's Halting Probability.

[BibT_eX]

[DOI]

J. Math. Log., 2005

Completing pseudojump operators.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2005

05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability.

[BibT_eX]

[DOI]

Martin Grohe

Gerhard J. Woeginger

Proceedings of the Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005, 2005

05301 Summary - Exact Algorithms and Fixed-Parameter Tractability.

[BibT_eX]

[DOI]

Martin Grohe

Gerhard J. Woeginger

Proceedings of the Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005, 2005

Schnorr Dimension.

[BibT_eX]

[DOI]

Wolfgang Merkle

Jan Reimann

Proceedings of the New Computational Paradigms, 2005

Bounded Persistence Pathwidth.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing 2005, 2005

2004

On Kurtz randomness.

[BibT_eX]

[DOI]

Evan J. Griffiths

Stephanie Reid

Theor. Comput. Sci., 2004

There Are No Maximal Low D.C.E. Degrees.

[BibT_eX]

[DOI]

Liang Yu

Notre Dame J. Formal Log., 2004

Degrees of d. c. e. reals.

[BibT_eX]

[DOI]

Xizhong Zheng

Math. Log. Q., 2004

On Schnorr and computable randomness, martingales, and machines.

[BibT_eX]

[DOI]

Evan J. Griffiths

Math. Log. Q., 2004

Schnorr randomness.

[BibT_eX]

[DOI]

Evan J. Griffiths

J. Symb. Log., 2004

The Kolmogorov complexity of random reals.

[BibT_eX]

[DOI]

Liang Yu

Decheng Ding

Ann. Pure Appl. Log., 2004

Complementing cappable degrees in the difference hierarchy.

[BibT_eX]

[DOI]

Angsheng Li

Ann. Pure Appl. Log., 2004

Some Recent Progress in Algorithmic Randomness.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Online Problems, Pathwidth, and Persistence.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Some New Directions and Questions in Parameterized Complexity.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

2003

Decomposition and infima in the computably enumerable degrees.

[BibT_eX]

[DOI]

J. Symb. Log., 2003

Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems.

[BibT_eX]

[DOI]

Vladimir Estivill-Castro

Elena Prieto-Rodriguez

Frances A. Rosamond

Proceedings of the Computing: the Australasian Theory Symposiumm, 2003

2002

Presentations of computably enumerable reals.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Roman Murawski, Recursive Functions and Metamathematics.

[BibT_eX]

[DOI]

Stud Logica, 2002

Computably Enumerable Reals and Uniformly Presentable Ideals.

[BibT_eX]

[DOI]

Sebastiaan Terwijn

Math. Log. Q., 2002

Contiguity and Distributivity in The Enumerable Turing Degrees - Corrigendum.

[BibT_eX]

[DOI]

J. Symb. Log., 2002

Maximal Contiguous Degrees.

[BibT_eX]

[DOI]

Stephen Walk

J. Symb. Log., 2002

Trivial Reals.

[BibT_eX]

[DOI]

Proceedings of the Computability and Complexity in Analysis, 2002

2001

On Genericity and Ershov's Hierarchy.

[BibT_eX]

[DOI]

Amy Gale

Math. Log. Q., 2001

A delta02 Set with No Infinite Low Subset in Either It or Its Complement.

[BibT_eX]

[DOI]

J. Symb. Log., 2001

Some orbits for E.

[BibT_eX]

Eberhard Herrmann

Ann. Pure Appl. Log., 2001

Index sets and parametric reductions.

[BibT_eX]

[DOI]

Arch. Math. Log., 2001

Randomness, Computability, and Density.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

Randomness and Reducibility.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000

On computing graph minor obstruction sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Undecidability Results for Low Complexity Time Classes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2000

The complexity of irredundant sets parameterized by size.

[BibT_eX]

[DOI]

Venkatesh Raman

Discret. Appl. Math., 2000

1999

Parameterized Complexity

[BibT_eX]

[DOI]

Monographs in Computer Science, Springer, ISBN: 038794883X, 1999

The Parametrized Complexity of Some Fundamental Problems in Coding Theory.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

A Delta02 Set With Barely Sigma02 Degree.

[BibT_eX]

[DOI]

J. Symb. Log., 1999

Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank 1.

[BibT_eX]

[DOI]

Carl G. Jockusch Jr.

J. Symb. Log., 1999

Computational Tractability: The View From Mars.

[BibT_eX]

Ulrike Stege

Bull. EATCS, 1999

Addendum to "Computably Enumerable Sets and Quasi-Reducibility".

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1999

1998

Parameterized Circuit Complexity and the W Hierarchy.

[BibT_eX]

[DOI]

Kenneth W. Regan

Theor. Comput. Sci., 1998

Threshold Dominating Sets and an Improved Characterization of W[2].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Splitting Theorems and the Jump Operator.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1998

Computably Enumerable Sets and Quasi-Reducibility.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1998

Difference Sets and Computability Theory.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1998

Uniformly Hard Languages.

[BibT_eX]

[DOI]

Lance Fortnow

Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1998

1997

Infima in the Recursively Enumerable Weak Truth Table Degrees.

[BibT_eX]

[DOI]

Rich Blaylock

Notre Dame J. Formal Log., 1997

On the Universal Splitting Property.

[BibT_eX]

[DOI]

Math. Log. Q., 1997

A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals.

[BibT_eX]

[DOI]

Bruno Courcelle

J. Univers. Comput. Sci., 1997

Contiguity and Distributivity in the Enumerable Turing Degrees.

[BibT_eX]

[DOI]

J. Symb. Log., 1997

Advice Classes of Parameterized Tractability.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1997

On the parameterized complexity of short computation and factorization.

[BibT_eX]

[DOI]

Arch. Math. Log., 1997

Parameterized complexity: A framework for systematically confronting computational intractability.

[BibT_eX]

[DOI]

Ulrike Stege

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

Undecidability Results for Low Complexity Degree Structures.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996

There is No Fat Orbit.

[BibT_eX]

[DOI]

Leo Harrington

Ann. Pure Appl. Log., 1996

The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1].

[BibT_eX]

Udayan Taylor

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

Descriptive complexity and the W hierarchy.

[BibT_eX]

[DOI]

Kenneth W. Regan

Proceedings of the Proof Complexity and Feasible Arithmetics, 1996

1995

Fixed-Parameter Tractability and Completeness II: On Completeness for W[1].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Fixed-Parameter Tractability and Completeness I: Basic Results.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

Degree Theoretic Definitions of the low2 Recursively Enumerable Sets.

[BibT_eX]

[DOI]

J. Symb. Log., 1995

On the Structure of Parameterized Problems in NP.

[BibT_eX]

[DOI]

Inf. Comput., 1995

Parameterized complexity analysis in computational biology.

[BibT_eX]

[DOI]

Comput. Appl. Biosci., 1995

Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues.

[BibT_eX]

[DOI]

Karl R. Abrahamson

Ann. Pure Appl. Log., 1995

Intervals Without Critical Triples.

[BibT_eX]

[DOI]

Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, 1995

1994

Embedding Lattices into the wtt-Degrees below 0'.

[BibT_eX]

[DOI]

Christine Ann Haught

J. Symb. Log., 1994

A Rank one Cohesive Set.

[BibT_eX]

[DOI]

Yang Yue

Ann. Pure Appl. Log., 1994

The Structure of the Honest Polynomial m-Degrees.

[BibT_eX]

[DOI]

William I. Gasarch

Michael F. Moses

Ann. Pure Appl. Log., 1994

There is no plus-capping degree.

[BibT_eX]

[DOI]

Arch. Math. Log., 1994

On the Structure of Parameterized Problems in NP (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

The Parameterized Complexity of Some Problems in Logic and Linguistics.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

The Parameterized Complexity of Sequence Alignment and Consensus.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

1993

Highness and Bounding Minimal Pairs.

[BibT_eX]

[DOI]

Math. Log. Q., 1993

On the Cantor-Bendixon Rank of Recursively Enumerable Sets.

[BibT_eX]

[DOI]

J. Symb. Log., 1993

Friedberg Splittings of Recursively Enumerable Sets.

[BibT_eX]

[DOI]

Michael Stob

Ann. Pure Appl. Log., 1993

Splitting Theorems in Recursion Theory.

[BibT_eX]

[DOI]

Michael Stob

Ann. Pure Appl. Logic, 1993

Every Recursive Boolean Algebra is Isomorphic to One with Incomplete Atoms.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1993

Lattice Nonembeddings and Intervals of the Recursively Enumerable Degrees.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1993

Countable Thin Pi01 Classes.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1993

Fixed-Parameter Intractability II (Extended Abstract).

[BibT_eX]

[DOI]

Karl R. Abrahamson

Proceedings of the STACS 93, 1993

Parameterized Learning Complexity.

[BibT_eX]

[DOI]

Patricia A. Evans

Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1992

Nondiamond Theorems for Polynomial Time Reducibility.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1992

On co-Simple Isols and Their Intersection Types.

[BibT_eX]

[DOI]

Theodore A. Slaman

Ann. Pure Appl. Log., 1992

Tabular Degrees in alpha-Recursion Theory.

[BibT_eX]

[DOI]

Colin Bailey

Ann. Pure Appl. Log., 1992

Fixed Parameter Tractability and Completeness III: Some Structural Aspects of the W Hierarchy.

[BibT_eX]

Proceedings of the Complexity Theory: Current Research, 1992

Degrees of Inferability.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

Fixed-Parameter Intractability.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

1991

On Computational Complexity and Honest Polynomial Degrees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

On Π10 Classes and their Ranked Points.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1991

Jumps of Hemimaximal Sets.

[BibT_eX]

[DOI]

Mike Stob

Math. Log. Q., 1991

1990

Lattice Nonembeddings and Initial Segments of the Recursively Enumerable Degrees.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1990

Corrigendum: Correction to "Undecidability of L(Finfty) and Other Lattices of r.e. Substructures".

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1990

Minimal Degrees Recursive in 1-Generic Degrees.

[BibT_eX]

[DOI]

Chi Tat Chong

Ann. Pure Appl. Log., 1990

1989

On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders.

[BibT_eX]

[DOI]

Michael F. Moses

Math. Log. Q., 1989

A Contiguous Nonbranching Degree.

[BibT_eX]

[DOI]

Math. Log. Q., 1989

On Hyper-Torre Isols.

[BibT_eX]

[DOI]

J. Symb. Log., 1989

Recursively Enumerable m- and tt-Degrees. I: The Quantity of m- Degrees.

[BibT_eX]

[DOI]

J. Symb. Log., 1989

Completely Mitotic r.e. Degrees.

[BibT_eX]

[DOI]

Theodore A. Slaman

Ann. Pure Appl. Log., 1989

Classification of Degree Classes Associated with r.e. Subspaces.

[BibT_eX]

[DOI]

Jeffrey B. Remmel

Ann. Pure Appl. Log., 1989

Intervals and Sublattices of the r.e. Weak Truth Table Degrees, Part II: Nonbounding.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1989

Intervals and Sublattices of the r.e. Weak Truth Table Degrees, Part I: Density.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1989

On Honest Polynomial Reductions, Relativizations, and P=NP.

[BibT_eX]

[DOI]

Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1988

Recursively enumerable m- and tt-degrees II: The distribution of singular degrees.

[BibT_eX]

[DOI]

Arch. Math. Log., 1988

1987

Automorphisms and Recursive Structures.

[BibT_eX]

[DOI]

Jeffrey B. Remmel

Math. Log. Q., 1987

Maximal theories.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1987

Localization of a theorem of Ambos-Spies and the strong anti-splitting property.

[BibT_eX]

[DOI]

Arch. Math. Log., 1987

1986

Bases of Supermaximal Subspaces and Steinitz Systems II.

[BibT_eX]

[DOI]

Math. Log. Q., 1986

Splitting Properties of R. E. Sets and Degrees.

[BibT_eX]

[DOI]

Lawrence V. Welch

J. Symb. Log., 1986

Structural interactions of the recursively enumerable T- and W-degrees.

[BibT_eX]

[DOI]

Michael Stob

Ann. Pure Appl. Log., 1986

Recursion theory and ordered groups.

[BibT_eX]

[DOI]

Stuart A. Kurtz

Ann. Pure Appl. Log., 1986

Sound, totally sound, and unsound recursive equivalence types.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1986

Undecidability of L(F∞) and other lattices of r.e. substructures.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1986

1985

Effective Extensions of Linear Forms on a Recursive Vector Space Over a Recursive Field.

[BibT_eX]

[DOI]

Iraj Kalantari

Math. Log. Q., 1985

Automorphisms of Supermaximal Subspaces.

[BibT_eX]

[DOI]

Geoffrey R. Hird

J. Symb. Log., 1985

1984

A Note on Decompositions of Recursively Enumerable Subspaces.

[BibT_eX]

[DOI]

Math. Log. Q., 1984

Some Remarks on a Theorem of Iraj Kalantari Concerning convexity and Recursion Theory.

[BibT_eX]

[DOI]

Math. Log. Q., 1984

The Universal Complementation Property.

[BibT_eX]

[DOI]

Jeffrey B. Remmel

J. Symb. Log., 1984

Bases of Supermaximal Subspaces and Steinitz Systems. I.

[BibT_eX]

[DOI]

J. Symb. Log., 1984

Co-Immune Subspaces and Complementation in V.

[BibT_eX]

[DOI]

J. Symb. Log., 1984

Decidable Subspaces and Recursively Enumerable Subspaces.

[BibT_eX]

[DOI]

Christopher J. Ash

J. Symb. Log., 1984

1983

On a Question of a. Retzlaff.

[BibT_eX]

[DOI]