Lars Kristiansen

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

2023

On representations of real numbers and the computational complexity of converting between such representations.

[BibT_eX]

[DOI]

Amir M. Ben-Amram

Jakob Grue Simonsen

CoRR, 2023

2022

Reversible computing and implicit computational complexity.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2022

2021

Computable irrational numbers with representations of surprising complexity.

[BibT_eX]

[DOI]

Ivan Georgiev

Frank Stephan

Ann. Pure Appl. Log., 2021

First-order concatenation theory with bounded quantifiers.

[BibT_eX]

[DOI]

Arch. Math. Log., 2021

On Subrecursive Representation of Irrational Numbers: Contractors and Baire Sequences.

[BibT_eX]

[DOI]

Proceedings of the Connecting with Computability, 2021

2020

Reversible Programming Languages Capturing Complexity Classes.

[BibT_eX]

[DOI]

Proceedings of the Reversible Computation - 12th International Conference, 2020

On the Complexity of Conversion Between Classic Real Number Representations.

[BibT_eX]

[DOI]

Jakob Grue Simonsen

Proceedings of the Beyond the Horizon of Computability, 2020

On Interpretability Between Some Weak Essentially Undecidable Theories.

[BibT_eX]

[DOI]

Proceedings of the Beyond the Horizon of Computability, 2020

2019

On subrecursive representability of irrational numbers, part II.

[BibT_eX]

[DOI]

Comput., 2019

2018

Search for good examples of Hall's conjecture.

[BibT_eX]

[DOI]

Stål Aanderaa

Hans Kristian Ruud

Math. Comput., 2018

Decidable and Undecidable Fragments of First-Order Concatenation Theory.

[BibT_eX]

[DOI]

Proceedings of the Sailing Routes in the World of Computation, 2018

On General Sum Approximations of Irrational Numbers.

[BibT_eX]

[DOI]

Ivan Georgiev

Frank Stephan

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

On subrecursive representability of irrational numbers.

[BibT_eX]

[DOI]

Comput., 2017

2012

Non-determinism in Gödel's System T.

[BibT_eX]

[DOI]

Bedeho Mesghina Wolde Mender

Theory Comput. Syst., 2012

Higher Types, Finite Domains and Resource-bounded Turing Machines.

[BibT_eX]

[DOI]

J. Log. Comput., 2012

On the Edge of Decidability in Complexity Analysis of Loop Programs.

[BibT_eX]

[DOI]

Amir M. Ben-Amram

Int. J. Found. Comput. Sci., 2012

Streamlined subrecursive degree theory.

[BibT_eX]

[DOI]

Jan-Christoph Schlage-Puchta

Andreas Weiermann

Ann. Pure Appl. Log., 2012

Degrees of Total Algorithms versus Degrees of Honest Functions.

[BibT_eX]

[DOI]

Proceedings of the How the World Computes, 2012

2011

Book Reviews.

[BibT_eX]

[DOI]

Stud Logica, 2011

2009

A flow calculus of mwp-bounds for complexity analysis.

[BibT_eX]

[DOI]

Neil D. Jones

ACM Trans. Comput. Log., 2009

Static Complexity Analysis of Higher Order Programs.

[BibT_eX]

[DOI]

James Avery

Jean-Yves Moyen

Proceedings of the Foundational and Practical Aspects of Resource Analysis, 2009

2008

Complexity-Theoretic Hierarchies Induced by Fragments of Gödel's T.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

The Structure of Detour Degrees.

[BibT_eX]

[DOI]

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

On the complexity of determining autonomic policy constrained behaviour.

[BibT_eX]

[DOI]

Mark Burgess

Proceedings of the IEEE/IFIP Network Operations and Management Symposium: Pervasive Management for Ubioquitous Networks and Services, 2008

Recursion in Higher Types and Resource Bounded Turing Machines.

[BibT_eX]

[DOI]

Proceedings of the Logic and Theory of Algorithms, 2008

Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time.

[BibT_eX]

[DOI]

Amir M. Ben-Amram

Neil D. Jones

Proceedings of the Logic and Theory of Algorithms, 2008

2007

S. Barry Cooper, Computability Theory.

[BibT_eX]

[DOI]

Stud Logica, 2007

2006

The Trade-Off Theorem and Fragments of Gödel's T.

[BibT_eX]

[DOI]

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

Complexity-Theoretic Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

Programming Languages Capturing Complexity Classes.

[BibT_eX]

Nord. J. Comput., 2005

Neat function algebraic characterizations of logspace and linspace.

[BibT_eX]

[DOI]

Comput. Complex., 2005

The Flow of Data and the Complexity of Algorithms.

[BibT_eX]

[DOI]

Neil D. Jones

Proceedings of the New Computational Paradigms, 2005

The Small Grzegorczyk Classes and the Typed lambda-Calculus.

[BibT_eX]

[DOI]

Mathias Barra

Proceedings of the New Computational Paradigms, 2005

2004

On the computational complexity of imperative programming languages.

[BibT_eX]

[DOI]

Karl-Heinz Niggl

Theor. Comput. Sci., 2004

2003

Complexity classes and fragments of C.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

The Garland Measure and Computational Complexity of Stack Programs.

[BibT_eX]

[DOI]

Karl-Heinz Niggl

Proceedings of the Fifth International Workshop on Implicit Computational Complexity, 2003

The Surprising Power of Restricted Programs and Gödel's Functionals.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2001

Subrecursive degrees and fragments of Peano Arithmetic.

[BibT_eX]

[DOI]

Arch. Math. Log., 2001

1998

A jump operator on honest subrecursive degrees.

[BibT_eX]

[DOI]