## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Self-assembly is a pervasive natural phenomenon that gives rise to complex structures and functions.

<p>Nikhil Gopalkrishnan<br />
Duke University<br />
Computer Science Department<br />
LSRC Building D101<br />
308 Research Drive<br />
Durham, NC 27708<br />
United States of America</p>

Tuesday, 24 January 2012, 14:30 to 15:30

Self-assembly is a pervasive natural phenomenon that gives rise to complex structures and functions.

Monday, 23 January 2012, 14:30 to 15:30

Church's Problem asks for the construction of a procedure which, given a logical specification f(I,O) between input strings I and output strings O, determines whether there exists an operator F that implements the specification in the sense that f

Monday, 16 January 2012 (All day) to Friday, 27 January 2012 (All day)

The financial markets worldwide have seen a tremendous growth in the last four decades. To facilitate growth of research in this area we are conducting a two week long school and a workshop on Mathematical Finance sponsored by ICTS where the top luminaries in the field of mathematical/computational finance and financial economics teach a short course to interested researchers bringing them to the frontiers of research in financial mathematics.

Friday, 13 January 2012, 11:30 to 12:30

In the file maintenance problem, n integer items from the set {1,....,r} are to be stored in an array of size m>=n.

Thursday, 12 January 2012, 16:00 to 17:00

I will talk about our efforts to create a living library of observation and method.

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

In this talk I'll discuss our work on mitochondrial variability. Mitochondria serve as power stations for the cell and a conventional view has treated them as isolated organelles.

<p>Ashwin Nayak<br />
Dept. of Combinatorics and Optimization<br />
Faculty of Mathematics<br />
University of Waterloo<br />
200 University Avenue West<br />
Waterloo, Ontario N2L 3G1<br />
Canada</p>

Monday, 9 January 2012, 11:30 to 12:30

The Quantum Substate Theorem due to Jain, Radhakrishnan, and (2002) gives us a powerful operational interpretation of relative entropy, in fact, of the observational divergence of two quantum states, a quantity that is related to their relative en

<p>Srikanth Srinivasan<br />
Rutgers University<br />
DIMACS<br />
New Brunswick<br />
New Jersey<br />
United States of America</p>

Wednesday, 4 January 2012, 11:30 to 12:30

The general problem of proving limitations on what efficient algorithms can accomplish has been the subject of much research over the past four decades. In this talk, we consider the specific question of bounding the power of Boolean circuits.

<p>Ankit Sharma<br />
<span class="subtitle">Carnegie Mellon University</span><br />
School of Computer Science<br />
5000 Forbes Avenue<br />
Pittsburgh PA 15213-3891<br />
United States of America</p>

Tuesday, 3 January 2012, 14:30 to 15:30

What is the problem?

A limited resource needs to be allocated amongst a set of self-interested

agents. For instance, a company manager wants to allocate resources such as

<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.