Juraj Waczulík

According to our database, Juraj Waczulík authored at least 7 papers between 1990 and 1998.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1998

Effective Systolic Algorithms for Gossiping in Cycles.

Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener

Parallel Process. Lett., 1998

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 and Two-Dimensional Grids (Extended Abstract).

Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Walter Unger, Juraj Waczulík, Hubert Wagener

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994

Pebbling Dynamic Graphs in Minimal Space.

Peter Ruzicka, Juraj Waczulík

RAIRO Theor. Informatics Appl., 1994

1993

On Time-Space Trade-Offs in Dynamic Graph Pebbling.

Peter Ruzicka, Juraj Waczulík

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992

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

1990

Area Time Squared and Area Complexity of VLSI Computations is Strongly Unclosed Under Union and Intersection.

Juraj Waczulík

Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990