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]
@inproceedings{ForsterKLMSS01,
title = {Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity},
author = {Jürgen Forster and Matthias Krause and Satyanarayana V. Lokam and Rustam Mubarakzjanov and Niels Schmitt and Hans-Ulrich Simon},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2245/22450171.htm},
researchr = {https://researchr.org/publication/ForsterKLMSS01},
cites = {0},
citedby = {0},
pages = {171-182},
booktitle = {FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings},
editor = {Ramesh Hariharan and Madhavan Mukund and V. Vinay},
volume = {2245},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-43002-4},
}