Exact Template Matching Using Boolean Satisfiability. - Nabila Abdessaied; Mathias Soeken; Robert Wille; Rolf Drechsler (ISMVL, 2013)

Reducing the Depth of Quantum Circuits Using Additional Circuit Lines. - Nabila Abdessaied; Robert Wille; Mathias Soeken; Rolf Drechsler (RC, 2013)

Automating the translation of assertions using natural language processing techniques. - Mathias Soeken; Christopher B. Harris; Nabila Abdessaied; Ian G. Harris; Rolf Drechsler (FDL, 2014)

Quantum Circuit Optimization by Hadamard Gate Reduction. - Nabila Abdessaied; Mathias Soeken; Rolf Drechsler (RC, 2014)

A framework for reversible circuit complexity. - Mathias Soeken; Nabila Abdessaied; Rolf Drechsler (CoRR, 2014)

Upper bounds for reversible circuits based on Young subgroups. - Nabila Abdessaied; Mathias Soeken; Michael Kirkedal Thomsen; Rolf Drechsler (Inf. Process. Lett., 2014)

Technology Mapping for Single Target Gate Based Circuits Using Boolean Functional Decomposition. - Nabila Abdessaied; Mathias Soeken; Rolf Drechsler (RC, 2015)

Reversible circuit rewriting with simulated annealing. - Nabila Abdessaied; Mathias Soeken; Gerhard W. Dueck; Rolf Drechsler (VLSI-SoC, 2015)

Reversible and quantum circuits: optimization and complexity analysis. - Nabila Abdessaied (2015)

Technology Mapping of Reversible Circuits to Clifford+T Quantum Circuits. - Nabila Abdessaied; Matthew Amy; Mathias Soeken; Rolf Drechsler (ISMVL, 2016)

Enumeration of Reversible Functions and Its Application to Circuit Complexity. - Mathias Soeken; Nabila Abdessaied; Giovanni De Micheli (RC, 2016)

Complexity of reversible circuits and their quantum implementations. - Nabila Abdessaied; Matthew Amy; Rolf Drechsler; Mathias Soeken (Theor. Comput. Sci., 2016)