WorldCat Identities

Meyer auf der Heide, F. (Friedhelm) 1954-

Overview
Works: 188 works in 381 publications in 2 languages and 3,383 library holdings
Genres: Conference papers and proceedings 
Roles: Author, Editor, dgs, Other, htt, Contributor
Classifications: QA76.58, 004.35
Publication Timeline
.
Most widely held works by F Meyer auf der Heide
Parallel architectures and their efficient use : First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992 : proceedings by F Meyer auf der Heide( Book )

25 editions published between 1992 and 1993 in 3 languages and held by 522 WorldCat member libraries worldwide

"Research in the field of parallel computer architectures and parallel algorithms has been very successful in recent years, and further progress isto be expected. On the other hand, the question of basic principles of the architecture of universal parallel computers and their realizations is still wide open. The answer to this question must be regarded as mostimportant for the further development of parallel computing and especially for user acceptance. The First Heinz Nixdorf Symposium brought together leading experts in the field of parallel computing and its applications to discuss the state of the art, promising directions of research, and future perspectives. It was the first in a series of Heinz Nixdorf Symposia, intended to cover varying subjects from the research spectrum of the Heinz Nixdorf Institute of the University of Paderborn. This volume presents the proceedings of the symposium, which was held in Paderborn in November 1992. The contributions are grouped into four parts: parallel computation models and simulations, existing parallel machines, communication and programming paradigms, and parallel algorithms."--PUBLISHER'S WEBSITE
Automata, languages and programming : 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996 : proceedings by B Monien( )

18 editions published in 1996 in English and held by 456 WorldCat member libraries worldwide

"This volume constitutes the refereed proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP '96), held at Paderborn, Germany, in July 1996. ICALP is an annual conference sponsored by the European Association on Theoretical Computer Science (EATCS). The proceedings contain 52 refereed papers selected from 172 submissions and 4 invited papers. The papers cover the whole range of theoretical computer science; they are organized in sections on: Process Theory; Fairness, Domination, and the u-Calculus; Logic and Algebra; Languages and Processes; Algebraic Complexity; Graph Algorithms; Automata; Complexity Theory; Combinatorics on Words; Algorithms; Lower Bounds; Data Structures ..."--PUBLISHER'S WEBSITE
Algorithms-ESA 2001 : 9th annual European symposium, Åarhus, Denmark, August 28-31, 2001 : proceedings by F Meyer auf der Heide( )

28 editions published in 2001 in English and Undetermined and held by 435 WorldCat member libraries worldwide

This book constitutes the refereed proceedings of the 9th Annual European Symposium on Algorithms, ESA 2001, held in Aarhus, Denmark, in August 2001. The 41 revised full papers presented together with three invited contributions were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on caching and prefetching, online algorithms, data structures, optimization and approximation, sequences, scheduling, shortest paths, geometry, distributed algorithms, graph algorithms, pricing, broadcasting and multicasting, graph labeling and graph drawing, and graphs
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 by Paola Flocchini( )

13 editions published in 2014 in English and held by 429 WorldCat member libraries worldwide

This book constitutes the proceedings of the 9th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2013, held in Sophia Antipolis, France, in September 2013. The 19 papers presented in this volume were carefully reviewed and selected from 30 submissions. They deal with sensor network algorithms, wireless networks and distributed robotics algorithms; and experimental algorithms
Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures by F Meyer auf der Heide( )

2 editions published in 2011 in English and held by 250 WorldCat member libraries worldwide

Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures by F Meyer auf der Heide( )

2 editions published in 2010 in English and held by 249 WorldCat member libraries worldwide

Automata, languages and programming : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, proceedings by Samson Abramsky( )

19 editions published in 2010 in English and held by 84 WorldCat member libraries worldwide

Annotation
Algorithmische Grundlagen für die Selbstorganisation von Roboterschwärmen [87. Sitzung vom 13. Februar 2013 in Düsseldorf] by F Meyer auf der Heide( Book )

5 editions published between 2014 and 2019 in German and held by 66 WorldCat member libraries worldwide

Effizienz universeller Parallelrechner by F Meyer auf der Heide( Book )

2 editions published in 1981 in German and held by 39 WorldCat member libraries worldwide

Algorithms 9th annual European symposium ; proceedings( Book )

3 editions published in 2001 in English and held by 33 WorldCat member libraries worldwide

Conjunctive queries, arithmetic circuits and counting complexity by Stefan Mengel( )

1 edition published in 2013 in English and held by 29 WorldCat member libraries worldwide

