Skip to main content

3 Result(s)

within Juraj Waczulík Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    On time-space trade-offs in dynamic graph pebbling

    Pebble game on dynamic graphs is studied as an abstract model for the incremental computations. We investigate how the time T and/or the space S is changing according to the number m of insert-edge/delete-edge op...

    Peter Ružička, Juraj Waczulík in Mathematical Foundations of Computer Science 1993 (1993)

  2. No Access

    Chapter and Conference Paper

    A nonlinear lower bound on the practical combinational complexity

    An infinite sequence F={fn} n=1 ∞ of one-output Boolean functions with the following three properties is constructed:

      ...

    Xaver Gubáš, Juraj Hromkovič, Juraj Waczulík in STACS 92 (1992)

  3. No Access

    Chapter and Conference Paper

    Area time squared and area complexity of VLSI computations is strongly unclosed under union and intersection

    The communication complexity is an abstract complexity measure intensively investigated in the last few years. Since it provides lower bounds on the area (A) and area time squared (AT 2) complexity measures of VL...

    Juraj Waczulík in Aspects and Prospects of Theoretical Computer Science (1990)