default search action
Friedhelm Meyer auf der Heide
Person information
- affiliation: University of Paderborn, Heinz Nixdorf Institute, Germany
- award (1992): Gottfried Wilhelm Leibniz Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2006
- [b2]Friedhelm Meyer auf der Heide, Burkhard Monien:
New trends in parallel and distributed computing - 6th international Heinz Nixdorf symposium, January 17 - 18, 2006, Heinz Nixdorf MuseumsForum: within the scope of the DFG Collaborative Research Centre 376 Massively Parallel Computing: algorithms, design, methods, applications. HNI-Verlagsschriftenreihe 181, Heinz Nixdorf Institut 2006, ISBN 978-3-939350-00-2, pp. 1-259 - 1981
- [b1]Friedhelm Meyer auf der Heide:
Effizienz universeller Parallelrechner. Bielefeld University, Germany, 1981, pp. 1-92
Journal Articles
- 2024
- [j69]Marten Maack
, Friedhelm Meyer auf der Heide, Simon Pukrop
Server Cloud Scheduling. Algorithmica 86(4): 1210-1245 (2024) - 2023
- [j68]Jannik Castenow
Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation. Theor. Comput. Sci. 939: 261-291 (2023) - 2022
- [j67]Jannik Castenow
A discrete and continuous study of the Max-Chain-Formation problem. Inf. Comput. 285(Part): 104877 (2022) - [j66]Björn Feldkord, Till Knollmann
Online facility location with mobile facilities. Theor. Comput. Sci. 907: 45-61 (2022) - 2021
- [j65]Björn Feldkord
Managing Multiple Mobile Resources. Theory Comput. Syst. 65(6): 943-984 (2021) - [j64]Shouwei Li, Friedhelm Meyer auf der Heide, Pavel Podlipyan:
The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. Theor. Comput. Sci. 852: 29-40 (2021) - [j63]Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan:
A continuous strategy for collisionless gathering. Theor. Comput. Sci. 852: 41-60 (2021) - 2020
- [j62]Holger Karl, Dennis Kundisch, Friedhelm Meyer auf der Heide, Heike Wehrheim:
A Case for a New IT Ecosystem: On-The-Fly Computing. Bus. Inf. Syst. Eng. 62(6): 467-481 (2020) - [j61]Jannik Castenow, Matthias Fischer, Jonas Harbig
Gathering Anonymous, Oblivious Robots on a Grid. Theor. Comput. Sci. 815: 289-309 (2020) - 2019
- [j60]Sascha Brandt
Visibility-Aware Progressive Farthest Point Sampling on the GPU. Comput. Graph. Forum 38(7): 413-424 (2019) - [j59]Faisal N. Abu-Khzam
Efficient parallel algorithms for parameterized problems. Theor. Comput. Sci. 786: 2-12 (2019) - [j58]Björn Feldkord, Friedhelm Meyer auf der Heide:
The Mobile Server Problem. ACM Trans. Parallel Comput. 6(3): 14:1-14:17 (2019) - 2018
- [j57]Shouwei Li, Christine Markarian
Towards Flexible Demands in Online Leasing Problems. Algorithmica 80(5): 1556-1574 (2018) - [j56]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Cost-efficient scheduling on machines from the cloud. J. Comb. Optim. 36(4): 1168-1194 (2018) - [j55]Jürgen König, Alexander Mäcker, Friedhelm Meyer auf der Heide, Sören Riechers:
Scheduling with interjob communication on parallel processors. J. Comb. Optim. 36(4): 1356-1379 (2018) - [j54]Faisal N. Abu-Khzam, Christine Markarian
Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. Theory Comput. Syst. 62(8): 1673-1689 (2018) - [j53]Ernst Althaus, André Brinkmann, Peter Kling
Scheduling shared continuous resources on many-cores. J. Sched. 21(1): 77-92 (2018) - 2016
- [j52]Sebastian Abshoff, Peter Kling
Towards the price of leasing online. J. Comb. Optim. 32(4): 1197-1216 (2016) - [j51]Friedhelm Meyer auf der Heide, Peter Sanders, Nodari Sitchinava:
Introduction to the Special Issue on SPAA 2014. ACM Trans. Parallel Comput. 3(1): 1:1-1:2 (2016) - 2015
- [j50]Bastian Degener, Barbara Kempkes, Peter Kling
Linear and Competitive Strategies for Continuous Robot Formation Problems. ACM Trans. Parallel Comput. 2(1): 2:1-2:18 (2015) - 2013
- [j49]Benjamin Eikel, Claudius Jähn, Matthias Fischer, Friedhelm Meyer auf der Heide:
Spherical Visibility Sampling. Comput. Graph. Forum 32(4): 49-58 (2013) - [j48]Philipp Brandes, Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide:
Energy-efficient strategies for building short chains of mobile robots locally. Theor. Comput. Sci. 509: 97-112 (2013) - 2012
- [j47]Friedhelm Meyer auf der Heide:
The EATCS Award 2013. Call for nominations. Bull. EATCS 108: 16 (2012) - [j46]Valentina Damerow, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, Till Tantau:
Smoothed analysis of left-to-right maxima with applications. ACM Trans. Algorithms 8(3): 30:1-30:28 (2012) - 2011
- [j45]Bastian Degener, Sándor P. Fekete, Barbara Kempkes, Friedhelm Meyer auf der Heide:
A survey on relay placement with runtime and approximation guarantees. Comput. Sci. Rev. 5(1): 57-68 (2011) - [j44]D. Frank Hsu, Bruce M. Maggs, Howard C. T. Ho, Juraj Hromkovic, Francis C. M. Lau, Friedhelm Meyer auf der Heide:
Editorial. J. Interconnect. Networks 12(1-2) (2011) - 2010
- [j43]Friedhelm Meyer auf der Heide, Christian Scheideler:
Algorithmische Grundlagen verteilter Speichersysteme. Inform. Spektrum 33(5): 468-474 (2010) - 2009
- [j42]Marcin Bienkowski, Jaroslaw Byrka, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide:
Optimal algorithms for page migration in dynamic networks. J. Discrete Algorithms 7(4): 545-569 (2009) - [j41]Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide:
Optimal strategies for maintaining a chain of relays between an explorer and a base camp. Theor. Comput. Sci. 410(36): 3391-3405 (2009) - 2006
- [j40]Olaf Bonorden, Joachim Gehweiler, Friedhelm Meyer auf der Heide:
A Web Computing Environment for Parallel Algorithms in Java. Scalable Comput. Pract. Exp. 7(2) (2006) - 2004
- [j39]Friedhelm Meyer auf der Heide, Christian Schindelhauer
Congestion, Dilation, and Energy in Radio Networks. Theory Comput. Syst. 37(3): 343-370 (2004) - [j38]Jan Klein
The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments. Presence Teleoperators Virtual Environ. 13(6): 617-637 (2004) - 2003
- [j37]Friedhelm Meyer auf der Heide:
Sonderforschungsbereich 376 Massive Parallelität: Algorithmen - Entwurfsmethoden - Anwendungen (Massively Parallel Computing: Algorithms - Design Methods - Applications). it Inf. Technol. 45(2): 108-113 (2003) - [j36]Ben H. H. Juurlink, Petr Kolman
Optimal broadcast on parallel locality models. J. Discrete Algorithms 1(2): 151-166 (2003) - 2002
- [j35]Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann:
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. Theory Comput. Syst. 35(2): 217-245 (2002) - 2001
- [j34]Friedhelm Meyer auf der Heide, Christian Scheideler:
Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Comb. 21(1): 95-138 (2001) - 2000
- [j33]Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann:
Contention Resolution in Hashing Based Shared Memory Simulations. SIAM J. Comput. 29(5): 1703-1739 (2000) - 1999
- [j32]Friedhelm Meyer auf der Heide, Berthold Vöcking:
Shortest-Path Routing in Arbitrary Networks. J. Algorithms 31(1): 105-131 (1999) - [j31]Petra Berenbrink, Friedhelm Meyer auf der Heide, Klaus Schröder:
Allocating Weighted Jobs in Parallel. Theory Comput. Syst. 32(3): 281-300 (1999) - 1998
- [j30]Friedhelm Meyer auf der Heide, Klaus Schröder, Frank Schwarze:
Routing on Networks of Optical Crossbars. Theor. Comput. Sci. 196(1-2): 181-200 (1998) - [j29]Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide:
Truly Efficient Parallel Algorithms: 1-optimal Multisearch for an Extension of the BSP Model. Theor. Comput. Sci. 203(2): 175-203 (1998) - 1997
- [j28]Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky:
A Lower Bound for Randomized Algebraic Decision Trees. Comput. Complex. 6(4): 357-375 (1997) - [j27]Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann:
Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Inf. Comput. 137(2): 103-120 (1997) - [j26]Dany Breslauer, Artur Czumaj, Devdatt P. Dubhashi, Friedhelm Meyer auf der Heide:
Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. Inf. Process. Lett. 62(2): 103-110 (1997) - [j25]Friedhelm Meyer auf der Heide, Martin Storch, Rolf Wanka:
Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory Comput. Syst. 30(6): 627-644 (1997) - 1996
- [j24]Foued Ameur, Paul Fischer, Klaus-Uwe Höffgen, Friedhelm Meyer auf der Heide:
Trial and Error. A New Approach to Space-Bounded Learning. Acta Informatica 33(7): 621-630 (1996) - [j23]Friedhelm Meyer auf der Heide, Brigitte Oesterdiekhoff, Rolf Wanka:
Strongly Adaptive Token Distribution. Algorithmica 15(5): 413-427 (1996) - [j22]Richard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide:
Efficient PRAM Simulation on a Distributed Memory Machine. Algorithmica 16(4/5): 517-542 (1996) - [j21]Joseph Gil, Friedhelm Meyer auf der Heide, Avi Wigderson:
The Tree Model for Hashing: Lower and Upper Bounds. SIAM J. Comput. 25(5): 936-955 (1996) - [j20]Friedhelm Meyer auf der Heide, Christian Scheideler, Volker Stemann:
Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor. Comput. Sci. 162(2): 245-281 (1996) - 1994
- [j19]Martin Dietzfelbinger
Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM J. Comput. 23(4): 738-761 (1994) - 1993
- [j18]Martin Dietzfelbinger
An Optimal Parallel Dictionary. Inf. Comput. 102(2): 196-217 (1993) - 1990
- [j17]Friedhelm Meyer auf der Heide:
Das Heinz Nixdorf-Institut der Universität-GH Paderborn. Inform. Spektrum 13(4): 231-232 (1990) - 1989
- [j16]Bettina Just, Friedhelm Meyer auf der Heide, Avi Wigderson:
On Computations with Integer Division. RAIRO Theor. Informatics Appl. 23(1): 101-111 (1989) - 1988
- [j15]László Babai
On the Limits of Computations with the Floor Function. Inf. Comput. 78(2): 99-107 (1988) - [j14]Friedhelm Meyer auf der Heide:
Fast algorithms for N-dimensional restrictions of hard problems. J. ACM 35(3): 740-747 (1988) - [j13]Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal
A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. Theor. Comput. Sci. 58: 57-68 (1988) - 1987
- [j12]Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal
A Time-Space Tradeoff for Element Distinctness. SIAM J. Comput. 16(1): 97-99 (1987) - [j11]Friedhelm Meyer auf der Heide, Avi Wigderson:
The Complexity of Parallel Sorting. SIAM J. Comput. 16(1): 100-107 (1987) - 1986
- [j10]Friedhelm Meyer auf der Heide:
Efficient Simulations Among Several Models of Parallel Computers. SIAM J. Comput. 15(1): 106-119 (1986) - 1985
- [j9]Friedhelm Meyer auf der Heide:
Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models. Inf. Control. 67(1-3): 195-211 (1985) - [j8]Clemens Lautemann, Friedhelm Meyer auf der Heide:
Lower Time Bounds for Integer Programming with Two Variables. Inf. Process. Lett. 21(2): 101-105 (1985) - [j7]Friedhelm Meyer auf der Heide:
Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines. J. ACM 32(4): 929-937 (1985) - [j6]Friedhelm Meyer auf der Heide:
Simulating Probabilistic by Deterministic Algebraic Computation Trees. Theor. Comput. Sci. 41: 325-330 (1985) - 1984
- [j5]Friedhelm Meyer auf der Heide:
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem. J. ACM 31(3): 668-676 (1984) - 1983
- [j4]Friedhelm Meyer auf der Heide:
Efficiency of Universal Parallel Computers. Acta Informatica 19: 269-296 (1983) - [j3]Peter Klein, Friedhelm Meyer auf der Heide:
A Lower Time Bound for the Knapsack Problem on Random Access Machines. Acta Informatica 19: 385-395 (1983) - [j2]Friedhelm Meyer auf der Heide:
Infinite Cube-Connected Cycles. Inf. Process. Lett. 16(1): 1-2 (1983) - 1981
- [j1]Friedhelm Meyer auf der Heide:
A Comparison of two Variations of a Pebble Game on Graphs. Theor. Comput. Sci. 13: 315-322 (1981)
Conference and Workshop Papers
- 2023
- [c158]Jannik Castenow
Unifying Gathering Protocols for Swarms of Mobile Robots. CIAC 2023: 5-16 - 2022
- [c157]Jannik Castenow, Jonas Harbig
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility. OPODIS 2022: 15:1-15:25 - [c156]Jannik Castenow, Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide:
The k-Server with Preferences Problem. SPAA 2022: 345-356 - 2021
- [c155]Jannik Castenow, Jonas Harbig
Gathering a Euclidean Closed Chain of Robots in Linear Time. ALGOSENSORS 2021: 29-44 - [c154]Jannik Castenow, Thorsten Götte, Till Knollmann, Friedhelm Meyer auf der Heide:
The Max-Line-Formation Problem - And New Insights for Gathering and Chain-Formation. SSS 2021: 289-304 - [c153]Marten Maack
Server Cloud Scheduling. WAOA 2021: 144-164 - 2020
- [c152]Michael Braun, Jannik Castenow
Local Gathering of Mobile Robots in Three Dimensions. SIROCCO 2020: 63-79 - [c151]Alexander Mäcker, Friedhelm Meyer auf der Heide, Simon Pukrop
Approximating Weighted Completion Time for Order Scheduling with Setup Times. SOFSEM 2020: 88-100 - [c150]Jannik Castenow, Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide:
The Online Multi-Commodity Facility Location Problem. SPAA 2020: 129-139 - [c149]Jannik Castenow, Peter Kling
A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up. SPAA 2020: 515-517 - [c148]Jannik Castenow, Jonas Harbig
Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented and Luminous Robots with Limited Visibility. SSS 2020: 60-64 - [c147]Jannik Castenow, Peter Kling
A Discrete and Continuous Study of the Max-Chain-Formation Problem - Slow down to Speed Up. SSS 2020: 65-80 - 2019
- [c146]Christine Markarian, Friedhelm Meyer auf der Heide:
Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location. ICORES 2019: 315-321 - [c145]Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide:
Managing Multiple Mobile Resources. WAOA 2019: 120-137 - 2018
- [c144]Markus Benter, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, Jannik Sundermeier:
A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension. ALGOCLOUD 2018: 46-58 - [c143]Björn Feldkord, Manuel Malatyali, Friedhelm Meyer auf der Heide:
A Dynamic Distributed Data Structure for Top-k and k-Select Queries. Adventures Between Lower Bounds and Higher Altitudes 2018: 311-329 - [c142]Heiko Hamann, Christine Markarian, Friedhelm Meyer auf der Heide, Mostafa Wahby:
Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. FUN 2018: 22:1-22:13 - [c141]Friedhelm Meyer auf der Heide, Johannes Schaefer:
Brief Announcement: Communication in Systems of Home Based Mobile Agents. SPAA 2018: 359-361 - [c140]Björn Feldkord, Friedhelm Meyer auf der Heide:
Online Facility Location with Mobile Facilities. SPAA 2018: 373-381 - 2017
- [c139]Matthias Fischer, Daniel Jung
Gathering Anonymous, Oblivious Robots on a Grid. ALGOSENSORS 2017: 168-181 - [c138]Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan:
A Continuous Strategy for Collisionless Gathering. ALGOSENSORS 2017: 182-197 - [c137]Björn Feldkord, Christine Markarian, Friedhelm Meyer auf der Heide:
Price Fluctuation in Online Leasing. COCOA (2) 2017: 17-31 - [c136]Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan:
Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. FAW 2017: 139-150 - [c135]Pascal Bemmann, Felix Biermeier, Jan Bürmann
Monitoring of Domain-Related Problems in Distributed Data Streams. SIROCCO 2017: 212-226 - [c134]Björn Feldkord, Friedhelm Meyer auf der Heide:
The Mobile Server Problem. SPAA 2017: 313-319 - [c133]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Non-clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. WAOA 2017: 207-222 - [c132]Felix Biermeier, Björn Feldkord, Manuel Malatyali, Friedhelm Meyer auf der Heide:
A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries. WAOA 2017: 285-300 - 2016
- [c131]Shouwei Li, Friedhelm Meyer auf der Heide, Pavel Podlipyan:
The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots. ALGOSENSORS 2016: 62-79 - [c130]Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan:
On the Parameterized Parallel Complexity and the Vertex Cover Problem. COCOA 2016: 477-488 - [c129]Jürgen König, Alexander Mäcker, Friedhelm Meyer auf der Heide, Sören Riechers:
Scheduling with Interjob Communication on Parallel Processors. COCOA 2016: 563-577 - [c128]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Cost-Efficient Scheduling on Machines from the Cloud. COCOA 2016: 578-592 - [c127]Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan:
The Monotone Circuit Value Problem with Bounded Genus Is in NC. COCOON 2016: 92-102 - [c126]Sebastian Abshoff, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung
Gathering a Closed Chain of Robots on a Grid. IPDPS 2016: 689-699 - [c125]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide:
On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams. IPDPS 2016: 700-709 - [c124]Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung
Asymptotically Optimal Gathering on a Grid. SPAA 2016: 301-312 - 2015
- [c123]Shouwei Li, Alexander Mäcker, Christine Markarian, Friedhelm Meyer auf der Heide, Sören Riechers:
Towards Flexible Demands in Online Leasing Problems. COCOON 2015: 277-288 - [c122]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide:
Online Top-k-Position Monitoring of Distributed Data Streams. IPDPS 2015: 357-364 - [c121]Christine Markarian, Friedhelm Meyer auf der Heide:
Online Resource Leasing. PODC 2015: 343-344 - [c120]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Non-preemptive Scheduling on Machines with Setup Times. WADS 2015: 542-553 - 2014
- [c119]Sebastian Abshoff, Christine Markarian, Friedhelm Meyer auf der Heide:
Randomized Online Algorithms for Set Cover Leasing Problems. COCOA 2014: 25-34 - [c118]Tamás Lukovszki, Friedhelm Meyer auf der Heide:
Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots. OPODIS 2014: 248-262 - [c117]Sebastian Kniesburges, Christine Markarian, Friedhelm Meyer auf der Heide, Christian Scheideler:
Algorithmic Aspects of Resource Management in the Cloud. SIROCCO 2014: 1-13 - [c116]Sebastian Abshoff, Friedhelm Meyer auf der Heide:
Continuous Aggregation in Dynamic Ad-Hoc Networks. SIROCCO 2014: 194-209 - [c115]André Brinkmann
Scheduling shared continuous resources on many-cores. SPAA 2014: 128-137 - [c114]Andreas Cord-Landwehr, Alexander Mäcker, Friedhelm Meyer auf der Heide:
Quality of Service in Network Creation Games. WINE 2014: 423-428 - 2013
- [c113]Sebastian Abshoff, Markus Benter, Andreas Cord-Landwehr, Manuel Malatyali, Friedhelm Meyer auf der Heide:
Token Dissemination in Geometric Dynamic Networks. ALGOSENSORS 2013: 22-34 - [c112]Christine Markarian, Friedhelm Meyer auf der Heide, Michael Schubert:
A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks. ALGOSENSORS 2013: 217-227 - [c111]Markus Happe, Friedhelm Meyer auf der Heide, Peter Kling
On-The-Fly Computing: A novel paradigm for individualized IT services. ISORC 2013: 1-10 - [c110]Claudius Jähn, Benjamin Eikel, Matthias Fischer, Ralf Petring, Friedhelm Meyer auf der Heide:
Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties. ISVC (1) 2013: 108-118 - [c109]Ralf Petring, Benjamin Eikel, Claudius Jähn, Matthias Fischer, Friedhelm Meyer auf der Heide:
Real-Time 3D Rendering of Heterogeneous Scenes. ISVC (1) 2013: 448-458 - [c108]Sebastian Abshoff, Markus Benter, Manuel Malatyali, Friedhelm Meyer auf der Heide:
On Two-Party Communication through Dynamic Networks. OPODIS 2013: 11-22 - 2012
- [c107]Tim Süß, Clemens Koch, Claudius Jähn, Matthias Fischer, Friedhelm Meyer auf der Heide:
Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes. ISVC (1) 2012: 502-512 - [c106]Peter Kling
An Algorithm for Online Facility Leasing. SIROCCO 2012: 61-72 - [c105]Barbara Kempkes, Peter Kling
Optimal and competitive runtime bounds for continuous, local gathering of mobile robots. SPAA 2012: 18-26 - [c104]Philipp Brandes, Friedhelm Meyer auf der Heide:
Distributed computing in fault-prone dynamic networks. TADDS 2012: 9-14 - [c103]Barbara Kempkes, Friedhelm Meyer auf der Heide:
Continuous Local Strategies for Robotic Formation Problems. SEA 2012: 9-17 - 2011
- [c102]Barbara Kempkes, Friedhelm Meyer auf der Heide:
Local, Self-organizing Strategies for Robotic Formation Problems. ALGOSENSORS 2011: 4-12 - [c101]Andreas Cord-Landwehr, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling
A New Approach for Analyzing Convergence Algorithms for Mobile Robots. ICALP (2) 2011: 650-661 - [c100]Joachim Gehweiler, Peter Kling
An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment. PPAM (2) 2011: 31-40 - [c99]Philipp Brandes, Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide:
Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. SIROCCO 2011: 138-149 - [c98]Andreas Cord-Landwehr, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling
Collisionless Gathering of Robots with an Extent. SOFSEM 2011: 178-189 - [c97]Bastian Degener, Barbara Kempkes, Tobias Langner, Friedhelm Meyer auf der Heide, Peter Pietrzyk, Roger Wattenhofer:
A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. SPAA 2011: 139-148 - [c96]Peter Kling
Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed. SPAA 2011: 159-166 - [c95]Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide:
Building Simple Formations in Large Societies of Tiny Mobile Robots. FET 2011: 153-155 - 2010
- [c94]Bastian Degener, Barbara Kempkes, Peter Kling
A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. SIROCCO 2010: 168-182 - [c93]Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide:
A local O(n2) gathering algorithm. SPAA 2010: 217-223 - 2009
- [c92]Jan Mehler, Friedhelm Meyer auf der Heide:
Power-aware online file allocation in mobile ad hoc networks: [extended abstract]. SPAA 2009: 347-356 - 2008
- [c91]Friedhelm Meyer auf der Heide, Barbara Schneider:
Local Strategies for Connecting Stations by Small Robotic Networks. BICC 2008: 95-104 - 2007
- [c90]André Brinkmann
Dynamic and Redundant Data Placement. ICDCS 2007: 29 - [c89]Miroslaw Dynia, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, Jonas Schrieb:
Local strategies for maintaining a chain of relay stations between an explorer and a base station. SPAA 2007: 260-269 - 2006
- [c88]Miroslaw Dynia, Jaroslaw Kutylowski, Pawel Lorek
Maintaining Communication Between an Explorer and a Base Station. BICC 2006: 137-146 - [c87]Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu:
De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space). LATIN 2006: 349-361 - [c86]Miroslaw Dynia, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, Christian Schindelhauer
Smart Robot Teams Exploring Sparse Trees. MFCS 2006: 327-338 - 2005
- [c85]Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide:
Dynamic Load Balancing in Distributed Hash Tables. IPTPS 2005: 217-225 - [c84]Marcin Bienkowski, Friedhelm Meyer auf der Heide:
Page Migration in Dynamic Networks. MFCS 2005: 1-14 - [c83]Olaf Bonorden, Joachim Gehweiler, Friedhelm Meyer auf der Heide:
A Web Computing Environment for Parallel Algorithms in Java. PPAM 2005: 801-808 - [c82]Olaf Bonorden, Joachim Gehweiler, Friedhelm Meyer auf der Heide:
Load Balancing Strategies in a Web Computing Environment. PPAM 2005: 839-846 - 2004
- [c81]Vikas Bansal
Labeling Smart Dust. ESA 2004: 77-88 - [c80]André Brinkmann, Michael Heidebuer, Friedhelm Meyer auf der Heide, Ulrich Rückert, Kay Salzwedel, Mario Vodisek:
V: Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System. MSST 2004: 153-157 - [c79]Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide:
Fighting against two adversaries: page migration in dynamic networks. SPAA 2004: 64-73 - [c78]Stefano Leonardi, Alberto Marchetti-Spaccamela
Scheduling against an adversarial network. SPAA 2004: 151-159 - 2003
- [c77]Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler:
Smoothed Motion Complexity. ESA 2003: 161-171 - [c76]Olaf Bonorden, Nikolaus Brüls, Uwe Kastens, Dinh Khoi Le, Friedhelm Meyer auf der Heide, Jörg-Christian Niemann, Mario Porrmann
A holistic methodology for network processor design. LCN 2003: 583- - 2002
- [c75]Friedhelm Meyer auf der Heide, Mohan Kumar, Sotiris E. Nikoletseas, Paul G. Spirakis:
Mobile Computing, Mobile Networks. Euro-Par 2002: 933-934 - [c74]Friedhelm Meyer auf der Heide, Christian Schindelhauer
Energy, congestion and dilation in radio networks. SPAA 2002: 230-237 - [c73]Jan Klein
The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments. VRST 2002: 137-146 - 2001
- [c72]Friedhelm Meyer auf der Heide, Rolf Wanka:
Parallel Bridging Models and Their Impact on Algorithm Design. International Conference on Computational Science (2) 2001: 628-637 - [c71]Michael Wand, Matthias Fischer, Ingmar Peter, Friedhelm Meyer auf der Heide, Wolfgang Straßer:
The randomized z-buffer algorithm: interactive rendering of highly complex scenes. SIGGRAPH 2001: 361-370 - [c70]Friedhelm Meyer auf der Heide:
Invited Presentation: Data Management in Networks. WG 2001: 8 - 2000
- [c69]Friedhelm Meyer auf der Heide, Miroslaw Kutylowski, Prabhakar Ragde:
Complexity Theory and Algorithms. Euro-Par 2000: 455 - [c68]Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping:
Optimal broadcast on parallel locality models. SIROCCO 2000: 221-225 - [c67]Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann:
Caching in networks (extended abstract). SODA 2000: 430-439 - [c66]Friedhelm Meyer auf der Heide, Harald Räcke, Matthias Westermann:
Data management in hierarchical bus networks. SPAA 2000: 109-118 - 1999
- [c65]Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann:
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks. ESA 1999: 89-100 - [c64]Friedemann Mattern, Friedhelm Meyer auf der Heide:
Vorwort: Junge Informatik. GI Jahrestagung 1999: 137 - [c63]Ernst W. Mayr, Friedhelm Meyer auf der Heide, Rolf Wanka:
International Workshop on Communication and Data Management in Large Networks. GI Jahrestagung 1999: 334 - [c62]Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann:
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. SPAA 1999: 165-174 - 1998
- [c61]Friedhelm Meyer auf der Heide, Gabriel Terán Martinez:
Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation. LATIN 1998: 316-330 - [c60]Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman
Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. STOC 1998: 378-388 - 1997
- [c59]Matthias Fischer, Friedhelm Meyer auf der Heide, Willy-Bernhard Strothmann:
Dynamic Data Structures for Realtime Management of Large Geormetric Scences (Extended Abstract). ESA 1997: 157-170 - [c58]Friedhelm Meyer auf der Heide, Berthold Vöcking:
Static and Dynamic Data Management in Networks. Euro-Par 1997: 46-56 - [c57]Efstratios Karaivazoglou, Friedhelm Meyer auf der Heide:
Routing on Asyncronous Processor Networks. Euro-Par 1997: 250-257 - [c56]Bruce M. Maggs, Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann:
Exploiting Locality for Data Management in Systems of Limited Bandwidth. FOCS 1997: 284-293 - [c55]Friedhelm Meyer auf der Heide, Thomas Decker:
Parallel Computing in Paderborn: The SFB 376 "Massive Parallelism - Algorithms, Design Methods, Applications". GI Jahrestagung 1997: 164-171 - [c54]Stefan Bock
Optimal Wormhole Routing in the (n, d)-Torus. IPPS 1997: 326-332 - [c53]Armin Bäumker, Friedhelm Meyer auf der Heide:
Communication Efficient Parallel Searching. IRREGULAR 1997: 233-254 - [c52]Petra Berenbrink, Friedhelm Meyer auf der Heide, Klaus Schröder:
Allocating Weighted Jobs in Parallel. SPAA 1997: 302-310 - 1996
- [c51]Friedhelm Meyer auf der Heide, Klaus Schröder, Frank Schwarze:
Routing on Networks of Optical Crossbars (Extended Abstract). Euro-Par, Vol. I 1996: 299-306 - [c50]Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, Ingo Rieping:
Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP Model. Euro-Par, Vol. II 1996: 369-376 - [c49]Friedhelm Meyer auf der Heide, Christian Scheideler:
Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. FOCS 1996: 370-379 - [c48]Friedhelm Meyer auf der Heide, Christian Scheideler:
Communication in Parallel Systems. SOFSEM 1996: 16-33 - [c47]Petra Berenbrink, Friedhelm Meyer auf der Heide, Volker Stemann:
Fault-Tolerant Shared Memory Simulations. STACS 1996: 181-192 - [c46]Robert Cypher, Friedhelm Meyer auf der Heide, Christian Scheideler, Berthold Vöcking:
Universal Algorithms for Store-and-Forward and Wormhole Routing. STOC 1996: 356-365 - [c45]Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky:
A Lower Bound for Randomized Algebraic Decision Trees. STOC 1996: 612-619 - 1995
- [c44]Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide:
Truly Efficient Parallel Algorithms: c-Optimal Multisearch for an Extension of the BSP Model (Extended Abstract). ESA 1995: 17-30 - [c43]Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann:
Shared Memory Simulations with Triple-Logarithmic Delay. ESA 1995: 46-59 - [c42]Friedhelm Meyer auf der Heide, Christian Scheideler:
Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. ESA 1995: 341-354 - [c41]Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann:
Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration. ISTCS 1995: 11-19 - [c40]Friedhelm Meyer auf der Heide, Martin Storch, Rolf Wanka:
Optimal Trade-Offs Between Size and Slowdown for Universal Parallel Networks. SPAA 1995: 119-128 - [c39]Friedhelm Meyer auf der Heide, Christian Scheideler:
Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). SPAA 1995: 137-146 - [c38]Friedhelm Meyer auf der Heide, Christian Scheideler, Volker Stemann:
Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. STACS 1995: 267-278 - [c37]Friedhelm Meyer auf der Heide, Berthold Vöcking:
A Packet Routing Protocol for Arbitrary Networks. STACS 1995: 291-302 - [c36]Friedhelm Meyer auf der Heide, Matthias Westermann:
Hot-Potato Routing on Multi-Dimensional Tori. WG 1995: 209-221 - 1993
- [c35]Foued Ameur, Paul Fischer, Klaus-Uwe Höffgen, Friedhelm Meyer auf der Heide:
Trial and error: a new approach to space-bounded learning. EuroCOLT 1993: 133-144 - [c34]Friedhelm Meyer auf der Heide, Brigitte Oesterdiekhoff, Rolf Wanka:
Strongly Adaptive Token Distribution. ICALP 1993: 398-409 - [c33]Martin Dietzfelbinger
Simple, Efficient Shared Memory Simulations. SPAA 1993: 110-119 - [c32]Katharina Lürwer-Brüggemeier, Friedhelm Meyer auf der Heide:
Capabilities and Complexity of Computations with Integer Division. STACS 1993: 463-472 - 1992
- [c31]Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
High Performance Universal Hashing, with Applications to Shared Memory Simulations. Data Structures and Efficient Algorithms 1992: 250-269 - [c30]Friedhelm Meyer auf der Heide:
Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines. Heinz Nixdorf Symposium 1992: 20-29 - [c29]Friedhelm Meyer auf der Heide, Hieu Thien Pham:
On the Performance of Networks with Multiple Busses. STACS 1992: 97-108 - [c28]Richard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide:
Efficient PRAM Simulation on a Distributed Memory Machine. STOC 1992: 318-326 - 1990
- [c27]Martin Dietzfelbinger
A New Universal Class of Hash Functions and Dynamic Hashing in Real Time. ICALP 1990: 6-19 - [c26]Friedhelm Meyer auf der Heide:
Dynamic Hashing Strategies. MFCS 1990: 76-87 - [c25]Marek Karpinski, Friedhelm Meyer auf der Heide:
On the Complexity of Genuinely Polynomial Computation. MFCS 1990: 362-368 - [c24]Martin Dietzfelbinger
How to Distribute a Dictionary in a Complete Network. STOC 1990: 117-127 - [c23]Joseph Gil, Friedhelm Meyer auf der Heide, Avi Wigderson:
Not All Keys Can Be Hashed in Constant Time (Preliminary Version). STOC 1990: 244-253 - 1989
- [c22]Martin Dietzfelbinger
An Optimal Parallel Dictionary. SPAA 1989: 360-368 - [c21]Friedhelm Meyer auf der Heide:
On Genuinely Time Bounded Compuations. STACS 1989: 1-16 - [c20]Friedhelm Meyer auf der Heide, Rolf Wanka
Time-Optimal Simulations of Networks by Universal Parallel Computers. STACS 1989: 120-131 - [c19]Friedhelm Meyer auf der Heide:
Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays. STACS 1989: 181-192 - 1988
- [c18]Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan:
Dynamic Perfect Hashing: Upper and Lower Bounds. FOCS 1988: 524-531 - [c17]Bettina Just, Friedhelm Meyer auf der Heide, Avi Wigderson:
On Computations with Integer Division. STACS 1988: 29-37 - [c16]Martin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert:
Upper and Lower Bounds for the Dictionary Problem (Abstract). SWAT 1988: 214-215 - 1986
- [c15]Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal
A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. ICALP 1986: 50-59 - [c14]Friedhelm Meyer auf der Heide:
Speeding up Random Access Machines by Few Processors. STACS 1986: 142-152 - [c13]Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal
A Time-Space Tradeoff for Element Distinctness. STACS 1986: 353-358 - 1985
- [c12]Friedhelm Meyer auf der Heide:
Nondeterministic versus Probabilistic Linear Search Algorithms. FOCS 1985: 65-73 - [c11]Friedhelm Meyer auf der Heide, Avi Wigderson:
The Complexity of Parallel Sorting. FOCS 1985: 532-540 - [c10]Faith E. Fich, Friedhelm Meyer auf der Heide, Prabhakar Ragde, Avi Wigderson:
One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation. STOC 1985: 48-58 - [c9]Friedhelm Meyer auf der Heide:
Fast Algorithms for N-Dimensional Restrictions of Hard Problems. STOC 1985: 413-420 - 1984
- [c8]Friedhelm Meyer auf der Heide, Rüdiger Reischuk:
On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication. FOCS 1984: 56-64 - [c7]Friedhelm Meyer auf der Heide:
Efficient Simulations among Several Models of Parallel Computers. STACS 1984: 218-229 - 1983
- [c6]Friedhelm Meyer auf der Heide:
A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem. STOC 1983: 70-79 - [c5]Friedhelm Meyer auf der Heide:
Efficiency of universal parallel computers. Theoretical Computer Science 1983: 221-241 - 1981
- [c4]Friedhelm Meyer auf der Heide, Hans-Anton Rollik:
Random Access Machines and Straight-Line Programs. FCT 1981: 259-264 - [c3]Friedhelm Meyer auf der Heide:
Time-Processor Trade-offs for Universal Parallel Computers. MFCS 1981: 433-441 - 1980
- [c2]Peter Klein, Friedhelm Meyer auf der Heide:
Untere Zeitschranken für das Rucksack-Problem. GI Jahrestagung 1980: 365-374 - 1979
- [c1]Friedhelm Meyer auf der Heide:
A Comparison Between Two Variations of a Pebble Game on Graphs. ICALP 1979: 411-421
Parts in Books or Collections
- 2022
- [p7]Jannik Castenow, Björn Feldkord, Jonas Hanselle, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide:
Distributed Data Streams. Algorithms for Big Data 2022: 179-195 - 2019
- [p6]Peter Kling
Continuous Protocols for Swarm Robotics. Distributed Computing by Mobile Entities 2019: 317-334 - 2016
- [p5]Matthias Fischer, Claudius Jähn, Friedhelm Meyer auf der Heide, Ralf Petring:
Algorithm Engineering Aspects of Real-Time Rendering Algorithms. Algorithm Engineering 2016: 226-244 - 2011
- [p4]Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide:
Energy-Awareness in Self-organising Robotic Exploration Teams. Organic Computing 2011: 531-543 - [p3]Joachim Gehweiler, Friedhelm Meyer auf der Heide:
Bin Packing - How Do I Get My Stuff into the Boxes. Algorithms Unplugged 2011: 367-374 - 2008
- [p2]Joachim Gehweiler, Friedhelm Meyer auf der Heide:
Bin Packing oder "Wie bekomme ich die Klamotten in die Kisten?". Taschenbuch der Algorithmen 2008: 395-403 - 1992
- [p1]Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
Dynamic Hashing in Real Time. Informatik 1992: 95-119
Editorship
- 2016
- [e13]Falko Dressler, Friedhelm Meyer auf der Heide:
Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2016, Paderborn, Germany, July 4-8, 2016. ACM 2016, ISBN 978-1-4503-4184-4 [contents] - 2014
- [e12]Paola Flocchini, Jie Gao, Evangelos Kranakis
Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8243, Springer 2014, ISBN 978-3-642-45345-8 [contents] - 2011
- [e11]Rajmohan Rajaraman, Friedhelm Meyer auf der Heide:
SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011). ACM 2011, ISBN 978-1-4503-0743-7 [contents] - 2010
- [e10]Samson Abramsky
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Lecture Notes in Computer Science 6198, Springer 2010, ISBN 978-3-642-14164-5 [contents] - [e9]Samson Abramsky
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Lecture Notes in Computer Science 6199, Springer 2010, ISBN 978-3-642-14161-4 [contents] - [e8]Friedhelm Meyer auf der Heide, Cynthia A. Phillips:
SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010. ACM 2010, ISBN 978-1-4503-0079-7 [contents] - 2009
- [e7]Friedhelm Meyer auf der Heide, Michael A. Bender:
SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009. ACM 2009, ISBN 978-1-60558-606-9 [contents] - 2008
- [e6]Friedhelm Meyer auf der Heide, Nir Shavit:
SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, June 14-16, 2008. ACM 2008, ISBN 978-1-59593-973-9 [contents] - 2006
- [e5]Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner:
Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005. Dagstuhl Seminar Proceedings 05361, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - 2003
- [e4]Arnold L. Rosenberg, Friedhelm Meyer auf der Heide:
SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003). ACM 2003, ISBN 1-58113-661-7 [contents] - 2001
- [e3]Friedhelm Meyer auf der Heide:
Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings. Lecture Notes in Computer Science 2161, Springer 2001, ISBN 3-540-42493-8 [contents] - 1996
- [e2]Friedhelm Meyer auf der Heide, Burkhard Monien:
Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings. Lecture Notes in Computer Science 1099, Springer 1996, ISBN 3-540-61440-0 [contents] - 1993
- [e1]Friedhelm Meyer auf der Heide, Burkhard Monien, Arnold L. Rosenberg:
Parallel Architectures and Their Efficient Use, First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992, Proceedings. Lecture Notes in Computer Science 678, Springer 1993, ISBN 3-540-56731-3 [contents]
Informal and Other Publications
- 2022
- [i31]Jannik Castenow, Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide:
The k-Server with Preferences Problem. CoRR abs/2205.11102 (2022) - [i30]Jannik Castenow, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann, Friedhelm Meyer auf der Heide:
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility. CoRR abs/2206.07567 (2022) - 2021
- [i29]Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop:
Full Version - Server Cloud Scheduling. CoRR abs/2108.02109 (2021) - [i28]Jannik Castenow, Thorsten Götte, Till Knollmann, Friedhelm Meyer auf der Heide:
The Max-Line-Formation Problem. CoRR abs/2109.11856 (2021) - 2020
- [i27]Michael Braun, Jannik Castenow, Friedhelm Meyer auf der Heide:
Local Gathering of Mobile Robots in Three Dimensions. CoRR abs/2005.07495 (2020) - [i26]Jannik Castenow, Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide:
The Online Multi-Commodity Facility Location Problem. CoRR abs/2005.08391 (2020) - [i25]Jannik Castenow, Peter Kling, Till Knollmann, Friedhelm Meyer auf der Heide:
A Discrete and Continuous Study of the Max-Chain-Formation Problem. CoRR abs/2010.02043 (2020) - [i24]Jannik Castenow, Jonas Harbig, Daniel Jung, Till Knollmann, Friedhelm Meyer auf der Heide:
Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility. CoRR abs/2010.04424 (2020) - 2019
- [i23]Björn Feldkord, Friedhelm Meyer auf der Heide:
The Mobile Server Problem. CoRR abs/1904.05220 (2019) - [i22]Sascha Brandt, Claudius Jähn, Matthias Fischer, Friedhelm Meyer auf der Heide:
Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels. CoRR abs/1904.08225 (2019) - [i21]Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide:
Managing Multiple Mobile Resources. CoRR abs/1907.09834 (2019) - [i20]Alexander Mäcker, Friedhelm Meyer auf der Heide, Simon Pukrop:
Approximating Weighted Completion Time for Order Scheduling with Setup Times. CoRR abs/1910.08360 (2019) - 2017
- [i19]Matthias Fischer, Daniel Jung, Friedhelm Meyer auf der Heide:
Gathering Anonymous, Oblivious Robots on a Grid. CoRR abs/1702.03400 (2017) - [i18]Pascal Bemmann, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann, Steffen Knorr, Nils Kothe, Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers, Johannes Schaefer, Jannik Sundermeier:
Monitoring of Domain-Related Problems in Distributed Data Streams. CoRR abs/1706.03568 (2017) - [i17]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. CoRR abs/1709.05896 (2017) - [i16]Felix Biermeier, Björn Feldkord, Manuel Malatyali, Friedhelm Meyer auf der Heide:
A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries. CoRR abs/1709.07259 (2017) - 2016
- [i15]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide:
On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams. CoRR abs/1601.04448 (2016) - [i14]Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, Friedhelm Meyer auf der Heide:
Asymptotically Optimal Gathering on a Grid. CoRR abs/1602.03303 (2016) - [i13]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Cost-efficient Scheduling on Machines from the Cloud. CoRR abs/1609.01184 (2016) - 2015
- [i12]Sebastian Abshoff, Andreas Cord-Landwehr, Daniel Jung, Friedhelm Meyer auf der Heide:
Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case. CoRR abs/1501.04877 (2015) - [i11]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Non-Preemptive Scheduling on Machines with Setup Times. CoRR abs/1504.07066 (2015) - [i10]Faisal N. Abu-Khzam, Christine Markarian, Friedhelm Meyer auf der Heide, Michael Schubert:
Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks. CoRR abs/1510.01866 (2015) - [i9]Sebastian Abshoff, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, Friedhelm Meyer auf der Heide:
Gathering a Closed Chain of Robots on a Grid. CoRR abs/1510.05454 (2015) - 2014
- [i8]Andreas Cord-Landwehr, Alexander Mäcker, Friedhelm Meyer auf der Heide:
Quality of Service in Network Creation Games. CoRR abs/1409.5366 (2014) - [i7]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide:
Online Top-k-Position Monitoring of Distributed Data Streams. CoRR abs/1410.7912 (2014) - 2013
- [i6]Friedhelm Meyer auf der Heide, Kamil Swierkot:
Hierarchies. CoRR abs/1311.7229 (2013) - 2008
- [i5]Matthias Fischer, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf der Heide, Martin Ziegler:
Planar Visibility Counting. CoRR abs/0810.0052 (2008) - 2005
- [i4]Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner:
05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks. Algorithmic Aspects of Large and Complex Networks 2005 - [i3]Marcin Bienkowski, Valentina Damerow, Friedhelm Meyer auf der Heide, Christian Sohler
Average case complexity of Voronoi diagrams of n sites from the unit cube. EuroCG 2005: 167-170 - [i2]Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu:
De Dictionariis Dynamicis Pauco Spatio Utentibus. CoRR abs/cs/0512081 (2005) - 1995
- [i1]Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky:
A Lower Bound for Randomized Algebraic Decision Trees. Electron. Colloquium Comput. Complex. TR95 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-10-28 23:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: