Author image not provided
 Friedhelm Meyer Auf Der Heide

Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article0.67
Citation Count4
Publication count6
Publication years1983-2015
Available for download3
Average downloads per article94.33
Downloads (cumulative)283
Downloads (12 Months)20
Downloads (6 Weeks)3
Arrow RightAuthor only
· Editor only
· All roles

See all colleagues of this author

See all subject areas


7 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 7 of 7
Sort by:

February 2018 Journal of Scheduling: Volume 21 Issue 1, February 2018
Publisher: Kluwer Academic Publishers
Citation Count: 0

We consider the problem of scheduling a number of jobs on m identical processors sharing a continuously divisible resource. Each job j comes with a resource requirement [InlineEquation not available: see fulltext.]. The job can be processed at full speed if granted its full resource requirement. If receiving only an ...
Keywords: Approximation algorithms, Resources, Scheduling

May 2015 IPDPS '15: Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium
Publisher: IEEE Computer Society
Citation Count: 0

Consider n nodes connected to a single coordinator. Each node receives an individual online data stream of numbers and, at any point in time, the coordinator has to know the k nodes currently observing the largest values, for a given k between 1 and n. We design and analyze an ...
Keywords: distributed monitoring, continuous computation, tracking, top-k, online data streams, distributed maximum

3 published by ACM
May 2015 ACM Transactions on Parallel Computing - Special Issue on SPAA 2012: Volume 2 Issue 1, May 2015
Publisher: ACM
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 13,   Downloads (Overall): 85

Full text available: PDFPDF
We study a scenario in which n mobile robots with a limited viewing range are distributed in the Euclidean plane and have to solve a formation problem. The formation problems we consider are the G athering problem and the C hain-Formation problem. In the G athering problem, the robots have ...
Keywords: distributed algorithms, Mobile robots, local algorithms, robot gathering

4 published by ACM
July 2012 ACM Transactions on Algorithms (TALG): Volume 8 Issue 3, July 2012
Publisher: ACM
Citation Count: 2
Downloads (6 Weeks): 0,   Downloads (12 Months): 7,   Downloads (Overall): 198

Full text available: PDFPDF
A left-to-right maximum in a sequence of n numbers s 1 , …, s n is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that ...
Keywords: Binary search trees, convex hull, motion complexity, quicksort, smoothed analysis

August 1996 Acta Informatica: Volume 33 Issue 5, August 1996
Publisher: Springer-Verlag New York, Inc.
Citation Count: 0

A pac-learning algorithm is d -space bounded, if it stores at most d examples from the sample at any time. We characterize the d -space learnable concept classes. For this purpose we introduce the compression parameter of a concept class b and design our Trial and Error Learning Algorithm. We ...

October 1985 SFCS '85: Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Publisher: IEEE Computer Society
Citation Count: 2

The "component counting lower bound" known for deterministic linear search algorithms (LSA's) also holds for their probabilistic versions (PLSA's) for many problems, even if two-sided error is allowed, and if one does not charge for probabilistic choice. This implies lower bounds on PLSA's for e.g. the element distinctness problem (n ...

July 1983 Acta Informatica: Volume 19 Issue 3, July 1983
Publisher: Springer-Verlag New York, Inc.
Citation Count: 0

We consider parallel computers (PC's) with fixed communication network and bounded degree. We deal with the following question: How efficiently can one PC, a so-called universal PC, simulate each PC with n processors? This question is asked in [1] where a universal PC with O(n ) processors and time loss ...

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us