External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Complexity of Boolean Functions on PRAMs - Lower Bound Techniques

Miroslaw Kutylowski. Complexity of Boolean Functions on PRAMs - Lower Bound Techniques. In Burkhard Monien, Thomas Ottmann, editors, Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative. Volume 594 of Lecture Notes in Computer Science, pages 309-329, Springer, 1992.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.

runs on