This thesis deals with several subjects from counting complexity and arithmetic circuit complexity.The first part explores the complexity of counting solutions to conjunctive queries, which are a basic class of queries from database theory. We introduce a parameter, called the quantified star size of a query phi, which measures how the free variables are spread in phi. As usual in database theory, we associate a hypergraph to a query phi. We show that for classes of queries for which these associated hypergraphs have bounded generalized hypertree width, bounded quantified star size exactly characterizes the subclasses of queries for which counting the number of solutions is tractable. In the case of bounded arity, this allows us to fully characterize the classes of conjunctive queries for which counting the solutions is tractable. Finally, we also analyze the complexity of computing the quantified star size of a conjunctive query.In the second part we characterize different classes from arithmetic circuit complexity by different means, including conjunctive queries and constraint satisfaction problems, graph polynomials on bounded treewidth graphs, and an extension of the classical arithmetic branching program model by stack memory.In particular, this yields new characterizations of the arithmetic circuit class VP, a class that is central to the area but arguably not well understood.Finally, the third part studies the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of its monomials. We show that these problems are complete for different levels of the counting hierarchy, which had few or no known natural complete problems before. ; eng
Automata, Languages and Programming : 23rd International Colloquium, ICALP '96 Paderborn, Germany, July 8-12, 1996 Proceedings by F Meyer auf der Heide( )

1 edition published in 1996 in English and held by 28 WorldCat member libraries worldwide

Automata, Languages and Programming 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II by Samson Abramsky( )

3 editions published in 2010 in English and held by 22 WorldCat member libraries worldwide

ICALP 2010, the 37th edition of the International Colloquium on Automata, Languages and Programming was held July 6-10, 2010 in Bordeaux, France. ICALP is a series of annual conference of the European Association for Th- retical Computer Science (EATCS) which?rst took place in 1972, organized by MauriceNivatandhiscolleaguesinParis. Thisyear, theprogramconsistedofthe established trackA, focusing on Algorithms, Complexity and Games, chairedby Paul G. Spirakis; Track B, focusing on Logic, Semantics, Automata and Theory of Programming, chaired by Samson Abramsky; Track C focusing this year on Foundations of Networked Computation: Models, Algorithms and Information Management, chaired by Friedhelm Meyer auf der Heide. The three Program Committees received a total of 389 submissions: 222 for TrackA,114forTrackBand53forTrackC, writtenbyauthorsfrom45di?erent countries. Of these, 60, 30 and 16, respectively, were selected for inclusion in the scienti?c program. Each paper got on average 3.5 referee reports. The Programalsoincluded six invitedtalks byPierreFraigniaud(CNRS and Univ. ParisDiderot), JeanGoubault-Larrecq(ENSCachanandLSV), Burkhard Monien (Univ. Paderborn), Joel Ouaknine (Oxford Univ. Computing Lab.), Roger Wattenhofer (ETH Zurich), and Emo Welzl (ETH Zurich). These 112 contributed and invited papers are presented in two proceedings volumes. The?rst contains the contributed papers of Track A and the invited talks of Burkhard Monien and Emo Welzl. The second volume contains the contributed papers of Tracks B and C as well as the invited talks of Pierre Fraigniaud, Jean Goubault-Larrecq, Joel Ouaknine and Roger Wattenhofer
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures by F Meyer auf der Heide( )

2 editions published in 2008 in English and held by 21 WorldCat member libraries worldwide

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures by F Meyer auf der Heide( )

4 editions published in 2009 in English and held by 21 WorldCat member libraries worldwide

Annotation
Verfahren zur redundanten Datenplatzierung in skalierbaren Speichernetzen Strategies for redundant data placement in scaleable storage networks by Sascha Effert( )

3 editions published in 2011 in German and held by 20 WorldCat member libraries worldwide

