Rainer Feldmann

According to our database, Rainer Feldmann authored at least 31 papers between 1989 and 2010.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2010

Facets of the Fully Mixed Nash Equilibrium Conjecture.

Rainer Feldmann, Marios Mavronicolas, Andreas Pieris

Theory Comput. Syst., 2010

2009

Nash Equilibria for Voronoi Games on Transitive Graphs.

Rainer Feldmann, Marios Mavronicolas, Burkhard Monien

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

2005

Selfish Routing of Splittable Flow with Respect to Maximum Congestion.

Rainer Feldmann

Proceedings of the Computing and Markets, 3.-7. January 2005, 2005

2003

Selfish Routing in Non-Cooperative Networks: A Survey.

Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode

Bull. EATCS, 2003

Nashification and the Coordination Ratio for a Selfish Routing Game.

Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Fault Tolerances Analysis of Distributed Reconfigurable Systems Using SAT-Based Techniques.

Rainer Feldmann, Christian Haubelt, Burkhard Monien, Jürgen Teich

Proceedings of the Field Programmable Logic and Application, 13th International Conference, 2003

SAT-Based Techniques in System Synthesis.

Christian Haubelt, Jürgen Teich, Rainer Feldmann, Burkhard Monien

Proceedings of the 2003 Design, 2003

The Aircraft Sequencing Problem.

Torsten Fahle, Rainer Feldmann, Silvia Götz, Sven Grothklags, Burkhard Monien

Proceedings of the Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, 2003

2002

Discrete Optimization.

Rainer Feldmann, Catherine Roucairol

Proceedings of the Euro-Par 2002, 2002

2001

Topic 06: Complexity Theory and Algorithms.

Gianfranco Bilardi, Rainer Feldmann, Kieran T. Herley, Bruce M. Maggs

Proceedings of the Euro-Par 2001: Parallel Processing, 2001

2000

A Distributed Algorithm to Evaluate Quantified Boolean Formulae.

Rainer Feldmann, Burkhard Monien, Stefan Schamberger

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999

The Latest Information on the 9^th World Computer-Chess Championship.

Burkhard Monien, Rainer Feldmann, H. Jaap van den Herik

J. Int. Comput. Games Assoc., 1999

More Information on the 9^th World Computer-Chess Championship.

Burkhard Monien, Rainer Feldmann, H. Jaap van den Herik

J. Int. Comput. Games Assoc., 1999

1998

The 9^th World Computer-Chess Championship.

Burkhard Monien, Rainer Feldmann

J. Int. Comput. Games Assoc., 1998

1997

A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract).

Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Stefan Tschöke

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Computer Chess: Algorithms and Heuristics for a Deep Look into the Future.

Rainer Feldmann

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

1996

The Shuffle Exchange Network has a Hamiltonian Path.

Rainer Feldmann, Peter Mysliwietz

Math. Syst. Theory, 1996

1995

Verteilte Spielbaumsuche.

Rainer Feldmann, Burkhard Monien, Peter Mysliwietz

Informationstechnik Tech. Inform., 1995

Controlled Conspiracy-Number Search.

Ulf Lorenz, Valentin Rottmann, Rainer Feldmann, Peter Mysliwietz

J. Int. Comput. Games Assoc., 1995

13th World Microcomputer-Chess Championship.

Rainer Feldmann

J. Int. Comput. Games Assoc., 1995

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

Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

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

Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation.

Rainer Feldmann, Peter Mysliwietz, Burkhard Monien

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

1993

Parallel Architectures: Design and Efficient Use.

Burkhard Monien, Rainer Feldmann, Ralf Klasing, Reinhard Lüling

Proceedings of the STACS 93, 1993

Spielbaumsuche mit massiv parallelen Systemen.

Rainer Feldmann

PhD thesis, 1993

1992

The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network.

Rainer Feldmann, Walter Unger

Parallel Process. Lett., 1992

Optimal Algorithms for Disemination of Information in Generalized Communication Modes.

Rainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz

Proceedings of the PARLE '92: Parallel Architectures and Languages Europe, 1992

Distributed Game Tree Search on a Massively Parallel System.

Rainer Feldmann, Peter Mysliwietz, Burkhard Monien

Proceedings of the Data Structures and Efficient Algorithms, 1992

1991

Report on the 1st International Paderborn Computer Chess Championship.

Anne Marie Burton, Peter Mysliwietz, Rainer Feldmann

J. Int. Comput. Games Assoc., 1991

1990

Response to a Comment on 'Distributed Game-Tree Search'.

Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Oliver Vornberger

J. Int. Comput. Games Assoc., 1990

1989

Distributed Game-Tree Search.

Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Oliver Vornberger

J. Int. Comput. Games Assoc., 1989