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