Friedhelm Meyer auf der Heide

From MaRDI portal
Person:287049

Available identifiers

zbMath Open meyer-auf-der-heide.friedhelmWikidataQ1457235 ScholiaQ1457235MaRDI QIDQ287049

List of research outcomes

PublicationDate of PublicationType
Server cloud scheduling2024-04-02Paper
Hot-potato routing on multi-dimensional tori2024-02-28Paper
Unifying gathering protocols for swarms of mobile robots2023-10-04Paper
A Dynamic Distributed Data Structure for Top-k and k-Select Queries2023-06-30Paper
Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model2023-05-08Paper
Shared memory simulations with triple-logarithmic delay2023-05-08Paper
Routing with bounded buffers and hot-potato routing in vertex-symmetric networks2023-05-08Paper
Gathering Anonymous, Oblivious Robots on a Grid2022-12-09Paper
A Continuous Strategy for Collisionless Gathering2022-12-09Paper
Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation2022-11-17Paper
Server cloud scheduling2022-10-19Paper
Local Gathering of Mobile Robots in Three Dimensions2022-09-01Paper
On the performance of networks with multiple busses2022-08-18Paper
On genuinely time bounded computations2022-08-16Paper
Time-optimal simulations of networks by universal parallel computers2022-08-16Paper
Computing minimum spanning forests on 1- and 2-dimensional processor arrays2022-08-16Paper
Gathering a Euclidean closed chain of robots in linear time2022-06-24Paper
A discrete and continuous study of the \textsc{Max-Chain-Formation} problem2022-06-08Paper
Online facility location with mobile facilities2022-02-21Paper
Dynamic data structures for realtime management of large geometric scenes (extended abstract)2021-12-20Paper
Managing multiple mobile resources2021-09-28Paper
The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots2021-01-25Paper
A continuous strategy for collisionless gathering2021-01-25Paper
Managing multiple mobile resources2020-08-24Paper
https://portal.mardi4nfdi.de/entity/Q33010102020-08-11Paper
Approximating Weighted Completion Time for Order Scheduling with Setup Times2020-07-20Paper
Gathering anonymous, oblivious robots on a grid2020-04-06Paper
Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks2019-09-05Paper
Efficient parallel algorithms for parameterized problems2019-08-20Paper
Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity2019-04-26Paper
Strongly adaptive token distribution2019-03-29Paper
The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots2018-12-07Paper
Cost-efficient scheduling on machines from the cloud2018-12-06Paper
Scheduling with interjob communication on parallel processors2018-12-06Paper
Scheduling shared continuous resources on many-cores2018-11-07Paper
Token dissemination in geometric dynamic networks2018-10-17Paper
A distributed approximation algorithm for strongly connected dominating-absorbent sets in asymmetric wireless ad-hoc networks2018-10-17Paper
Non-clairvoyant scheduling to minimize MAX flow time on a machine with setup times2018-06-22Paper
A communication-efficient distributed data structure for top-\(k\) and \(k\)-select queries2018-06-22Paper
Towards flexible demands in online leasing problems2018-05-18Paper
Monitoring of domain-related problems in distributed data streams2018-04-12Paper
Price fluctuation in online leasing2018-03-26Paper
Exploiting storage redundancy to speed up randomized shared memory simulations2017-12-04Paper
A packet routing protocol for arbitrary networks2017-12-04Paper
Fault-tolerant shared memory simulations2017-11-16Paper
Cost-efficient scheduling on machines from the cloud2017-02-01Paper
On the Parameterized Parallel Complexity and the Vertex Cover Problem2017-02-01Paper
Scheduling with Interjob Communication on Parallel Processors2017-02-01Paper
Towards the price of leasing online2016-11-29Paper
The Monotone Circuit Value Problem with Bounded Genus Is in NC2016-09-02Paper
Transforming comparison model lower bounds to the parallel-random-access-machine2016-05-26Paper
Non-preemptive Scheduling on Machines with Setup Times2015-10-30Paper
Towards Flexible Demands in Online Leasing Problems2015-10-29Paper
Randomized Online Algorithms for Set Cover Leasing Problems2015-09-11Paper
Quality of Service in Network Creation Games2015-01-07Paper
A survey on relay placement with runtime and approximation guarantees2014-10-24Paper
Smoothed analysis of left-to-right maxima with applications2014-09-09Paper
Continuous Aggregation in Dynamic Ad-Hoc Networks2014-08-07Paper
Energy-efficient strategies for building short chains of mobile robots locally2014-01-13Paper
A New Approach for Analyzing Convergence Algorithms for Mobile Robots2011-07-07Paper
Collisionless Gathering of Robots with an Extent2011-02-15Paper
A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots2010-06-17Paper
Algorithms - ESA 20032010-03-03Paper
Optimal algorithms for page migration in dynamic networks2009-12-10Paper
Optimal strategies for maintaining a chain of relays between an explorer and a base camp2009-08-21Paper
De Dictionariis Dynamicis Pauco Spatio Utentibus2008-09-18Paper
Smart Robot Teams Exploring Sparse Trees2007-09-05Paper
https://portal.mardi4nfdi.de/entity/Q34431532007-05-31Paper
Parallel Processing and Applied Mathematics2007-05-02Paper
Deterministic routing with bounded buffers: turning offline into online protocols2007-03-29Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
Congestion, dilation, and energy in radio networks2005-02-08Paper
https://portal.mardi4nfdi.de/entity/Q48131812004-08-12Paper
Optimal broadcast on parallel locality models2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44487412004-02-18Paper
https://portal.mardi4nfdi.de/entity/Q45425562004-01-27Paper
https://portal.mardi4nfdi.de/entity/Q45369002002-11-06Paper
Data management in networks: Experimental evaluation of a provably good strategy2002-06-27Paper
https://portal.mardi4nfdi.de/entity/Q45369362002-06-25Paper
https://portal.mardi4nfdi.de/entity/Q27796042002-04-15Paper
https://portal.mardi4nfdi.de/entity/Q49526492000-05-10Paper
Contention Resolution in Hashing Based Shared Memory Simulations2000-03-19Paper
Allocating weighted jobs in parallel2000-01-10Paper
Shortest-Path Routing in Arbitrary Networks2000-01-09Paper
https://portal.mardi4nfdi.de/entity/Q42284891999-10-04Paper
https://portal.mardi4nfdi.de/entity/Q42285171999-10-04Paper
Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model1999-01-12Paper
Optimal tradeoffs between size and slowdown for universal parallel networks1998-08-24Paper
Routing on networks of optical crossbars1998-08-13Paper
A lower bound for randomized algebraic decision trees1998-05-13Paper
Simulating shared memory in real time: On the computation power of reconfigurable architectures1998-01-13Paper
Exploiting storage redundancy to speed up randomized shared memory simulations1997-09-10Paper
https://portal.mardi4nfdi.de/entity/Q47182271997-04-13Paper
The Tree Model for Hashing: Lower and Upper Bounds1997-03-25Paper
Efficient PRAM simulation on a distributed memory machine1997-02-18Paper
Strongly adaptive token distribution1996-09-22Paper
Trial and error: A new approach to space-bounded learning1995-11-15Paper
Dynamic Perfect Hashing: Upper and Lower Bounds1994-10-17Paper
https://portal.mardi4nfdi.de/entity/Q42815481994-04-07Paper
https://portal.mardi4nfdi.de/entity/Q40386771993-05-18Paper
An optimal parallel dictionary1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q39760401992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q33575281990-01-01Paper
On computations with integer division1989-01-01Paper
A tradeoff between search and update time for the implicit dictionary problem1988-01-01Paper
On the limits of computations with the floor function1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37967881988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38041861988-01-01Paper
A Time-Space Tradeoff for Element Distinctness1987-01-01Paper
The Complexity of Parallel Sorting1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37237031986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37255581986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37452721986-01-01Paper
Lower time bounds for integer programming with two variables1985-01-01Paper
Simulating probabilistic by deterministic algebraic computation trees1985-01-01Paper
Efficient Simulations among Several Models of Parallel Computers1985-01-01Paper
Lower time bounds for solving linear diophantine equations on several parallel computational models1985-01-01Paper
Lower bounds for solving linear diophantine equations on random access machines1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33349911984-01-01Paper
A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem1984-01-01Paper
A lower time bound for the knapsack problem on random access machines1983-01-01Paper
Efficiency of universal parallel computers1983-01-01Paper
Infinite cube-connected cycles1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39601231982-01-01Paper
A comparison of two variations of a pebble game on graphs1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39120261981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39120271981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39361991981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30486391979-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Friedhelm Meyer auf der Heide