The following pages link to Paul Molitor (Q698097):
Displayed 23 items.
- Limits of using signatures for permutation independent Boolean comparison (Q698098) (← links)
- A logic-topological calculus for the construction of integrated circuits. I (Q1088971) (← links)
- A logic-topological calculus for the construction of integrated circuits. II. (Q1096590) (← links)
- Application of BDDs in Boolean matching techniques for formal logic combinational verification (Q1606811) (← links)
- Finding the redundant gates in reversible circuits (Q1796385) (← links)
- A hierarchy preserving hierarchical bottom-up 2-layer wiring algorithm with respect to via minimization (Q3139911) (← links)
- Client Hardware-Token Based Single Sign-On over Several Servers without Trusted Online Third Party Server (Q3558776) (← links)
- Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction (Q3578366) (← links)
- Technische Informatik (Q3619792) (← links)
- (Q3775485) (← links)
- (Q3783975) (← links)
- (Q3787931) (← links)
- Establishing latch correspondence for sequential circuits using distinguishing signatures (Q4225374) (← links)
- (Q4230678) (← links)
- (Q4472315) (← links)
- Least upper bounds for the size of OBDDs using symmetry properties (Q4571359) (← links)
- (Q4677783) (← links)
- (Q4825215) (← links)
- Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP (Q5385935) (← links)
- Some Basics on Tolerances (Q5434399) (← links)
- Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP (Q5458509) (← links)
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order (Q5505660) (← links)
- (Q5750822) (← links)