dblp.uni-trier.dewww.uni-trier.de

Paul Molitor

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
41EEGerold Jäger, Paul Molitor: Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order. COCOA 2008: 211-224
40 Paul Molitor: Gutachter 2008. it - Information Technology 50(6): 410 (2008)
2007
39EEDirk 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
38EEChangxing Dong, Paul Molitor: What Graphs can be Efficiently Represented by BDDs? ICCTA 2007: 128-134
2006
37EEBoris Goldengorin, Gerold Jäger, Paul Molitor: Some Basics on Tolerances. AAIM 2006: 194-206
36EEBoris Goldengorin, Gerold Jäger, Paul Molitor: Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. CAAN 2006: 86-97
35EEPaul Molitor: ...was wird mit übrigens? it - Information Technology 48(4): 247 (2006)
2005
34EEPaul Molitor: Gutachter 2005. it - Information Technology 47(6): 366- (2005)
2004
33EEPaul Molitor: Gutachter 2004. it - Information Technology 46(6): 360- (2004)
2003
32 Martin Keim, Rolf Drechsler, Bernd Becker, Michael Martin, Paul Molitor: Polynomial Formal Verification of Multipliers. Formal Methods in System Design 22(1): 39-58 (2003)
31EEHeinz Zemanek, Johannes Oldenbourg, Paul Molitor, Klaus Küspert, Kurt Rothermel: Zum neuen Jahrgang. it - Information Technology 45(1): 3-5 (2003)
2002
30EERobby Schönfeld, Paul Molitor: What are the samples for learning efficient routing heuristics? [MCM routing]. APCCAS (1) 2002: 267-272
29 Janett Mohnke, Paul Molitor, Sharad Malik: Limits of Using Signatures for Permutation Independent Boolean Comparison. Formal Methods in System Design 21(2): 167-191 (2002)
2001
28EEJörg Ritter, Paul Molitor: A pipelined architecture for partitioned DWT based lossy image compression using FPGA's. FPGA 2001: 201-206
27EEJanett Mohnke, Paul Molitor, Sharad Malik: Application of BDDs in Boolean matching techniques for formal logic combinational verification. STTT 3(2): 207-216 (2001)
2000
26EESandro Wefel, Paul Molitor: Prove that a faulty multiplier is faulty!? ACM Great Lakes Symposium on VLSI 2000: 43-46
25EERiccardo 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
24EEWolfgang Günther, Robby Schönfeld, Bernd Becker, Paul Molitor: k-Layer Straightline Crossing Minimization by Speeding Up Sifting. Graph Drawing 2000: 253-258
23EELaura Heinrich-Litan, Paul Molitor: Least Upper Bounds for the Size of OBDDs Using Symmetry Properties. IEEE Trans. Computers 49(4): 360-368 (2000)
1999
22EEChristian Matuszewski, Robby Schönfeld, Paul Molitor: Using Sifting for k -Layer Straightline Crossing Minimization. Graph Drawing 1999: 217-224
21EEChristoph Scholl, Dirk Möller, Paul Molitor, Rolf Drechsler: BDD minimization using symmetries. IEEE Trans. on CAD of Integrated Circuits and Systems 18(2): 81-100 (1999)
20EEJanett Mohnke, Paul Molitor, Sharad Malik: Establishing latch correspondence for sequential circuits using distinguishing signatures. Integration 27(1): 33-46 (1999)
1998
19EELaura 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
18EEChristoph Scholl, S. Melchior, Günter Hotz, Paul Molitor: Minimizing ROBDD sizes of incompletely specified Boolean functionsby exploiting strong symmetries. ED&TC 1997: 229-234
17EEMartin Keim, Michael Martin, Bernd Becker, Rolf Drechsler, Paul Molitor: Polynomial Formal Verification of Multipliers. VTS 1997: 150-157
1996
16EELaura 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-
15 Tolga Asveren, Paul Molitor: New Crossover Methods For Sequencing Problems. PPSN 1996: 290-299
1995
14EEChristoph Scholl, Paul Molitor: Communication based FPGA synthesis for multi-output Boolean functions. ASP-DAC 1995
13EEJanett Mohnke, Paul Molitor, Sharad Malik: Limits of using signatures for permutation independent Boolean comparison. ASP-DAC 1995
12EEInes Peters, Paul Molitor: Priority driven channel pin assignment. Great Lakes Symposium on VLSI 1995: 132-
11EEBernd Becker, Rolf Drechsler, Paul Molitor: On the generation of area-time optimal testable adders. IEEE Trans. on CAD of Integrated Circuits and Systems 14(9): 1049-1066 (1995)
1994
10 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
1992
9 Michael Kaufmann, Paul Molitor, Wolfgang Vogelgesang: Performance Driven k-Layer Wiring. STACS 1992: 489-500
1991
8 Paul Molitor: A Survey on Wiring. Elektronische Informationsverarbeitung und Kybernetik 27(1): 3-19 (1991)
1990
7EEBernd 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
6EEPaul Molitor: Constrained via minimization for systolic arrays. IEEE Trans. on CAD of Integrated Circuits and Systems 9(5): 537-542 (1990)
1987
5EEBernd Becker, Günter Hotz, Reiner Kolla, Paul Molitor, Hans-Georg Osthof: Hierarchical Design Based on a Calculus of Nets. DAC 1987: 649-653
4 Paul Molitor: On the Contact-Minimization-Problem. STACS 1987: 420-431
1986
3 Günter Hotz, Reiner Kolla, Paul Molitor: On Network Algebras and Recursive Equations. Graph-Grammars and Their Application to Computer Science 1986: 250-261
2 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)
1 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)

Coauthor Index

1Tolga Asveren [15]
2Bernd Becker [1] [2] [5] [7] [11] [17] [24] [32]
3Thomas Burch [7]
4Changxing Dong [38]
5Rolf Drechsler [11] [17] [21] [32]
6Ursula Fissgus [19]
7Riccardo Forth [25]
8Boris Goldengorin [36] [37] [39]
9Wolfgang Günther [24]
10Laura Heinrich-Litan [16] [19] [23]
11Günter Hotz [1] [2] [3] [5] [7] [18]
12Gerold Jäger [36] [37] [39] [41]
13Michael Kaufmann [9]
14Martin Keim [17] [32]
15D. Kiel [7]
16Reiner Kolla [1] [2] [3] [5] [7]
17Klaus Küspert [31]
18Sharad Malik [13] [20] [27] [29]
19Michael Martin [17] [32]
20Christian Matuszewski [22]
21S. Melchior [18]
22Janett Mohnke [13] [20] [27] [29]
23Dirk Möller [16] [21]
24Johannes Oldenbourg [31]
25Hans-Georg Osthof [5] [7]
26Ines Peters [12]
27Gisela Pitsch [7]
28Thomas Rauber [19]
29Dirk Richter [39]
30Jörg Ritter [28]
31Kurt Rothermel [31]
32Christoph Scholl [14] [18] [21]
33Robby Schönfeld [22] [24] [30]
34Uwe Sparmann [7] [10]
35St. Sutter [19]
36Wolfgang Vogelgesang [9]
37Dorothea Wagner [10]
38Sandro Wefel [26]
39Heinz Zemanek [31]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)