Searching for authors named "Rainer Feldmann" – sorted by Relevance.
-
Fail High Reductions (Extended Abstract)
- Fail High Reductions Rainer Feldmann Department of Mathematics and Computer Science University
- Add To MetaCart
-
Computer Chess: Algorithms and Heuristics for a Deep Look into the Future
- Computer Chess: Algorithms and Heuristics for a Deep Look into the Future ? Rainer Feldmann
- Cited by 3 (2 self) – Add To MetaCart
-
Game Tree Search on Massively Parallel Systems
- by Rainer Feldmann Department of mathematics and computer science University of Paderborn Paderborn, Germany
- Cited by 41 (5 self) – Add To MetaCart
-
The Shuffle Exchange Network has a Hamiltonian Path
- The Shuffle Exchange Network has a Hamiltonian Path Rainer Feldmann Peter Mysliwietz Department
- Cited by 3 (1 self) – Add To MetaCart
-
Some development on the fully mixed nash equilibrium conjecture
- Some Development on the Fully Mixed Nash Equilibrium Conjecture ∗ Rainer Feldmann † Marios
- Cited by 1 (0 self) – Add To MetaCart
-
Controlled Conspiracy Number Search
- Controlled Conspiracy Number Search Ulf Lorenz, Valentin Rottmann, Rainer Feldmann, and Peter
- Cited by 2 (1 self) – Add To MetaCart
-
SAT-Based Techniques in System Synthesis
- Rainer Feldmann, Burkhard Monien AG-Monien, University of Paderborn (a) m0 (b) r0 m 1 m n r 1 r n p 0 p 1
- Cited by 1 (0 self) – Add To MetaCart
-
A Distributed Algorithm to Evaluate Quantified Boolean Formulae
- A Distributed Algorithm to Evaluate Quantified Boolean Formulae Rainer Feldmann, Burkhard Monien
- Cited by 41 (1 self) – Add To MetaCart
-
Studying Overheads in Massively Parallel Min/Max-Tree Evaluation (Extended Abstract)
- Studying Overheads in Massively Parallel Min/Max-Tree Evaluation (Extended Abstract) y Rainer
- Cited by 28 (3 self) – Add To MetaCart
-
A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract)
- A better upper bound on the bisection width of de Bruijn networks (extended abstract) Rainer
- Cited by 4 (0 self) – Add To MetaCart

