## Speaker:

## Time:

## Venue:

Given a collection of vertices in a network, the problem of finding the minimum cost sub-network connecting a set of client nodes to a dedicated hub-node is the Steiner tree problem. Consider the following two twists.

Deeparnab Chakrabarty
University of Pennsylvania
Department of Computer and Information
Sciences
Philadelphia

Thursday, 22 July 2010 (All day)

Given a collection of vertices in a network, the problem of finding the minimum cost sub-network connecting a set of client nodes to a dedicated hub-node is the Steiner tree problem. Consider the following two twists.

Vivek Sarkar
Rice University
Department of Computer Science
P.O. Box 1892
Houston, TX 77251
United State

Wednesday, 21 July 2010 (All day)

The computer industry is at a major inflection point in its hardware roadmap due to the end of a decades-long trend of exponentially increasing clock frequencies.

Kasturi Varadarajan
University of Iowa
Department of Computer Science
101E, Maclean Hall
Iowa City, IA 52242-

Wednesday, 21 July 2010 (All day)

There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting.

Bala Krishnamoorthy
Washington State University
Department of Mathematics
Neill 103
Pullman WA 99164-3113
<br

Thursday, 15 July 2010 (All day)

Given a simplicial complex with weights on its simplices, and a nontrivial cycle on it, we are interested in finding the cycle with minimal weight which is homologous to the given one.

Rahul Jain
National University of Singapore
Department of Computer Science
S15#04-01, 3 Science Drive 2
Singa

Wednesday, 14 July 2010 (All day)

We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE.

R. Inkulu
Indian Institute of Technology
Department of Computer Science
and Engineering
Guwahati
http://

Tuesday, 13 July 2010 (All day)

The Euclidean shortest path problem in a polygonal region is one of the oldest and best-known in Computational Geometry due to its various applications.

Andreas Krebs
Universitat Tubingen
Wilhelm-Schickard-Inst. fur Informatik
Arbeitsbereich Theoretische
Informa

Thursday, 8 July 2010 (All day)

We prove a $\\#$NC$^1$ upper bound for the problem of counting accepting paths in any fixed visibly pushdown automaton.

Navin Kashyap
Queen's University
Department of Mathematics and Statistics
Kingston, Ontario
Canada K7L 3N6<br

Monday, 5 July 2010 (All day)

A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces and linear local constraint codes to be associated with the edges and vert

Manoj Gopalkrishnan
Tata Institute of Fundamental Research
School of Technology and Computer Science
Homi Bhabha R

Friday, 2 July 2010 (All day)

If networks of chemical reactions are the circuits of biology then catalysts are the transistors, or perhaps switches. But which species should be called catalysts? Come to the talk and find out.

Apurva Mudgal
Indian Institute of Technology, Ropar
Department of Computer Science and
Engineering
Nangal Roa

Monday, 28 June 2010 (All day)

Localization is a fundamental problem in robotics. The kidnapped robot possesses a compass and map of its environment it must determine its location at a minimum cost of travel distance.