Area Time Squared and Area Complexity of VLSI Computations is Strongly Unclosed Under Union and Intersection. - Juraj Waczulík (IMYCS, 1990)

Abstract symbol systems - an exercise of the bottom-up approach in artificial intelligence. - Juraj Hromkovic; Jozef Kelemen; Juraj Waczulík (J. Exp. Theor. Artif. Intell., 1992)

On Time-Space Trade-Offs in Dynamic Graph Pebbling. - Peter Ruzicka; Juraj Waczulík (MFCS, 1993)

Pebbling Dynamic Graphs in Minimal Space. - Peter Ruzicka; Juraj Waczulík (RAIRO Theor. Informatics Appl., 1994)

Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract). - Juraj Hromkovic; Ralf Klasing; Dana Pardubská; Walter Unger; Juraj Waczulík; Hubert Wagener (FCT, 1995)

A Nonlinear Lower Bound on the Practical Combinational Complexity. - Xaver Gubás; Juraj Hromkovic; Juraj Waczulík (Theor. Comput. Sci., 1995)

Effective Systolic Algorithms for Gossiping in Cycles. - Juraj Hromkovic; Ralf Klasing; Dana Pardubská; Juraj Waczulík; Hubert Wagener (Parallel Process. Lett., 1998)