Search the dblp DataBase

Publications of Author

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