Properties of complexity measures for prams and wrams

Authors:
S. Bublitz;U. Schürfeld;I. Wegener;B. Voigt
Affiliations:
Johann Wolfgang Goethe-Univ., Frankfurt am Main, W. Germany;Johann Wolfgang Goethe-Univ., Frankfurt am Main, W. Germany;Johann Wolfgang Goethe-Univ., Frankfurt am Main, W. Germany;Univ. Bielefeld, Bielefeld, W. Germany
Venue:
Theoretical Computer Science
Year:
1986

Exact time bounds for computing boolean functions on PRAMs without simultaneous writes

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Exact lower time bounds for computing Boolean functions on CREW PRAMs

Journal of Computer and System Sciences
The nonapproximability of OBDD minimization

Information and Computation
On the distribution of the number of monotone boolean functions relative to the number of lower units

Discrete Mathematics - Kleitman and combinatorics: a celebration
Gossiping and broadcasting versus computing functions in networks

Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Quantum certificate complexity

Journal of Computer and System Sciences
Properties and applications of boolean function composition

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Hi-index	5.23