Home | Contact

MicroPower

Bibliography

Here you can find some references related to the project.

Articles

2014

[1]	Abdessaied, N.; Soeken, M.; Thomsen, M. K. and Drechsler, R. Upper bounds for reversible circuits based on Young subgroups. In Information Processing Letters, 114 (6): 282-286, 2014.
[2]	De Vos, A.; Burignat, S.; Glück, R.; Mogensen, T. A.; Axelsen, H. B.; Thomsen, M. K.; Rotenberg, E. and Yokoyama, T. Designing Garbage-free Reversible Implementations of the Integer Cosine Transform. In ACM Journal on Emerging Technologies in Computing Systems; Special Issue on Reversible Computation, 2014.
[3]	Mogensen, T. A. Garbage-Free Reversible Constant Multipliers for Arbitrary Integers. In ACM Journal on Emerging Technologies in Computing Systems; Special Issue on Reversible Computation, 2014.

2013

[4]	De Vos, A. and De Baerdemacker, S. The NEGATOR as a basic building block for quantum circuits. In Open Systems & Information Dynamics, 20 (1): 135004:1-135004:26, 2013.

2012

[5]	Burignat, S. and De Vos, A. A Review on Performances of Reversible Ripple-carry Adders. In International Journal of Electronics and Telecommunications, 58 (3): 205-212, 2012.
[6]	De Vos, A.; Burignat, S. and Thomsen, M. K. Reversible Implementation of a Discrete Integer Linear Transform. In Journal of Multiple-Valued Logic and Soft Computing, Special Issue: Reversible Computation, 18 (1): 25-35, 2012.
[7]	De Vos, A.; Boes, M. and De Baerdemacker, S. Reversible computation, quantum computation, and computer architectures in between. In Journal of Multiple-Valued Logic and Soft Computing, 18 (1): 67-81, 2012.
[8]	De Vos, A.; Van Laer, R. and Vandenbrande, S. The group of dyadic unitary matrices. In Open Systems & Information Dynamics, 19 (1): 1250003:1-1250003:28, 2012.
[9]	Pécseli, T. Reverse Universal Resolving Algorithm and inverse driving. In Journal of Logic and Algebraic Programming, 81 (3): 314-330, 2012.
[10]	Yokoyama, T.; Axelsen, H. B. and Glück, R. Optimizing Reversible Simulation of Injective Functions. In Multiple-Valued Logic and Soft Computing, 18 (1): 5-24, 2012.

2011

[11]	De Vos, A. and De Baerdemacker, S. Symmetry groups for the decomposition of reversible computers, quantum computers, and computers in between. In Symmetry, 3 (2): 305-324, 2011.

2010

[12]	De Vos, A. and De Baerdemacker, S. Decomposition of a linear reversible computer: digital versus analog. In International Journal of Unconventional Computing, 6 (3-4): 239-263, 2010.
[13]	Thomsen, M. K.; Glück, R. and Axelsen, H. B. Reversible arithmetic logic unit for quantum arithmetic. In Journal of Physics A: Mathematical and Theoretical, 43 (38): 382002, 2010.
[14]	Yokoyama, T. Reversible Computation and Reversible Programming Languages. In Electronic Notes in Theoretical Computer Science, 253 (6): 71-81, 2010.

2009

[15]	De Vos, A.; De Beule, J. and Storme, L. Computing with the square root of NOT. In Serdica Journal of Computing, 3 (4): 359-370, 2009.
[16]	De Vos, A. and Van Rentergem, Y. Multiple-valued reversible logic circuits. In Journal of Multiple-Valued Logic and Soft Computing, Special Issue: Reversible Computation, 15 (5-6): 489-505, 2009.
[17]	Thomsen, M. K. and Axelsen, H. B. Parallelization of Reversible Ripple-carry Adders. In Parallel Processing Letters, 19 (1): 205-222, 2009.
[18]	Axelsen, H. B.; Glück, R.; De Vos, A. and Thomsen, M. K. MicroPower: Towards Low-Power Microprocessors with Reversible Computing. In ERCIM News, 79 (1): 20-21, 2009.

Books

2010

[19]	De Vos, A. Reversible Computing: Fundamentals, Quantum Computing and Applications. Wiley-VCH, Weinheim, 2010.

Collections

2010

[20]	Mogensen, T. A. Nogle programmeringssprog er mere lige end andre. In Den digitale revolution--fortaellinger fra datalogiens verden, pages 50-63, DIKU, Dept. of Computer Science, University of Copenhagen, 2010.

In Proceedings

2014

[21]	De Vos, A. and De Baerdemacker, S. The decomposition of U(n) into XU(n) and ZU(n). In Multiple-Valued Logic, 2014. Proceedings. 44th International Symposium on, 2014.

2013

