Personal information

Verified email addresses

Verified email domains

Efficient Algorithms, Binary Decision Diagrams, Traveling Salesman Problem, Text Alignment Algorithms, eHumanities, Hardware Verification, Circuit Synthesis
Germany, Luxembourg

Biography

Prof. Dr. Paul Molitor (*1959, Luxembourg) studied Computer Science and Mathematics at the University of Saarbrücken (Diplom 1982, Promotion 1986, Habilitation 1992). He was member of the scientific staff of Prof. Dr. Gunter Hotz (1982-1994) in the National Research Center 124 "VLSI and Parallelism" (1992-1994). In 1993, he was with the Humboldt-University of Berlin as Associate Professor for Circuit Technology. Since 1994 he is a Full Professor for Computer Engineering at the Martin-Luther-University Halle-Wittenberg (MLU).

Prof. Dr. Molitor's interests concern not only Technical Computer Science, in particular Formal Hardware Verification, but also Combinatorial Optimization and Digital Humanities/eHumanities. Prof. Molitor acquired and led more than 15 externally funded projects, including 9 projects funded by the German Research Foundation (DFG), 5 projects funded by the Federal Ministry of Education and Research (BMBF), and 1 project funded by the VolkswagenStiftung, as well as several industry projects.He is author of 4 lecture books and more than 100 research papers.

Prof. Dr. Molitor was/is managing director of the Institute for Computer Science in 1994-1998, 2000-2003, and 2010-2022. He was chairman of the "Landes-Hochschul-DV-Kommission" (1995-2014) and the IT Board of the Universities of Saxony-Anhalt (2015-2016). For about 20 years, he was chairman of the IT steering group of MLU. From 2003 to 2017 and from 2021 to 2023, he was Editor-in-Chief of it - Information Technology, De Gruyter, the oldest German scientific journal on information technology (launched in 1959).

Activities

Employment (3)

Martin Luther University Halle-Wittenberg: Halle (Saale), DE

1994-04 to present | Professor for Technical Computer Science / Acting Director (Computer Science Institute)
Employment
Source: Self-asserted source
Paul Molitor

Humboldt-Universität zu Berlin: Berlin, DE

1993-10 to 1994-03 | Professor for Circuit Design (Department of Computer Science)
Employment
Source: Self-asserted source
Paul Molitor

Universität des Saarlandes: Saarbrücken, DE

1982-10 to 1993-09 | Research associate (Department of Computer Scinece)
Employment
Source: Self-asserted source
Paul Molitor

Education and qualifications (4)

Universität des Saarlandes: Saarbrucken, Saarland, DE

1986 to 1992 | Dr. rer. nat. habil (Department on Computer Science)
Education
Source: Self-asserted source
Paul Molitor

Universität des Saarlandes: Saarbrucken, Saarland, DE

1982 to 1986 | Dr. rer. nat. (Department of Computer Science)
Education
Source: Self-asserted source
Paul Molitor

Universität des Saarlandes: Saarbrucken, Saarland, DE

1978 to 1982 | Diplom-Informatiker (Department of Computer Science)
Education
Source: Self-asserted source
Paul Molitor

Lycée de Garcons de Luxembourg : Luxembourg, LU

1971 to 1978 | Diplôme de fin d´études secondaires, section langues vivantes-sciences, option sciences mathématiques
Education
Source: Self-asserted source
Paul Molitor

Professional activities (8)

Gesellschaft für Informatik eV: Bonn, Nordrhein-Westfalen, DE

Membership
Source: Self-asserted source
Paul Molitor

Association for Computing Machinery: New York, NY, US

Membership
Source: Self-asserted source
Paul Molitor

IT-Kommission der Hochschulen des Landes Sachsen-Anhalt: Magdeburg, Saxony-Anhalt, DE

2015 to 2023 | Representative of the Martin Luther University Halle-Wittenberg
Invited position
Source: Self-asserted source
Paul Molitor

GISA GmbH: Halle (Saale), Saxony-Anhalt, DE

2012 to 2019 | Chairman of the Scientific and Technical Advisory Board
Invited position
Source: Self-asserted source
Paul Molitor

Gesellschaft für Informatik eV: Bonn, Nordrhein-Westfalen, DE

2005 to 2019 | Member of the Nomination Committee of the GI Dissertation Award
Invited position
Source: Self-asserted source
Paul Molitor

Walter de Gruyter (Germany): Berlin, DE

2003 to 2019 | Editor-in-Chief of the scientific journal "it - Information Technology"
Invited position
Source: Self-asserted source
Paul Molitor

Landes-Hochschul-DV-Kommission (LDVK): Magdeburg, Saxony-Anhalt, DE

