Juraj Wiedermann

Publication Activity (10 Years)

Years Active: 1976-1992
Publications (10 Years): 0

Publications

Juraj Wiedermann
Weak Parallel Machines: a New Class of Physically Feasible Parallel Machine Models. MFCS (1992)
Juraj Wiedermann
Optimal Algorithms for Sorting on Single-tape Turing Machines. IFIP Congress (1) (1992)
Juraj Wiedermann
On the Computational Efficiency of Symmetric Neural Networks. Theor. Comput. Sci. 80 (2) (1991)
Juraj Wiedermann
Efficient simulations of nondeterministic computations and their speed-up by the ring of cooperating machines. FAIR (1991)
Juraj Wiedermann
Normalizing and Accelerating RAM Computations and the Problem of Reasonable Space Measures. ICALP (1990)
Juraj Wiedermann
Complexity Issues in Discrete Neurocomputing. IMYCS (1990)
Juraj Wiedermann
On the Power of Synchronization. J. Inf. Process. Cybern. 25 (10) (1989)
Juraj Wiedermann
On the Computational Efficiency of Symmetric Neural Networks. MFCS (1989)
Juraj Wiedermann
Deterministic and Nondeterministic Simulation of the RAM by the Turing Machine. IFIP Congress (1983)
Juraj Wiedermann
Preserving Total Order in Constant Expected Time. MFCS (1981)
Juraj Wiedermann
The Complexity of Lexicographic Sorting and Searching. MFCS (1979)
Peter Ruzicka, Juraj Wiedermann
How Good Is the Adversary Lower Bound? MFCS (1977)
Peter Ruzicka, Juraj Wiedermann
On the Lower Bound for Minimum Comparison Selection. MFCS (1976)