The following pages link to Ingo Wegener (Q171935):
Displaying 45 items.
- The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities (Q3885498) (← links)
- (Q3905208) (← links)
- (Q3912347) (← links)
- (Q3916365) (← links)
- Discrete Sequential Search with Positive Switch Cost (Q3964313) (← links)
- (Q3993546) (← links)
- (Q4016932) (← links)
- (Q4035664) (← links)
- (Q4036705) (← links)
- A Simple Modification of Xunrang and Yuzhang'S HEAPSORT Variant Improving its Complexity Significantly (Q4039039) (← links)
- (Q4216333) (← links)
- (Q4251042) (← links)
- On the Complexity of the Hidden Weighted Bit Function for Various BDD Models (Q4265532) (← links)
- (Q4331299) (← links)
- (Q4418669) (← links)
- The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions (Q4419798) (← links)
- Improving the variable ordering of OBDDs is NP-complete (Q4420841) (← links)
- (Q4436870) (← links)
- (Q4449717) (← links)
- (Q4460348) (← links)
- (Q4470521) (← links)
- Branching Programs and Binary Decision Diagrams (Q4485697) (← links)
- (Q4535010) (← links)
- Read-once projections and formal circuit verification with binary decision diagrams (Q4593955) (← links)
- On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics (Q4660566) (← links)
- (Q4699308) (← links)
- (Q4718221) (← links)
- (Q4728250) (← links)
- (Q4855385) (← links)
- (Q4885895) (← links)
- Tight bounds for blind search on the integers (Q4910723) (← links)
- Tight Bounds for Blind Search on the Integers and the Reals (Q4911109) (← links)
- (Q4938776) (← links)
- (Q4946045) (← links)
- (Q4946959) (← links)
- Comments on "A characterization of binary decision diagrams" (Q5375298) (← links)
- Switching functions whose monotone complexity (Q5402551) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431298) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431349) (← links)
- Exact OBDD Bounds for Some Fundamental Functions (Q5448645) (← links)
- (Q5708382) (← links)
- Logic versus Approximation (Q5712366) (← links)
- Automata, Languages and Programming (Q5716810) (← links)
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems (Q5929919) (← links)
- A comparison of free BDDs and transformed BDDs (Q5949487) (← links)