Moderne Datenzentren sind mit einer rasant wachsenden Menge an Daten konfrontiert, welche sie mit immer höherer Geschwindigkeit hochverfügbar speichern müssen. Daher brauchen sie Speichersysteme, welche mit ihren Anforderungen wachsen. Zunehmend werden dazu Speichernetze eingesetzt, in welchen Datenserver einen virtuellen Speicher über Festplatten erzeugen. Dabei ist die Last des virtuellen Speichers so zu verteilen, dass die physikalischen Festplatten optimal genutzt werden. Um Ausfälle kompensieren zu können ist es nötig, Daten redundant zu speichern. Die Verfahren zur Datenverteilung müssen diesen Anforderungen gerecht werden. Einen wichtigen Beitrag liefern hier pseudorandomisierte Hashfunktionen. Innerhalb dieser Arbeit gehe ich auf verschiedene Speichersysteme ein. Speziell untersuche ich Speichernetze, welche aus Datenservern mit lokalen Festplatten bestehen. Für diese zeige ich, wie sie bei verschiedenen Arten der Datenverteilung skalieren. Leider wird keines der betrachteten Speichersysteme allen Anforderungen gerecht. Als Lösung stelle ich das Verfahren Redundant Share vor, welches alle Anforderungen erfüllt. Mittels Redundant Share kann eine beliebige Anzahl an Kopien der Daten des virtuellen Speichers wie gefordert verteilt werden. Gleichzeitig erfordert das Hinzufügen neuer Festplatten einen begrenzten Aufwand. Abschließend vermesse ich eine Implementierung von Redundant Share und vergleiche die Ergebnisse mit anderen Verteilern.. - Modern data centers are faced with a rapidly growing amount of data which they have to keep highly available with increasing performance. Therefore they need storage systems, which grow with the demands. Storage networks are more and more used in this area. In such systems data servers create a virtual storage on top of a number of physical hard disks. Therefore the load of the virtual storage has to be distributed in a way that the physical disks are used in an optimal way. It is also important to store all data with redundancies to be able to compensate broken hardware. The algorithms used for data distribution have to solve all these demands. Pseudo randomized hash functions have a big impact in this area. In this dissertation I describe different storage systems. I take a closer look at storage networks with data servers using directly attached hard disks. For these I show how they scale using different kinds of data distribution. Unfortunately none of the described storage systems solves all demands. As a solution I introduce Redundant Share which solves all demands. Using Redundant Share it is possible to distribute an arbitrary number of copies of each piece of data using each hard disk in an optimal way according its capacity. Moreover adding a new physical hard disk ends up in a bounded effort. I perorate with this dissertation by measuring an implementation of Redundant Share and by comparing the results with other distribution algorithms
The complexity of local max-cut by Tobias Tscheuschner( )

2 editions published in 2012 in German and held by 19 WorldCat member libraries worldwide

Local search is one of the most successful approaches for solving hard optimization problems. In local search, a set of neighbor solutions is assigned to every solution and one asks for a local optimum, i.e., a solution that has no better neighbor. To encapsulate the complexity of finding local optima, Johnson et al. (JCSS,1988) introduced the complexity class PLS. Shortly afterwards, Schäffer et al. (JOC,1991) showed PLS-completeness for several local search problems including LocalMax-Cut on graphs with unbounded degree with a FLIP-neighborhood in which one node changes the partition. Moreover, they showed two further results for LocalMax-Cut: First, there is an infinite family of instances and solutions for which every sequence of improving steps that ends up in a local optimum has exponential length (all-exp property). Second, the StandardAlgorithmProblem (SAP), i.e., the problem of finding a local optimum that is reachable from a given pair of an instance and initial solution via improving steps, is PSPACE-complete. On the positive side, Poljak (JOC,1995) showed that there are at most quadratically many improving steps possible for LocalMax-Cut on cubic graphs. This thesis provides three complexity results for LocalMax-Cut. First, it has the all-exp property if restricted to graphs with maximum degree four. Second, the SAP is PSPACE-complete for graphs with maximum degree four. Third, finding a local optimum is PLS-complete for graphs with maximum degree five. ; eng
On the hardness of computing local optima Über die Schwierigkeit der Berechnung Lokaler Optima by Dominic Dumrauf( )

2 editions published in 2011 in English and held by 19 WorldCat member libraries worldwide

