Paul Molitor

发表

Differenzanalyse komplexer Textvarianten

André Medek, Marcus Pöckelmann, Thomas Bremer, 2014, Datenbank-Spektrum.

VHDL - eine Einführung

Paul Molitor, Jörg Ritter, 2004 .

Client Hardware-Token Based Single Sign-On over Several Servers without Trusted Online Third Party Server

Paul Molitor, Sandro Wefel, P. Molitor, 2009 .

Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction

Gerold Jäger, Paul Molitor, Christian Ernst, 2010, AAIM.

Communication based multilevel synthesis for multi-output Boolean functions

Christoph Scholl, Paul Molitor, 1994, Proceedings of 4th Great Lakes Symposium on VLSI.

Digital methods for intertextuality studies

Paul Molitor, Jörg Ritter, 2020 .

A Hierarchy Preserving Hierarchical Bottom-Up 2-layer Wiring Algorithm with Respect to Via Minimization

Paul Molitor, 1992, Informatik.

On the Contact-Minimization-Problem

Paul Molitor, P. Molitor, 1987, STACS.

A backbone based TSP heuristic for large instances

Gerold Jäger, Paul Molitor, Boris Goldengorin, 2014, J. Heuristics.

User-friendly lemmatization and morphological annotation of Early New High German manuscripts

André Medek, Paul Molitor, Jörg Ritter, 2014, DH.

SPIHT implemented in a XC4000 device

Görschwin Fey, Paul Molitor, Jörg Ritter, 2002, The 2002 45th Midwest Symposium on Circuits and Systems, 2002. MWSCAS-2002..

Minimizing ROBDD sizes of incompletely specified Boolean functions by exploiting strong symmetries

Christoph Scholl, Paul Molitor, Günter Hotz, 1997, Proceedings European Design and Test Conference. ED & TC 97.

Application of BDDs in Boolean matching techniques for formal logic combinational verification

Sharad Malik, Paul Molitor, Janett Mohnke, 2001, International Journal on Software Tools for Technology Transfer.

An efficient heuristic for state encoding minimizing the BDD representations of the transistion relations of finite state machines

Paul Molitor, Riccardo Forth, 2000, ASP-DAC.

Tolerances applied in combinatorial optimization

Gerold Jäger, Paul Molitor, Boris Goldengorin, 2006 .

BDD minimization using symmetries

Rolf Drechsler, Christoph Scholl, Paul Molitor, 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

Least Upper Bounds for the Size of OBDDs Using Symmetry Properties

Paul Molitor, Laura Heinrich-Litan, P. Molitor, 2000, IEEE Trans. Computers.

Using Hardware Tokens for Authentication of Multiple Client Application Making Single Sign-On Possible

Paul Molitor, Sandro Wefel, P. Molitor, 2008 .

Fast paraphrase extraction in Ancient Greek literature

Marcus Pöckelmann, Paul Molitor, Jörg Ritter, 2020, it Inf. Technol..

Reviewer Thanks

Paul Molitor, 2011, it Inf. Technol..

Hierarchical Design Based on a Calculus of Nets

Bernd Becker, Paul Molitor, Günter Hotz, 1987, 24th ACM/IEEE Design Automation Conference.

Model Checking for PLC based Railway Interlocking Systems

André Medek, Paul Molitor, Jörg Ritter, 2013, MBMV.

Einführung in den VLSI-Entwurf

Paul Molitor, Reiner Kolla, Hans-Georg Osthof, 1989, Leitfäden und Monographien der Informatik.

Simulating field programmable analog devices

Paul Molitor, Sandro Wefel, M. Rost, 1999, 42nd Midwest Symposium on Circuits and Systems (Cat. No.99CH36356).

New Crossover Methods For Sequencing Problems

Paul Molitor, Tolga Asveren, P. Molitor, 1996, PPSN.

Constrained via minimization for systolic arrays

Paul Molitor, 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

