## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Randomized rounding is a classic method to produce an integral 0/1 solution from a fractional one by interpreting the fractions as probabilities.

<p>Nikhil Bansal<br />
Eindhoven University of Technology<br />
Department of Maths. & Computing Science<br />
HG 9.01<br />
P.O. Box 513<br />
5600 MB Eindhoven<br />
The Netherlands</p>

Tuesday, 3 January 2012, 11:30 to 12:30

Randomized rounding is a classic method to produce an integral 0/1 solution from a fractional one by interpreting the fractions as probabilities.

<p>Sudeep Kamath<br />
University of California at Berkeley<br />
Department of Electrical Engineering and<br />
Computer Science<br />
California 94720<br />
United States of America</p>

Wednesday, 14 December 2011, 14:00 to 15:00

The talk will be in two parts.

Adnan Raja
University of Illinois at Urbana-Champaign
Coordinated Science Laboratory
1308 West Main Street
Ur

Tuesday, 18 January 2011 (All day)

We consider a wireless relay network where many relay nodes help communication between a source and a destination node. The goal is to understand fundamental information-theoretic limits and efficient communication architectures in such networks.

Saswata Shannigrahi
Tata Institute of Fundamental Research
School of Technology and Computer Science
Homi Bhabha R

Tuesday, 11 January 2011 (All day)

We study four problems on uniform hypergraph. First, we present a streaming algorithm for two-coloring uniform hypergraphs with limited number of hyperedges.

Sourav Chakraborty
Chennai Mathematical Institute
Plot No. H1
SIPCOT IT Park
Padur PO
Siruseri - 603103<

Wednesday, 2 February 2011 (All day)

We study the problem of testing structural equivalence (isomorphism) between a pair of Boolean functions $f,g:\\{0,1\\}^n \\to \\{0,1\\}$.

Dhruv Mubayi
University of Illinois at Chicago
Dept. of Mathematics, Statistics, and Computer Science
322 Science

Wednesday, 11 August 2010 (All day)

Many problems in number theory, discrete geometry, coding theory and combinatorics can be phrased as problems about finding the independence number of certain hypergraphs.

Girija Narlikar
Bell Labs, Room 2C-410
700 Mountain Avenue
Murray Hill
New Jersey 07974
United States

Friday, 3 December 2010 (All day)

Reducing the energy consumption of a wireless cellular network is an important and urgent problem. We studied the effect of cell sizes on the energy consumed by the network, assuming base station technologies of today and the future.

Girish Varma
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhabha Road
<br

Monday, 6 September 2010 (All day)

Most algorithmic problems could be viewed as questions being asked about a natural binary relation and we can classify them into decision, search, uniform generation and counting.

Frank P. Kelly
University of Cambridge
The Old Schools
Trinity Lane
Cambridge CB2 1TN
United Kingdom<br/

Wednesday, 17 February 2010 (All day)

How should flows through a network be organized so that resources are shared fairly, and so that the network operates in a stable and efficient manner?

Pranab Sen
School of Technology and Computer Science
Tata Institute of Fundamental Research
Homi Bhaba Road
<

Tuesday, 16 June 2009 (All day)

Suppose we have a polynomial $P$ in variables $X_1, \\ldots, X_n$ with coefficients from a field $F$, with total degree at most $d$. The polynomial $P$ is given in terms of some algebraic expression involving $X_1, \\ldots, X_n$.