On Network Algebras and Recursive Equations. - Günter Hotz; Reiner Kolla; Paul Molitor (Graph-Grammars and Their Application to Computer Science, 1986)

Ein logisch-topologischer Kalkül zur Konstruktion integrierter Schaltkreise, Teil I. - Günter Hotz; Bernd Becker 001; Reiner Kolla; Paul Molitor (Inform. Forsch. Entwickl., 1986)

Ein logisch-topologischer Kalkül zur Konstruktion integrierter Schaltkreise, Teil II. - Günter Hotz; Bernd Becker 001; Reiner Kolla; Paul Molitor (Inform. Forsch. Entwickl., 1986)

Über die Bikategorie der logisch-topologischen Netze und ihre Semantik. - Paul Molitor (1986)

Hierarchical Design Based on a Calculus of Nets. - Bernd Becker 001; Günter Hotz; Reiner Kolla; Paul Molitor; Hans-Georg Osthof (DAC, 1987)

On the Contact-Minimization-Problem. - Paul Molitor (STACS, 1987)

Einführung in den VLSI-Entwurf. - Reiner Kolla; Paul Molitor; Hans-Georg Osthof (Teubner, 1989)

A note on hierarchical layer-assignment. - Reiner Kolla; Paul Molitor (Integr., 1989)

A graphical system for hierarchical specifications and checkups of VLSI circuits. - Bernd Becker 001; Thomas Burch; Günter Hotz; D. Kiel; Reiner Kolla; Paul Molitor; Hans-Georg Osthof; Gisela Pitsch; Uwe Sparmann (EURO-DAC, 1990)

Constrained via minimization for systolic arrays. - Paul Molitor (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990)

A Survey on Wiring. - Paul Molitor (J. Inf. Process. Cybern., 1991)

Minimal stretching of a layout to ensure 2-layer wirability. - Michael Kaufmann 001; Paul Molitor (Integr., 1991)

A Hierarchy Preserving Hierarchical Bottom-Up 2-layer Wiring Algorithm with Respect to Via Minimization. - Paul Molitor (Informatik, 1992)

A performance driven generator for efficient testable conditional-sum-adders. - Bernd Becker 001; Paul Molitor (EURO-DAC, 1992)

Performance Driven k-Layer Wiring. - Michael Kaufmann 001; Paul Molitor; Wolfgang Vogelgesang (STACS, 1992)

On the implementation of an efficient performance driven generator for conditional-sum-adders. - Bernd Becker 001; Rolf Drechsler; Paul Molitor (EURO-DAC, 1993)

A hierarchy preserving hierarchical bottom-up 2-layer wiring algorithm with respect to via minimization. - Paul Molitor (Integr., 1993)

Communication based multilevel synthesis for multi-output Boolean functions. - Paul Molitor; Christoph Scholl 001 (Great Lakes Symposium on VLSI, 1994)

Two-Layer Wiring with Pin Preassignments is Easier if the Power Supply Nets are Already Generated. - Paul Molitor; Uwe Sparmann; Dorothea Wagner (VLSI Design, 1994)

Communication based FPGA synthesis for multi-output Boolean functions. - Christoph Scholl 001; Paul Molitor (ASP-DAC, 1995)

Priority driven channel pin assignment. - Ines Peters; Paul Molitor (Great Lakes Symposium on VLSI, 1995)

On the generation of area-time optimal testable adders. - Bernd Becker 001; Rolf Drechsler; Paul Molitor (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1995)

Least Upper Bounds on the Sizes of Symmetric Variable Order based OBDDs. - Laura Heinrich-Litan; Paul Molitor; Dirk Möller (Great Lakes Symposium on VLSI, 1996)

New Crossover Methods For Sequencing Problems. - Tolga Asveren; Paul Molitor (PPSN, 1996)

Minimizing ROBDD sizes of incompletely specified Boolean functionsby exploiting strong symmetries. - Christoph Scholl 001; S. Melchior; Günter Hotz; Paul Molitor (ED&TC, 1997)

