The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bernhard von Stengel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rahul Savani, Bernhard von Stengel
    Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:258-267 [Conf]
  2. Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
    Optimal Projective Algorithms for the List Update Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:305-316 [Conf]
  3. Elena Dubrova, Jon C. Muzio, Bernhard von Stengel
    Finding Composition Trees for Multiple-Valued Functions. [Citation Graph (0, 0)][DBLP]
    ISMVL, 1997, pp:19-26 [Conf]
  4. Daphne Koller, Nimrod Megiddo, Bernhard von Stengel
    Fast algorithms for finding randomized strategies in game trees. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:750-759 [Conf]
  5. Javier Esparza, Bernhard von Stengel
    The Asynchronous Committee Meeting Problem. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:276-287 [Conf]
  6. Bernhard von Stengel, Ralph Werchner
    Complexity of Searching an Immobile Hider in a Graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:235-249 [Journal]
  7. Bernhard von Stengel
    New Maximal Numbers of Equilibria in Bimatrix Games. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:21, n:4, pp:557-568 [Journal]
  8. Susanne Albers, Bernhard von Stengel, Ralph Werchner
    A Combined BIT and TIMESTAMP Algorithm for the List Update Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:3, pp:135-139 [Journal]
  9. Martin Fränzle, Bernhard von Stengel, Arne Wittmüss
    A Generalized Notion of Semantic Independence. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:1, pp:5-9 [Journal]
  10. Bernhard von Stengel
    An Algebraic Characterization of Semantic Independence. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:6, pp:291-296 [Journal]
  11. Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
    A new lower bound for the list update problem in the partial cost model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:268, n:1, pp:3-16 [Journal]

  12. 07471 Abstracts Collection - Equilibrium Computation. [Citation Graph (, )][DBLP]


  13. Games, geometry, and the computational complexity of finding equilibria. [Citation Graph (, )][DBLP]


  14. Computing an Extensive-Form Correlated Equilibrium in Polynomial Time. [Citation Graph (, )][DBLP]


  15. Strategic Characterization of the Index of an Equilibrium. [Citation Graph (, )][DBLP]


  16. Optimal Projective Algorithms for the List Update Problem [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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