# Seminar

# Quantum Information Theory - Lecture Series

## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

# Quantum Information Theory - Lecture Series

## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

# Quantum Information Theory - Lecture Series

## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

# Quantum Information Theory - Lecture Series

## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

# Algorithms for computing diffuse reflection paths in polygons

## Organisers:

## Time:

## Venue:

Let s be a point source of light inside an n-sided polygon P. A polygonal path from s to some point t inside P is called a *diffuse reflection path* if the turning points of the path lie on edges of P.

# The Analysis and Design of Network Congestion Games

## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Abstract: In many applications, users strategically choose paths in a network to minimize the congestion they face. Examples of such applications are road traffic, data networks, and machine scheduling.

# Extensional Crisis and Proving Identity

## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Abstract: Extensionality axioms are common when reasoning about data collections, such as arrays and functions in program analysis, or sets in mathematics.

# Hardness of Hypergraph Coloring

## Organisers:

## Time:

## Venue:

## Webpage:

Abstract: The Graph Coloring problem is to efficiently color the vertices of a graph on n vertices using as few colors as possible such that no edge is monochromatic.

# Automated Test Generation Using Concolic Testing

## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Abstract: In this talk, I will describe concolic testing, also known as directed automated random testing (DART) or dynamic symbolic execution, an efficient way to automatically and systematically generate test inputs for prog