1995 to 2015 | Chairman of the commission / Representative of the Martin Luther University Halle-Wittenberg
Invited position
Source: Self-asserted source
Paul Molitor

Deutscher Akademischer Austauschdienst: Bonn, Nordrhein-Westfalen, DE

2009 to 2012 | Member of the selection committee of the DAAD program "Research at International Science and Technology Centers (FIT)"
Invited position
Source: Self-asserted source
Paul Molitor

Funding (16)

Exzerpte - Zur digitalen Erschließung und Edition einer besonderen Text-Bild- Konstellation am Beispiel Johann Joachim Winckelmanns

2021-04 to 2024-03 | Grant
Bundesministerium für Bildung und Forschung (BMBF) (Berlin, DE)
Source: Self-asserted source
Paul Molitor

Synoptische Edition des kabbalistischen Traktats Keter Shem Tov mit englischer Übersetzung, Stellenkommentar und rezeptionsgeschichtlichen Studien

2019-05 to 2025-06 | Grant
Deutsche Forschungsgemeinschaft (DFG) (Bonn, DE)
GRANT_NUMBER: 414786977
Source: Self-asserted source
Paul Molitor

Digital Plato: Tradition and Reception

2016-04 to 2019-03 | Grant
Volkswagen Foundation (Hanover, DE)
GRANT_NUMBER: 89372
Source: Self-asserted source
Paul Molitor

Kumulatives Nachtragswörterbuch des Sanskrit

2014-01 to 2016-12 | Grant
Deutsche Forschungsgemeinschaft (Bonn, DE)
GRANT_NUMBER: 234693396
Source: Self-asserted source
Paul Molitor

Vernetzte Korrespondenzen – Erforschung und Visualisierung sozialer, räumlicher, zeitlicher und thematischer Netze in Briefkorpora

2013-02 to 2016-01 | Grant
Bundesministerium für Bildung und Forschung (Berlin, DE)
Source: Self-asserted source
Paul Molitor

Semi-automatische Differenzanalyse von komplexen Textvarianten

2012-09 to 2015-08 | Award
Bundesministerium für Bildung und Forschung (Berlin, DE)
Source: Self-asserted source
Paul Molitor

Innovationsprojekt STUDIUM MULTIMEDIAL

2012-04 to 2016-12 | Grant
Bundesministerium für Bildung und Forschung (Berlin, DE)
Source: Self-asserted source
Paul Molitor

Analyse von Spezifikationen elektronischer Stellwerke

2009-04 to 2011-03 | Grant
Siemens Transportation Systems (Braunschweig, DE)
Source: Self-asserted source
Paul Molitor

Einführung einer Smartcard basierten Single Sign-On Lösung

2009-01 to 2014-03 | Grant
Europäischer Fond für regionale Entwicklung (Magdeburg, DE)
Source: Self-asserted source
Paul Molitor

Auf Toleranzen basierende Methoden zur Lösung des Handelsreisendenproblems

2007-09 to 2009-10 | Grant
Deutsche Forschungsgemeinschaft (Bonn, DE)
GRANT_NUMBER: 5426224
Source: Self-asserted source
Paul Molitor

ULI – Universitärer Lehrverbund Informatik

2001-04 to 2003-12 | Grant
Bundesministerium für Bildung und Forschung (Berlin, DE)
Source: Self-asserted source
Paul Molitor

Routing Probleme in VLSI Systemen, Lösungsansätze mit Genetischen Al-gorithmen

1998-10 to 2001-03 | Grant
Deutsche Forschungsgemeinschaft (Bonn, DE)
Source: Self-asserted source
Paul Molitor

Formale Verifikation hierarchisch spezifizierter Schaltungen

1997-05 to 2002-07 | Grant
Deutsche Forschungsgemeinschaft (Bonn, DE)
Source: Self-asserted source
Paul Molitor

Logic Synthesis of Random Logic Circuits

1995-01 to 1997-06 | Grant
Deutsche Forschungsgemeinschaft (Bonn, DE)
Source: Self-asserted source
Paul Molitor

CADIC - Ein top-down Entwurfssystem für integrierte Schal¬tun¬gen

1992-01 to 1994-12 | Grant
Deutsche Forschungsgemeinschaft (Bonn, DE)
Source: Self-asserted source
Paul Molitor

Automatische Synthese und Optimierung kleiner Schaltungen

1990-10 to 1994-12 | Grant
Deutsche Forschungsgemeinschaft (Bonn, DE)
Source: Self-asserted source
Paul Molitor

Works (50 of 93)

Items per page:
Page 1 of 2

Machine learning applications

