Meyer auf der Heide, Friedhelm, 1954-....
Meyer auf der Heide, F. (Friedhelm), 1954-
Meyer auf der Heide, Friedhelm
Meyer auf der Heide, F.
Friedhelm Meyer auf der Heide
Meyer auf der Heide, F. (Friedhelm)
VIAF ID: 74440535 ( Personal )
Permalink: http://viaf.org/viaf/74440535
Preferred Forms
- 100 0 _ ‡a Friedhelm Meyer auf der Heide
-
- 100 1 _ ‡a Meyer auf der Heide, F. ‡q (Friedhelm)
-
-
- 100 1 _ ‡a Meyer auf der Heide, F. ‡q (Friedhelm), ‡d 1954-
-
-
-
- 100 1 _ ‡a Meyer auf der Heide, Friedhelm
-
- 100 1 _ ‡a Meyer auf der Heide, Friedhelm ‡d 1954-
- 100 1 _ ‡a Meyer auf der Heide, Friedhelm, ‡d 1954-....
4xx's: Alternate Name Forms (30)
5xx's: Related Names (5)
- 551 _ _ ‡a Bielefeld ‡4 ortg ‡4 https://d-nb.info/standards/elementset/gnd#placeOfBirth
- 510 2 _ ‡a ESA '2001 (2001 : Aarhus, Denmark)
- 510 2 _ ‡a Heinz Nixdorf Institut
- 510 2 _ ‡a Heinz Nixdorf Institut ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a mathem. Bielefeld
Works
Title | Sources |
---|---|
Algorithmische Grundlagen für die Selbstorganisation von Roboterschwärmen [87. Sitzung vom 13. Februar 2013 in Düsseldorf] | |
Algorithms — ESA 2001 : 9th Annual European Symposium Århus, Denmark, August 28–31, 2001 Proceedings | |
Algorithms for dynamic geometric data streams | |
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 | |
Augmented and virtual reality in der Produktentstehung | |
Automata, languages and programming : 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996 ; proceedings | |
Automatic parallelization of random access machines with varying instruction sets | |
A comparison of two variations of a pebble game on graphs | |
complexity of local max-cut | |
Computing minimum spanning forests on 1- and 2-dimensional processor arrays | |
Conjunctive queries, arithmetic circuits and counting complexity | |
Design, analysis, and evaluation of a data structure for distributed virtual environments | |
Dritter Workshop über Komplexitätstheorie, Effiziente Algorithmen und Datenstrukturen am 24.11.1987 in Dortmund | |
Efficient simulations among several models of parallel computers | |
Effizienz universeller Parallelrechner | |
ESA 2001 | |
european integrated project "Dynamically Evolving, Large Scale Information Systems (DELIS)" proceedings of the final workshop, Barcelona, February 27 - 28, 2008 | |
Expander graphs, random graphs, and their application 11.04. - 15.04.94 | |
Fast algorithms for N-dimensional restrictions of hard problems | |
Hashing strategies for simulating shared memory on distributed memory machines | |
Heinz-Nixdorf-Institut der Universität-GH Paderborn | |
ICALP '96 | |
Infinite cube-connected cycles | |
Learning and coordination in sequential multiagent problems | |
Local strategies for robot formation problems | |
A lower bound for randomized algebraic decision trees | |
Lower bounds for solving linear Diophantine equations on random access machines | |
Lower time bounds for integer programming with two variables | |
New trends in parallel & distributed computing within the scope of the DFG Collaborative Research Centre 376 Massively Parallel Computing: Algorithms, Design Methods, Applications | |
Nondeterministic versus probabilistic linear search algorithms | |
On computation with integer division | |
On the complexity of genuinely polynomial computation | |
On the hardness of computing local optima | |
Parallel algorithms and architectures : proceedings of the 8th ACM Symposium on ..., SPAA'96, Padua, Italy, June 24-26, 1996 | |
Parallel architectures and their efficient use : First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992 : proceedings | |
Parallel real-time rendering using heterogeneous PC clusters | |
Peer-to-peer based parallel web computing | |
polynomial linear search algorithm for the n-dimensional knapsack problem | |
"powerful" model of computation and "simple" languages that cannot be decided by it | |
The randomized z-buffer algorithm : interactive rendering of highly complex scenes | |
Risk aware overbooking for SLA based scheduling systems | |
Self-Organizing Ad-hoc Mobile Robotic Networks | |
Simulating probabilistic by deterministic algebraic computation trees | |
Size equivalent cluster trees rendering CAD-models in industrial scenes | |
Speeding up random access machines by few processors | |
Strategies for redundant data placement in scaleable storage networks | |
Time-processor trade-offs for universal parallel computers | |
Trajectory planning by means of discretization and combinatorial optimization | |
Trajektorienplanung mittels Diskretisierung und kombinatorischer Optimierung am Beispiel des autonomen Kreuzungsmanagements für Kraftfahrzeuge | |
Über die Schwierigkeit der Berechnung Lokaler Optima | |
Verfahren zur redundanten Datenplatzierung in skalierbaren Speichernetzen |