Compiling Janus to RSSA

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	RC (13. : 2021 : Online) Reversible Computation
1. Verfasser:	Kutrib, We Martin (VerfasserIn)
Weitere Verfasser:	Meyer, Uwe (VerfasserIn), Deworetzki, Niklas (VerfasserIn), Schuster, Marc (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2021
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
Reversible Functional Array Programming	2021	Mogensen, Torben Egidius
Variational Quantum Eigensolver and Its Applications	2021	Matsuo, Atsushi
Causal-Consistent Debugging of Distributed Erlang Programs	2021	Fabbretti, Giovanni
A Tangled Web of 12 Lens Laws	2021	Nakano, Keisuke
Reversibility of Executable Interval Temporal Logic Specifications	2021	Cau, Antonio
Towards a Truly Concurrent Semantics for Reversible CCS	2021	Melgratti, Hernan
Towards a Unified Language Architecture for Reversible Object-Oriented Programming	2021	Hay-Schmidt, Lasse
Reversibility and Predictions	2021	Vassor, Martin
Finding Optimal Implementations of Non-native CNOT Gates Using SAT	2021	Niemann, Philipp
How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton?	2021	Morita, Kenichi
Explicit Identifiers and Contexts in Reversible Concurrent Calculus	2021	Aubert, Clement
Efficient Construction of Functional Representations for Quantum Algorithms	2021	Burgholzer, Lukas
Splitting Recursion Schemes into Reversible and Classical Interacting Threads	2021	Matos, Armando B.
OR-Toffoli and OR-Peres Reversiva Gates	2021	Moraga, Claudio
Compiling Janus to RSSA	2021	Kutrib, We Martin
Forward-Reverse Observational Equivalences in CCSK	2021	Lanese, Ivan
Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network	2021	Dobbs, Evan E.