1
0
0
(1 - 20 von 20
)
Aspects of - RWTH Aachen University
publications.rwth-aachen.de
WebLars Olbrich aus Lünen in Westfalen Berichter: Universitätsprofessor Dr. Berthold Vöcking Universitätsprofessor Dr.-Ing. Ekkehard Wendler Tag der mündlichen Prüfung: 22. …
Highlights der Algorithmik
algo.rwth-aachen.de
... algorithm for database search, Proc. of the 28th STOC, Kontakt. Marcel Ochel: ochel(at) cs.rwth-aachen.de, Lars Olbrich: lars (at) cs.rwth-aachen.de. › fruehSem › SHdA
dblp: BibTeX records: Lars Olbrich
dblp.uni-trier.de
List of computer science publications by BibTeX records: Lars Olbrich
Taxing Subnetworks - Internet and Network Economics, 4th...
www.hni.uni-paderborn.de
Taxing Subnetworks - Internet and Network Economics, 4th International Workshop, {WINE} 2008, Shanghai, China, December , Proceedings - Martin...
Lehrstuhl i1 - Informatik 1 - RWTH Aachenalgo.rwth-aachen.de › mitarbeiter
algo.rwth-aachen.de
Lars Olbrich, Juli Oktober Klaus Radke, Juni Dezember Rebecca Reiffenhäuser, Dezember November Benjamin Ries, Oktober ...
dblp: Aspects of Wardrop equilibria.
dblp.uni-trier.de
Bibliographic details on Aspects of Wardrop equilibria.
KOPS.Taxing Subnetworks
kops.uni-konstanz.de
HOEFER, Martin, Lars OLBRICH, Alexander SKOPALIK, Taxing Subnetworks.In: PAPADIMITRIOU, Christos, ed., Shuzhong ZHANG, ed.. Internet and Network Economics.
Approximating Wardrop equilibria with finitely many agents.
dblp.uni-trier.de
— Simon Fischer, Lars Olbrich, Berthold Vöcking: Approximating Wardrop equilibria with finitely many agents. Distributed Comput. › journals
Heinz Nixdorf Institut: SearchUniversität Paderborn
www.hni.uni-paderborn.de
Taxing Subnetworks Martin Hoefer, Alexander Skopalik, Lars Olbrich Inapproximability of pure nash equilibria Berthold Vöcking, Alexander Skopalik. › search
Important Dates
algo.rwth-aachen.de
... Nash equilibria in Congestion Games", Chien, Sinclair. Contact. Martin Hoefer: mhoefer (at) cs.rwth-aachen.de. Lars Olbrich: lars(at) cs. rwth-aachen.de.
dblp: Approximating Wardrop Equilibria with Finitely Many Agents.
dblp.dagstuhl.de
Bibliographic details on Approximating Wardrop Equilibria with Finitely Many Agents.
Strategische Aspekte in Netzwerkenalgo.rwth-aachen.de › fruehSem › SSAiN
algo.rwth-aachen.de
... zum : Abgabe und Besprechung der Folien; 2 Tage zwischen 18. und 21. September: Seminar. Vorträge. TBA. Kontakt. Lars Olbrich, Simon Fischer.
Heinz Nixdorf Institut: Suche
www.hni.uni-paderborn.de
Doing Good with Spam Is Hard Lars Olbrich, Martin Hoefer, Alexander Skopalik Complexity of Pure Nash Equilibria in Player-Specific Network Congestion ... › suche
Heinz Nixdorf Institut: Search
www.hni.uni-paderborn.de
Taxing Subnetworks Martin Hoefer, Alexander Skopalik, Lars Olbrich Inapproximability of pure nash equilibria Berthold Vöcking, Alexander Skopalik.
Martin Hoefer - Publications - Algorithms and Complexityalgo.cs.uni-frankfurt.de › ~mhoefer › publications
algo.cs.uni-frankfurt.de
Workshop on Internet & Network Economics (WINE 2009), LNCS 5929, pp , Full version in ACM TEAC. Martin Hoefer, Lars Olbrich, Alexander Skopalik.
Doing Good with Spam Is Hard - Algorithmic Game Theory, Second...
www.hni.uni-paderborn.de
Doing Good with Spam Is Hard - Algorithmic Game Theory, Second International Symposium, {SAGT} 2009, Paphos, Cyprus, October , Proceedings - Martin...
Verwandte Suchanfragen zu Lars Olbrich
Simon Fischer Alexander Skopalik Berthold Vöcking | Thomas Franke Alexander Graff Matthias Englert | Ernst Thälmann |
Person "Olbrich" (7) Vorname "Lars" (24476) Name "Olbrich" (824) |
sortiert nach Relevanz / Datum