[22]	Axelsen, H. B. and Glück, R. Reversible Representation and Manipulation of Constructor Terms in the Heap. In Reversible Computation, pages 96-109, LNCS 7948, 2013.
[23]	Axelsen, H. B. and Thomsen, M. K. Garbage-Free Reversible Integer Multiplication with Constants of the Form $2^k+2^l+1$. In Reversible Computation, pages 171-182, LNCS 7581, 2013.
[24]	Burignat, S.; Vermeirsch, K.; De Vos, A. and Thomsen, M. K. Garbageless Reversible Implementation of Integer Linear Transformations. In Reversible Computation, pages 160-170, LNCS 7581, 2013.
[25]	Mogensen, T. A. Garbage-Free Reversible Constant Multipliers for Arbitrary Integers. In Reversible Computation, pages 70-83, LNCS 7948, 2013.
[26]	Rotenberg, E.; Cranch, J.; Thomsen, M. K. and Axelsen, H. B. Strength of the Reversible, Garbage-Free $2k pm 1$ Multiplier. In Reversible Computation, pages 46-57, LNCS 7948, 2013.
[27]	Soeken, M. and Thomsen, M. K. White Dots do Matter: Rewriting Reversible Logic Circuits. In Reversible Computation, pages 196-208, LNCS 7948, 2013.

2012

[28]	Axelsen, H. B. Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space. In Language and Automata Theory and Applications. Proceedings, pages 95-105, Springer-Verlag, LNCS 7183, 2012.
[29]	Axelsen, H. B. Time Complexity of Tape Reduction for Reversible Turing Machines. In Reversible Computation, RC2011. Revised Selected Papers, pages 1-13, Springer-Verlag, LNCS 7165, 2012.
[30]	Burignat, S.; Olczac, M.; Klimczak, M. and De Vos, A. Towards the Limits of Cascaded Reversible (Quantum-Inspired) Circuits. In Reversible Computation, RC2011. Revised Selected Papers, pages 102-111, Springer-Verlag, LNCS 7165, 2012.
[31]	Burignat, S.; Thomsen, M. K.; Klimczak, M.; Olczak, M. and De Vos, A. Interfacing Reversible Pass-Transistor CMOS Chips with Conventional Restoring CMOS Circuits. In Reversible Computation, RC 2011. Revised Papers, pages 112-122, Springer-Verlag, LNCS 7165, 2012.
[32]	De Vos, A. and De Baerdemacker, S. The roots of the NOT gate. In Proceedings of the International Symposium on Multiple-valued Logic, pages 167-172, IEEE Computer Society, 2012.
[33]	De Vos, A. and De Baerdemacker, S. Logics between classical reversible logic and quantum logic. In Quantum Physics and Logic, 9th International Workshop, Proceedings, pages 123-128, Universit'e Libre de Bruxelles (ULB), 2012.
[34]	Mogensen, T. A. Partial Evaluation of Janus Part 2: Assertions and Procedures. In Perspectives of Systems Informatics, pages 289-301, Springer-Verlag, LNCS 7162, 2012.
[35]	Thomsen, M. K. A Functional Language for Describing Reversible Logic. In Specification & Design Languages, FDL 2012, pages 135-142, IEEE, 2012.
[36]	Thomsen, M. K. Describing and Optimizing Reversible Logic using a Functional Language. In Implementation and Application of Functional Languages, IFL '12, pages 148-163, Springer-Verlag, LNCS 7257, 2012.
[37]	Thomsen, M. K.; Axelsen, H. B. and Glück, R. A Reversible Processor Architecture and its Reversible Logic Design. In Reversible Computation, RC '11, pages 30-42, Springer-Verlag, LNCS 7165, 2012.
[38]	Thomsen, M. K.; Axelsen, H. B. and Glück, R. Cleaning Up: Garbage-Free Reversible Circuits by Design Languages. In International Symposium on Electronic System Design (ISED), 2012.
[39]	Vandenbrande, S.; Van Laer, R. and De Vos, A. The computational power of the square root of NOT. In 10th International Workshop on Boolean Problems, Proceedings, pages 257-262, Bergakademie Freiberg, 2012.
[40]	Yokoyama, T.; Axelsen, H. B. and Glück, R. Minimizing garbage size by generating reversible simulations. In Networking and Computing (ICNC), 2012 Third International Conference on, pages 379-387, 2012.
[41]	Yokoyama, T.; Axelsen, H. B. and Glück, R. Towards a reversible functional language. In Reversible Computation, RC '11, pages 14-29, Springer-Verlag, LNCS 7165, 2012.

2011

[42]	Axelsen, H. B. Clean Translation of an Imperative Reversible Programming Language. In Compiler Construction. CC '11, pages 142-161, Springer-Verlag, LNCS 6601, 2011.
[43]	Axelsen, H. B. and Glück, R. What Do Reversible Programs Compute?. In Foundations of Software Science and Computational Structures, pages 42-56, Springer-Verlag, LNCS 6604, 2011.
[44]	Axelsen, H. B. and Glück, R. A Simple and Efficient Universal Reversible Turing Machine. In Language and Automata Theory and Applications. Proceedings, pages 117-128, Springer-Verlag, LNCS 6638, 2011.
[45]	Burignat, S. and De Vos, A. Test of a majority-based reversible (quantum) 4 bits ripple-carry adder in adiabatic calculation. In Mixed Design of Integrated Circuits and Systems, 18th International Conference, Proceedings, pages 368-373, 2011.
[46]	De Vos, A. and Boes, M. Creating subgroups of U$(2^n)$ for quantum-minus computers. In Journal of Physics Conference Series, pages 012021:1-012021:6, IOP Publishing, 2011.
[47]	Mogensen, T. A. Partial evaluation of the reversible language Janus. In Proceedings of the 20th ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, pages 23-32, ACM, PEPM '11 , 2011.