A performance driven generator for efficient testable conditional-sum-adders

Bernd Becker, Paul Molitor, B. Becker, 1992, Proceedings EURO-DAC '92: European Design Automation Conference.

Ein logisch-topologischer Kalkül zur Konstruktion von integrierten Schaltkreisen

Paul Molitor, Günter Hotz, Reiner Kolla, 1985 .

What Graphs can be Efficiently Represented by BDDs?

Paul Molitor, Changxing Dong, 2007, 2007 International Conference on Computing: Theory and Applications (ICCTA'07).

Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem

Gerold Jäger, Jens Keilwagen, Ivo Grosse, 2015, Comput..

What are the samples for learning efficient routing heuristics? [MCM routing]

Paul Molitor, Robby Schönfeld, 2002, Asia-Pacific Conference on Circuits and Systems.

Some Basics on Tolerances

Gerold Jäger, Paul Molitor, Boris Goldengorin, 2006, AAIM.

On the generation of area-time optimal testable adders

Rolf Drechsler, Bernd Becker, Paul Molitor, 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

Prove that a faulty multiplier is faulty!?

Paul Molitor, Sandro Wefel, 2000, ACM Great Lakes Symposium on VLSI.

Priority driven channel pin assignment

Paul Molitor, Ines Peters, 1995, Proceedings. Fifth Great Lakes Symposium on VLSI.

Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP

Gerold Jäger, Paul Molitor, Boris Goldengorin, 2007, CAAN.

Communication based FPGA synthesis for multi-output Boolean functions

Christoph Scholl, Paul Molitor, C. Scholl, 1995, ASP-DAC '95.

Raising User Acceptance of Token based Authentication by Single Sign-On

Paul Molitor, Sandro Wefel, 2012 .

k-Layer Straightline Crossing Minimization by Speeding Up Sifting

Bernd Becker, Wolfgang Günther, Paul Molitor, 2000, Graph Drawing.

Performance Driven k-Layer Wiring

Michael Kaufmann, Paul Molitor, Wolfgang Vogelgesang, 1992, STACS.

… was wird mit übrigens?

Paul Molitor, P. Molitor, 2006, it Inf. Technol..

Gutachter 2008

Paul Molitor, 2008, it Inf. Technol..

Guiding property development with SAT-based coverage calculation

Paul Molitor, Roberto Hoffmann, 2009, 2009 52nd IEEE International Midwest Symposium on Circuits and Systems.

Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP

Gerold Jäger, Paul Molitor, Boris Goldengorin, 2006, CAAN.

On Network Algebras and Recursive Equations

Paul Molitor, Günter Hotz, Reiner Kolla, 1986, Graph-Grammars and Their Application to Computer Science.

„im Zentrum eines Netzes [...] geistiger Fäden“. Erschließung und Erforschung thematischer Zusammenhänge in heterogenen Briefkorpora

Paul Molitor, Jörg Ritter, Vera Hildenbrandt, 2015, Datenbank-Spektrum.

Limits of Using Signatures for Permutation Independent Boolean Comparison

Sharad Malik, Paul Molitor, Janett Mohnke, 2002, Formal Methods Syst. Des..

Technische Informatik - eine Einführung

Rolf Drechsler, Bernd Becker, Paul Molitor, 2005, Pearson Studium.

Über die Bikategorie der logisch-topologischen Netze und ihre Semantik

Paul Molitor, 1986 .

Modellierung eines Mikroprozessors in SystemC

Bernd Becker, Ulrich Kühne, Paul Molitor, 2005 .

On the implementation of an efficient performance driven generator for conditional-sum-adders

Rolf Drechsler, Bernd Becker, Paul Molitor, 1993, Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference.

A hierarchy preserving hierarchical bottom-up 2-layer wiring algorithm with respect to via minimization

Paul Molitor, P. Molitor, 1993, Integr..

A Survey on Wiring

Paul Molitor, 1991, J. Inf. Process. Cybern..

Limits of using signatures for permutation independent Boolean comparison

Sharad Malik, Paul Molitor, Janett Mohnke, 1995, ASP-DAC '95.

Finding the Redundant Gates in Reversible Circuits

Paul Molitor, Jörg Ritter, Matthias Pfuhl, 2018, RC.

Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order

Gerold Jäger, Paul Molitor, G. Jäger, 2008, COCOA.

Polynomial formal verification of of multipliers

Rolf Drechsler, Bernd Becker, Paul Molitor, 1997, Proceedings. 15th IEEE VLSI Test Symposium (Cat. No.97TB100125).

Permutation Independent Comparison of Pseudo Boolean Functions

Paul Molitor, Riccardo Forth, 2000, MBMV.

A graphical system for hierarchical specifications and checkups of VLSI circuits

Bernd Becker, Uwe Sparmann, Paul Molitor, 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..

Ein logisch-topologischer Kalkül zur Konstruktion integrierter Schaltkreise, Teil II

Bernd Becker, Paul Molitor, Günter Hotz, 1986, Inform. Forsch. Entwickl..

Minimal stretching of a layout to ensure 2-layer wirability

Michael Kaufmann, Paul Molitor, 1991, Integr..

Datenstrukturen und effiziente Algorithmen für die Logiksynthese kombinatorischer Schaltungen

Christoph Scholl, Paul Molitor, P. Molitor, 1999 .

A note on hierarchical layer-assignment

Paul Molitor, Reiner Kolla, 1989, Integr..

Zum neuen Jahrgang

Kurt Rothermel, Klaus Küspert, Paul Molitor, 2003, it Inf. Technol..

Technische Informatik - eine einführende Darstellung

Bernd Becker, Paul Molitor, P. Molitor, 2008 .

Least upper bounds on the sizes of symmetric variable order based OBDDs

Paul Molitor, Laura Heinrich-Litan, Dirk Möller, 1996, Proceedings of the Sixth Great Lakes Symposium on VLSI.

Reviewers 2013–2014

Paul Molitor, 2015, it Inf. Technol..

Equivalence Checking of Digital Circuits: Fundamentals, Principles, Methods

Paul Molitor, Janett Mohnke, P. Molitor, 2007 .

Polynomial Formal Verification of Multipliers

Rolf Drechsler, Bernd Becker, Paul Molitor, 2003, Formal Methods Syst. Des..

A pipelined architecture for partitioned DWT based lossy image compression using FPGA's

Paul Molitor, Jörg Ritter, 2001, FPGA '01.

BDD-based Analysis of Test Cases for PLC-based Railway Interlocking Systems

André Medek, Paul Molitor, Jörg Ritter, 2011, MBMV.

Using Sifting for k -Layer Straightline Crossing Minimization

Paul Molitor, Christian Matuszewski, Robby Schönfeld, 1999, GD.

Gutachter 2004

Paul Molitor, 2004, it Inf. Technol..

Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges

Gerold Jäger, Paul Molitor, Changxing Dong, 2009, AAIM.

Establishing latch correspondence for sequential circuits using distinguishing signatures

Sharad Malik, Paul Molitor, Janett Mohnke, 1999, Integr..

Two-layer wiring with pin preassignments is easier if the power supply nets are already generated

Uwe Sparmann, Dorothea Wagner, Paul Molitor, 1994, Proceedings of 7th International Conference on VLSI Design.

Kompaktkurs VDHL: mit vielen anschaulischen Beispielen

Paul Molitor, Jörg Ritter, 2013 .

Efficient ROBDD based computation of common decomposition functions of multi-output boolean functions

Christoph Scholl, Paul Molitor, 1995 .

Recent Developments in Wiring and Via Minimization

Paul Molitor, P. Molitor, 2002 .

Complexity and Algorithms for the Traveling Salesman Problem and the Assignment Problem of Second Order ∗

Gerold Jäger, Paul Molitor, Frank Fischer, 2009 .