default search action
Holger Bock Axelsen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j9]Holger Bock Axelsen, Martin Kutrib
, Andreas Malcher:
Reversible Shrinking Two-Pushdown Automata. J. Autom. Lang. Comb. 27(1-3): 47-77 (2022) - 2020
- [j8]Holger Bock Axelsen, Martin Kutrib
Boosting Reversible Pushdown and Queue Machines by Preprocessing. Int. J. Found. Comput. Sci. 31(8): 1021-1049 (2020)
2010 – 2019
- 2017
- [j7]Holger Bock Axelsen, Markus Holzer
The Degree of Irreversibility in Deterministic Finite Automata. Int. J. Found. Comput. Sci. 28(5): 503-522 (2017) - [j6]Robin Kaarsgaard
Join inverse categories and reversible recursion. J. Log. Algebraic Methods Program. 87: 33-50 (2017) - 2016
- [j5]Holger Bock Axelsen
On reversible Turing machines and their function universality. Acta Informatica 53(5): 509-543 (2016) - [j4]Tetsuo Yokoyama, Holger Bock Axelsen
Fundamentals of reversible flowchart languages. Theor. Comput. Sci. 611: 87-115 (2016) - [c26]Holger Bock Axelsen, Robin Kaarsgaard
Join Inverse Categories as Models of Reversible Recursion. FoSSaCS 2016: 73-90 - [c25]Holger Bock Axelsen, Markus Holzer
Reversible Shrinking Two-Pushdown Automata. LATA 2016: 579-591 - [c24]Holger Bock Axelsen, Martin Kutrib
Boosting Reversible Pushdown Machines by Preprocessing. RC 2016: 89-104 - [c23]Ulrik Pagh Schultz
Elements of a Reversible Object-Oriented Language - Work-in-Progress Report. RC 2016: 153-159 - [c22]Holger Bock Axelsen, Markus Holzer
The Degree of Irreversibility in Deterministic Finite Automata. CIAA 2016: 15-26 - [c21]Holger Bock Axelsen, Robert Glück
A Classical Propositional Logic for Reasoning About Reversible Logic Circuits. WoLLIC 2016: 52-67 - 2015
- [c20]Holger Bock Axelsen, Tetsuo Yokoyama:
Programming Techniques for Reversible Comparison Sorts. APLAS 2015: 407-426 - [c19]Michael Kirkedal Thomsen, Holger Bock Axelsen:
Interpretation and programming of the reversible functional language RFUN. IFL 2015: 8:1-8:13 - [c18]Holger Bock Axelsen, Sebastian Jakobi, Martin Kutrib
A Hierarchy of Fast Reversible Turing Machines. RC 2015: 29-44 - [c17]Ulrik Pagh Schultz
Towards a Domain-Specific Language for Reversible Assembly Sequences. RC 2015: 111-126 - 2014
- [j3]Alexis De Vos, Stéphane Burignat, Robert Glück
Designing Garbage-Free Reversible Implementations of the Integer Cosine Transform. ACM J. Emerg. Technol. Comput. Syst. 11(2): 11:1-11:15 (2014) - 2013
- [c16]Eva Rotenberg, James Cranch, Michael Kirkedal Thomsen, Holger Bock Axelsen:
Strength of the Reversible, Garbage-Free 2 k ±1 Multiplier. RC 2013: 46-57 - [c15]Holger Bock Axelsen, Robert Glück:
Reversible Representation and Manipulation of Constructor Terms in the Heap. RC 2013: 96-109 - 2012
- [j2]Tetsuo Yokoyama, Holger Bock Axelsen, Robert Glück:
Optimizing Reversible Simulation of Injective Functions. J. Multiple Valued Log. Soft Comput. 18(1): 5-24 (2012) - [c14]Tetsuo Yokoyama, Holger Bock Axelsen, Robert Glück
Minimizing Garbage Size by Generating Reversible Simulations. ICNC 2012: 379-387 - [c13]Michael Kirkedal Thomsen, Holger Bock Axelsen, Robert Glück
Cleaning Up: Garbage-Free Reversible Circuits by Design Languages. ISED 2012: 6-10 - [c12]Holger Bock Axelsen:
Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space. LATA 2012: 95-105 - [c11]Holger Bock Axelsen, Michael Kirkedal Thomsen:
Garbage-Free Reversible Integer Multiplication with Constants of the Form 2 k ±2 l ±1. RC 2012: 171-182 - 2011
- [c10]Holger Bock Axelsen:
Clean Translation of an Imperative Reversible Programming Language. CC 2011: 144-163 - [c9]Holger Bock Axelsen, Robert Glück
What Do Reversible Programs Compute? FoSSaCS 2011: 42-56 - [c8]Holger Bock Axelsen, Robert Glück:
A Simple and Efficient Universal Reversible Turing Machine. LATA 2011: 117-128 - [c7]Holger Bock Axelsen:
Time Complexity of Tape Reduction for Reversible Turing Machines. RC 2011: 1-13 - [c6]Tetsuo Yokoyama, Holger Bock Axelsen, Robert Glück
Towards a Reversible Functional Language. RC 2011: 14-29 - [c5]Michael Kirkedal Thomsen, Holger Bock Axelsen, Robert Glück
A Reversible Processor Architecture and Its Reversible Logic Design. RC 2011: 30-42
2000 – 2009
- 2009
- [j1]Michael Kirkedal Thomsen, Holger Bock Axelsen:
Parallelization of Reversible Ripple-Carry Adders. Parallel Process. Lett. 19(2): 205-222 (2009) - [i1]Holger Bock Axelsen, Robert Glück, Alexis De Vos, Michael Kirkedal Thomsen:
MicroPower: Towards Low-Power Microprocessors with Reversible Computing. ERCIM News 2009(79) (2009) - 2008
- [c4]Tetsuo Yokoyama, Holger Bock Axelsen, Robert Glück
Principles of a reversible programming language. Conf. Computing Frontiers 2008: 43-54 - [c3]Tetsuo Yokoyama, Holger Bock Axelsen, Robert Glück
Reversible Flowchart Languages and the Structured Reversible Program Theorem. ICALP (2) 2008: 258-270 - [c2]Michael Kirkedal Thomsen, Holger Bock Axelsen:
Parallel Optimization of a Reversible (Quantum) Ripple-Carry Adder. UC 2008: 228-241 - 2007
- [c1]Holger Bock Axelsen, Robert Glück, Tetsuo Yokoyama:
Reversible Machine Code and Its Abstract Processor Architecture. CSR 2007: 56-69
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-04-25 05:53 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: