One of the most active research directions in quantum computing currently is establishing quantum supremacy results: coming up with computational tasks which a quantum algorithm can solve super-polynomially faster than a classical algorithm.

One of the fundamental problems in Computer Networking is to efficiently transport packets belonging to different sessions, such as unicast, broadcast, multicast and anycast, collectively known as the generalized flows.

Abstract: Broadcast channels model the downlink in a wireless network, i.e., the link from a base station transmitter to several receivers. The broadcast channel model was proposed by Tom Cover in 1972.

Abstract: The PCP theorem (AS,ALMSS 1991) guarantees that every NP language has a probabilistically checkable proof (PCP) system allowing a verifier to check a witness very efficiently using randomness, and allowing for small error.

Abstract: We will see an application of topology to prove combinatorial results. The Borsuk-Ulam theorem states that any continuous function f from the surface of the (n+1)-sphere to R^n should have a point x on the sphere such that f(x) = f(-x).