default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRainer Feldmann
Person information
- affiliation: University of Paderborn, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1993
[b1]Rainer Feldmann:
Spielbaumsuche mit massiv parallelen Systemen. Universität Paderborn, 1993, pp. 1-160
Journal Articles
- 2010
- [j14]Rainer Feldmann, Marios Mavronicolas
, Andreas Pieris:
Facets of the Fully Mixed Nash Equilibrium Conjecture. Theory Comput. Syst. 47(1): 60-112 (2010) - 2003
- [j13]Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode:
Selfish Routing in Non-Cooperative Networks: A Survey. Bull. EATCS 81: 137-164 (2003) - 1999
- [j12]Burkhard Monien, Rainer Feldmann, H. Jaap van den Herik:
More Information on the 9th World Computer-Chess Championship. J. Int. Comput. Games Assoc. 22(1): 47-53 (1999) - [j11]Burkhard Monien, Rainer Feldmann, H. Jaap van den Herik:
The Latest Information on the 9th World Computer-Chess Championship. J. Int. Comput. Games Assoc. 22(2): 115 (1999) - 1998
- [j10]Burkhard Monien, Rainer Feldmann:
The 9th World Computer-Chess Championship. J. Int. Comput. Games Assoc. 21(4): 266 (1998) - 1996
- [j9]Rainer Feldmann, Peter Mysliwietz:
The Shuffle Exchange Network has a Hamiltonian Path. Math. Syst. Theory 29(5): 471-485 (1996) - 1995
- [j8]Ulf Lorenz, Valentin Rottmann, Rainer Feldmann, Peter Mysliwietz:
Controlled Conspiracy-Number Search. J. Int. Comput. Games Assoc. 18(3): 135-147 (1995) - [j7]Rainer Feldmann:
13th World Microcomputer-Chess Championship. J. Int. Comput. Games Assoc. 18(4): 236-245 (1995) - [j6]Rainer Feldmann, Burkhard Monien, Peter Mysliwietz:
Verteilte Spielbaumsuche. Informationstechnik Tech. Inform. 37(2): 7-11 (1995) - 1994
- [j5]Rainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz:
Optimal algorithms for dissemination of information in generalized communication modes. Discret. Appl. Math. 53(1-3): 55-78 (1994) - 1992
- [j4]Rainer Feldmann, Walter Unger:
The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network. Parallel Process. Lett. 2: 13-19 (1992) - 1991
- [j3]Anne Marie Burton, Peter Mysliwietz, Rainer Feldmann:
Report on the 1st International Paderborn Computer Chess Championship. J. Int. Comput. Games Assoc. 14(4): 226-227 (1991) - 1990
- [j2]Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Oliver Vornberger:
Response to a Comment on 'Distributed Game-Tree Search'. J. Int. Comput. Games Assoc. 13(1): 20-21 (1990) - 1989
- [j1]Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Oliver Vornberger:
Distributed Game-Tree Search. J. Int. Comput. Games Assoc. 12(2): 65-73 (1989)
Conference and Workshop Papers
- 2009
- [c17]Rainer Feldmann, Marios Mavronicolas, Burkhard Monien:
Nash Equilibria for Voronoi Games on Transitive Graphs. WINE 2009: 280-291 - 2008
- [c16]Rainer Feldmann, Marios Mavronicolas, Andreas Pieris:
Facets of the Fully Mixed Nash Equilibrium Conjecture. SAGT 2008: 145-157 - 2003
- [c15]Torsten Fahle, Rainer Feldmann, Silvia Götz, Sven Grothklags, Burkhard Monien:
The Aircraft Sequencing Problem. Computer Science in Perspective 2003: 152-166 - [c14]Christian Haubelt, Jürgen Teich, Rainer Feldmann, Burkhard Monien:
SAT-Based Techniques in System Synthesis. DATE 2003: 11168-11169 - [c13]Rainer Feldmann, Christian Haubelt, Burkhard Monien, Jürgen Teich:
Fault Tolerances Analysis of Distributed Reconfigurable Systems Using SAT-Based Techniques. FPL 2003: 478-487 - [c12]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 - [c11]Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode:
Selfish Routing in Non-cooperative Networks: A Survey. MFCS 2003: 21-45 - 2002
- [c10]Rainer Feldmann, Catherine Roucairol:
Discrete Optimization. Euro-Par 2002: 911 - 2001
- [c9]Gianfranco Bilardi, Rainer Feldmann, Kieran T. Herley, Bruce M. Maggs:
Topic 06: Complexity Theory and Algorithms. Euro-Par 2001: 332 - 2000
- [c8]Rainer Feldmann, Burkhard Monien, Stefan Schamberger:
A Distributed Algorithm to Evaluate Quantified Boolean Formulae. AAAI/IAAI 2000: 285-290 - 1997
- [c7]Rainer Feldmann:
Computer Chess: Algorithms and Heuristics for a Deep Look into the Future. SOFSEM 1997: 1-18 - [c6]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 - 1994
- [c5]Rainer Feldmann, Peter Mysliwietz, Burkhard Monien:
Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation. SPAA 1994: 94-103 - 1993
- [c4]Burkhard Monien, Rainer Feldmann, Ralf Klasing, Reinhard Lüling:
Parallel Architectures: Design and Efficient Use. STACS 1993: 247-269 - 1992
- [c3]Rainer Feldmann, Peter Mysliwietz, Burkhard Monien:
Distributed Game Tree Search on a Massively Parallel System. Data Structures and Efficient Algorithms 1992: 270-288 - [c2]Rainer Feldmann, Peter Mysliwietz:
The Shuffle Exchange Network has a Hamiltonian Path. MFCS 1992: 246-254 - [c1]Rainer Feldmann, Juraj Hromkovic, Seshu Madhavapeddy, Burkhard Monien, Peter Mysliwietz:
Optimal Algorithms for Disemination of Information in Generalized Communication Modes. PARLE 1992: 115-130
Parts in Books or Collections
- 1995
- [p1]Burkhard Monien, Ralf Diekmann, Rainer Feldmann, Ralf Klasing, Reinhard Lüling, Knut Menzel, Thomas Römke, Ulf-Peter Schroeder:
Efficient Use of Parallel & Distributed Systems: From Theory to Practice. Computer Science Today 1995: 62-77
Editorship
- 2002
- [e1]Burkhard Monien, Rainer Feldmann:
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 [contents]
Informal and Other Publications
- 2005
- [i1]Rainer Feldmann:
Selfish Routing of Splittable Flow with Respect to Maximum Congestion. Computing and Markets 2005
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
