CS6850 - Communication Complexity (Reading Course)

Meetings  

• Theme 1 : Communication Complexity Bounds - 9 meetings

  • Meeting 01 : Thu, Jan 14, 04:00 pm-06:00 pm

  Basic Introduction. Communication Complexity of a Boolean function. Simple examples and formal definition of a protocol and its cost. Two simple applications of Deterministic Communication Complexity - Time-space trade offs for Palindromes and Time-Area tradeoffs in VLSI design.<br> (Lead : Jayalal)

  References	Section 1.1 in the [KN] textbook.<br> <a href="http://www.tcs.tifr.res.in/~prahladh/teaching/2011-12/comm/lectures/l04.pdf">Lecture Notes</a>.
  Exercises	Exercises 1.4 to 1.9 in the [KN] textbook.
  Reading

  Basic Introduction. Communication Complexity of a Boolean function. Simple examples and formal definition of a protocol and its cost. Two simple applications of Deterministic Communication Complexity - Time-space trade offs for Palindromes and Time-Area tradeoffs in VLSI design.
  (Lead : Jayalal)
  

  References	:	Section 1.1 in the [KN] textbook. Lecture Notes.
  Exercises	:	Exercises 1.4 to 1.9 in the [KN] textbook.

  • Meeting 02 : Tue, Jan 19, 04:00 pm-06:00 pm

  Lower bound techniques for deterministic protocols. Rectangle property. Fooling Set Arguments. Matrix Rank Based Lower Bounds. Examples. Applications of rank method. Log rank conjecture. The conjecture does not hold over F_2.<br> (Lead : Jayalal)

  References
  Exercises
  Reading

  Lower bound techniques for deterministic protocols. Rectangle property. Fooling Set Arguments. Matrix Rank Based Lower Bounds. Examples. Applications of rank method. Log rank conjecture. The conjecture does not hold over F_2.
  (Lead : Jayalal)
  

  References

  :

  None

  • Meeting 03 : Sat, Jan 30, 03:00 pm-05:00 pm

  Non-deterministic Communication Complexity. Cover number, partition number and protocol cover number.<br> (Lead : Ishu Garg)

  References
  Exercises
  Reading

  Non-deterministic Communication Complexity. Cover number, partition number and protocol cover number.
  (Lead : Ishu Garg)
  

  References

  :

  None

  • Meeting 04 : Sat, Feb 06, 09:30 am-11:30 am

  Rectangle Size and Covers, Partitions and Covers.<br> (Lead : Sanchit Agrawal)

  References
  Exercises
  Reading

  Rectangle Size and Covers, Partitions and Covers.
  (Lead : Sanchit Agrawal)
  

  References

  :

  None

  • Meeting 05 : Sat, Feb 13, 09:30 am-11:30 am

  Randomized Communication Complexity - Private coin protocol, public coin protocol.<br> (Lead : Santhoshini)

  References
  Exercises
  Reading

  Randomized Communication Complexity - Private coin protocol, public coin protocol.
  (Lead : Santhoshini)
  

  References

  :

  None

  • Meeting 06 : Sat, Feb 20, 09:30 am-11:30 am

  Distributional Complexity, Min-Max theorem. The Discrepancy method. Lower bound for the Inner Product using the Discrepancy method.<br> (Lead : Vidhya)

  References
  Exercises
  Reading

  Distributional Complexity, Min-Max theorem. The Discrepancy method. Lower bound for the Inner Product using the Discrepancy method.
  (Lead : Vidhya)
  

  References

  :

  None

  • Meeting 07 : Sat, Feb 27, 09:30 am-11:30 am

  Recent Results on Logrank Conjecture<br> (Lead : Susanna)

  References
  Exercises
  Reading

  Recent Results on Logrank Conjecture
  (Lead : Susanna)
  

  References

  :

  None

  • Meeting 08 : Sat, Mar 05, 09:30 am-11:30 am

  Multiparty Communication Complexity. <br> (Lead : Sahil)

  References
  Exercises
  Reading

  Multiparty Communication Complexity.
  (Lead : Sahil)
  

  References

  :

  None

  • Meeting 09 : Sat, Mar 19, 09:30 am-11:30 am

  Communication Complexity of Relations, FORK.<br> (Lead : Pranjal)

  References
  Exercises
  Reading

  Communication Complexity of Relations, FORK.
  (Lead : Pranjal)
  

  References

  :

  None

• Theme 2 : Connections and Applications - 5 meetings

  • Meeting 10 : Thu, Mar 31, 10:00 am-12:00 pm

  Depth Lower Bounds for Monotone Circuits for testing reachability in graphs<br> Lead : Abhishek

  References
  Exercises
  Reading

  Depth Lower Bounds for Monotone Circuits for testing reachability in graphs
  Lead : Abhishek
  

  References

  :

  None

  • Meeting 11 : Sat, Apr 02, 09:30 am-11:30 am

  Discrepancy, Rank, Margin Complexity (Lead : Aditi)

  References
  Exercises
  Reading

  Discrepancy, Rank, Margin Complexity (Lead : Aditi)
  

  References

  :

  None

  • Meeting 12 : Sat, Apr 09, 09:30 am-11:30 am

  Lower Bounds in Property Testing<br> (Leads : Vishvajeet)

  References
  Exercises
  Reading

  Lower Bounds in Property Testing
  (Leads : Vishvajeet)
  

  References

  :

  None

  • Meeting 13 : Sat, Apr 23, 09:30 am-11:30 am

  Lower Bounds for Data Structures<br> (Leads : Vipin)

  References
  Exercises
  Reading

  Lower Bounds for Data Structures
  (Leads : Vipin)
  

  References

  :

  None

  • Meeting 14 : Sat, Apr 30, 10:00 am-12:00 pm

  Endsem Exam

  References
  Exercises
  Reading

  Endsem Exam
  

  References

  :

  None