Bernhard von Stengel

	2010
18		Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel: Optimal Projective Algorithms for the List Update Problem CoRR abs/1002.2440: (2010)
	2008
17		P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel: Equilibrium Computation, 18.11. - 23.11.2007 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008
16		Arndt von Schemde, Bernhard von Stengel: Strategic Characterization of the Index of an Equilibrium. SAGT 2008: 242-254
15		Wan Huang, Bernhard von Stengel: Computing an Extensive-Form Correlated Equilibrium in Polynomial Time. WINE 2008: 506-513
14		Bernhard von Stengel, Françoise Forges: Extensive-Form Correlated Equilibrium: Definition and Computational Complexity. Math. Oper. Res. 33(4): 1002-1022 (2008)
	2007
13		P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel: 07471 Abstracts Collection - Equilibrium Computation. Equilibrium Computation 2007
12		Bernhard von Stengel: Games, geometry, and the computational complexity of finding equilibria. TARK 2007: 4-5
	2004
11		Rahul Savani, Bernhard von Stengel: Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game. FOCS 2004: 258-267
	2001
10		Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel: A new lower bound for the list update problem in the partial cost model. Theor. Comput. Sci. 268(1): 3-16 (2001)
	2000
9		Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel: Optimal Projective Algorithms for the List Update Problem. ICALP 2000: 305-316
	1999
8		Bernhard von Stengel: New Maximal Numbers of Equilibria in Bimatrix Games. Discrete & Computational Geometry 21(4): 557-568 (1999)
	1997
7		Elena Dubrova, Jon C. Muzio, Bernhard von Stengel: Finding Composition Trees for Multiple-Valued Functions. ISMVL 1997: 19-26
6		Bernhard von Stengel, Ralph Werchner: Complexity of Searching an Immobile Hider in a Graph. Discrete Applied Mathematics 78(1-3): 235-249 (1997)
	1995
5		Martin Fränzle, Bernhard von Stengel, Arne Wittmüss: A Generalized Notion of Semantic Independence. Inf. Process. Lett. 53(1): 5-9 (1995)
4		Susanne Albers, Bernhard von Stengel, Ralph Werchner: A Combined BIT and TIMESTAMP Algorithm for the List Update Problem. Inf. Process. Lett. 56(3): 135-139 (1995)
	1994
3		Daphne Koller, Nimrod Megiddo, Bernhard von Stengel: Fast algorithms for finding randomized strategies in game trees. STOC 1994: 750-759
	1993
2		Javier Esparza, Bernhard von Stengel: The Asynchronous Committee Meeting Problem. WG 1993: 276-287
	1991
1		Bernhard von Stengel: An Algebraic Characterization of Semantic Independence. Inf. Process. Lett. 39(6): 291-296 (1991)

Coauthor Index

1	Susanne Albers	[4]
2	Christoph Ambühl	[9] [10] [18]
3	Elena Dubrova	[7]
4	Javier Esparza	[2]
5	Françoise Forges	[14]
6	Martin Fränzle	[5]
7	Bernd Gärtner	[9] [10] [18]
8	P. Jean-Jacques Herings	[13] [17]
9	Wan Huang	[15]
10	Marcin Jurdzinski	[13] [17]
11	Daphne Koller	[3]
12	Nimrod Megiddo	[3]
13	Peter Bro Miltersen	[13] [17]
14	Jon C. Muzio	[7]
15	Rahul Savani	[11]
16	Arndt von Schemde	[16]
17	Éva Tardos	[13] [17]
18	Ralph Werchner	[4] [6]
19	Arne Wittmüss	[5]

Colors in the list of coauthors