it - Information Technology
2023-08-27 | Journal article
Contributors: Natanael Arndt; Paul Molitor; Ricardo Usbeck
Source: check_circle
Crossref

LERA—an interactive platform for synoptical representations of multiple text witnesses

Digital Scholarship in the Humanities
2022-06-30 | Journal article
Part of ISSN: 2055-7671
Part of ISSN: 2055-768X
Contributors: Marcus Pöckelmann; André Medek; Jörg Ritter; Paul Molitor
Source: Self-asserted source
Paul Molitor

Putting collation of text witnesses on a formal basis

Digital Scholarship in the Humanities
2022-05-25 | Journal article
Contributors: Janis Dähne; Marcus Pöckelmann; Jörg Ritter; Paul Molitor
Source: check_circle
Crossref

Digital methods for intertextuality studies

it - Information Technology
2020-04-26 | Journal article
Contributors: Paul Molitor; Jörg Ritter
Source: check_circle
Crossref

Fast paraphrase extraction in Ancient Greek literature

it - Information Technology
2020-03-06 | Journal article
Source: Self-asserted source
Paul Molitor
grade
Preferred source (of 2)‎

Platon Digital

Propylaeum
2019 | Edited book
Source: Self-asserted source
Paul Molitor

Word Mover's Distance angewendet auf die Paraphrasenextraktion im Altgriechischen

Platon Digital. Tradition und Rezeption
2019 | Book chapter
Source: Self-asserted source
Paul Molitor

Finding the redundant gates in reversible circuits

Proceedings of the 10th Conference on Reversible Computation
2018-09-13 | Conference paper
Source: Self-asserted source
Paul Molitor

eID & eIDAS at University Management - Chances and Changes for Security and Legally Binding in Cross Boarder Electronization

Annual Congress of the European University Information Systems Organization (EUNIS'2017)
2017-06 | Conference paper
Source: Self-asserted source
Paul Molitor

Zum Einsatz digitaler Methoden bei der Erstellung und Nutzung genetischer Editionen gedruckter Texte mit verschiedenen Fassungen

Editio
2015-12-15 | Journal article
Source: Self-asserted source
Paul Molitor

Optimized platform for capturing metadata of historical correspondences

Literary and Linguistic Computing
2015-12-01 | Journal article
Source: Self-asserted source
Paul Molitor
grade
Preferred source (of 2)‎

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

Computation
2015-06 | Journal article
Source: Self-asserted source
Paul Molitor
grade
Preferred source (of 2)‎

Interactive Similarity Analysis of Early New High German Text Variants. Digital Humanities

Supporting The Investigation Of Text Genesis Of Large Manuscripts By An Overall Interactive Visualization Tool

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

Datenbank-Spektrum
2015-03 | Journal article
Source: Self-asserted source
Paul Molitor

Differenzanalyse komplexer Textvarianten

Datenbank-Spektrum
2015-03 | Journal article
Source: Self-asserted source
Paul Molitor

Special Issue dedicated to Bernd Becker on the occasion of his 60th birthday: Testing Integrated Circuits / Rolf Drechsler Preface

it - Information Technology
2014 | Journal article
Contributors: Molitor, Paul
Source: check_circle
Web of Science Researcher Profile Sync

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

Digital Humanities (DH2014)
2014-07-04 | Conference poster
Source: Self-asserted source
Paul Molitor

Exact Algorithms and Heuristics for the Quadratic Traveling Salesman Problem with an Application in Bioinformatics

Discrete Applied Mathematics,
2014-03 | Journal article
Source: Self-asserted source
Paul Molitor
grade
Preferred source (of 2)‎

A Backbone Based TSP Heuristic for Large Instances

Journal of Heuristics
2014-02 | Journal article
Source: Self-asserted source
Paul Molitor
grade
Preferred source (of 2)‎

Kompaktkurs VHDL mit vielen anschaulichen Beispielen

Oldenbourg Wissenschaftsverlag
2013 | Book
Source: Self-asserted source
Paul Molitor

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

International Journal of Information and Computer Science
2012-06 | Journal article
Source: Self-asserted source
Paul Molitor

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

6th International Conference on Algorithmic Aspects in Information and Management (AAIM'10)
2010-07 | Conference paper
Source: Self-asserted source
Paul Molitor
grade
Preferred source (of 2)‎

Permutation Independent Comparison of Pseudo Boolean Functions

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

Communications in Computer and Information Science
2009 | Journal article
Contributors: Wefel, Sandro; Molitor, Paul
Source: check_circle
Web of Science Researcher Profile Sync

Guiding Property Development with SAT-based Coverage Calculation

2nd IEEE International Midwest Symposium on Circuits and Systems (MWSCAS 2009)
2009-08 | Conference paper
Source: Self-asserted source
Paul Molitor
grade
Preferred source (of 2)‎

Client Hardware-Token Based Single Sign-On Over Several Servers Without Trusted Online Third party Server

International Conference on Security and Assurance (ISA)
2009-06 | Conference paper
Source: Self-asserted source
Paul Molitor

Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo-Backbones

Source: Self-asserted source
Paul Molitor

Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges

5th International Conference on Algorithmic Aspects in Information and Management (AAIM'09)
2009-06 | Conference paper
Source: Self-asserted source
Paul Molitor
grade
Preferred source (of 2)‎

Technische Informatik

Oldenbourg Wissenschaftsverlag
2008 | Book
Source: Self-asserted source
Paul Molitor

Experimental Study for the Traveling Salesman Problem of Second Order

2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA 2008)
2008-08 | Conference paper
Source: Self-asserted source
Paul Molitor
grade
Preferred source (of 2)‎

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

4th Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2007)
2007-08 | Conference paper
Source: Self-asserted source
Paul Molitor

What Graphs Can Be Efficiently Represented by BDDs

International Conference on Computing: Theory and Applications (ICCTA 2007)
2007-03 | Conference paper
Source: Self-asserted source
Paul Molitor
grade
Preferred source (of 2)‎

Tolerances applied in combinatorial optimization

Source: Self-asserted source
Paul Molitor

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

3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2006)
2006-07 | Conference paper
Source: Self-asserted source
Paul Molitor

