Foreword von Ferreira, Afonso, Rolim, JoséD.P

Volltext

Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs von Andreev, Alexander E., Clementi, Andrea E.F., Rolim, JoséD.P.

Volltext

Constructing the highest degree subgraph for dense graphs is in N b A S von Andreev, Alexander E., Clementi, Andrea E.F., Rolim, JoséD.P.

Volltext

Constructing the highest degree subgraph for dense graphs is in [formula omitted] von Andreev, Alexander E., Clementi, Andrea E.F., Rolim, JoséD.P.

Volltext

Optimal bounds for the approximation of boolean functions and some applications von Andreev, Alexander E., Clementi, Andrea E.F., Rolim, JoséD.P.

Volltext

A note on the density of oracle decreasing time–space complexity von Dˇurisˇ, Pavol, Rolim, JoséD.P.

Volltext

On the polynomial IO-complexity von Rolim, JoséD.P.

Volltext

A note on the best-case complexity von Rolim, JoséD.P., Greibach, Sheila A.

Volltext

On the IO-complexity and approximation languages von Rolim, JoséD.P., Greibach, Sheila A.

Volltext