 | 1998 |
| 8 |  | Juraj Hromkovic,
Ralf Klasing,
Dana Pardubská,
Juraj Waczulík,
Hubert Wagener:
Effective Systolic Algorithms for Gossiping in Cycles.
Parallel Processing Letters 8(2): 197-205 (1998) |
| 1995 |
| 7 |  | Juraj Hromkovic,
Ralf Klasing,
Dana Pardubská,
Walter Unger,
Juraj Waczulík,
Hubert Wagener:
Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract).
FCT 1995: 273-282 |
| 6 |  | Xaver Gubás,
Juraj Hromkovic,
Juraj Waczulík:
A Nonlinear Lower Bound on the Practical Combinational Complexity.
Theor. Comput. Sci. 143(2): 335-342 (1995) |
| 1994 |
| 5 |  | Peter Ruzicka,
Juraj Waczulík:
Pebbling Dynamic Graphs in Minimal Space.
ITA 28(6): 557-565 (1994) |
| 1993 |
| 4 |  | Peter Ruzicka,
Juraj Waczulík:
On Time-Space Trade-Offs in Dynamic Graph Pebbling.
MFCS 1993: 671-681 |
| 1992 |
| 3 |  | Xaver Gubás,
Juraj Hromkovic,
Juraj Waczulík:
A Nonlinear Lower Bound on the Practical Combinational Complexity.
STACS 1992: 293-302 |
| 2 |  | Juraj Hromkovic,
Jozef Kelemen,
Juraj Waczulík:
Abstract symbol systems - an exercise of the bottom-up approach in artificial intelligence.
J. Exp. Theor. Artif. Intell. 4(1): 49-58 (1992) |
| 1990 |
| 1 |  | Juraj Waczulík:
Area Time Squared and Area Complexity of VLSI Computations is Strongly Unclosed Under Union and Intersection.
IMYCS 1990: 278-287 |