Modeling the Communication Behavior of Distributed Memory Machines by Genetic Programming. - Laura Heinrich-Litan; Ursula Fissgus; St. Sutter; Paul Molitor; Thomas Rauber (Euro-Par, 1998)

Datenstrukturen und effiziente Algorithmen für die Logiksynthese kombinatorischer Schaltungen. - Paul Molitor; Christoph Scholl 001 (Teubner, 1999)

Using Sifting for k -Layer Straightline Crossing Minimization. - Christian Matuszewski; Robby Schönfeld; Paul Molitor (GD, 1999)

Establishing latch correspondence for sequential circuits using distinguishing signatures. - Janett Mohnke; Paul Molitor; Sharad Malik (Integr., 1999)

BDD minimization using symmetries. - Christoph Scholl 001; Dirk Möller; Paul Molitor; Rolf Drechsler (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1999)

An efficient heuristic for state encoding minimizing the BDD representations of the transistion relations of finite state machines. - Riccardo Forth; Paul Molitor (ASP-DAC, 2000)

A partitioned wavelet-based approach for image compression using FPGA's. - Joerg Ritter 002; Paul Molitor (CICC, 2000)

k-Layer Straightline Crossing Minimization by Speeding Up Sifting. - Wolfgang Günther 001; Robby Schönfeld; Bernd Becker 001; Paul Molitor (GD, 2000)

Prove that a faulty multiplier is faulty!? - Sandro Wefel; Paul Molitor (ACM Great Lakes Symposium on VLSI, 2000)

Permutation Independent Comparison of Pseudo Boolean Functions. - Riccardo Forth; Paul Molitor (MBMV, 2000)

Least Upper Bounds for the Size of OBDDs Using Symmetry Properties. - Laura Heinrich-Litan; Paul Molitor (IEEE Trans. Computers, 2000)

A pipelined architecture for partitioned DWT based lossy image compression using FPGA's. - Jörg Ritter 002; Paul Molitor (FPGA, 2001)

Application of BDDs in Boolean matching techniques for formal logic combinational verification. - Janett Mohnke; Paul Molitor; Sharad Malik (Int. J. Softw. Tools Technol. Transf., 2001)

What are the samples for learning efficient routing heuristics? [MCM routing]. - Robby Schönfeld; Paul Molitor (APCCAS (1), 2002)

Limits of Using Signatures for Permutation Independent Boolean Comparison. - Janett Mohnke; Paul Molitor; Sharad Malik (Formal Methods Syst. Des., 2002)

Polynomial Formal Verification of Multipliers. - Martin Keim; Rolf Drechsler; Bernd Becker 001; Michael Martin 002; Paul Molitor (Formal Methods Syst. Des., 2003)

Zum neuen Jahrgang. - Heinz Zemanek; Johannes Oldenbourg; Paul Molitor; Klaus Küspert; Kurt Rothermel (it Inf. Technol., 2003)

VHDL - eine Einführung. - Paul Molitor; Jörg Ritter 002 (Pearson Studium, 2004)

Gutachter 2004. - Paul Molitor (it Inf. Technol., 2004)

Technische Informatik - eine Einführung. - Bernd Becker 001; Rolf Drechsler; Paul Molitor (Pearson Education, 2005)

Gutachter 2005. - Paul Molitor (it Inf. Technol., 2005)

Some Basics on Tolerances. - Boris Goldengorin; Gerold Jäger; Paul Molitor (AAIM, 2006)

Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. - Boris Goldengorin; Gerold Jäger; Paul Molitor (CAAN, 2006)

...was wird mit übrigens? - Paul Molitor (it Inf. Technol., 2006)

Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP. - Dirk Richter; Boris Goldengorin; Gerold Jäger; Paul Molitor (CAAN, 2007)

What Graphs can be Efficiently Represented by BDDs? - Changxing Dong; Paul Molitor (ICCTA, 2007)

Technische Informatik - eine einführende Darstellung. - Bernd Becker 001; Paul Molitor (Oldenbourg, 2008)

Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order. - Gerold Jäger; Paul Molitor (COCOA, 2008)

