The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rainer Feldmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rainer Feldmann, Burkhard Monien, Stefan Schamberger
    A Distributed Algorithm to Evaluate Quantified Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:285-290 [Conf]
  2. Torsten Fahle, Rainer Feldmann, Silvia Götz, Sven Grothklags, Burkhard Monien
    The Aircraft Sequencing Problem. [Citation Graph (0, 0)][DBLP]
    Computer Science in Perspective, 2003, pp:152-166 [Conf]
  3. Rainer Feldmann
    Selfish Routing of Splittable Flow with Respect to Maximum Congestion. [Citation Graph (0, 0)][DBLP]
    Computing and Markets, 2005, pp:- [Conf]
  4. Christian Haubelt, Jürgen Teich, Rainer Feldmann, Burkhard Monien
    SAT-Based Techniques in System Synthesis. [Citation Graph (0, 0)][DBLP]
    DATE, 2003, pp:11168-11169 [Conf]
  5. Rainer Feldmann, Peter Mysliwietz, Burkhard Monien
    Distributed Game Tree Search on a Massively Parallel System. [Citation Graph (0, 0)][DBLP]
    Data Structures and Efficient Algorithms, 1992, pp:270-288 [Conf]
  6. Gianfranco Bilardi, Rainer Feldmann, Kieran T. Herley, Bruce M. Maggs
    Topic 06: Complexity Theory and Algorithms. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2001, pp:332- [Conf]
  7. Rainer Feldmann, Catherine Roucairol
    Discrete Optimization. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2002, pp:911- [Conf]
  8. Rainer Feldmann, Christian Haubelt, Burkhard Monien, Jürgen Teich
    Fault Tolerances Analysis of Distributed Reconfigurable Systems Using SAT-Based Techniques. [Citation Graph (0, 0)][DBLP]
    FPL, 2003, pp:478-487 [Conf]
  9. Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
    Nashification and the Coordination Ratio for a Selfish Routing Game. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:514-526 [Conf]
  10. Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
    Selfish Routing in Non-cooperative Networks: A Survey. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:21-45 [Conf]
  11. Rainer Feldmann, Peter Mysliwietz
    The Shuffle Exchange Network has a Hamiltonian Path. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:246-254 [Conf]
  12. Rainer Feldmann, Juraj Hromkovic, S. Madhavapeddy, Burkhard Monien, Peter Mysliwietz
    Optimal Algorithms for Disemination of Information in Generalized Communication Modes. [Citation Graph (0, 0)][DBLP]
    PARLE, 1992, pp:115-130 [Conf]
  13. Rainer Feldmann
    Computer Chess: Algorithms and Heuristics for a Deep Look into the Future. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1997, pp:1-18 [Conf]
  14. Rainer Feldmann, Peter Mysliwietz, Burkhard Monien
    Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation. [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:94-103 [Conf]
  15. Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Stefan Tschöke
    A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:511-522 [Conf]
  16. Burkhard Monien, Rainer Feldmann, Ralf Klasing, Reinhard Lüling
    Parallel Architectures: Design and Efficient Use. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:247-269 [Conf]
  17. Rainer Feldmann, Juraj Hromkovic, S. Madhavapeddy, Burkhard Monien, Peter Mysliwietz
    Optimal algorithms for dissemination of information in generalized communication modes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:55-78 [Journal]
  18. Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
    Selfish Routing in Non-Cooperative Networks: A Survey. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2003, v:81, n:, pp:137-164 [Journal]
  19. Rainer Feldmann, Peter Mysliwietz
    The Shuffle Exchange Network has a Hamiltonian Path. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:5, pp:471-485 [Journal]
  20. Rainer Feldmann, Walter Unger
    The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1992, v:2, n:, pp:13-19 [Journal]

  21. Nash Equilibria for Voronoi Games on Transitive Graphs. [Citation Graph (, )][DBLP]


  22. Facets of the Fully Mixed Nash Equilibrium Conjecture. [Citation Graph (, )][DBLP]


Search in 0.030secs, Finished in 0.031secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002