In dieser Arbeit untersuchen wir die Komplexität der Berechnung lokal optimaler Lösungen von Problemen aus den Bereichen der Spieltheorie und der Optimierung. Für unsere Untersuchungen verwenden wir das Framework PLS (Abkürzung für "Polynomialzeit lokale Suche"), wie von Johnson, Papadimtriou und Yannakakis eingeführt. In der Spieltheorie sind Congestion Games ein weit verbreitetes und akzeptiertes Modell um das Verhalten und die Performanz von großen verteilten Netzwerken mit autonomen Teilnehmern zu untersuchen. Die Klasse der Restricted Network Congestion Games ist eine Teilklasse der Congestion Games bei der für jeden Spieler eine Menge von Kanten existiert, die er nicht verwenden darf. In Kapitel 5 zeigen wir mittels einer tighten Reduktion von MAXCUT, dass die Berechnung eines Nash Equilibriums in einem Restricted Network Congestion Game mit zwei Spielern PLS-vollständig ist. Aus dem Bereich der Optimierung untersuchen wir die Komplexität der Berechnung lokal optimaler Lösungen des MAXIMUM CONSTRAINT ASSIGNMENT (abgekürzt MCA) Problems und von gewichteten Standard-Mengenproblemen. Die Parameter in (p,q,r)-MCA_{k-par} beschränken hierbei simultan die maximale Länge p jedes Constraints, das maximale Auftreten q jeder Variable und deren Wertigkeit r; zusätzlich ist die Menge der Constraints k-partit. Wir konzentrieren uns auf Härteergebnisse und zeigen in Kapitel 6 mittels tighter Reduktionen von CIRCUIT/FLIP die PLS-Vollständigkeit von (3,2,3)-MCA_{3-par}, (2,3,6)-MCA_{2-par} und (6,2,2)-MCA. Abschließend untersuchen wir in Kapitel 7 die Komplexität der Berechnung lokal optimaler Lösungen von gewichteten Standard-Mengenproblemen wie SETPACKING, SETCOVER und vieler anderer Probleme, wie sie in [SP1]-[SP10] im Buch von Garey und Johnson [Seite 221ff.] zusammengefasst sind.. - In this thesis, we investigate the complexity of computing locally optimal solutions of problems arising in the fields of game theory and optimization. For our investigation, we use the framework of PLS (short for "Polynomial-time Local Search"), as introduced by Johnson, Papadimtriou, and Yannakakis. In game theory, congestion games are a widely accepted model to investigate the behavior and performance of large-scale distributed networks with autonomous participants. The class of restricted network congestion games is a subclass of congestion games where for each player there exists a set of edges which he is not allowed to use. In Chapter 5, we show that computing a Nash equilibrium in a restricted network congestion game with two players is PLS-complete, using a tight reduction from MAXCUT. From the field of optimization, we investigate the complexity of computing locally optimal solutions of the MAXIMUM CONSTRAINT ASSIGNMENT (in short MCA) problem and of weighted standard set problems. The parameters in (p,q,r)-MCA_{k-par} simultaneously limit the maximum length p of each constraint, the maximum appearance q of each variable and its valence r; additionally, the set of constraints is k-partite. We focus on hardness results and show PLS-completeness of (3,2,3)-MCA_{3-par}, (2,3,6)-MCA_{2-par} and (6,2,2)-MCA, using tight reductions from CIRCUIT/FLIP in Chapter 6. Finally, in Chapter 7 we study the complexity of computing locally optimal solutions of weighted standard set problems such as SETPACKING, SETCOVER, and many more, as pooled in problems [SP1]-[SP10] in the book of Garey and Johnson [page 221ff.]
Local strategies for robot formation problems by Barbara Kempkes( )

1 edition published in 2012 in English and held by 19 WorldCat member libraries worldwide

Wir betrachten eine Gruppe von mobilen, autonomen Robotern in einem ebenen Gelände. Es gibt keine zentrale Steuerung und die Roboter müssen sich selbst koordinieren. Zentrale Herausforderung dabei ist, dass jeder Roboter nur seine unmittelbare Nachbarschaft sieht und auch nur mit Robotern in seiner unmittelbaren Nachbarschaft kommunizieren kann. Daraus ergeben sich viele algorithmische Fragestellungen. In dieser Arbeit wird untersucht, unter welchen Voraussetzungen die Roboter sich auf einem Punkt versammeln bzw. eine Linie zwischen zwei festen Stationen bilden können. Dafür werden mehrere Roboter-Strategien in verschiedenen Bewegungsmodellen vorgestellt. Diese Strategien werden auf ihre Effizienz hin untersucht. Es werden obere und untere Schranken für die benötigte Anzahl Runden und die Bewegungsdistanz gezeigt. In einigen Fällen wird außerdem die benötigte Bewegungsdistanz mit derjenigen Bewegungsdistanz verglichen, die eine optimale globale Strategie auf der gleichen Instanz benötigen würde. So werden kompetititve Faktoren hergeleitet. ; ger
Reconfigurable accelerators in the world of general-purpose computing Rekonfigurierbare Beschleuniger in der Welt von allgemeinen Rechenaufgaben by Tobias Kenter( )

3 editions published in 2016 in English and held by 18 WorldCat member libraries worldwide

