Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

344 Publications


2017 | Book Chapter | LibreCat-ID: 16461
Bemmann P, Biermeier F, Bürmann J, et al. Monitoring of Domain-Related Problems in Distributed Data Streams. In: Structural Information and Communication Complexity. Cham; 2017. doi:10.1007/978-3-319-72050-0_13
LibreCat | DOI | arXiv
 

2017 | Mastersthesis | LibreCat-ID: 1080
Bürmann J. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn; 2017.
LibreCat
 

2017 | Bachelorsthesis | LibreCat-ID: 1073
Nachtigall S. Sortieren dynamischer Daten. Universität Paderborn; 2017.
LibreCat
 

2017 | Conference Paper | LibreCat-ID: 113
Feldotto M, Gairing M, Kotsialou G, Skopalik A. Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In: Proceedings of the 13th International Conference on Web and Internet Economics (WINE). ; 2017. doi:10.1007/978-3-319-71924-5_14
LibreCat | Files available | DOI | arXiv
 

2017 | Conference Paper | LibreCat-ID: 16347
Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. In: Fernández Anta A, Jurdzinski T, Mosteiro MA, Zhang Y, eds. Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}. Vol 10718. Lecture Notes in Computer Science. Vienna, Austria: Springer; 2017:168-181. doi:10.1007/978-3-319-72751-6_13
LibreCat | DOI
 

2017 | Conference Paper | LibreCat-ID: 55
Feldkord B, Meyer auf der Heide F. The Mobile Server Problem. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2017:313-319. doi:10.1145/3087556.3087575
LibreCat | Files available | DOI
 

2017 | Conference Paper | LibreCat-ID: 79
Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA). Vol 10787. Lecture Notes in Computer Science. Springer; 2017:207-222. doi:10.1007/978-3-319-89441-6
LibreCat | Files available | DOI
 

2017 | Mastersthesis | LibreCat-ID: 1081
Vijayalakshmi VR. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn; 2017.
LibreCat
 

2017 | Bachelorsthesis | LibreCat-ID: 1074
Pukrop S. Robuste Optimierung in Congestion Games. Universität Paderborn; 2017.
LibreCat
 

2017 | Conference Paper | LibreCat-ID: 16348
Biermeier F, Feldkord B, Malatyali M, Meyer auf der Heide F. A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries. In: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA). Springer; 2017:285-300. doi:10.1007/978-3-319-89441-6_21
LibreCat | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed