default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Molitor
Person information
- affiliation: Martin Luther University of Halle-Wittenberg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2008
[b6]Bernd Becker, Paul Molitor:
Technische Informatik - eine einführende Darstellung. Oldenbourg 2008, ISBN 978-3-486-58650-3, pp. I-XVI, 1-419- 2005
- [b5]Bernd Becker, Rolf Drechsler, Paul Molitor:
Technische Informatik - eine Einführung. Pearson Studium, Pearson Education 2005, ISBN 978-3-8273-7092-1, pp. 1-390 - 2004
- [b4]Paul Molitor, Jörg Ritter:
VHDL - eine Einführung. Pearson Studium 2004, ISBN 978-3-8273-7047-1, pp. 1-287 - 1999
- [b3]Paul Molitor, Christoph Scholl:
Datenstrukturen und effiziente Algorithmen für die Logiksynthese kombinatorischer Schaltungen. Teubner 1999, ISBN 978-3-519-02945-8, pp. 1-298 - 1989
- [b2]Reiner Kolla, Paul Molitor, Hans-Georg Osthof:
Einführung in den VLSI-Entwurf. Leitfäden und Monographien der Informatik, Teubner 1989, ISBN 978-3-519-02273-2, pp. 1-352 - 1986
- [b1]Paul Molitor:
Über die Bikategorie der logisch-topologischen Netze und ihre Semantik. Saarland University, Saarbrücken, Germany, 1986
Journal Articles
- 2023
- [j33]Natanael Arndt, Paul Molitor
, Ricardo Usbeck:
Machine learning applications. it Inf. Technol. 65(4-5): 139-141 (2023) - [j32]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): 330-346 (2023) - 2022
- [j31]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): 375-390 (2022) - 2020
- [j30]Paul Molitor, Jörg Ritter:
Digital methods for intertextuality studies. it Inf. Technol. 62(2): 49-51 (2020) - [j29]Marcus Pöckelmann, Janis Dähne, Jörg Ritter, Paul Molitor:
Fast paraphrase extraction in Ancient Greek literature. it Inf. Technol. 62(2): 75-89 (2020) - 2015
- [j28]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): 285-298 (2015) - [j27]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): 25-31 (2015) - [j26]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): 49-55 (2015) - [j25]Paul Molitor:
Reviewers 2013-2014. it Inf. Technol. 57(2): 144-145 (2015) - [j24]Martin Andert, Frank Berger, Paul Molitor, Jörg Ritter:
An optimized platform for capturing metadata of historical correspondence. Digit. Scholarsh. Humanit. 30(4): 471-480 (2015) - 2014
- [j23]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: 97-114 (2014) - [j22]Gerold Jäger, Changxing Dong, Boris Goldengorin, Paul Molitor, Dirk Richter:
A backbone based TSP heuristic for large instances. J. Heuristics 20(1): 107-124 (2014) - [j21]Paul Molitor:
Preface. it Inf. Technol. 56(4): 147 (2014) - 2011
- [j20]Paul Molitor:
Reviewer Thanks. it Inf. Technol. 53(1): 44- (2011) - 2008
- [j19]Paul Molitor:
Gutachter 2008. it Inf. Technol. 50(6): 410 (2008) - 2006
- [j18]Paul Molitor:
...was wird mit übrigens? it Inf. Technol. 48(4): 247 (2006) - 2005
- [j17]Paul Molitor:
Gutachter 2005. it Inf. Technol. 47(6): 366- (2005) - 2004
- [j16]Paul Molitor:
Gutachter 2004. it Inf. Technol. 46(6): 360- (2004) - 2003
- [j15]Martin Keim, Rolf Drechsler, Bernd Becker, Michael Martin, Paul Molitor:
Polynomial Formal Verification of Multipliers. Formal Methods Syst. Des. 22(1): 39-58 (2003) - [j14]Heinz Zemanek, Johannes Oldenbourg, Paul Molitor, Klaus Küspert, Kurt Rothermel:
Zum neuen Jahrgang. it Inf. Technol. 45(1): 3-5 (2003) - 2002
- [j13]Janett Mohnke, Paul Molitor, Sharad Malik:
Limits of Using Signatures for Permutation Independent Boolean Comparison. Formal Methods Syst. Des. 21(2): 167-191 (2002) - 2001
- [j12]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): 207-216 (2001) - 2000
- [j11]Laura Heinrich-Litan, Paul Molitor:
Least Upper Bounds for the Size of OBDDs Using Symmetry Properties. IEEE Trans. Computers 49(4): 360-368 (2000) - 1999
- [j10]Janett Mohnke, Paul Molitor, Sharad Malik:
Establishing latch correspondence for sequential circuits using distinguishing signatures. Integr. 27(1): 33-46 (1999) - [j9]Christoph Scholl, Dirk Möller, Paul Molitor, Rolf Drechsler:
BDD minimization using symmetries. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(2): 81-100 (1999) - 1995
- [j8]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): 1049-1066 (1995) - 1993
- [j7]Paul Molitor:
A hierarchy preserving hierarchical bottom-up 2-layer wiring algorithm with respect to via minimization. Integr. 15(1): 73-95 (1993) - 1991
- [j6]Paul Molitor:
A Survey on Wiring. J. Inf. Process. Cybern. 27(1): 3-19 (1991) - [j5]Michael Kaufmann, Paul Molitor:
Minimal stretching of a layout to ensure 2-layer wirability. Integr. 12(3): 339-352 (1991) - 1990
- [j4]Paul Molitor:
Constrained via minimization for systolic arrays. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(5): 537-542 (1990) - 1989
- [j3]Reiner Kolla, Paul Molitor:
A note on hierarchical layer-assignment. Integr. 7(3): 213-230 (1989) - 1986
- [j2]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): 38-47 (1986) - [j1]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): 72-82 (1986)
Conference and Workshop Papers
- 2020
- [c39]Paul Molitor, Gerold Necker, Marcus Pöckelmann, Bill Rebiger, Jörg Ritter:
Keter Shem Ṭov - Prozessualisierung eines Editionsprojekts mit 100 Textzeugen. DHd 2020 - 2018
- [c38]Matthias Pfuhl, Jörg Ritter, Paul Molitor:
Finding the Redundant Gates in Reversible Circuits. RC 2018: 205-219 - 2014
- [c37]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 - 2013
- [c36]Martin Andert, Jörg Ritter, Paul Molitor:
Optimized platform for capturing metadata of historical correspondences. DH 2013: 88 - [c35]André Gießler, Jörg Ritter, Paul Molitor:
Model Checking for PLC based Railway Interlocking Systems. MBMV 2013: 71-82 - 2011
- [c34]André Gießler, Jörg Ritter, Paul Molitor:
BDD-based Analysis of Test Cases for PLC-based Railway Interlocking Systems. MBMV 2011: 133-143 - 2010
- [c33]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: 119-130 - 2009
- [c32]Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor:
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges. AAIM 2009: 175-187 - [c31]Changxing Dong, Christian Ernst, Gerold Jäger, Dirk Richter, Paul Molitor:
Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones. CTW 2009: 3-6 - 2008
- [c30]Gerold Jäger, Paul Molitor:
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order. COCOA 2008: 211-224 - 2007
- [c29]Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor:
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP. CAAN 2007: 99-111 - [c28]Changxing Dong, Paul Molitor:
What Graphs can be Efficiently Represented by BDDs? ICCTA 2007: 128-134 - 2006
- [c27]Boris Goldengorin, Gerold Jäger, Paul Molitor:
Some Basics on Tolerances. AAIM 2006: 194-206 - [c26]Boris Goldengorin, Gerold Jäger, Paul Molitor:
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. CAAN 2006: 86-97 - 2002
- [c25]Robby Schönfeld, Paul Molitor:
What are the samples for learning efficient routing heuristics? [MCM routing]. APCCAS (1) 2002: 267-272 - 2001
- [c24]Jörg Ritter, Paul Molitor:
A pipelined architecture for partitioned DWT based lossy image compression using FPGA's. FPGA 2001: 201-206 - 2000
- [c23]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: 61-66 - [c22]Joerg Ritter, Paul Molitor:
A partitioned wavelet-based approach for image compression using FPGA's. CICC 2000: 547-550 - [c21]Wolfgang Günther, Robby Schönfeld, Bernd Becker, Paul Molitor:
k-Layer Straightline Crossing Minimization by Speeding Up Sifting. GD 2000: 253-258 - [c20]Sandro Wefel, Paul Molitor:
Prove that a faulty multiplier is faulty!? ACM Great Lakes Symposium on VLSI 2000: 43-46 - [c19]Riccardo Forth, Paul Molitor:
Permutation Independent Comparison of Pseudo Boolean Functions. MBMV 2000: 79-88 - 1999
- [c18]Christian Matuszewski, Robby Schönfeld, Paul Molitor:
Using Sifting for k -Layer Straightline Crossing Minimization. GD 1999: 217-224 - 1998
- [c17]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: 273-278 - 1997
- [c16]Christoph Scholl, S. Melchior, Günter Hotz, Paul Molitor:
Minimizing ROBDD sizes of incompletely specified Boolean functionsby exploiting strong symmetries. ED&TC 1997: 229-234 - [c15]Martin Keim, Michael Martin, Bernd Becker, Rolf Drechsler, Paul Molitor:
Polynomial Formal Verification of Multipliers. VTS 1997: 150-157 - 1996
- [c14]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: 126- - [c13]Tolga Asveren, Paul Molitor:
New Crossover Methods For Sequencing Problems. PPSN 1996: 290-299 - 1995
- [c12]Janett Mohnke, Paul Molitor, Sharad Malik:
Limits of using signatures for permutation independent Boolean comparison. ASP-DAC 1995 - [c11]Christoph Scholl, Paul Molitor:
Communication based FPGA synthesis for multi-output Boolean functions. ASP-DAC 1995 - [c10]Ines Peters, Paul Molitor:
Priority driven channel pin assignment. Great Lakes Symposium on VLSI 1995: 132- - 1994
- [c9]Paul Molitor, Christoph Scholl:
Communication based multilevel synthesis for multi-output Boolean functions. Great Lakes Symposium on VLSI 1994: 101-104 - [c8]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: 149-154 - 1993
- [c7]Bernd Becker, Rolf Drechsler, Paul Molitor:
On the implementation of an efficient performance driven generator for conditional-sum-adders. EURO-DAC 1993: 402-407 - 1992
- [c6]Bernd Becker, Paul Molitor:
A performance driven generator for efficient testable conditional-sum-adders. EURO-DAC 1992: 370-375 - [c5]Michael Kaufmann, Paul Molitor, Wolfgang Vogelgesang:
Performance Driven k-Layer Wiring. STACS 1992: 489-500 - 1990
- [c4]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: 174-179 - 1987
- [c3]Bernd Becker, Günter Hotz, Reiner Kolla, Paul Molitor, Hans-Georg Osthof:
Hierarchical Design Based on a Calculus of Nets. DAC 1987: 649-653 - [c2]Paul Molitor:
On the Contact-Minimization-Problem. STACS 1987: 420-431 - 1986
- [c1]Günter Hotz, Reiner Kolla, Paul Molitor:
On Network Algebras and Recursive Equations. Graph-Grammars and Their Application to Computer Science 1986: 250-261
Parts in Books or Collections
- 1992
- [p1]Paul Molitor:
A Hierarchy Preserving Hierarchical Bottom-Up 2-layer Wiring Algorithm with Respect to Via Minimization. Informatik 1992: 333-348
Editorship
- 2019
- [e14]Sven Apel, Abraham Bernstein, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Björn Scheuermann, Nicole Schweikardt, Myra Spiliopoulou, Sabine Süsstrunk, Klaus Wehrle:
Ausgezeichnete Informatikdissertationen 2018. LNI D-19, GI 2019, ISBN 978-3-88579-977-1 [contents] - 2018
- [e13]Sven Apel, Abraham Bernstein, Wolfgang Effelsberg, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Björn Scheuermann, Myra Spiliopoulou, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2017. LNI D-18, GI 2018, ISBN 978-3-88579-977-1 [contents] - 2017
- [e12]Abraham Bernstein, Wolfgang Effelsberg, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2016. LNI D-17, GI 2017, ISBN 978-3-88579-976-4 [contents] - 2016
- [e11]Abraham Bernstein, Wolfgang Effelsberg, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Harald Störrle, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2015. LNI D-16, GI 2016, ISBN 978-3-88579-975-7 [contents] - 2015
- [e10]Abraham Bernstein, Wolfgang Effelsberg, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Harald Störrle, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2014. LNI D-15, GI 2015, ISBN 978-3-88579-419-6 [contents] - 2014
- [e9]Abraham Bernstein, Wolfgang Effelsberg, Steffen Hölldobler, Hans-Peter Lenhof, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Harald Störrle, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2013. LNI D-14, GI 2014, ISBN 978-3-88579-418-9 [contents] - 2012
- [e8]Abraham Bernstein, Steffen Hölldobler, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2011. LNI D-12, GI 2012, ISBN 978-3-88579-416-5 [contents] - [e7]Abraham Bernstein, Wolfgang Effelsberg, Steffen Hölldobler, Hans-Peter Lenhof, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Harald Störrle, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2012. LNI D-13, GI 2012, ISBN 978-3-88579-417-2 [contents] - 2011
- [e6]Abraham Bernstein, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2010. LNI D-11, GI 2011, ISBN 978-3-88579-415-8 [contents] - 2010
- [e5]Abraham Bernstein, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2009. LNI D-10, GI 2010, ISBN 978-3-88579-414-1 [contents] - [e4]Abraham Bernstein, Thomas Dreier, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2008. LNI D-9, GI 2010, ISBN 978-3-88579-413-4 [contents] - 2008
- [e3]Abraham Bernstein, Thomas Dreier, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2007. LNI D-8, GI 2008, ISBN 978-3-88579-412-7 [contents] - 2006
- [e2]Abraham Bernstein, Thomas Dreier, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2005. LNI D-6, GI 2006, ISBN 978-3-88579-410-3 [contents] - 2005
- [e1]Thomas Dreier, Oliver Günther, Steffen Hölldobler, Klaus-Peter Löhr, Paul Molitor, Rüdiger Reischuk, Dietmar Saupe, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2004. LNI D-5, GI 2005, ISBN 3-88579-409-8 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
