Distributed Game-Tree Search. - Rainer Feldmann; Burkhard Monien; Peter Mysliwietz; Oliver Vornberger (J. Int. Comput. Games Assoc., 1989)

Response to a Comment on 'Distributed Game-Tree Search'. - Rainer Feldmann; Burkhard Monien; Peter Mysliwietz; Oliver Vornberger (J. Int. Comput. Games Assoc., 1990)

Report on the 1st International Paderborn Computer Chess Championship. - Anne Marie Burton; Peter Mysliwietz; Rainer Feldmann (J. Int. Comput. Games Assoc., 1991)

Distributed Game Tree Search on a Massively Parallel System. - Rainer Feldmann; Peter Mysliwietz; Burkhard Monien (Data Structures and Efficient Algorithms, 1992)

Optimal Algorithms for Disemination of Information in Generalized Communication Modes. - Rainer Feldmann; Juraj Hromkovic; Seshu Madhavapeddy; Burkhard Monien; Peter Mysliwietz (PARLE, 1992)

The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network. - Rainer Feldmann; Walter Unger (Parallel Process. Lett., 1992)

Spielbaumsuche mit massiv parallelen Systemen. - Rainer Feldmann (1993)

Parallel Architectures: Design and Efficient Use. - Burkhard Monien; Rainer Feldmann; Ralf Klasing; Reinhard Lüling (STACS, 1993)

Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation. - Rainer Feldmann; Peter Mysliwietz; Burkhard Monien (SPAA, 1994)

Optimal algorithms for dissemination of information in generalized communication modes. - Rainer Feldmann; Juraj Hromkovic; Seshu Madhavapeddy; Burkhard Monien; Peter Mysliwietz (Discret. Appl. Math., 1994)

Efficient Use of Parallel & Distributed Systems: From Theory to Practice. - Burkhard Monien; Ralf Diekmann; Rainer Feldmann; Ralf Klasing; Reinhard Lüling; Knut Menzel; Thomas Römke; Ulf-Peter Schroeder (Computer Science Today, 1995)

13th World Microcomputer-Chess Championship. - Rainer Feldmann (J. Int. Comput. Games Assoc., 1995)

Controlled Conspiracy-Number Search. - Ulf Lorenz; Valentin Rottmann; Rainer Feldmann; Peter Mysliwietz (J. Int. Comput. Games Assoc., 1995)

Verteilte Spielbaumsuche. - Rainer Feldmann; Burkhard Monien; Peter Mysliwietz (Informationstechnik Tech. Inform., 1995)

The Shuffle Exchange Network has a Hamiltonian Path. - Rainer Feldmann; Peter Mysliwietz (Math. Syst. Theory, 1996)

Computer Chess: Algorithms and Heuristics for a Deep Look into the Future. - Rainer Feldmann (SOFSEM, 1997)

A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract). - Rainer Feldmann; Burkhard Monien; Peter Mysliwietz; Stefan Tschöke (STACS, 1997)

The 9th World Computer-Chess Championship. - Burkhard Monien; Rainer Feldmann (J. Int. Comput. Games Assoc., 1998)

More Information on the 9th World Computer-Chess Championship. - Burkhard Monien; Rainer Feldmann; H. Jaap van den Herik (J. Int. Comput. Games Assoc., 1999)

The Latest Information on the 9th World Computer-Chess Championship. - Burkhard Monien; Rainer Feldmann; H. Jaap van den Herik (J. Int. Comput. Games Assoc., 1999)

A Distributed Algorithm to Evaluate Quantified Boolean Formulae. - Rainer Feldmann; Burkhard Monien; Stefan Schamberger (AAAI/IAAI, 2000)

Topic 06: Complexity Theory and Algorithms. - Gianfranco Bilardi; Rainer Feldmann; Kieran T. Herley; Bruce M. Maggs (Euro-Par, 2001)

Discrete Optimization. - Rainer Feldmann; Catherine Roucairol (Euro-Par, 2002)

The Aircraft Sequencing Problem. - Torsten Fahle; Rainer Feldmann; Silvia Götz; Sven Grothklags; Burkhard Monien (Computer Science in Perspective, 2003)

SAT-Based Techniques in System Synthesis. - Christian Haubelt; Jürgen Teich; Rainer Feldmann; Burkhard Monien (DATE, 2003)

Fault Tolerances Analysis of Distributed Reconfigurable Systems Using SAT-Based Techniques. - Rainer Feldmann; Christian Haubelt; Burkhard Monien; Jürgen Teich (FPL, 2003)

Nashification and the Coordination Ratio for a Selfish Routing Game. - Rainer Feldmann; Martin Gairing; Thomas Lücking 001; Burkhard Monien; Manuel Rode (ICALP, 2003)

Selfish Routing in Non-Cooperative Networks: A Survey. - Rainer Feldmann; Martin Gairing; Thomas Lücking 001; Burkhard Monien; Manuel Rode (Bull. EATCS, 2003)

Selfish Routing of Splittable Flow with Respect to Maximum Congestion. - Rainer Feldmann (Computing and Markets, 2005)

Nash Equilibria for Voronoi Games on Transitive Graphs. - Rainer Feldmann; Marios Mavronicolas; Burkhard Monien (WINE, 2009)

Facets of the Fully Mixed Nash Equilibrium Conjecture. - Rainer Feldmann; Marios Mavronicolas; Andreas Pieris (Theory Comput. Syst., 2010)