default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLars Kristiansen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Lars Kristiansen, Juvenal Murwanashyaka:
A Weak First-Order Theory of Sequences. CiE 2024: 390-404- 2023
- [i1]Amir M. Ben-Amram, Lars Kristiansen, Jakob Grue Simonsen:
On representations of real numbers and the computational complexity of converting between such representations. CoRR abs/2304.07227 (2023) - 2022
- [j20]Lars Kristiansen:
Reversible computing and implicit computational complexity. Sci. Comput. Program. 213: 102723 (2022) - 2021
- [j19]Lars Kristiansen
, Juvenal Murwanashyaka:
First-order concatenation theory with bounded quantifiers. Arch. Math. Log. 60(1-2): 77-104 (2021) - [j18]Ivan Georgiev, Lars Kristiansen, Frank Stephan:
Computable irrational numbers with representations of surprising complexity. Ann. Pure Appl. Log. 172(2): 102893 (2021) - [c18]Lars Kristiansen:
On Subrecursive Representation of Irrational Numbers: Contractors and Baire Sequences. CiE 2021: 308-317 - 2020
- [c17]Lars Kristiansen, Juvenal Murwanashyaka:
On Interpretability Between Some Weak Essentially Undecidable Theories. CiE 2020: 63-74 - [c16]Lars Kristiansen, Jakob Grue Simonsen:
On the Complexity of Conversion Between Classic Real Number Representations. CiE 2020: 75-86 - [c15]Lars Kristiansen:
Reversible Programming Languages Capturing Complexity Classes. RC 2020: 111-127
2010 – 2019
- 2019
- [j17]Lars Kristiansen:
On subrecursive representability of irrational numbers, part II. Comput. 8(1): 43-65 (2019) - 2018
- [j16]Stål Aanderaa, Lars Kristiansen, Hans Kristian Ruud:
Search for good examples of Hall's conjecture. Math. Comput. 87(314): 2903-2914 (2018) - [c14]Ivan Georgiev, Lars Kristiansen, Frank Stephan:
On General Sum Approximations of Irrational Numbers. CiE 2018: 194-203 - [c13]Lars Kristiansen, Juvenal Murwanashyaka:
Decidable and Undecidable Fragments of First-Order Concatenation Theory. CiE 2018: 244-253 - 2017
- [j15]Lars Kristiansen:
On subrecursive representability of irrational numbers. Comput. 6(3): 249-276 (2017) - 2012
- [j14]Lars Kristiansen, Jan-Christoph Schlage-Puchta, Andreas Weiermann:
Streamlined subrecursive degree theory. Ann. Pure Appl. Log. 163(6): 698-716 (2012) - [j13]Amir M. Ben-Amram, Lars Kristiansen:
On the Edge of Decidability in Complexity Analysis of Loop Programs. Int. J. Found. Comput. Sci. 23(7): 1451-1464 (2012) - [j12]Lars Kristiansen:
Higher Types, Finite Domains and Resource-bounded Turing Machines. J. Log. Comput. 22(2): 281-304 (2012) - [j11]Lars Kristiansen, Bedeho Mesghina Wolde Mender:
Non-determinism in Gödel's System T. Theory Comput. Syst. 51(1): 85-105 (2012) - [c12]Lars Kristiansen:
Degrees of Total Algorithms versus Degrees of Honest Functions. CiE 2012: 422-431 - 2011
- [j10]Lars Kristiansen:
Book Reviews. Stud Logica 97(2): 313-316 (2011)
2000 – 2009
- 2009
- [j9]Neil D. Jones, Lars Kristiansen:
A flow calculus of mwp-bounds for complexity analysis. ACM Trans. Comput. Log. 10(4): 28:1-28:41 (2009) - [c11]James Avery, Lars Kristiansen, Jean-Yves Moyen:
Static Complexity Analysis of Higher Order Programs. FOPARA 2009: 84-99 - 2008
- [j8]Lars Kristiansen:
Complexity-Theoretic Hierarchies Induced by Fragments of Gödel's T. Theory Comput. Syst. 43(3-4): 516-541 (2008) - [c10]Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen:
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. CiE 2008: 67-76 - [c9]Lars Kristiansen:
Recursion in Higher Types and Resource Bounded Turing Machines. CiE 2008: 336-348 - [c8]Mark Burgess, Lars Kristiansen:
On the complexity of determining autonomic policy constrained behaviour. NOMS 2008: 295-301 - [c7]Lars Kristiansen, Paul J. Voda:
The Structure of Detour Degrees. TAMC 2008: 148-159 - 2007
- [j7]Lars Kristiansen:
S. Barry Cooper, Computability Theory. Stud Logica 86(1): 145-146 (2007) - 2006
- [c6]Lars Kristiansen:
Complexity-Theoretic Hierarchies. CiE 2006: 279-288 - [c5]Lars Kristiansen, Paul J. Voda:
The Trade-Off Theorem and Fragments of Gödel's T. TAMC 2006: 654-674 - 2005
- [j6]Lars Kristiansen:
Neat function algebraic characterizations of logspace and linspace. Comput. Complex. 14(1): 72-88 (2005) - [j5]Lars Kristiansen, Paul J. Voda:
Programming Languages Capturing Complexity Classes. Nord. J. Comput. 12(2): 89-115 (2005) - [c4]Lars Kristiansen, Mathias Barra:
The Small Grzegorczyk Classes and the Typed lambda-Calculus. CiE 2005: 252-262 - [c3]Lars Kristiansen, Neil D. Jones:
The Flow of Data and the Complexity of Algorithms. CiE 2005: 263-274 - 2004
- [j4]Lars Kristiansen, Karl-Heinz Niggl:
On the computational complexity of imperative programming languages. Theor. Comput. Sci. 318(1-2): 139-161 (2004) - 2003
- [j3]Lars Kristiansen, Paul J. Voda:
Complexity classes and fragments of C. Inf. Process. Lett. 88(5): 213-218 (2003) - [c2]Lars Kristiansen, Paul J. Voda:
The Surprising Power of Restricted Programs and Gödel's Functionals. CSL 2003: 345-358 - [c1]Lars Kristiansen, Karl-Heinz Niggl:
The Garland Measure and Computational Complexity of Stack Programs. ICC@LICS 2003: 15-35 - 2001
- [j2]Lars Kristiansen:
Subrecursive degrees and fragments of Peano Arithmetic. Arch. Math. Log. 40(5): 365-397 (2001)
1990 – 1999
- 1998
- [j1]Lars Kristiansen:
A jump operator on honest subrecursive degrees. Arch. Math. Log. 37(2): 105-125 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-21 22:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