Some basics on tolerances

2nd International Conference on Algorithmic Aspects in Information and Management (AAIM`06)
2006-06 | Conference paper
Source: Self-asserted source
Paul Molitor
grade
Preferred source (of 2)‎

An Internet-Based Tool for Dynamical Electronic Practical Training

3rd International Conference on Education and Information Systems, Technologies and Applications (EISTA 2005)
2005-07 | Conference paper
Source: Self-asserted source
Paul Molitor

Algorithmen -- Eine Einführung

Oldenbourg Wissenschaftsverlag
2004 | Website
Source: Self-asserted source
Paul Molitor

Equivalence Checking of Digital Circuits

Kluwer Academic Publishers
2004-01 | Book
Source: Self-asserted source
Paul Molitor

Polynomial Formal Verification of Multipliers

Formal Methods in System Design
2003-01 | Journal article
Source: Self-asserted source
Paul Molitor
grade
Preferred source (of 2)‎

What are the samples for learning efficient routing heuristics?

APCCAS 2002: ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, VOL 1, PROCEEDINGS
2002 | Journal article
Contributors: Schonfeld, R; Molitor, P
Source: check_circle
Web of Science Researcher Profile Sync

Limits of using Signatures for Permutation Independent Boolean Comparison

Formal Methods in System Design
2002-09 | Journal article
Source: Self-asserted source
Paul Molitor
grade
Preferred source (of 2)‎

SPIHT implemented in a XC4000 Device

5th IEEE International Midwest Symposium on Circuits and Systems
2002-08 | Conference paper
Source: Self-asserted source
Paul Molitor
grade
Preferred source (of 2)‎

An Efficient FPGA Implementation of the SPIHT Algorithm

10th ACM International Symposium on Field-Programmable Gate Array`s
2002-02 | Conference poster
Source: Self-asserted source
Paul Molitor

Application of BDDs in Boolean Matching Techniques for Formal Logic Combinational Verification

International Journal on Software Tools for Technology Transfer
2001-05 | Journal article
Source: Self-asserted source
Paul Molitor

A Pipelined Architecture For Partitioned DWT Based Lossy Image Compression Using FPGAs

9th ACM International Symposium on Field-Programmable Gate Array`s
2001-02 | Conference paper
Source: Self-asserted source
Paul Molitor

K-Layer Straightline Crossing Minimization by Speeding up Sifting

8th Graph Drawing Conference
2000-09 | Conference paper
Source: Self-asserted source
Paul Molitor

Partitioned Wavelet-based Approach for Image Compression using FPGA`s

IEEE Custom Integrated Circuits Conference (CICC)
2000-05 | Conference paper
Source: Self-asserted source
Paul Molitor
grade
Preferred source (of 2)‎

Least Upper Bounds for the Size of OBDDs using Symmetries

IEEE Transactions on Computers
2000-04 | Journal article
Source: Self-asserted source
Paul Molitor
grade
Preferred source (of 2)‎

Prove that a Faulty Multiplier is Faulty!?

10th Great Lakes Symposium on VLSI (GLS-VLSI)
2000-03 | Conference paper
Source: Self-asserted source
Paul Molitor
Items per page:
Page 1 of 2