PhD student

<P>

Tapas Kumar Mishra. PhD Thesis, Submitted May 2017: Bisecting families for set systems and related problems.

<P>

==========================================================================

<P>
Earlier B Tech and M Tech theses

<P>
--------------------------------------------------------------------------
<P>


<P>

Development of a quantum circuit builder by Payardha Manoj, July 2008, B Tech 
thesis.

<P> 

Fault-tolerant quantum computation by Arijit Ghosh (co-supervisor 
Prof. Raussendorf, University of British Columbia), May 2008, M Tech thesis.

<P>

Polygon and fortress guarding by diffuse reflection by Abhinav Anand, May 2010,
B Tech thesis.

<P>

Diffuse visibility problems in simple polytopes in 2 and 3 dimensions by
Siddhartha Brahma, May 7, 2005, B Tech thesis.

<P>

Bounding the communication complexity of hypergraph bicoloring games by 
Nitin Kumar, May 2008, M Tech thesis.

<P>

Classical and entanglement-assisted communication complexity of hypergraph
bicoloring games by Rahul Bhalchandra Gokhale, April 2007, M Tech thesis.

<P>

Visibility regions in polygons: VC-dimensions and approximation
algorithms by Satheesh Dannuri, April 2014, M Tech thesis.

<P>

Applications of Lovasz local lemma: Existence and computation of combinatorial structures by Ramneet Kaur, April 2014, M Tech thesis. 

<P>