UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

On the independence number and Hamiltonicity of uniform random intersection graphs

Theoretical computer science, 2011-11, Vol.412 (48), p.6750-6760

2011

Volltextzugriff (PDF)

On the structure of equilibria in basic network formation

Theoretical computer science, 2015-07, Vol.590, p.96-105

2015

Volltextzugriff (PDF)

The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions

Theoretical computer science, 2009-03, Vol.410 (8), p.745-755

2009

Volltextzugriff (PDF)

Expander properties and the cover time of random intersection graphs

Theoretical computer science, 2009-11, Vol.410 (50), p.5261-5272

2009

Volltextzugriff (PDF)

Radiocoloring in planar graphs: Complexity and approximations

Theoretical computer science, 2005-08, Vol.340 (3), p.514-538

2005

Volltextzugriff (PDF)

Selfish splittable flows and NP-completeness

Computer science review, 2011-08, Vol.5 (3), p.209-228

2011

Volltextzugriff (PDF)

Structure and complexity of extreme Nash equilibria

Theoretical computer science, 2005-10, Vol.343 (1), p.133-157

2005

Volltextzugriff (PDF)

Selfish unsplittable flows

Theoretical computer science, 2005-12, Vol.348 (2), p.226-239

2005

Volltextzugriff (PDF)

The structure and complexity of Nash equilibria for a selfish routing game

Theoretical computer science, 2009-08, Vol.410 (36), p.3305-3326

2009

Volltextzugriff (PDF)

Large independent sets in general random intersection graphs

Theoretical computer science, 2008-10, Vol.406 (3), p.215-224

2008

Volltextzugriff (PDF)

A hierarchical adaptive distributed algorithm for load balancing

Journal of parallel and distributed computing, 2004, Vol.64 (1), p.151-162

2004

Volltextzugriff (PDF)

Weighted random sampling with a reservoir

Information processing letters, 2006-03, Vol.97 (5), p.181-185

2006

Volltextzugriff (PDF)

On the robustness of interconnections in random graphs: a symbolic approach

Theoretical computer science, 2002-09, Vol.287 (2), p.515-534

2002

Volltextzugriff (PDF)

Game authority for robust and scalable distributed selfish-computer systems

Theoretical computer science, 2010-06, Vol.411 (26), p.2459-2466, Article 2459

2010

Volltextzugriff (PDF)

Large independent sets in general random intersection graphs: Algorithmic Aspects of Global Computing

Theoretical computer science, 2008, Vol.406 (3), p.215-224

2008

Volltextzugriff (PDF)

An analytical performance model for multistage interconnection networks with finite, infinite and zero length buffers

Performance evaluation, 1998-11, Vol.34 (3), p.169-182

1998

Volltextzugriff (PDF)

On the random generation and counting of matchings in dense graphs

Theoretical computer science, 1998-07, Vol.201 (1), p.281-290

1998

Volltextzugriff (PDF)

Internet and Network Economics

Theoretical computer science, 2009, Vol.410 (17)

2009

Volltextzugriff (PDF)

Performance and stability bounds for dynamic networks

Journal of parallel and distributed computing, 2007-04, Vol.67 (4), p.386-399

2007

Volltextzugriff (PDF)

Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays

Information and computation, 1993, Vol.105 (1), p.94-104

1993

Volltextzugriff (PDF)

Distributed communication algorithms for ad hoc mobile networks

Journal of parallel and distributed computing, 2003, Vol.63 (1), p.58-74

2003

Volltextzugriff (PDF)

Tentative and definite distributed computations: an optimistic approach to network synchronization

Theoretical computer science, 1994-06, Vol.128 (1), p.63-74

1994

Volltextzugriff (PDF)

The cost of concurrent, low-contention Read&Modify&Write

Theoretical computer science, 2005-03, Vol.333 (3), p.373-400

2005

Volltextzugriff (PDF)

Structure and complexity of extreme Nash equilibria: Game theory meets theoretical computer science

Theoretical computer science, 2005, Vol.343 (1-2), p.133-157

2005

Volltextzugriff (PDF)

An efficient deterministic parallel algorithm for two processors precedence constraint scheduling

Theoretical computer science, 2003-01, Vol.292 (3), p.639-652

2003

Volltextzugriff (PDF)

1 – 25 von 39

Menü

Weitere Dienste

Einstellungen

On the independence number and Hamiltonicity of uniform random intersection graphs

On the structure of equilibria in basic network formation

The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions

Expander properties and the cover time of random intersection graphs

Radiocoloring in planar graphs: Complexity and approximations

Selfish splittable flows and NP-completeness

Structure and complexity of extreme Nash equilibria

Selfish unsplittable flows

The structure and complexity of Nash equilibria for a selfish routing game

Large independent sets in general random intersection graphs

A hierarchical adaptive distributed algorithm for load balancing

Weighted random sampling with a reservoir

On the robustness of interconnections in random graphs: a symbolic approach

Game authority for robust and scalable distributed selfish-computer systems

Large independent sets in general random intersection graphs: Algorithmic Aspects of Global Computing

An analytical performance model for multistage interconnection networks with finite, infinite and zero length buffers

On the random generation and counting of matchings in dense graphs

Internet and Network Economics

Performance and stability bounds for dynamic networks

Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays

Distributed communication algorithms for ad hoc mobile networks

Tentative and definite distributed computations: an optimistic approach to network synchronization

The cost of concurrent, low-contention Read&Modify&Write

Structure and complexity of extreme Nash equilibria: Game theory meets theoretical computer science

An efficient deterministic parallel algorithm for two processors precedence constraint scheduling

Aktive Filter

Suchergebnisse filtern