UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 500

Sortiert nach

Euro-Par 2002. Parallel Processing: 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002 Proceedings

1, 2002

Link zum Volltext

Verfügbarkeit prüfen

High Performance Computing - HiPC 2001: 8th International Conference, Hyderabad, India, December, 17-20, 2001. Proceedings

2001, 2001

Link zum Volltext

Verfügbarkeit prüfen

Conditional Value-at-Risk: Structure and complexity of equilibria

Theoretical computer science, 2020-02, Vol.807, p.266-283

2020

Link zum Volltext

Verfügbarkeit prüfen

Automata, Languages and Programming: 23rd International Colloquium, ICALP '96 Paderborn, Germany, July 8–12, 1996 Proceedings

1996

Link zum Volltext

Verfügbarkeit prüfen

Automata, Languages and Programming: 18th International Colloquium Madrid, Spain, July 8–12, 1991 Proceedings

1991

Link zum Volltext

Verfügbarkeit prüfen

Nash Equilibria for Voronoi Games on Transitive Graphs

Internet and Network Economics, p.280-291

Link zum Volltext

Verfügbarkeit prüfen

The complexity of equilibria for risk-modeling valuations

Theoretical computer science, 2016-06, Vol.634, p.67-96

2016

Link zum Volltext

Verfügbarkeit prüfen

The complexity of (E+Var)-equilibria, ESR-equilibria, and SuperE-equilibria for 2-players games with few cost values

Theoretical computer science, 2021-03, Vol.860, p.84-97

2021

Link zum Volltext

Verfügbarkeit prüfen

Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube

Journal of graph theory, 2018-04, Vol.87 (4), p.561-580

2018

Link zum Volltext

Verfügbarkeit prüfen

(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions

Theory of computing systems, 2022-10, Vol.66 (5), p.957-995

2022

Link zum Volltext

Verfügbarkeit prüfen

The complexity of pure equilibria in mix-weighted congestion games on parallel links

Information processing letters, 2015-12, Vol.115 (12), p.927-931

2015

Link zum Volltext

Verfügbarkeit prüfen

Minimizing Expectation Plus Variance

Theory of computing systems, 2015-10, Vol.57 (3), p.617-654

2015

Link zum Volltext

Verfügbarkeit prüfen

Which is the Worst-Case Nash Equilibrium?

SIAM journal on discrete mathematics, 2024-06, Vol.38 (2), p.1701-1732

2024

Link zum Volltext

Verfügbarkeit prüfen

EXACT PRICE OF ANARCHY FOR POLYNOMIAL CONGESTION GAMES

SIAM journal on computing, 2011-01, Vol.40 (5), p.1211-1233

2011

Link zum Volltext

Verfügbarkeit prüfen

Algorithmic Game Theory: First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings

1, 2008

Link zum Volltext

Verfügbarkeit prüfen

On the PLS-complexity of maximum constraint assignment

Theoretical computer science, 2013-01, Vol.469, p.24-52

2013

Link zum Volltext

Verfügbarkeit prüfen

STACS 89: 6th Annual Symposium on Theoretical Aspects of Computer Science Paderborn, FRG, February 16–18, 1989 Proceedings

1989

Link zum Volltext

Verfügbarkeit prüfen

Conditional Value-at-Risk: Structure and Complexity of Equilibria

Algorithmic Game Theory, p.131-143

Link zum Volltext

Verfügbarkeit prüfen

Parallel Architectures and Their Efficient Use: First Heinz Nixdorf Symposium Paderborn, Germany, November 11–13, 1992 Proceedings

1993

Link zum Volltext

Verfügbarkeit prüfen

Graph partitioning and disturbed diffusion

Parallel computing, 2009-10, Vol.35 (10), p.544-569

2009

Link zum Volltext

Verfügbarkeit prüfen

A faster combinatorial approximation algorithm for scheduling unrelated parallel machines

Theoretical computer science, 2007-06, Vol.380 (1), p.87-99

2007

Link zum Volltext

Verfügbarkeit prüfen

Preface to the self-portrayals of the GI Junior Fellows

Information technology (Munich, Germany), 2014-10, Vol.56 (5), p.254-254

2014

Link zum Volltext

Verfügbarkeit prüfen

A new model for selfish routing

Theoretical computer science, 2008-10, Vol.406 (3), p.187-206

2008

Link zum Volltext

Verfügbarkeit prüfen

Weighted Boolean Formula Games

Algorithms, Probability, Networks, and Games, p.49-86

Link zum Volltext

Verfügbarkeit prüfen

Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions

Automata, Languages and Programming, 2006, p.501-512

2006

Link zum Volltext

Verfügbarkeit prüfen

1 – 25 von 500

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(435)
Mit Volltextzugriff
(499)

Publikationsform

Sprache

Erscheinungsjahr

n.n

Neu hinzugefügt

... seit 90 Tagen
(1)

Menü

Weitere Dienste

Einstellungen

Euro-Par 2002. Parallel Processing: 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002 Proceedings

High Performance Computing - HiPC 2001: 8th International Conference, Hyderabad, India, December, 17-20, 2001. Proceedings

Conditional Value-at-Risk: Structure and complexity of equilibria

Automata, Languages and Programming: 23rd International Colloquium, ICALP '96 Paderborn, Germany, July 8–12, 1996 Proceedings

Automata, Languages and Programming: 18th International Colloquium Madrid, Spain, July 8–12, 1991 Proceedings

Nash Equilibria for Voronoi Games on Transitive Graphs

The complexity of equilibria for risk-modeling valuations

The complexity of (E+Var)-equilibria, ESR-equilibria, and SuperE-equilibria for 2-players games with few cost values

Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube

(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions

The complexity of pure equilibria in mix-weighted congestion games on parallel links

Minimizing Expectation Plus Variance

Which is the Worst-Case Nash Equilibrium?

EXACT PRICE OF ANARCHY FOR POLYNOMIAL CONGESTION GAMES

Algorithmic Game Theory: First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings

On the PLS-complexity of maximum constraint assignment

STACS 89: 6th Annual Symposium on Theoretical Aspects of Computer Science Paderborn, FRG, February 16–18, 1989 Proceedings

Conditional Value-at-Risk: Structure and Complexity of Equilibria

Parallel Architectures and Their Efficient Use: First Heinz Nixdorf Symposium Paderborn, Germany, November 11–13, 1992 Proceedings

Graph partitioning and disturbed diffusion

A faster combinatorial approximation algorithm for scheduling unrelated parallel machines

Preface to the self-portrayals of the GI Junior Fellows

A new model for selfish routing

Weighted Boolean Formula Games

Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions

Suchergebnisse filtern