Paul Molitor

ORCID

Publication Activity (10 Years)

Years Active: 1986-2023
Publications (10 Years): 7

Top Venues

it Inf. Technol.

Digit. Scholarsh. Humanit.

Datenbank-Spektrum

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

Marcus Pöckelmann, André Medek, Jörg Ritter, Paul Molitor
LERA - an interactive platform for synoptical representations of multiple text witnesses. Digit. Scholarsh. Humanit. 38 (1) (2023)
Natanael Arndt, Paul Molitor, Ricardo Usbeck
Machine learning applications. it Inf. Technol. 65 (4-5) (2023)
Janis Dähne, Marcus Pöckelmann, Jörg Ritter, Paul Molitor
Putting collation of text witnesses on a formal basis. Digit. Scholarsh. Humanit. 37 (2) (2022)
Paul Molitor, Jörg Ritter
Digital methods for intertextuality studies. it Inf. Technol. 62 (2) (2020)
Paul Molitor, Gerold Necker, Marcus Pöckelmann, Bill Rebiger, Jörg Ritter
Keter Shem Ṭov - Prozessualisierung eines Editionsprojekts mit 100 Textzeugen. DHd (2020)
Marcus Pöckelmann, Janis Dähne, Jörg Ritter, Paul Molitor
Fast paraphrase extraction in Ancient Greek literature. it Inf. Technol. 62 (2) (2020)
Matthias Pfuhl, Jörg Ritter, Paul Molitor
Finding the Redundant Gates in Reversible Circuits. RC (2018)
Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor, Ivo Grosse
Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem. Comput. 3 (2) (2015)
André Medek, Marcus Pöckelmann, Thomas Bremer, Hans-Joachim Solms, Paul Molitor, Jörg Ritter
Differenzanalyse komplexer Textvarianten - Diskussion und Werkzeuge. Datenbank-Spektrum 15 (1) (2015)
Vera Hildenbrandt, Roland S. Kamzelak, Paul Molitor, Jörg Ritter
"im Zentrum eines Netzes [...] geistiger Fäden". Erschließung und Erforschung thematischer Zusammenhänge in heterogenen Briefkorpora. Datenbank-Spektrum 15 (1) (2015)
Martin Andert, Frank Berger, Paul Molitor, Jörg Ritter
An optimized platform for capturing metadata of historical correspondence. Digit. Scholarsh. Humanit. 30 (4) (2015)
Paul Molitor
Reviewers 2013-2014. it Inf. Technol. 57 (2) (2015)
Gerold Jäger, Changxing Dong, Boris Goldengorin, Paul Molitor, Dirk Richter
A backbone based TSP heuristic for large instances. J. Heuristics 20 (1) (2014)
Paul Molitor
Preface. it Inf. Technol. 56 (4) (2014)
Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor, Ivo Grosse
Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics. Discret. Appl. Math. 166 (2014)
André Gießler, Jörg Ritter, Paul Molitor, Martin Andert, Sylwia Kösser, Aletta Leipold
User-friendly lemmatization and morphological annotation of Early New High German manuscripts. DH (2014)
André Gießler, Jörg Ritter, Paul Molitor
Model Checking for PLC based Railway Interlocking Systems. MBMV (2013)
Martin Andert, Jörg Ritter, Paul Molitor
Optimized platform for capturing metadata of historical correspondences. DH (2013)
André Gießler, Jörg Ritter, Paul Molitor
BDD-based Analysis of Test Cases for PLC-based Railway Interlocking Systems. MBMV (2011)
Paul Molitor
Reviewer Thanks. it Inf. Technol. 53 (1) (2011)
Christian Ernst, Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction. AAIM (2010)
Changxing Dong, Christian Ernst, Gerold Jäger, Dirk Richter, Paul Molitor
Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones. CTW (2009)
Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges. AAIM (2009)
Gerold Jäger, Paul Molitor
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order. COCOA (2008)
Paul Molitor
Gutachter 2008. it Inf. Technol. 50 (6) (2008)
Changxing Dong, Paul Molitor
What Graphs can be Efficiently Represented by BDDs? ICCTA (2007)
Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP. CAAN (2007)
Boris Goldengorin, Gerold Jäger, Paul Molitor
Some Basics on Tolerances. AAIM (2006)
Boris Goldengorin, Gerold Jäger, Paul Molitor
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. CAAN (2006)
Paul Molitor
...was wird mit übrigens? it Inf. Technol. 48 (4) (2006)
Paul Molitor
Gutachter 2005. it Inf. Technol. 47 (6) (2005)
Paul Molitor
Gutachter 2004. it Inf. Technol. 46 (6) (2004)
Martin Keim, Rolf Drechsler, Bernd Becker, Michael Martin, Paul Molitor
Polynomial Formal Verification of Multipliers. Formal Methods Syst. Des. 22 (1) (2003)
Heinz Zemanek, Johannes Oldenbourg, Paul Molitor, Klaus Küspert, Kurt Rothermel
Zum neuen Jahrgang. it Inf. Technol. 45 (1) (2003)
Robby Schönfeld, Paul Molitor
What are the samples for learning efficient routing heuristics? [MCM routing]. APCCAS (1) (2002)
Janett Mohnke, Paul Molitor, Sharad Malik
Limits of Using Signatures for Permutation Independent Boolean Comparison. Formal Methods Syst. Des. 21 (2) (2002)
Janett Mohnke, Paul Molitor, Sharad Malik
Application of BDDs in Boolean matching techniques for formal logic combinational verification. Int. J. Softw. Tools Technol. Transf. 3 (2) (2001)
Jörg Ritter, Paul Molitor
A pipelined architecture for partitioned DWT based lossy image compression using FPGA's. FPGA (2001)
Riccardo Forth, Paul Molitor
An efficient heuristic for state encoding minimizing the BDD representations of the transistion relations of finite state machines. ASP-DAC (2000)
Wolfgang Günther, Robby Schönfeld, Bernd Becker, Paul Molitor
-Layer Straightline Crossing Minimization by Speeding Up Sifting. Graph Drawing (2000)
Joerg Ritter, Paul Molitor
A partitioned wavelet-based approach for image compression using FPGA's. CICC (2000)
Sandro Wefel, Paul Molitor
Prove that a faulty multiplier is faulty!? ACM Great Lakes Symposium on VLSI (2000)
Riccardo Forth, Paul Molitor
Permutation Independent Comparison of Pseudo Boolean Functions. MBMV (2000)
Laura Heinrich-Litan, Paul Molitor
Least Upper Bounds for the Size of OBDDs Using Symmetry Properties. IEEE Trans. Computers 49 (4) (2000)
Christoph Scholl, Dirk Möller, Paul Molitor, Rolf Drechsler
BDD minimization using symmetries. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18 (2) (1999)
Christian Matuszewski, Robby Schönfeld, Paul Molitor
Using Sifting for k -Layer Straightline Crossing Minimization. Graph Drawing (1999)
Janett Mohnke, Paul Molitor, Sharad Malik
Establishing latch correspondence for sequential circuits using distinguishing signatures. Integr. 27 (1) (1999)
Laura Heinrich-Litan, Ursula Fissgus, St. Sutter, Paul Molitor, Thomas Rauber
Modeling the Communication Behavior of Distributed Memory Machines by Genetic Programming. Euro-Par (1998)
Martin Keim, Michael Martin, Bernd Becker, Rolf Drechsler, Paul Molitor
Polynomial Formal Verification of Multipliers. VTS (1997)
Christoph Scholl, S. Melchior, Günter Hotz, Paul Molitor
Minimizing ROBDD sizes of incompletely specified Boolean functionsby exploiting strong symmetries. ED&TC (1997)
Tolga Asveren, Paul Molitor
New Crossover Methods For Sequencing Problems. PPSN (1996)
Laura Heinrich-Litan, Paul Molitor, Dirk Möller
Least Upper Bounds on the Sizes of Symmetric Variable Order based OBDDs. Great Lakes Symposium on VLSI (1996)
Ines Peters, Paul Molitor
Priority driven channel pin assignment. Great Lakes Symposium on VLSI (1995)
Janett Mohnke, Paul Molitor, Sharad Malik
Limits of using signatures for permutation independent Boolean comparison. ASP-DAC (1995)
Christoph Scholl, Paul Molitor
Communication based FPGA synthesis for multi-output Boolean functions. ASP-DAC (1995)
Bernd Becker, Rolf Drechsler, Paul Molitor
On the generation of area-time optimal testable adders. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14 (9) (1995)
Paul Molitor, Uwe Sparmann, Dorothea Wagner
Two-Layer Wiring with Pin Preassignments is Easier if the Power Supply Nets are Already Generated. VLSI Design (1994)
Paul Molitor, Christoph Scholl
Communication based multilevel synthesis for multi-output Boolean functions. Great Lakes Symposium on VLSI (1994)
Paul Molitor
A hierarchy preserving hierarchical bottom-up 2-layer wiring algorithm with respect to via minimization. Integr. 15 (1) (1993)
Bernd Becker, Rolf Drechsler, Paul Molitor
On the implementation of an efficient performance driven generator for conditional-sum-adders. EURO-DAC (1993)
Michael Kaufmann, Paul Molitor, Wolfgang Vogelgesang
Performance Driven k-Layer Wiring. STACS (1992)
Bernd Becker, Paul Molitor
A performance driven generator for efficient testable conditional-sum-adders. EURO-DAC (1992)
Michael Kaufmann, Paul Molitor
Minimal stretching of a layout to ensure 2-layer wirability. Integr. 12 (3) (1991)
Paul Molitor
A Survey on Wiring. J. Inf. Process. Cybern. 27 (1) (1991)
Paul Molitor
Constrained via minimization for systolic arrays. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9 (5) (1990)
Bernd Becker, Thomas Burch, Günter Hotz, D. Kiel, Reiner Kolla, Paul Molitor, Hans-Georg Osthof, Gisela Pitsch, Uwe Sparmann
A graphical system for hierarchical specifications and checkups of VLSI circuits. EURO-DAC (1990)
Reiner Kolla, Paul Molitor
A note on hierarchical layer-assignment. Integr. 7 (3) (1989)
Bernd Becker, Günter Hotz, Reiner Kolla, Paul Molitor, Hans-Georg Osthof
Hierarchical Design Based on a Calculus of Nets. DAC (1987)
Paul Molitor
On the Contact-Minimization-Problem. STACS (1987)
Günter Hotz, Bernd Becker, Reiner Kolla, Paul Molitor
Ein logisch-topologischer Kalkül zur Konstruktion integrierter Schaltkreise, Teil II. Inform. Forsch. Entwickl. 1 (2) (1986)
Günter Hotz, Reiner Kolla, Paul Molitor
On Network Algebras and Recursive Equations. Graph-Grammars and Their Application to Computer Science (1986)
Günter Hotz, Bernd Becker, Reiner Kolla, Paul Molitor
Ein logisch-topologischer Kalkül zur Konstruktion integrierter Schaltkreise, Teil I. Inform. Forsch. Entwickl. 1 (1) (1986)

Paul Molitor.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Paul Molitor