Juraj Wiedermann

14 papers A* 1B 7Journal 2Unranked 4
YearRankTypeTitle / Venue / Authors
1992 — conf
Optimal Algorithms for Sorting on Single-tape Turing Machines.
IFIP Congress (1)
Juraj Wiedermann
1992 B conf
Weak Parallel Machines: a New Class of Physically Feasible Parallel Machine Models.
MFCS
Juraj Wiedermann
1991 — conf
Efficient simulations of nondeterministic computations and their speed-up by the ring of cooperating machines.
FAIR
Juraj Wiedermann
1991 J jnl
On the Computational Efficiency of Symmetric Neural Networks.
Theor. Comput. Sci.
Juraj Wiedermann
1990 — conf
Complexity Issues in Discrete Neurocomputing.
IMYCS
Juraj Wiedermann
1990 A* conf
Normalizing and Accelerating RAM Computations and the Problem of Reasonable Space Measures.
ICALP
Juraj Wiedermann
1989 B conf
On the Computational Efficiency of Symmetric Neural Networks.
MFCS
Juraj Wiedermann
1989 J jnl
On the Power of Synchronization.
J. Inf. Process. Cybern.
Juraj Wiedermann
1986 B ed.
Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings
MFCS
Jozef Gruska, Branislav Rovan, Juraj Wiedermann
1983 — conf
Deterministic and Nondeterministic Simulation of the RAM by the Turing Machine.
IFIP Congress
Juraj Wiedermann
1981 B conf
Preserving Total Order in Constant Expected Time.
MFCS
Juraj Wiedermann
1979 B conf
The Complexity of Lexicographic Sorting and Searching.
MFCS
Juraj Wiedermann
1977 B conf
How Good Is the Adversary Lower Bound?
MFCS
Peter Ruzicka, Juraj Wiedermann
1976 B conf
On the Lower Bound for Minimum Comparison Selection.
MFCS
Peter Ruzicka, Juraj Wiedermann