Automata, Languages and Programming
Springer Berlin Heidelberg
Chapter title |
A Direct Sum Theorem in Communication Complexity via Message Compression
|
---|---|
Chapter number | 26 |
Book title |
Automata, Languages and Programming
|
Published by |
Springer Berlin Heidelberg, June 2003
|
DOI | 10.1007/3-540-45061-0_26 |
Book ISBNs |
978-3-54-040493-4, 978-3-54-045061-0
|
Authors |
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
Editors |
Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger |
Country | Count | As % |
---|---|---|
Unknown | 22 | 100% |
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 12 | 55% |
Researcher | 3 | 14% |
Student > Master | 2 | 9% |
Lecturer | 1 | 5% |
Professor > Associate Professor | 1 | 5% |
Other | 0 | 0% |
Unknown | 3 | 14% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 17 | 77% |
Physics and Astronomy | 2 | 9% |
Unknown | 3 | 14% |