# Past Events

# The Story of CDOT - Centre for Development of Telematics: 36 months, 36 crores and a 5* hotel

## Speaker:

## Time:

## Venue:

CDoT completes 25 years in the month of August 2009.

# Zero Knowledge Proofs

## Speaker:

## Time:

## Venue:

Suppose Prof. N is giving Mr. M an exam, and Mr. M doubts that a question on the exam paper is wrong. Mr. M asks Prof. N about it. Naturally Prof.

# Communication Complexity for Dummies

## Speaker:

## Time:

## Venue:

The notion of communication complexity (CC) was introduced by Yao in 1979, who investigated the following problem involving two separated parties (Alice and Bob).

# What can one do with little memory?

## Speaker:

## Time:

## Venue:

We will study computations performed with limited memory. This will bring us into contact with several ideas in the area of randomness and computation. We will illustrate these ideas using the following toy example.

# Issues In Wireless Mesh Networks

## Speaker:

## Time:

## Venue:

Mesh networks have become increasingly important because they can be easily implemented without much infrastructure and can support adequate bandwidth with a flexible multi-hop wireless communication among their routers serving the clients.

# Solving Conjugacy Equation on Languages

## Speaker:

## Time:

## Venue:

XZ=ZY is called the conjugacy equation. Given languages X and Y we are interested in knowing if there exists a non empty language Z which makes this equation true. This problem is undecidable in the general setting.

# Testing whether a Multivariate Polynomial is Zero

## Speaker:

## Time:

## Venue:

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

# Kolmogorob Complexity

## Speaker:

## Time:

## Venue:

Using Kolmogorob Complexity, we will prove that there exist an oracle with respect to which $P$ not equal to $NP$.