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.

Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity

Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans-Ulrich Simon. Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. In Ramesh Hariharan, Madhavan Mukund, V. Vinay, editors, FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings. Volume 2245 of Lecture Notes in Computer Science, pages 171-182, Springer, 2001. [doi]

Authors

Jürgen Forster

This author has not been identified. Look up 'Jürgen Forster' in Google

Matthias Krause

This author has not been identified. Look up 'Matthias Krause' in Google

Satyanarayana V. Lokam

This author has not been identified. Look up 'Satyanarayana V. Lokam' in Google

Rustam Mubarakzjanov

This author has not been identified. Look up 'Rustam Mubarakzjanov' in Google

Niels Schmitt

This author has not been identified. Look up 'Niels Schmitt' in Google

Hans-Ulrich Simon

This author has not been identified. Look up 'Hans-Ulrich Simon' in Google
runs on