Rainer Feldmann

Rainer Feldmann, Marios Mavronicolas, Andreas Pieris: Facets of the Fully Mixed Nash Equilibrium Conjecture. Theory Comput. Syst. 47(1): 60-112 (2010)

Rainer Feldmann, Marios Mavronicolas, Burkhard Monien: Nash Equilibria for Voronoi Games on Transitive Graphs. WINE 2009: 280-291

Rainer Feldmann, Marios Mavronicolas, Andreas Pieris: Facets of the Fully Mixed Nash Equilibrium Conjecture. SAGT 2008: 145-157

Rainer Feldmann: Selfish Routing of Splittable Flow with Respect to Maximum Congestion. Computing and Markets 2005

Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode: Selfish Routing in Non-Cooperative Networks: A Survey. Bulletin of the EATCS 81: 137-164 (2003)

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

Christian Haubelt, Jürgen Teich, Rainer Feldmann, Burkhard Monien: SAT-Based Techniques in System Synthesis. DATE 2003: 11168-11169

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

Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode: Nashification and the Coordination Ratio for a Selfish Routing Game. ICALP 2003: 514-526

Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode: Selfish Routing in Non-cooperative Networks: A Survey. MFCS 2003: 21-45

Rainer Feldmann, Catherine Roucairol: Discrete Optimization. Euro-Par 2002: 911

Burkhard Monien, Rainer Feldmann (Eds.): Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002, Proceedings. Lecture Notes in Computer Science 2400, Springer 2002, isbn 3-540-44049-6

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

Rainer Feldmann, Burkhard Monien, Stefan Schamberger: A Distributed Algorithm to Evaluate Quantified Boolean Formulae. AAAI/IAAI 2000: 285-290

Rainer Feldmann: Computer Chess: Algorithms and Heuristics for a Deep Look into the Future. SOFSEM 1997: 1-18

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

Rainer Feldmann, Peter Mysliwietz: The Shuffle Exchange Network has a Hamiltonian Path. Mathematical Systems Theory 29(5): 471-485 (1996)

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

Rainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz: Optimal algorithms for dissemination of information in generalized communication modes. Discrete Applied Mathematics 53(1-3): 55-78 (1994)

Rainer Feldmann, Peter Mysliwietz, Burkhard Monien: Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation. SPAA 1994: 94-103

Rainer Feldmann: Spielbaumsuche mit massiv parallelen Systemen. Universität Paderborn 1993, pp. 1-160

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

Rainer Feldmann, Walter Unger: The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network. Parallel Processing Letters 2: 13-19 (1992)

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

Rainer Feldmann, Peter Mysliwietz: The Shuffle Exchange Network has a Hamiltonian Path. MFCS 1992: 246-254

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