The following pages link to Friedhelm Meyer auf der Heide (Q287049):
Displaying 50 items.
- Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050) (← links)
- (Q346513) (redirect page) (← links)
- Towards the price of leasing online (Q346515) (← links)
- Energy-efficient strategies for building short chains of mobile robots locally (Q392202) (← links)
- A survey on relay placement with runtime and approximation guarantees (Q465673) (← links)
- Congestion, dilation, and energy in radio networks (Q706317) (← links)
- (Q826083) (redirect page) (← links)
- Dynamic data structures for realtime management of large geometric scenes (extended abstract) (Q826084) (← links)
- Optimal strategies for maintaining a chain of relays between an explorer and a base camp (Q838151) (← links)
- Deterministic routing with bounded buffers: turning offline into online protocols (Q873651) (← links)
- Optimal algorithms for page migration in dynamic networks (Q1044046) (← links)
- A lower time bound for the knapsack problem on random access machines (Q1052091) (← links)
- Lower time bounds for integer programming with two variables (Q1072938) (← links)
- A tradeoff between search and update time for the implicit dictionary problem (Q1108806) (← links)
- On the limits of computations with the floor function (Q1112603) (← links)
- Routing on networks of optical crossbars (Q1128720) (← links)
- A comparison of two variations of a pebble game on graphs (Q1149448) (← links)
- Efficiency of universal parallel computers (Q1166920) (← links)
- Infinite cube-connected cycles (Q1172387) (← links)
- An optimal parallel dictionary (Q1207956) (← links)
- Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model (Q1274330) (← links)
- Allocating weighted jobs in parallel (Q1293917) (← links)
- Exploiting storage redundancy to speed up randomized shared memory simulations (Q1365933) (← links)
- Simulating shared memory in real time: On the computation power of reconfigurable architectures (Q1369096) (← links)
- Optimal tradeoffs between size and slowdown for universal parallel networks (Q1384695) (← links)
- A lower bound for randomized algebraic decision trees (Q1386178) (← links)
- Data management in networks: Experimental evaluation of a provably good strategy (Q1601742) (← links)
- Scheduling shared continuous resources on many-cores (Q1617293) (← links)
- Cost-efficient scheduling on machines from the cloud (Q1631672) (← links)
- Scheduling with interjob communication on parallel processors (Q1631686) (← links)
- Non-clairvoyant scheduling to minimize MAX flow time on a machine with setup times (Q1644941) (← links)
- A communication-efficient distributed data structure for top-\(k\) and \(k\)-select queries (Q1644951) (← links)
- (Q1708590) (redirect page) (← links)
- Price fluctuation in online leasing (Q1708591) (← links)
- Monitoring of domain-related problems in distributed data streams (Q1742778) (← links)
- Towards flexible demands in online leasing problems (Q1750358) (← links)
- Token dissemination in geometric dynamic networks (Q1796421) (← links)
- A distributed approximation algorithm for strongly connected dominating-absorbent sets in asymmetric wireless ad-hoc networks (Q1796438) (← links)
- Simulating probabilistic by deterministic algebraic computation trees (Q1821560) (← links)
- Optimal broadcast on parallel locality models (Q1827284) (← links)
- Trial and error: A new approach to space-bounded learning (Q1901711) (← links)
- Strongly adaptive token distribution (Q1913698) (← links)
- Efficient PRAM simulation on a distributed memory machine (Q1923863) (← links)
- Online facility location with mobile facilities (Q2077377) (← links)
- Server cloud scheduling (Q2085746) (← links)
- Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation (Q2098190) (← links)
- Gathering a Euclidean closed chain of robots in linear time (Q2148881) (← links)
- A continuous strategy for collisionless gathering (Q2220827) (← links)
- Gathering anonymous, oblivious robots on a grid (Q2310768) (← links)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
