A comparison between two variations of a pebble game on graphs
Meyer auf der Heide, FriedhelmIn: Automata, languages and programming. 1973 : Graz, Austria, July 16 - 20, 1979 (Lecture notes in computer science : 71), Jg. 1979, S. 411-4212009Computing minimum spanning forests on 1- and 2-dimensional processor arrays
Meyer auf der Heide, FriedhelmIn: STACS 1989, Jg. 1989, S. 181-1922009Dynamic hashing strategies
Meyer auf der Heide, FriedhelmIn: Mathematical foundations of computer science 1990, Jg. 1990, S. 76-872009Efficiency of universal parallel computers
Meyer auf der Heide, FriedhelmIn: Theoretical computer science : Dortmund, January 5 - 7, 1983 (Lecture notes in computer science : 145), Jg. 1983, S. 221-2412009Efficient simulations among several models of parallel computers
Meyer auf der Heide, FriedhelmIn: STACS 1984, Jg. 1984, S. 218-2292009Fast algorithms for n-dimensional restrictions of hard problems
Meyer auf der Heide, FriedhelmIn: STOC 1985, Jg. 1985, S. 413-4202009Hashing strategies for simulating shared memory on distributed memory machines
Meyer auf der Heide, FriedhelmIn: Parallel architectures and their efficient use : proceedings, Jg. 1993, S. 20-292009Nondeterministic versus probabilistic linear search algorithms
Meyer auf der Heide, FriedhelmIn: FOCS 1985, Jg. 1985, S. 65-732009On genuinely time bounded computations
Meyer auf der Heide, FriedhelmIn: STACS 1989, Jg. 1989, S. 1-162009A polynomial linear search algorithm for the N-dimensional Knapsack problem
Meyer auf der Heide, FriedhelmIn: Conference record of the ... annual ACM Symposium on Theory of Computing, Jg. 1983, S. 70-792009Speeding up random access machines by few processors
Meyer auf der Heide, FriedhelmIn: STACS 1986, Jg. 1986, S. 142-1522009Time-processor trade-offs for universal parallel computers
Meyer auf der Heide, FriedhelmIn: Mathematical foundations of computer science. 1975 : trbské Pleso, Czechoslovakia, August 31 - September 4, 1981 (Lecture notes in computer science : 118), Jg. 1981, S. 433-4412009