Searching for authors named "Paul Molitor" – sorted by Relevance.
-
A Hierarchy Preserving Hierarchical Bottom-Up 2-Layer Wiring Algorithm With Respect to Via Minimization
- minimization (appeared: INTEGRATION, the VLSI journal 15:73-95, 1993) Paul Molitor y Abstract Here
- Cited by 3 (1 self) – Add To MetaCart
-
What Are the Samples for Learning Efficient Routing Heuristics?
- with the Institute for Computer Science of the University Freiburg i.Br. Robby Schönfeld and Paul Molitor Institute
- Add To MetaCart
-
Communication Based FPGA Synthesis for Multi-Output Boolean Functions
- Communication Based FPGA Synthesis for Multi-Output Boolean Functions Christoph Scholl Paul
- Cited by 9 (2 self) – Add To MetaCart
-
Efficient ROBDD based computation of common decomposition functions of multi-output boolean functions
- functions Christoph Scholl y , Paul Molitor z y Universitat des Saarlandes Department of Computer
- Cited by 4 (0 self) – Add To MetaCart
-
A pipelined architecture for partitioned DWT based lossy image compression using FPGA's
- , Monterey, CA. Copyright 2001 ACM 1-58113-341-3/01/0002 ..$5.00 Paul Molitor Institute for Computer Science
- Cited by 7 (0 self) – Add To MetaCart
-
New Crossover Methods for Sequencing Problems
- Solving from Nature 1996 1 New Crossover Methods for Sequencing Problems 1 Tolga A��sveren and Paul
- Cited by 2 (0 self) – Add To MetaCart
-
Least Upper Bounds for the Size of OBDDs Using Symmetry Properties
- of OBDDs Using Symmetry Properties Laura Heinrich-Litan and Paul Molitor, Member, IEEE AbstractÐThis paper
- Cited by 1 (0 self) – Add To MetaCart
-
Communication Based Multilevel Synthesis for Multi-output Boolean Functions
- Communication Based Multilevel Synthesis for Multi-output Boolean Functions Paul Molitor Christoph Scholl
- Cited by 6 (4 self) – Add To MetaCart
-
Two-Layer Wiring With Pin Preassignments is Easier If the Power Supply Nets Are Already Generated
- -layer wiring with pin preassignments is easier if the power supply nets are already generated Paul Molitor
- Add To MetaCart
-
Minimizing ROBDD Sizes of Incompletely Specied Boolean Functions by Exploiting Strong Symmetries
- � Christoph Scholl y Stephan Melchior z G�unter Hotz z Paul Molitor x y Institute of Computer Science z
- Add To MetaCart

