CS6850 - Communication Complexity (Reading Course)

Meetings  

• Theme 1 : Introduction and Basics - 4 meetings

  • Meeting 01 : Tue, Jan 29, 06:00 pm-07:30 pm

  Basic Introduction. Communication Complexity of a Boolean function. The theoretical motivations. View towards applications.<br> The model and protocol. Example functions, equality, parity, inner product. Execution of a protocol and the cost. Rectangle property.

  References
  Exercises
  Reading

  Basic Introduction. Communication Complexity of a Boolean function. The theoretical motivations. View towards applications.
  The model and protocol. Example functions, equality, parity, inner product. Execution of a protocol and the cost. Rectangle property.
  

  References

  :

  None

  • Meeting 02 : Tue, Feb 05, 06:00 pm-07:30 pm

  Fooling Set Arguments, Matrix Rank Based Lower Bounds. Examples.

  References
  Exercises
  Reading

  Fooling Set Arguments, Matrix Rank Based Lower Bounds. Examples.
  

  References

  :

  None

  • Meeting 03 : Thu, Feb 14, 01:00 pm-02:00 pm

  Applications of rank method. Log rank conjecture. The conjecture does not hold over F_2.

  References
  Exercises
  Reading

  Applications of rank method. Log rank conjecture. The conjecture does not hold over F_2.
  

  References

  :

  None

  • Meeting 04 : Fri, Mar 01, 08:00 am-09:10 am

  <a>Sajin Koroth</a> : Randomized Communication Complexity - Private coin protocol, public coin protocol.

  References
  Exercises
  Reading

  Sajin Koroth : Randomized Communication Complexity - Private coin protocol, public coin protocol.
  

  References

  :

  None

• Theme 2 : Student Presentations - 10 meetings

  • Meeting 05 : Thu, Feb 21, 01:00 pm-02:00 pm

  <a>Abhiram</a> : Applications to Time-Space Tradeoffs in Turing Machines

  References
  Exercises
  Reading

  Abhiram : Applications to Time-Space Tradeoffs in Turing Machines
  

  References

  :

  None

  • Meeting 06 : Thu, Mar 07, 01:00 pm-02:00 pm

  <a>Spandana Raj</a> : Application to VLSI Design Optimizations (Part-I)

  References
  Exercises
  Reading

  Spandana Raj : Application to VLSI Design Optimizations (Part-I)
  

  References

  :

  None

  • Meeting 07 : Sat, Mar 16, 02:00 pm-03:00 pm

  <a>Saikrishna B.</a> : Monotone depth lower bound for s-t connectivity - I

  References
  Exercises
  Reading

  Saikrishna B. : Monotone depth lower bound for s-t connectivity - I
  

  References

  :

  None

  • Meeting 08 : Thu, Mar 21, 01:00 pm-02:00 pm

  <a>Saikrishna B.</a> : Monotone depth lower bound for s-t connectivity - II

  References
  Exercises
  Reading

  Saikrishna B. : Monotone depth lower bound for s-t connectivity - II
  

  References

  :

  None

  • Meeting 09 : Fri, Mar 22, 08:00 am-09:00 pm

  <a>D.C. Vagheesh</a> - A lower bound for regular expression size from communication complexity.

  References	  <a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.2937">Optimal Lower Bounds for Regular Expressions Size Using Communication Complexity</a>.
  Exercises
  Reading

  D.C. Vagheesh - A lower bound for regular expression size from communication complexity.
  

  References

  :

    Optimal Lower Bounds for Regular Expressions Size Using Communication Complexity.

  • Meeting 10 : Sat, Mar 23, 11:00 am-12:00 pm

  <a>Aditya Anirudh</a> : Construction of a DFA A and a reduction from the FORK game to the relation of A.

  References
  Exercises
  Reading

  Aditya Anirudh : Construction of a DFA A and a reduction from the FORK game to the relation of A.
  

  References

  :

  None

  • Meeting 11 : Thu, Apr 04, 01:00 pm-02:00 pm

  <a>Akshay Degwekar</a> : Distributional Complexity, Min-Max theorem. The Discrepancy method.

  References
  Exercises
  Reading

  Akshay Degwekar : Distributional Complexity, Min-Max theorem. The Discrepancy method.
  

  References

  :

  None

  • Meeting 12 : Sat, Apr 13, 10:00 am-11:00 am

  <a>Akshay Degwekar</a> : Lower bound Techniques for Randomized Communication Complexity. Lower bound for the inner product using the discrepancy method.

  References
  Exercises
  Reading

  Akshay Degwekar : Lower bound Techniques for Randomized Communication Complexity. Lower bound for the inner product using the discrepancy method.
  

  References

  :

  None

  • Meeting 13 : Sat, Apr 13, 11:00 am-12:00 pm

  <a>Manjunath</a> : Non-deterministic Communication Complexity and its connection to deterministic ones.

  References
  Exercises
  Reading

  Manjunath : Non-deterministic Communication Complexity and its connection to deterministic ones.
  

  References

  :

  None

  • Meeting 14 : Fri, Apr 26, 08:00 am-09:00 am

  <a>Eshwar C.</a> : Lower Bounds for Disjointness Function for Product Distributions.

  References
  Exercises
  Reading

  Eshwar C. : Lower Bounds for Disjointness Function for Product Distributions.
  

  References

  :

  None

• Theme 3 : Viva-Voce Meetings - 2 meetings

  • Meeting 15 : Wed, Apr 24, 02:00 pm-06:20 pm

  <li>14:00 - 14:20 - Abhiram</li> <li>14:20 - 14:40 - Spandana Raj</li> <li>14:40 - 15:00 - Dhanwin Mehta</li> <li>15:00 - 15:20 - Karthik Abhinav </li> <li>15:20 - 15:40 - Saikrishna B. </li> <li>15:40 - 16:00 - Vagheesh D.C. </li> <li>16:00 - 16:20 - Aditya Anirudh </li> <li>16:20 - 16:40 - Manjunath </li>

  References
  Exercises
  Reading

  14:00 - 14:20 - Abhiram

  14:20 - 14:40 - Spandana Raj

  14:40 - 15:00 - Dhanwin Mehta

  15:00 - 15:20 - Karthik Abhinav

  15:20 - 15:40 - Saikrishna B.

  15:40 - 16:00 - Vagheesh D.C.

  16:00 - 16:20 - Aditya Anirudh

  16:20 - 16:40 - Manjunath

  
  

  References

  :

  None

  • Meeting 16 : Sat, Apr 27, 02:00 pm-02:40 pm

  <li>14:00 - 14:20 - Eshwar C. </li> <li>14:20 - 14:40 - Akshay Degwekar </li>

  References
  Exercises
  Reading

  14:00 - 14:20 - Eshwar C.

  14:20 - 14:40 - Akshay Degwekar

  
  

  References

  :

  None