Summer Student Selected for TCS - 2015

Summer Student Selected for TCS - 2015

 

June 1st to July 10th 2015

 

With Accommodation and Per-diem
  Reg. No. Name
1 1141 Siddhanjay Godre
2 1148 Ram Gopal Pandey
3 1153 Rajeev Varun
4 1161 Avinandan Das
5 1164 Avishek Shetty
6 1174 Aditya Prakash
7 1178 SS Shreyas
8 1189 Shashank Pratap Singh
9 1193 Sanal Prasad
10 1251 Narinder Singh Ghumman
With only Per-diem and No Accommodation
1 1155 Abhishek De
2 1166 Sridharan Swetha
3 1184 Abhinav Sv
4 1199 Arindam Biswas
5 1201 V Anish
6 1202 Vani P
7 1203 Rajit Datta
8 1205 Sruthi Panchapakesan
9 1207 Adithya Murali
10 1211 T Iniyai
11 1244 Ajay Kumar
With No Per-diem and No Accommodation
1 1262 Saggurthi Suhas
2 1263 Sodagudi Suma
3 1264 Moolam Hima Swetha
4 1265 Abinaya JL
5 1266 S Srinidhi
6 1267 Savitaa V
7 1268 Kruthi Manojna
8 1269 Noorjahan MAJ
9 YARLAGADDA GEETA DHARANI
10 SRIPATHI ANASUYA SAI SRUTHI
11 S.Seshuram
12 Sudheer Surendran
13 Lokesh Kumar
14 Sarathi Kandavel
15 Shruti Saraswati
16 Neeraj
17 L Vijaya Sri
18 Ashiq M
19 Raghvendra Kiran
20 M Ramachandar
21 Riya James

 

Schedule for the summer program

Please note all the lectures will be held in room  number 123.

Possible Papers to Present.

  1. Storing a sparse table with O(1) worst case access time, JACM 31(3) : 538--544, 1983 by Fredman, Komlos and Szemeredi (FKS).
  2. The space complexity of approximating the frequency moments (1996) by Noga Alon , Yossi Matias ,
    Mario Szegedy, Journal of Computer and System Sciences.
  3. The probabilistic communication complexity of set intersection - Bala Kalyanasundaram and Georg
    Schnitger.
  4. On the distributional complexity of disjointness - Alexander Razboray.
  5. Some complexity questions related to distributive computing - Andrew Yao.
  6. . Representing Trees of Higher Degree - D.Benoit, E.Demaine, I.Munro, R.Raman, V.Raman, S.Rao ,
    Algorithmica 43(4) : 275--292, 2005.
  7. Succinct representation of balanced parentheses and static trees - J.I. Munro, V. Raman, SIAM J.
    Computing 31 (2001)762776.
  8. Randomized algorithm for matching in bipartite graphs using Scwartz Zippel lemma - A good exposition
    could be found at http://www.cs.berkeley.edu/-sinclair/cs271/n2.pdf (Section 2.1.2)
  9. Randomized algorithm to find min cut (Karger's algorithm)
    https://www.cs.princeton.edu/courses/archive/fal113/cos521/lecnotes/lec2...
  10. Randomized construction of smallest enclosing circle - http://www.cs.uu.nl/docs/vakken/ga/slides4b.
  11. Saieed Akbari, Jaehoon Kim, Alexandr Kostochra, Harmonious coloring of trees with large maximum degree, Discrete Mathematics, Vol. 312, 2012, 1633 - 1637.
  12. Marko Jakvac and Sandi Klavzar, The b-chromatic number of cubic graphs, Graphs and Combinatorics, Vol. 26, 2010, 107-118.

Note : These topics are only meant as a suggestion. Please feel free to consult individual instructors for
different topics related to your interest.

Problem Sheets for Tutorials.

AttachmentSize
PDF icon Pigeonhole Principle.pdf92.78 KB
PDF icon Automata.pdf139.57 KB
PDF icon Algorithms.pdf118.48 KB
PDF icon Data Structure.pdf52.37 KB
PDF icon Pushdown Automata.pdf107.83 KB