2010

[48]	Boes, M.; De Vos, A. and De Beule, J. Almost-classical quantum computers. In Boolean Problems, 9th International Workshop, Proceedings, pages 51-56, Freiberg University of Mining and Technology, 2010.
[49]	De Vos, A. Reversible Computer Hardware. In Electronic Notes in Theoretical Computer Science, pages 17-22, 2010.
[50]	Clementsen, P. J.; Axelsen, H. B. and Glück, R. Reversible Coroutines (extended abstract). In Nordic Workshop on Programming Theory, 2010.

2009

[51]	De Vos, A. Can reversible electronics avoid thermal problems?. In International Conference on Microtechnology and Thermal Problems in Electronics, 8th, Proceedings, pages 1-7, Technical University Lodz, 2009.
[52]	Thomsen, M. K.; Glück, R. and Axelsen, H. B. Towards Designing a Reversible Processor Architecture. In Preliminary Proceedings of the Workshop on Reversible Computation, pages 46-50, 2009.

200

[53]	Yokoyama, T. and Yokoyama, T. Functoriality in Reversible Circuits. In 1st Workshop on Reversible Computation. Preliminary Proceedings, pages 68-72, 200.

Master's Theses

2011

[54]	Klimczak, M. Design, test and interfacing of reversible digital circuits. Master's Thesis, ELIS, Vakgroep Elektronica en Informatiesystemen, Universiteit Gent, Sint Pietersnieuwstraat 41, B-9000 Gent, 2011.
[55]	Olczak, M. Optimization and measurements of reversible logical chips and signals. Master's Thesis, ELIS, Vakgroep Elektronica en Informatiesystemen, Universiteit Gent, Sint Pietersnieuwstraat 41, B-9000 Gent, 2011.

2010

[56]	Clementsen, P. J. Reversible Stack Machine: Design and Translation. Master's Thesis, DIKU, Dept. of Computer Science, University of Copenhagen, Universitetsparken 5, DK-2100 Copenhagen, 2010.
[57]	Fjord-Larsen, M. A Top-Down Simulation of Bottom-Up Parsing. Master's Thesis, DIKU, Dept. of Computer Science, University of Copenhagen, Universitetsparken 5, DK-2100 Copenhagen, 2010.
[58]	Gade, J. BidiX: A Language for Bidirectional Transformation. Master's Thesis, DIKU, Dept. of Computer Science, University of Copenhagen, Universitetsparken 5, DK-2100 Copenhagen, 2010.
[59]	Moriyama, K. Reversible Cellular Automata from a Programming Language Perspective. Master's Thesis, DIKU, Dept. of Computer Science, University of Copenhagen, Universitetsparken 5, DK-2100 Copenhagen, 2010.
[60]	Rorbech, C. Optimizing Translation of Reversible Languages. Master's Thesis, DIKU, Dept. of Computer Science, University of Copenhagen, Universitetsparken 5, DK-2100 Copenhagen, 2010.

2009

[61]	Oh, C. Reversible Intermediate Language for the Translation of Reversible Programming Languages. Master's Thesis, DIKU, Dept. of Computer Science, Univ. of Copenhagen, 2009.
[62]	Tonnesen, M. Semi Inversion of Conditional Constructor Term Rewriting Systems. Master's Thesis, DIKU, Dept. of Computer Science, Univ. of Copenhagen, 2009.

PhD Theses

2012

[63]	Thomsen, M. K. Design of Reversible Computing Systems - Logic, Languages, Circuits. Ph.D. Thesis, DIKU, Department of Computer Science, University of Copenhagen, Universitetsparken 5, DK-2100 Copenhagen, 2012.

2011

[64]	Axelsen, H. B. Reversible computing and Programming. Ph.D. Thesis, DIKU, Department of Computer Science, University of Copenhagen, Universitetsparken 5, DK-2100 Copenhagen, 2011.

Conference Proceedings

2013

[65]	Glück, R. and Yokoyama, T., ed. Reversible Computation 2012, LNCS 7581. Springer-Verlag, 2013.

2012

[66]	De Vos, A. and Wille, R., ed. Reversible Computation 2011, LNCS 7165. Springer-Verlag, 2012.

Technical Reports

2012

[67]	Thomsen, M. K. Design of Reversible Logic Circuits using Standard Cells -- Standard Cells and Functional Programming. Technical Report 2012-03, DIKU, Department of Computing Science, University of Copenhagen, 2012.

2011

[68]	Mogensen, T. AE. Vejen mod lavere stromforbrug. Technical Report, Version2, Ingenioren, urlhttp://www. version2.dk-/blog-/vejen-mod-lavere-stroemforbrug-19004, 2011.