Die Architektur von FPGAs (Field Programmable Gate Arrays) kombiniert Programmierbarkeit mit einem hohen Potenzial zur Spezialisierung für verschiedene Rechenlasten. Wir analysieren in dieser Arbeit zunächst aktuelle Ansätze, die Produktivität bei der Entwicklung von FPGA-Anwendungen zu steigern, arbeiten konzeptuelle und praktische Vor- und Nachteile heraus, und identifizieren drei Säulen, die einander dabei ergänzen können, die Verwendung von FPGAs für allgemeine Rechenaufgaben voranzutreiben.Anschließend konzentrieren wir uns auf übergelagerte Architekturen als Ansatz für produktive Entwicklungsprozesse für FPGAs. Solche Architekturen bedingen aber auch bisher unzureichend verstandene Nachteile bei der resultierenden Rechenleistung. Unsere Arbeit quantifiziert für eine solche Architektur diese Nachteile anhand einer Auswahl unterschiedlicher Programmschleifen, die zu einer modernen Anwendung für stereoskopischen Bildabgleich gehören. Wir zeigen, dass die Architektur trotz dieser Nachteile als praktisch nutzbarer Beschleuniger dienen kann und identifizieren verschiede Unterschiede im Vergleich zu vollständig spezialisierten Konfigurationen. Darüber hinaus stellen wir Werkzeuge vor, die automatisch geeignete Schleifen aus Hochsprachenquelltexten oder Binärcode extrahieren und auf einem Vektorprozessor zur Ausführung bringen, der als übergelagerte Architektur auf FPGAs umgesetzt ist.Mit einem abstrakten Modell zur Abschätzung von Rechenleistung, das die gegenseitige Abhängigkeit zwischen Architekturen und Programmierentscheidungen berücksichtigt, erkunden wir schließlich systematisch Alternativen für Rechnersysteme, die Prozessoren und FPGAs enger koppeln als bisher. Insbesondere die Integration der Speicherhierarchie hat einen erheblichen Einfluss auf das Beschleunigungspotenzial des Systems.. - The architecture of field programmable gate arrays (FPGAs) combines programmability with a high potential for specialization for different workloads. In this work, by analyzing current approaches to tackle this productivity challenge along with their conceptual and practical trade-offs, we identify three pillars that can complement each other to jointly drive general-purpose adoption of FPGAs.Subsequently, we focus on overlay architectures as one of theses paths towards productive FPGA design processes. Such architectures also incur until now insufficiently understood overheads compared to custom designs implemented directly on FPGA resources. Our work quantifies such overheads with a diverse set of program loops from a state-of-the-art stereo-matching application for an instruction-programmable overlay. It demonstrates that the architecture can, despite overheads, serve as a practically usable accelerator, and identifies specific differences to fully customized FPGA designs. Additionally, we present a fast tool flow that automatically extracts suitable loops from a high-level source or binary code and offloads them to a vector coprocessor realized as an FPGA overlay.With a high-level performance estimation model that takes into account the interdependency of architectures and program designs, we furthermore explore the design space for systems coupling processors and FPGAs more closely as before. We highlight that integration of the memory hierarchy has considerable influence on the acceleration potential of the platform
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.63 (from 0.39 for Verfahren ... to 0.93 for Algorithms ...)

Automata, languages and programming : 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996 : proceedings
Covers
Automata, languages and programming : 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996 : proceedingsAlgorithms-ESA 2001 : 9th annual European symposium, Åarhus, Denmark, August 28-31, 2001 : proceedingsAlgorithms 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 papersProceedings of the 23rd ACM symposium on Parallelism in algorithms and architecturesAutomata, languages and programming : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, proceedingsAlgorithms 9th annual European symposium ; proceedings
Alternative Names
Auf der Heide, F. Meyer 1954-

Auf der Heide, F. Meyer (Friedhelm), 1954-

Auf der Heide, Friedhelm Meyer.

Friedhelm Meyer auf der Heide deutscher Informatiker und Inhaber

Friedhelm Meyer auf der Heide Duits informaticus

Friedhelm Meyer auf der Heide German computer scientist and professor

Friedhelm Meyer auf der Heide professor académico alemão

Friedhelm Meyer auf der Heide tysk professor

Heide, F. Meyer auf der

Heide, F. Meyer auf der 1954-

Heide, F. Meyer auf der (Friedhelm), 1954-

Heide, Friedhelm auf der

Heide, Friedhelm auf der 1954-...

Heide, Friedhelm M. 1954-

Heide, Friedhelm Meyer auf der.

Heide, Friedhelm Meyer auf der 1954-

Meyer auf der Heide, F.

Meyer auf der Heide, F. 1954-

Meyer auf der Heide, Friedhelm

Meyer auf der Heide, Friedhelm 1954-

Meyer, Friedhelm 1954-

Languages
English (124)

German (13)