Gutachter 2008. - Paul Molitor (it Inf. Technol., 2008)

Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges. - Changxing Dong; Gerold Jäger; Dirk Richter; Paul Molitor (AAIM, 2009)

Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones. - Changxing Dong; Christian Ernst; Gerold Jäger; Dirk Richter; Paul Molitor (CTW, 2009)

Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction. - Christian Ernst; Changxing Dong; Gerold Jäger; Dirk Richter; Paul Molitor (AAIM, 2010)

BDD-based Analysis of Test Cases for PLC-based Railway Interlocking Systems. - André Gießler; Jörg Ritter 002; Paul Molitor (MBMV, 2011)

Reviewer Thanks. - Paul Molitor (it Inf. Technol., 2011)

Optimized platform for capturing metadata of historical correspondences. - Martin Andert; Jörg Ritter 002; Paul Molitor (DH, 2013)

Model Checking for PLC based Railway Interlocking Systems. - André Gießler; Jörg Ritter 002; Paul Molitor (MBMV, 2013)

User-friendly lemmatization and morphological annotation of Early New High German manuscripts. - André Gießler; Jörg Ritter 002; Paul Molitor; Martin Andert; Sylwia Kösser; Aletta Leipold (DH, 2014)

Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics. - Anja Fischer; Frank Fischer 002; Gerold Jäger; Jens Keilwagen; Paul Molitor; Ivo Grosse (Discret. Appl. Math., 2014)

A backbone based TSP heuristic for large instances. - Gerold Jäger; Changxing Dong; Boris Goldengorin; Paul Molitor; Dirk Richter (J. Heuristics, 2014)

Preface. - Paul Molitor (it Inf. Technol., 2014)

Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem. - Anja Fischer; Frank Fischer 002; Gerold Jäger; Jens Keilwagen; Paul Molitor; Ivo Grosse (Comput., 2015)

"im Zentrum eines Netzes [...] geistiger Fäden". Erschließung und Erforschung thematischer Zusammenhänge in heterogenen Briefkorpora. - Vera Hildenbrandt; Roland S. Kamzelak; Paul Molitor; Jörg Ritter 002 (Datenbank-Spektrum, 2015)

Differenzanalyse komplexer Textvarianten - Diskussion und Werkzeuge. - André Medek; Marcus Pöckelmann; Thomas Bremer; Hans-Joachim Solms; Paul Molitor; Jörg Ritter 002 (Datenbank-Spektrum, 2015)

Reviewers 2013-2014. - Paul Molitor (it Inf. Technol., 2015)

An optimized platform for capturing metadata of historical correspondence. - Martin Andert; Frank Berger; Paul Molitor; Jörg Ritter 002 (Digit. Scholarsh. Humanit., 2015)

Finding the Redundant Gates in Reversible Circuits. - Matthias Pfuhl; Jörg Ritter 002; Paul Molitor (RC, 2018)

Keter Shem Ṭov - Prozessualisierung eines Editionsprojekts mit 100 Textzeugen. - Paul Molitor; Gerold Necker; Marcus Pöckelmann; Bill Rebiger; Jörg Ritter 002 (DHd, 2020)

Digital methods for intertextuality studies. - Paul Molitor; Jörg Ritter 002 (it Inf. Technol., 2020)

Fast paraphrase extraction in Ancient Greek literature. - Marcus Pöckelmann; Janis Dähne; Jörg Ritter 002; Paul Molitor (it Inf. Technol., 2020)

Putting collation of text witnesses on a formal basis. - Janis Dähne; Marcus Pöckelmann; Jörg Ritter 002; Paul Molitor (Digit. Scholarsh. Humanit., 2022)

LERA - an interactive platform for synoptical representations of multiple text witnesses. - Marcus Pöckelmann; André Medek; Jörg Ritter 002; Paul Molitor (Digit. Scholarsh. Humanit., 2023)

Machine learning applications. - Natanael Arndt; Paul Molitor; Ricardo Usbeck (it Inf. Technol., 2023)

Improving text collations by local text resegmentation. - Janis Dähne; Jörg Ritter 002; Paul Molitor (Digit. Scholarsh. Humanit., 2025)