Castenow, Jannik. Local Protocols for Contracting and Expanding Robot Formation Problems. 2023, doi:10.17619/UNIPB/1-1750.
LibreCat: /record/45580
DOI: 10.17619/UNIPB/1-1750

Knollmann, Till. Online Algorithms for Allocating Heterogeneous Resources. 2023, doi:10.17619/UNIPB/1-1751.
LibreCat: /record/45579
DOI: 10.17619/UNIPB/1-1751

Pukrop, Simon. On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling. 2023, doi:10.17619/UNIPB/1-1768 .
LibreCat: /record/45781
DOI: 10.17619/UNIPB/1-1768 

Berger, Thilo Frederik. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation. 2021.
LibreCat: /record/44234

Pranger, Sebastian. Online K-Facility Reallocation Using k-Server Algorithms. 2021.
LibreCat: /record/44233

Feldkord, Björn. Mobile Resource Allocation. 2020, doi:10.17619/UNIPB/1-869.
LibreCat: /record/15631
DOI: 10.17619/UNIPB/1-869

Malatyali, Manuel. Big Data: Sublinear Algorithms for Distributed Data Streams. 2019, doi:10.17619/UNIPB/1-766.
LibreCat: /record/18975
DOI: 10.17619/UNIPB/1-766

Mäcker, Alexander. On Scheduling with Setup Times. 2019, doi:10.17619/UNIPB/1-828.
LibreCat: /record/14851
DOI: 10.17619/UNIPB/1-828

Pukrop, Simon. Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn, 2019.
LibreCat: /record/10344

Liedtke, David Jan. Influence of Stationary Robots on Continuous Robot Formation Problems. 2018.
LibreCat: /record/25121

Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018.
LibreCat: /record/5403

Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn, 2018.
LibreCat: /record/5404

Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-271.
LibreCat: /record/1209
DOI: 10.17619/UNIPB/1-271

Li, Shouwei. Parallel Fixed Parameter Tractable Problems. 2017, doi:10.17619/UNIPB/1-252.
LibreCat: /record/19604
DOI: 10.17619/UNIPB/1-252

Podlipyan, Pavel. Local Algorithms for the Continuous Gathering Problem. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-230.
LibreCat: /record/703
DOI: 10.17619/UNIPB/1-230

Riechers, Sören. Scheduling with Scarce Resources. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-231.
LibreCat: /record/704
DOI: 10.17619/UNIPB/1-231

Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016.
LibreCat: /record/688

Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016.
LibreCat: /record/689

Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network Creation Games. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.
LibreCat: /record/154

Markarian, Christine. Online Resource Leasing. Universität Paderborn, 2015.
LibreCat: /record/267

Jähn, Claudius. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn, 2015.
LibreCat: /record/317

Abshoff, Sebastian. On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks. Universität Paderborn, 2015.
LibreCat: /record/270

Petring, Ralf. Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen in Echtzeit. 2014.
LibreCat: /record/19039

Kling, Peter. Energy-Efficient Scheduling Algorithms. Universität Paderborn, 2014.
LibreCat: /record/431

Eikel, Benjamin. Spherical Visibility Samplingf: Preprocessed Visibility for Occlusion Culling in Complex 3D Scenes. 2013.
LibreCat: /record/17440

Pietrzyk, Peter. Local and Online Algorithms for Facility Location. Universität Paderborn, 2013.
LibreCat: /record/514

Kempkes, Barbara. Local Strategies for Robot Formation Problems. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.
LibreCat: /record/601

Korzeniowski, Miroslaw. Dynamic Load Balancing in Peer-to-Peer Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.
LibreCat: /record/19619

Mehler, Jan. Power-Aware Online File Allocation in Dynamic Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.
LibreCat: /record/18974

Effert, Sascha. Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen. 2011.
LibreCat: /record/19040

Swierkot, Kamil. Complexity Classes for Local Computation. Universität Paderborn, 2011.
LibreCat: /record/663

Bienkowski, Marcin. Page Migration in Dynamic Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
LibreCat: /record/18910

Dynia, Miroslaw. Collective Graph Exploration. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
LibreCat: /record/18927

Mahlmann, Peter. Peer-to-Peer Networks Based on Random Graphs. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
LibreCat: /record/19041

Degener, Bastian. Local, Distributed Approximation Algorithms for Geometric Assignment Problems. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
LibreCat: /record/19042

Lürwer-Brüggemeier, Katharina. Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
LibreCat: /record/19605

Mense, Mario. On Fault-Tolerant Data Placement in Storage Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
LibreCat: /record/19614

Kortenjan, Michael. Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
LibreCat: /record/19617

Bonorden, Olaf. Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
LibreCat: /record/19618

Schomaker, Gunnar. Distributed Resource Allocation and Management in Heterogeneous Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
LibreCat: /record/19615

Klein, Jan. Efficient Collision Detection for Point and Polygon Based Models. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.
LibreCat: /record/19612

Rührup, Stefan. Position-Based Routing Strategies. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.
LibreCat: /record/19613

Damerow, Valentina. Average and Smoothed Complexity of Geometric Structures. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.
LibreCat: /record/18972

Volbert, Klaus. Geometric Spanners for Topology Control in Wireless Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.
LibreCat: /record/19611

Fischer, Matthias. Design, Analysis, and Evaluation of a Data Structure for Distributed Virtual Environments. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.
LibreCat: /record/17413

Räcke, Harald. Data Management and Routing in General Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.
LibreCat: /record/18967

Salzwedel, Kay. Data Distribution Algorithms for Storage Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004.
LibreCat: /record/19616

Sohler, Christian. Property Testing and Geometry. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.
LibreCat: /record/18573

Ziegler, Martin. Zur Berechenbarkeit reeller geometrischer Probleme. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.
LibreCat: /record/18169

Schröder, Klaus. Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.
LibreCat: /record/19622