EVENTS

List of Events

The Theory of Computing group has regular events including the weekly theory lunch and research talks through the Theory Seminar.


Theory Seminar & Related Talks

Subscribe to our mailing list (theory-seminar) to receive announcements about the theory seminar and related talks.

Upcoming Talks

Jiequn Han (Flatiron Institute)

Provable Posterior Sampling with Denoising Oracles via Tilted Transport

Fri October 30th, 2026 - 1:00 pm6618 Morgridge HallCS Theory Seminar
Abstract

Score-based diffusion models learn a denoising oracle from data and have become a standard way to represent high-dimensional data priors. From a Bayesian perspective, they should also facilitate sampling from related distributions, such as posterior distributions in inverse problems or tilted distributions shaped by additional criteria. Many heuristic methods exist for this, but most lack quantitative guarantees.

This talk focuses on the setting of linear inverse problems with Gaussian observation noise. I will introduce tilted transport, a technique grounded in the analysis of the SDEs underlying diffusion. The denoising oracle enables an exact transformation of the original posterior sampling problem into a boosted posterior that is provably easier to sample. I will quantify when the boosted posterior is strongly log-concave, with explicit dependence on the condition number of the measurement matrix and the signal-to-noise ratio, delineating a regime where sampling is provably tractable given oracle access. Recent work has shown that sampling from negative-definite quadratic tilts is intractable in general, even at rank one, indicating that some such restriction is necessary.

Joint work with Joan Bruna (arXiv:2407.00745).

See the CS events calendar for more talks.

Past Talks

  • 2026-2027

    Jess Sorell
    The Computational Cost of Agreement in Correlated SamplingFri October 23rd, 2026 - 1:00 pm6618 Morgridge HallCS Theory Seminar
    Abstract

    A correlated sampler for a class of distributions D over a finite set allows two parties, each with a distribution from D and a shared random string, to sample from their respective distributions while guaranteeing that their samples agree with near optimal probability (dependent on the statistical distance between their distributions). Correlated sampling strategies achieving optimal agreement for general distributions have been known since Kleinberg and Tardos 2002, and have found applications in sketching algorithms, approximation algorithms, and proving equivalences between algorithmic stability notions, but we have only recently begun to understand the computational hardness of this problem.

    In this talk, we will discuss the hardness of correlated sampling in a variety of parameter regimes. We will show that the hardness of correlated sampling with inverse polynomial disagreement implies the existence of OWFs, and that the existence of a restricted class of OWFs in turn implies hardness of correlated sampling in the same parameter regime. We will also discuss the relationship with SZK and show that efficient correlated sampling with exponentially small disagreement implies NP = RP, even for the restricted case of Bernoulli distributions.

    Shyan Akmal (MPI)
    An Enumerative Perspective on ConnectivityFri October 2nd, 2026 - 1:00 pm6618 Morgridge HallCS Theory Seminar
    Abstract

    Computing the connectivity (also known as unweighted maximum flow) between nodes in a network is a foundational problem in combinatorial optimization. In general dense graphs, the current fastest algorithm for computing connectivities between all pairs of nodes is the naïve approach, where one simply runs an almost-linear time maximum flow algorithm separately for each pair of vertices. In this talk, we discuss faster algorithms computing all-pairs connectivities in sparse graphs and for bounded connectivity values. These approaches bypass the machinery of fast max-flow entirely, and instead are based off classic techniques for enumerating lattice paths using determinants.

    Ivan Hu (UW Madison)
    Lifting Polynomial Complexity Measures Using Error-Correcting CodesFri September 18th, 2026 - 1:00 pm6631 Morgridge HallCS Theory Seminar
    Abstract

    Lifting is the process of taking a function that is hard for a weak computational model and transforming it into a function that is hard for a stronger computational model. In this talk, we describe a lift that takes any polynomial with many terms and produces a polynomial that is hard for the model of read-once algebraic branching programs. We also describe the consequences for factor complexity, which asks if there are polynomials of low complexity with factors of high complexity.

    Jon Schneider (Google Research)
    Swap Regret and Correlated Equilibria Beyond Normal-Form GamesFri September 11th, 2026 - 1:00 pm6618 Morgridge HallCS Theory Seminar
    Abstract

    Swap regret is a notion that has proven itself to be central to the study of general-sum normal-form games, with swap-regret minimization leading to convergence to the set of correlated equilibria and guaranteeing non-manipulability against a self-interested opponent. However, the situation for more general classes of games -- such as Bayesian games and extensive-form games -- is less clear-cut, with multiple candidate definitions for swap-regret but no known efficiently minimizable variant of swap regret that implies analogous non-manipulability guarantees.

    In this paper, we present a new variant of swap regret for polytope games that we call “profile swap regret”, with the property that obtaining sublinear profile swap regret is both necessary and sufficient for any learning algorithm to be non-manipulable by an opponent (resolving an open problem of Mansour et al., 2022). Although we show profile swap regret is NP-hard to compute given a transcript of play, we show it is nonetheless possible to design efficient learning algorithms that guarantee at most O(sqrt(T)) profile swap regret. Finally, we explore the correlated equilibrium notion induced by low-profile-swap-regret play, and demonstrate a gap between the set of outcomes that can be implemented by this learning process and the set of outcomes that can be implemented by a third-party mediator (in contrast to the situation in normal-form games).

    Based on joint work with Eshwar Ram Arunachaleswaran, Natalie Collina, Yishay Mansour, Mehryar Mohri, and Balasubramanian Sivan.

  • 2025-2026

    Henry Yuen (Columbia University)
    Quantum position verification: from quantum cryptography to quantum gravityFri February 27th, 2026 - 1:15 pm7560 Morgridge HallPL Group
    Abstract

    Is it possible to remotely verify someone’s location by only sending signals? Secure position verification is classically impossible due to general spoofing attacks, but becomes possible with quantum physics. The unclonability of quantum information and the uncertainty principle give rise to quantum position verification (QPV) protocols that can mitigate spoofing attacks and securely certify an agent’s location.

    In this talk I will give an overview of quantum position verification and some visions of its cryptographic applications. Furthermore I will describe the surprising connections between QPV and deep questions in quantum information theory, theoretical computer science, and quantum gravity.

    Anders Aamand and Justin Chen (University of Copenhagen and MIT)
    How fast can you find a good hypothesis?Wed November 12th, 2025 - 2:30 pm3610 Morgridge HallCS Theory Seminar
    Abstract

    In the hypothesis selection problem, we are given a finite set of candidate distributions (hypotheses), H_1, . . . , H_n, and samples from an unknown distribution P. Our goal is to find a hypothesis H_i whose total variation distance to P is comparable to that of the nearest hypothesis in H. Specifically, if the minimum distance is OPT, we aim to output an H_i such that, with probability at least 1 − δ, its total variation distance to P is at most C · OPT + ε. Key aspects of this problem remain unresolved, especially regarding the computational efficiency of statistically optimal hypothesis selection. In this talk, we will highlight recent progress on two questions: (a) Does there exists an algorithm that simultaneously runs in near-linear time, achieves the best possible approximation factor, and succeeds with high probability? Intriguingly, such algorithms exist if we relax any one of these criteria. (b) Can the approximation factor be improved in expectation (similarly, if we are allowed to output a mixture of the hypotheses)? This question is closely related to the challenge of achieving the optimal approximation for improper hypothesis selection in finite time on real-valued domains. This talk is based joint work by Anders Aamand, Maryam Aliakbarpour, Justin Y. Chen, and Sandeep Silwal.

    Liren Shan (TTIC)
    Computing Small Volume Confidence Set for Arbitrary DistributionsWed November 5th, 2025 - 2:30 pm3610 Morgridge HallCS Theory Seminar
    Abstract

    We study the problem of learning a high-density region of an arbitrary distribution. Given a target coverage level, and sample access to an arbitrary distribution D, we want to output a confidence set S such that S achieves the desired coverage and the volume of S is as small as possible. We show that this problem is statistically intractable in the most general setting. Then, we restrict our attention to competing with sets from a set family C with bounded VC dimension and provide approximation algorithms to compute a small volume set with desired coverage. Finally, we demonstrate the application of our results to conformal prediction.

    Shyan Akmal (INSAIT)

    A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection

    Wed October 22nd, 2025 - 2:30 pm3610 Morgridge HallCS Theory Seminar
    Jin-Yi Cai (UW Madison)
    Shor's Quantum Algorithms Fail in the Presence of NoiseWed October 1st, 2025 - 2:30 pm3610 Morgridge HallCS Theory Seminar
    Abstract

    We consider Shor's quantum factoring algorithm in the setting of noisy quantum gates. We prove that the algorithm does not factor integers of the form pq when the noise exceeds a vanishingly small level in terms of n --- the number of bits of the integer to be factored, where p and q are either a pair of random primes or from a well-defined set of primes of positive density.

    Links to the papers proving these claims are given below.

    The second paper is joint with Ben Young and proves the same result for Discrete Log.

    I will also present some experimental results supporting the hypothesis that rotations of physical qubits are not infinitely accurate, which forms the basis of the noise model for the proof.

    I will speculate whether quantum error correction can rescue the situation.

    Rishab Goyal (UW Madison)
    Succinct Arguments for BatchQMA and Friends under 8 roundsWed September 17th, 2025 - 2:30 pm3610 Morgridge HallCS Theory Seminar
    Abstract

    We study the problem of minimizing round complexity in the context of succinct classical argument systems for quantum computation. All prior works either require at least 8 rounds of interaction between the quantum prover and classical verifier, or rely on the idealized quantum random oracle model (QROM). We design:

    1. A 4-round public-coin (except for the first message) argument system for batchQMA languages. Under the post-quantum hardness of functional encryption and learning with errors (LWE), we achieve optimal communication complexity (i.e., all messages sizes are independent of batch size). If we only rely on the post-quantum hardness of LWE, then we can make all messages except the verifier’s first message to be independent of the batch size.

  • 2024-2025

    Tegan Wilson (Northeastern University)

    Probabilistic Tail Bounds From "Breaking the VLB Barrier for Oblivious Reconfigurable Networks"

    Thu March 6th, 2025 - 9:45 amCS 3310, Main CS BuildingCS Theory Seminar
    Ben Young (UW Madison)

    The Converse of the Real Orthogonal Holant Theorem and Symmetric Tensor Diagonalization

    Thu February 13th, 2025 - 9:45 amCS 3310, Main CS BuildingCS Theory Seminar
    Alberto Del Pia (UW Madison)

    Minimizing quadratics over integers

    Fri December 6th, 2024 - 2:00 pmCS 3310, Main CS BuildingTheory Seminar
    Carla Michini (UW Madison)

    Price of Anarchy in Paving Matroid Congestion Games

    Fri November 22nd, 2024 - 2:00 pmCS 3310, Main CS BuildingTheory Seminar
    Jeremy McMahan (UW Madison)

    From Knapsacks to Self-Driving | FPTAS Recipes for Constrained RL

    Fri November 15th, 2024 - 2:00 pmCS 3310, Main CS BuildingTheory Seminar
    Faith Ellen (University of Toronto)

    Why Extension-Based Proofs Fail

    Fri November 8th, 2024 - 2:00 pmCS 3310, Main CS BuildingTheory Seminar
    Chuanqi Zhang (University of Technology Sydney)

    Faster isomorphism testing of p-groups of Frattini class-2

    Fri November 1st, 2024 - 2:00 pmCS 3310, Main CS BuildingTheory Seminar
    Tegan Wilson (Northeastern University)

    Breaking the VLB Barrier for Oblivious Reconfigurable Networks

    Fri October 25th, 2024 - 2:00 pmCS 3310, Main CS BuildingTheory Seminar
    Thanasis Pittas (UW Madison)

    Clustering Mixtures of Bounded Covariance Distributions Under Optimal Separation

    Fri October 18th, 2024 - 2:00 pmCS 3310, Main CS BuildingTheory Seminar
    Manolis Vlatakis (UW Madison)

    The Computational Complexity of Multi-player Concave Games and Kakutani Fixed Points

    Fri September 27th, 2024 - 2:00 pmCS 3310, Main CS BuildingTheory Seminar
    Sandeep Silwal (UW Madison)

    A near linear time approximation of the Chamfer distance

    Fri September 20th, 2024 - 2:00 pmCS 3310, Main CS BuildingTheory Seminar
  • 2023-2024

  • 2022-2023

  • 2021-2022

  • 2020-2021

  • 2019-2020

    Jin-Yi Cai (UW Madison)

    Offerings from the classification program for counting problems

    Tue November 19th, 2019 - 4:00 pm901 Van Vleck HallUW-Madison Logic seminar
    Ilias Diakonikolas (UW Madison)

    Algorithmic Questions in High-Dimensional Robust Statistics

    Wed November 6th, 2019 - 12:30 pmDiscovery Building, Orchard View CSSILO seminar
    Dieter van Melkebeek (UW Madison)

    Isomorphism problems and minimum circuit size

    Tue October 1st, 2019 - 4:00 pm901 Van Vleck HallUW-Madison Logic seminar
    Constantinos Daskalakis (MIT)

    Reducing AI Bias using Truncated Statistics

    Fri September 13th, 2019 - 4:00 pmCS 1240CS Colloquium
  • 2018-2019

    Yiding Feng (Northwestern University)

    An End-to-End Argument in Mechanism Design

    Fri February 8th, 2019 - 11:00 amCS 4310Theory Seminar
    Nidhi Rathi (IISc, Bangalore, India)

    Fully Polynomial-Time Approximation Schemes for Fair Rent Division

    Wed January 23rd, 2019 - 12:00 pmCS 4310Theory Seminar
    Arturs Backurs (TTI, Chicago)

    Efficient Density Evaluation for Smooth Kernels

    Fri December 7th, 2018 - 4:00 pmCS 4310Theory Seminar
    Balu Sivan (Google Research)

    Towards Optimal Algorithms for Prediction With Expert Advice

    Fri November 30th, 2018 - 2:30 pmCS 4310Theory Seminar
    Thodoris Lykouris (Cornell University)

    On Preserving Non-Discrimination When Combining Expert Advice

    Wed October 10th, 2018 - 12:00 pmCS 4310Theory Seminar
    Sanjam Garg (Berkeley)

    Identity-Based Encryption from the Diffie-Hellman Assumption

    Fri September 21st, 2018 - 4:00 pmCS 1240Theory Seminar
  • 2017-2018

    Tianyu Liu (UW Madison)

    Approximability of the Six-Vertex Model

    Fri December 1st, 2017 - 2:30 pmCS 4310Theory Seminar
    Benjamin Miller (UW Madison)

    Revenue Maximization with an Uncertainty-Averse Buyer

    Fri October 27th, 2017 - 2:30 pmCS 4310Theory Seminar
    Andrew Morgan (UW Madison)

    Minimum Circuit Size and Isomorphism Problems

    Mon October 23rd, 2017 - 2:00 pmCS 4310Preliminary Examination
    Richard Lipton (Georgia Tech)

    Three Of My Favorite Open Problems

    Tue October 17th, 2017 - 11:00 amCS 1240Theory Seminar
    Richard Lipton (Georgia Tech)

    Computer Science Theory: Past, Present, and Future

    Mon October 16th, 2017 - 5:00 pmDiscovery Building, H. F. DeLuca ForumHilldale Lecture
  • 2016-2017

    Baris Aydinlioglu (UW Madison)

    A study of the NEXP vs. P/poly problem and its variants

    Tue August 15th, 2017 - 1:00 pmCS 4310PhD Defense
    Lisa Hellerstein (NYU)

    Minimizing the Expected Cost of Evaluating Boolean Functions

    Fri August 11th, 2017 - 11:00 amCS 5331Theory Seminar
    Oxana Poburinnaya (Boston University)

    Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model

    Wed May 10th, 2017 - 1:30 pmCS 4310Theory Seminar
    Dimitris Paparas (UW-Madison)

    On the Computation of Market Equilibria

    Fri January 20th, 2017 - 2:00 pmCS 4310Theory Seminar
    Kira Goldner (University of Washington)

    The FedEx Problem

    Fri November 4th, 2016 - 2:00 pmCS 3310Theory Seminar
    Rachel Cummings (Northwestern University)

    The Possibilities and Limitations of Private Prediction Markets

    Fri October 28th, 2016 - 2:00 pmCS 3310Theory Seminar
    Manolis Pountourakis (Northwestern University)

    Repeated Sales with Multiple Strategic Buyers

    Fri October 21st, 2016 - 2:00 pmCS 3310Theory Seminar
  • 2015-2016

    Gautam Prakriya (UW Madison)

    On the Power of Unambiguous Space Bounded Computations

    Tue July 26th, 2016 - 2:00 pmRoom 4310Preliminary Examination
    Madhu Sudan (Harvard Univesity)

    Algebraic Codes and Invariance

    Sat April 30th, 2016 - 9:30 amWID, Room 3280Applied Algebra Day Talk
    Benjamin Miller (UW Madison)

    Mechanism Design for Subadditive Agents via an Ex Ante Relaxation

    Fri April 29th, 2016 - 2:00 pmRoom 4310Theory Seminar
    Janardhan Kulkarni (Microsoft Research)

    Scheduling and Resource Allocation Problems in Multidimensional Settings

    Fri April 15th, 2016 - 2:00 pmRoom 4310Theory Seminar
    Tengyu Ma (Princeton University)

    The Linear Algebraic Structure of Word Meanings

    Fri April 8th, 2016 - 2:00 pmRoom 4310Theory Seminar
    Dimitris Paparas (Columbia University)

    On the Complexity of Revenue Maximizing Bayesian Auctions

    Fri April 1st, 2016 - 2:00 pmRoom 4310Theory Seminar
    Shai Vardi (Tel Aviv University)

    Local Computation Mechanism Design

    Fri February 26th, 2016 - 2:00 pmRoom 4310Theory Seminar
    Carla Michini (UW Madison)

    Totally Unimodular Conjestion Games

    Fri February 5th, 2016 - 2:00 pmRoom 4310Theory Seminar
    Eric Bach (UW Madison)

    Square Roots in Finite Fields

    Fri January 22nd, 2016 - 2:00 pmRoom 4310Theory Seminar
    Ilan Cohen (Tel-Aviv University)

    Packing Small Vectors

    Fri January 15th, 2016 - 2:00 pmTheory Seminar
    Alberto del Pia (UW Madison)

    On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming

    Wed October 28th, 2015 - 11:00 amRoom 4310Theory Seminar
    Jamie Morgenstern (University of Pennsylvania)

    The Pseudo-Dimension of Near-Optimal Auctions

    Wed October 28th, 2015 - 11:00 amRoom 4310Theory Seminar
  • 2014-2015

    Grigory Yaroslavtsev (University of Pennsylvania)

    Fast Fourier Sparsity Testing Over the Boolean Hypercube

    Thu August 6th, 2015 - 11:00 amRoom 4310Theory Seminar
    Heng Guo (UW Madison)

    Complexity Classification of Exact and Approximate Counting Problems

    Wed July 22nd, 2015 - 10:30 amRoom 4310PhD Defense
    Avrim Blum (CMU)

    New Directions in Learning Theory

    Mon July 20th, 2015 - 11:00 amRoom 1240Theory Seminar
    Seeun William Umboh (UW Madison)

    Towards a Unified Analysis Framework for Online Network Design

    Wed May 13th, 2015 - 11:00 amRoom 4310PhD Defense
    Mohit Singh (Microsoft Research Redmond)

    Computability of Maximum Entropy Distributions and Counting Problems

    Tue May 12th, 2015 - 11:00 amRoom 4310Theory Seminar
    Tyson Williams (UW Madison)

    Advances in the Computational Complexity of Holant Problems

    Fri May 1st, 2015 - 3:40 pmRoom 4310PhD Defense
    Shi Li (Toyota Technical Institute at Chicago)

    Towards Better Approximation Algorithms for Classic Combinatorial Optimization Problems

    Tue April 7th, 2015 - 4:00 pmRoom 1240Faculty Candidate Talk
    Richard Peng (MIT)

    Multifaceted Algorithm Design

    Tue March 24th, 2015 - 4:00 pmRoom 1240Faculty Candidate Talk
    Shuchi Chawla (UW Madison)

    A/B Testing of Auction

    Fri March 20th, 2015 - 3:45 pmRoom 7324 in the Sewell Social Science BuildingEconomics Theory Workshop
    Nima Haghpanah (MIT)

    Reverse Mechanism Design

    Mon January 26th, 2015 - 1:00 pmRoom 4310Theory Seminar
    Cris Moore (Santa Fe Institute)

    Sending Secrets: Security and Privacy in a Quantum World

    Wed January 21st, 2015 - 7:00 pmHF. DeLuca Forum in WIDJohn von Neumann Public Lectures in Complexity & Computation
    Chris Peikert (Georgia Institute of Technology)

    Cryptography from Lattices

    Wed December 3rd, 2014 - 4:00 pmRoom 1240Departmental Colloquium
    Pranjal Awasthi (Princeton University)

    Learning Halfspaces with Noise

    Mon November 10th, 2014 - 1:00 pmRoom 4310Theory Seminar
    Seeun (William) Umboh (UW Madison)

    Online Network Design Algorithms via Hierarchical Decompositions

    Mon November 10th, 2014 - 1:00 pmRoom 4310Theory Seminar
    Christopher Peikert (Georgia Institute of Technology)

    Practical Bootstrapping for Fully Homomorphic Encryption

    Mon October 13th, 2014 - 1:00 pmRoom 4310Theory Seminar
    Yaoyun Shi (University of Michigan)

    How to generate the first secret, then as many as you like

    Fri October 10th, 2014 - 1:00 pmRoom 4310Theory Seminar
  • 2013-2014

    Andrew Bridy (UW Madison)

    State Complexity of Algebraic Power Series over Finite Fields

    Sat July 12th, 2014 - 12:00 pmTheory Seminar
    Tyson Williams (UW Madison)

    Siegel's theorem, edge coloring, and a Holant dichotomy

    Sun May 11th, 2014 - 10:20 amB231 Van VleckApplied Algebra Days 2
    Tyson Williams (UW Madison)

    Siegel's theorem, edge coloring, and a Holant dichotomy

    Fri May 2nd, 2014 - 11:00 am901 Van VleckApplied Algebra Seminar
    Sanjam Garg (IBM Thomas J. Watson Research Center)

    How to Obfuscate Software

    Thu April 10th, 2014 - 4:00 pmCS 1240Faculty Candidate Talk
    Daniel Kane (Stanford University)

    An Optimal Algorithm for the Distinct Elements Problem

    Wed March 5th, 2014 - 4:00 pmCS 1240Faculty Candidate Talk
    Jo Ellis-Monaghan (St. Michael's College)

    DNA origami and the complexity of Eulerian circuits with turning costs

    Mon November 18th, 2013 - 1:00 pmCS 4310Theory Seminar
    Jin-Yi Cai (UW Madison)

    Complexity Dichotomy Theorems for Counting Problems

    Thu November 14th, 2013 - 1:15 pm901 Van VleckApplied Algebra Seminar
    David Malec (UW Madison)

    Approximation in Bayesian Mechanism Design

    Wed November 6th, 2013 - 9:30 amCS 4310PhD Final Oral Defense
  • 2012-2013

    Muthu Muthukrishnan (Rutgers University)

    Internet Ad Systems And Research Challenges

    Thu March 14th, 2013 - 3:30 pmCS 1240Department Seminar
    Kunal Talwar (Microsoft Research Silicon Valley)

    The Geometry of Approximate Differential Privacy

    Mon March 11th, 2013 - 10:00 amCS 3310Theory Seminar
    Shuchi Chawla (UW Madison)

    Approximation in Mechanism Design

    Mon December 10th, 2012 - 4:00 pmWisconsin Institute for Discovery (WID), Room 3280b (3rd floor teaching lab)WID-DOW Presentation Series
    Ankit Sharma (CMU)

    Welfare and Profit Maximization with Procurement Costs

    Mon December 3rd, 2012 - 11:00 amCS 2310Theory Seminar
    Marco Molinaro (CMU)

    The Geometry of Online Packing Linear Programs

    Thu November 8th, 2012 - 4:00 pmCS 4310Theory Seminar
    Jin-Yi Cai (UW Madison)

    Post's Problem revisited - A complexity dichotomy perspective

    Tue November 6th, 2012 - 4:15 pmVan Vleck 901Southern Wisconsin Logic Colloquium
    Jin-Yi Cai (UW Madison)

    Computational complexity theory The world of P and NP

    Tue September 11th, 2012 - 12:05 pmChamberlin Hall 4274Madison Chaos and Complex Systems Seminar
  • 2011-2012

    Baris Aydinlioglu (UW Madison)

    A Study of Computational Hardness and Randomness

    Wed August 29th, 2012 - 2:00 pmCS 4310Preliminary Examination
    Siddharth Barman (UW Madison)

    Approximation Algorithms for Network Design and Partitioning Problems

    Fri June 8th, 2012 - 1:00 pm4310 CSPhD Final Oral Defense
    Seeun William Umboh (UW Madison)

    Algorithms for Resource Allocation and Scheduling

    Mon May 14th, 2012 - 2:30 pm4310 CSPreliminary Examination
    Matthew Anderson (UW Madison)

    Advancing Algebraic and Logical Approaches to Circuit Lower Bounds

    Thu May 10th, 2012 - 2:30 pm4310 CSPhD Final Oral Defense
    Balu Sivan (UW Madison)

    Prior Independent Optimization

    Mon May 7th, 2012 - 1:00 pm4310 CSPreliminary Examination
    Daniel Spielman (Yale University)

    Spectral Sparsification of Graphs and Approximations of Matrices

    Tue March 6th, 2012 - 2:30 pm3310 CSTheory Seminar
    Daniel Spielman (Yale University)

    Algorithms, Graph Theory, And The Solution Of Laplacian Linear Equations

    Mon March 5th, 2012 - 4:00 pm1240 CSDistinguished Lecture Series
    Nikhil Devanur (Microsoft Research)

    Online Matching with Concave Returns

    Fri February 24th, 2012 - 2:30 pm4310 CSTheory Seminar
    Éva Tardos (Cornell University)

    Sequential Auctions And The Curse of Simultaneity

    Fri February 10th, 2012 - 2:30 pm4310 CSTheory Seminar
    Éva Tardos (Cornell University)

    How Good Are Simple Auctions?

    Thu February 9th, 2012 - 4:00 pm1240 CSDistinguished Lecture Series
    Nima Haghpanah (Northwestern University)

    Optimal Multi-Dimensional Mechanisms Via Multi- To Single-Agent Reduction

    Wed November 30th, 2011 - 3:30 pm4310 CSTheory Seminar
    Vijay Vazirani (Georgia Tech)

    Can the Theory of Algorithms Ratify the "Invisible Hand of the Market"?

    Mon November 21st, 2011 - 4:00 pm1240 CSDistinguished Lecture Series
    Michael Mitzenmacher (Harvard University)

    Practical Verified Computation with Streaming Interactive Proofs

    Fri November 11th, 2011 - 1:00 pm4310 CSTheory Seminar
    Michael Mitzenmacher (Harvard University)

    Cuckoo Hashing: New Results and Open Questions

    Thu November 10th, 2011 - 4:00 pm1240 CSDistinguished Lecture Series
    Jon Sorenson (Butler University)

    Parallel Algorithms for Integer GCDs

    Wed September 21st, 2011 - 2:30 pm3310 CSTheory Seminar
    Alexander Razborov (University of Chicago)

    A combinatorial approach to the Hirsch Conjecture

    Fri September 16th, 2011 - 2:30 pm4310 CSTheory Seminar
  • 2010-2011

    Venkat Guruswami (CMU)

    Bridging Shannon and Hamming: Codes for computationally simple channels

    Tue May 31st, 2011 - 10:00 am4310 CSTheory Seminar
    Hu Fu (Cornell University)

    Optimal Auction Design with Correlated Valuations

    Fri May 27th, 2011 - 11:00 am4310 CSTheory Seminar
    Venkat Chakaravarthy (IBM Research, New Delhi)

    Covering demands with intervals

    Fri May 20th, 2011 - 2:00 pm3310 CSTheory Seminar
    David Malec (UW Madison)

    Approximation in Bayesian Mechanism Design

    Wed May 18th, 2011 - 2:00 pm4310 CSPreliminary Exam
    Balu Sivan (UW Madison)

    Optimal Crowdsourcing Contests

    Fri April 29th, 2011 - 4:00 pm3310 CSTheory Seminar
    Seeun William Umboh (UW Madison)

    Secretary Problems with Convex Costs

    Fri April 1st, 2011 - 4:00 pm3310 CSTheory Seminar
    Elliot Anshelevich (RPI)

    Contribution Games in Social Networks

    Tue November 16th, 2010 - 1:00 pm3310 CSTheory Seminar
    Ben Recht (UW Madison)

    Randomized Local Embeddings

    Thu October 28th, 2010 - 4:00 pm3310 CSTheory Seminar
    Barna Saha (University of Maryland, College Park)

    The Lovasz Local Lemma Constructive

    Fri October 22nd, 2010 - 11:00 am4310 CSTheory Seminar
    Azarakhsh Malekian (Northwestern University)

    Reducing Baysian Mechanism Design to Algorithm Design

    Mon September 13th, 2010 - 2:30 pm4310 CSTheory Seminar
  • 2009-2010

    Seeun William Umboh (UW Madison)

    Threshold Rules for Online Sample Selection

    Thu May 20th, 2010 - 2:00 pm3310 CSTheory Seminar
    David Malec (UW Madison)

    Bayesian multi-parameter mechanism design

    Wed May 12th, 2010 - 2:00 pm3310 CSTheory Seminar
    Nicole Immorlica (Northwestern University)

    Emergence of Cooperation in Social Networks

    Wed May 5th, 2010 - 2:15 pm4310 CSTheory Seminar
    Jeff Kinne (UW Madison)

    Deterministic Simulations and Hierarchy Theorems for Randomized Algorithms

    Tue April 27th, 2010 - 10:00 am4310 CSDissertation Defense
    Balu Sivan (UW Madison)

    Multi-parameter Mechanism Design and Sequential Posted Pricing

    Mon February 8th, 2010 - 4:00 pm4310 CSTheory Seminar
    Matthew Anderson (UW Madison)

    Lower Bounds for Restricted Models

    Mon December 14th, 2009 - 2:30 pm3310 CSPreliminary Exam
    Dieter van Melkebeek (UW Madison)

    Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-TimeHierarchy Collapses

    Wed October 28th, 2009 - 4:00 pm3310 CSTheory Seminar
    Siddharth Barman (UW Madison)

    Region growing for multi-route cuts

    Wed October 14th, 2009 - 4:00 pm3310 CSTheory Seminar
    Dieter van Melkebeek (UW Madison)

    Satisfiability Allows NoNontrivial Sparsification Unless The Polynomial-TimeHierarchy Collapses

    Wed September 30th, 2009 - 4:00 pm3310 CSTheory Seminar
    Kamesh Munagala (Duke University)

    Multi-armed Bandits with Side Constraints

    Thu September 24th, 2009 - 4:00 pm3310 CSTheory Seminar
    Jin-Yi Cai (UW Madison)

    Holant problems, CSP and graph homomorphismsAn overview

    Mon September 14th, 2009 - 4:00 pm4310 CSTheory Seminar
    Jason Hartline (Northwestern University)

    Simple vs. Optimal Auctions

    Wed September 9th, 2009 - 2:30 pm3310 CSTheory Seminar
  • 2008-2009

    Kunal Talwar (Microsoft Research)

    Differentially Private Approximation Algorithms

    Mon August 31st, 2009 - 4:00 pm4310 CSTheory Seminar
    Jeff Kinne (UW Madison)

    Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds

    Tue August 18th, 2009 - 2:00 pm3310 CSPractice Talk
    Siddharth Barman (UW Madison)

    Approximation Algorithms for Combinatorial Optimization

    Mon July 13th, 2009 - 10:00 am4310 CSPreliminary Exam
    Jack Lutz (Iowa State)

    Inseparability and Strong Hypotheses for Disjoint NP Pairs

    Tue March 24th, 2009 - 4:00 pm901 Van VleckTheory Seminar
    Jin-Yi Cai (University of Wisconsin-Madison)

    A Dichotomy Theorem for Graph Homomorphisms with Complex Values

    Tue November 4th, 2008 - 3:00 pm4310 CSTheory Seminar
    Ofer Neiman (Hebrew University)

    Nearly Tight Low Stretch Spanning Trees

    Fri October 24th, 2008 - 11:00 am2310 CSTheory Seminar
  • 2007-2008

    Thomas Watson

    A Quantum Time-Space Lower Bound for the Counting Hierarchy

    Tue April 29th, 2008 - 3:00 pm3310 CSTheory Seminar
    Scott Diehl (UW Madison)

    Time-Space Lower Bounds for Satisfiability and Related Problems on Randomized Machines

    Thu April 17th, 2008 - 11:00 am3310 CSDissertation Defense
    Rod Downey (Victoria University)

    Practical Fixed-Parameter Tractability and Foundations of Kernelization

    Tue April 15th, 2008 - 1:30 pm2310 CSTheory Seminar
    Brent Waters (SRI)

    Functional Encryption: Beyond Public Key Cryptography

    Mon April 7th, 2008 - 4:00 pm1221 CSFaculty Candidate Talk
    Prabhakar Raghavan

    New sciences for a new web

    Wed April 2nd, 2008 - 4:00 pm1800 ENGRosser Lecture
    Dorit Hochbaum

    Efficient cut-based image segmentation techniques

    Wed March 12th, 2008 - 4:00 pmCS 1221Theory/Optimization Seminar
    Sylvain Perifel

    Interpolation in Valiant's Theory

    Wed February 27th, 2008 - 2:30 pmCS 2310Theory Seminar
    Maria-Florina (Nina) Balcan

    A Theory of Similarity Functions for Learning and Clustering

    Mon February 25th, 2008 - 4:00 pmCS 1221Faculty Candidate Talk
    Jeff Kinne (UW Madison)

    Space Hierarchy Results for Randomized Models

    Mon February 18th, 2008 - 1:00 pmCS 4310Practice Talk
    Eddie Nikolova (MIT)

    From shortest paths to quasi-concave minimization

    Fri November 30th, 2007 - 11:00 amCS 2310Theory Seminar
    Shuchi Chawla (UW Madison)

    Tutorial on Mechanism Design Part II

    Tue October 23rd, 2007 - 4:00 pmCS 4310Theory Seminar
    Shuchi Chawla (UW Madison)

    Tutorial on Mechanism Design Part I

    Fri October 19th, 2007 - 4:15 pmCS 4310Theory Seminar
    Kunal Talwar (Microsoft Research)

    The Price of Privacy and the Limits of LP Decoding

    Fri October 12th, 2007 - 11:00 amCS 2310Theory Seminar
    Udi Manber

    A behind the scene look at Google Search

    Thu September 27th, 2007 - 3:30 pm1800 Engineering HallSpecial Computer Science and Engineering Colloquium
  • 2006-2007

    Jeff Kinne (UW Madison)

    Verifying and Decoding in Constant Depth (by S. Goldwasser, D. Gutfreund, A. Healy, T. Kaufman, and G.N. Rothblum)

    Wed August 1st, 2007 - 2:30 pm4310 CSTheory Seminar: FCRC presentation
    Matt Anderson (UW Madison)

    Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates (by A. Shpilka)

    Wed July 25th, 2007 - 2:30 pm4310 CSTheory Seminar: FCRC presentation
    Scott Diehl (UW Madison)

    Linear Probing with constant Independence (by A. Pagh, R. Pagh, and M. Ruzic)

    Wed July 18th, 2007 - 2:30 pm3310 CSTheory Seminar: FCRC presentation
    Bess Berg (UW Madison)

    Uncertainty Principles, Extractors, and Explicit Embeddings of L2 into L1 (by P. Indyk)

    Wed July 11th, 2007 - 2:30 pm4310 CSTheory Seminar: FCRC presentation
    Tom Watson (UW Madison)

    CS 880 presentation: The Unique Games conjecture

    Wed May 9th, 2007 - 4:00 pm4310 CSTheory Chit-Chat
    Maurice Rojas (Texas A&M University)

    Feasibility of Complex Equations and Primes in Arithmetic Progressions

    Mon May 7th, 2007 - 4:00 pm4310 CSTheory of Computing Seminar
    Kristoffer Hansen (University of Chicago)

    Lower Bounds for AC^0 Circuits Augmented with Few Special Gates

    Wed May 2nd, 2007 - 4:00 pm4310 CSTheory of Computing Seminar
    Peter Buergisser (University of Paderborn)

    On defining integers and proving arithmetic circuit lower bounds

    Fri April 27th, 2007 - 11:00 am2310 CSTheory of Computing Seminar
    Jeff Kinne (UW Madison)

    Space Hierarchy Results for Semantic Models

    Wed April 25th, 2007 - 12:00 pm4310 CSPrelim
    Andrew Shallue (UW Madison)

    Azuma's inequality

    Wed April 18th, 2007 - 4:00 pm4310 CSTheory Chit-Chat
    Eric Bach (UW Madison)

    Correlation-immune Boolean functions

    Wed April 11th, 2007 - 4:00 pm4310 CSTheory Chit-Chat
    Scott Diehl (UW Madison)

    Lower bounds for swapping Arthur & Merlin

    Wed March 21st, 2007 - 4:00 pm4310 CSTheory Chit-Chat
    Pinyan Lu (Tsinghua University)

    Holographic Algorithms

    Wed February 14th, 2007 - 4:00 pm4310 CSTheory Chit-Chat
    Shuchi Chawla (UW Madison)

    Stochastic Optimization

    Wed February 7th, 2007 - 4:00 pm4310 CSTheory Chit-Chat
    Leslie Valiant (Harvard University)

    Holographic Algorithms

    Thu November 30th, 2006 - 9:00 am2310 CSTheory of Computing Seminar
    Leslie Valiant (Harvard University)

    Biology as Computation

    Wed November 29th, 2006 - 4:00 pm1221 CSDistinguished Lecture Series
    Chris Umans (Caltech)

    Extractors and condensers from univariate polynomials

    Fri November 17th, 2006 - 1:30 pm2310 CSTheory of Computing Seminar
    Madhu Sudan (MIT)

    Algebraic Property Testing

    Thu November 16th, 2006 - 9:30 am2310 CSTheory of Computing Seminar
    Madhu Sudan (MIT)

    Modelling Errors and Recovery for Communication

    Wed November 15th, 2006 - 4:00 pm1221 CSDistinguished Lecture Series
    Sanjeev Arora (Princeton University)

    Geometry and Expansion: A survey of recent results

    Thu November 9th, 2006 - 9:30 am2310 CSTheory of Computing Seminar
    Sanjeev Arora (Princeton University)

    Why NP got a new definition: the quest to understand the approximation properties of NP-hard optimization problems

    Wed November 8th, 2006 - 4:00 pm1221 CSDistinguished Lecture Series
    Avi Wigderson (Institute for Advanced Study)

    The sum-product theorem and its applications

    Thu October 19th, 2006 - 9:30 am2310 CSTheory of Computing Seminar
    Avi Wigderson (Institute for Advanced Study)

    The Power and Weakness of Randomness in Computation

    Wed October 18th, 2006 - 4:00 pm1221 CSDistinguished Lecture Series
    Stephen Cook (University of Toronto)

    Uniform Proof Complexity

    Fri September 29th, 2006 - 10:00 am2310 CSTheory of Computing Seminar
    Stephen Cook (University of Toronto)

    The P vs NP Problem and its Place in Complexity Theory

    Thu September 28th, 2006 - 4:00 pm1800 Engineering HallDistinguished Lecture Series
    Tim Roughgarden (Stanford University)

    Optimal Cost-Sharing Mechanisms

    Thu September 7th, 2006 - 4:00 pm2310 CSTheory of Computing Seminar
  • 2005-2006

    Lisa Hellerstein (Polytechnic University)

    Flow Algorithms for Two Pipelined Filtering Problems

    Thu August 3rd, 2006 - 3:30 pm2310 CSTheory of Computing Seminar
    Andrew Shallue (University of Wisconsin)

    Finding points and encoding messages on elliptic curves over characteristic 2

    Wed September 28th, 2005 - 1:00 pm3331 CSTheory of Computing Seminar
    Shang-Hua Teng (Boston University and Akamai Technologies)

    Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time

    Mon October 3rd, 2005 - 10:00 am2310 CSTheory of Computing Seminar
  • 2004-2005

    Aranyak Mehta (Cornell University)

    Adwords and Generalizaed Online Matching

    Fri August 26th, 2005 - 2:00 pm4331 CSTheory of Computing Seminar
    Adam Klivans (Toyota Technological Institute at Chicago and University of Texas at Austin)

    Learning Intersections of Halfspaces

    Fri November 19th, 2004 - 2:30 pm1221 CSTheory of Computing Seminar
    David S. Johnson (AT&T Labs-Research)

    Three applications of dynamic programming to network management

    Tue November 23rd, 2004 - 4:00 pm1240 CSTheory of Computing Seminar
    Kevin Compton (University of Michigan)

    Average-Case Analysis of an Algorithm from Computer Algebra

    Mon December 6th, 2004 - 2:30 pm2310 CSTheory of Computing Seminar
    Richard Cleve (University of Waterloo)

    Quantum information, computation, and communication

    Thu February 10th, 2005 - 2:30 pm1800 Engineering HallWorkshop on Quantum Computation
    David DiVincenzo (IBM Watson Research Center)

    Prospects for real quantum information processing devices in the laboratory

    Thu February 10th, 2005 - 3:45 pm1800 Engineering HallWorkshop on Quantum Computation
    Seth Lloyd (MIT)

    The future of quantum information processing: how big, how fast, how powerful?

    Thu February 10th, 2005 - 5:00 pm1800 Engineering HallWorkshop on Quantum Computation
    Vladlen Koltun (University of California-Berkeley)

    Linear Programming and Arrangements

    Thu February 24th, 2005 - 4:00 pm1221 CSFaculty Candidate Talk
    Shafi Goldwasser (MIT)

    Secrets and Proofs: The Role of Randomness

    Tue April 5th, 2005 - 3:30 pmAB20 Weeks HallJ. Barkley Rosser Memorial Lecture
    Shuchi Chawla (Carnegie Mellon University)

    Algorithms for Path Planning

    Thu April 7th, 2005 - 4:00 pm1221 CSFaculty Candidate Talk
    Jon Sorenson (Butler University)

    Algorithms PSSPS - The Pseudosquares Prime Sieve

    Mon May 23rd, 2005 - 2:30 pm2310 CSTheory of Computing Seminar
    Nisheeth K. Vishnoi (IBM Research)

    The Unique Games Conjecture, Integrality Gap for Cut Problems and the Embeddability of Negative Type Metrics into L_1

    Tue June 21st, 2005 - 10:00 am2310 CSTheory of Computing Seminar
    Scott Diehl (UW Madison)

    Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines

    Thu June 30th, 2005 - 4:00 pm3331 CSPractice Talk
  • 2003-2004

    Raimund Seidel (Saarland University)

    Top-down Analysis of Path Compression

    Mon July 26th, 2004 - 2:30 pm2310 CSTheory of Computing Seminar
    Sandeep Bhatt (Telcordia Technologies)

    Managing Network Insecurity

    Mon September 22nd, 2003 - 12:00 pmTheory of Computing Seminar
    Peter Sarnak (Courant-NYU and Princeton University)

    Ramanujan Graphs

    Fri October 17th, 2003 - 12:00 pmTheory of Computing Seminar
    Christos Papadimitriou (University of California at Berkeley)

    Games and Networks

    Thu November 13th, 2003 - 12:00 pmJ. Barkley Rosser Memorial Lecture
    Christos Papadimitriou (University of California at Berkeley)

    Nash equilibria and complexity

    Fri November 14th, 2003 - 12:00 pmTheory of Computing Seminar
    Klaus Huber (University of Illinois and Deutsche Telekom)

    Applications of Fermat's Two Squares Theorem in Information Technology

    Tue January 6th, 2004 - 2:30 pm2310 CSTheory of Computing Seminar
    Mark Bauer (University of Calgary)

    Point Counting on Picard Curves

    Tue February 17th, 2004 - 12:15 pm5331 CSTheory of Computing Seminar
    Avner Magen (University of Toronto)

    Sublinear Geometric Algorithms

    Mon February 23rd, 2004 - 4:00 pm1221 CSTheory of Computing Seminar
    Stephen Smale (Toyota Technical Institute at Chicago and University of California at Berkeley)

    Shannon Sampling, Learning Theory and Reconstructing Functions from Point Values

    Mon March 8th, 2004 - 4:00 pmB239 Van VleckTheory of Computing Seminar
    Kunal Talwar (University of California at Berkeley)

    Approximating metrics by simpler metrics: Why and how?

    Mon April 5th, 2004 - 4:00 pm1221 CSTheory of Computing Seminar
    Richard Karp (University of California at Berkeley)

    Computers as Puzzle Solvers: The Challenge of Efficient Search

    Tue April 13th, 2004 - 4:00 pm1100 GraingerUW Madison Annual Hilldale Lecture
    Richard Karp (University of California at Berkeley)

    Global Synchronization in Sensornets

    Wed April 14th, 2004 - 2:00 pm2310 CSTheory of Computing Seminar
    Claire Kenyon (Ecole Polytechnique at Paris)

    Metric Clustering

    Thu April 15th, 2004 - 4:00 pm1221 CSTheory of Computing Seminar
    Raimund Seidel (Saarland University)

    Top-down Analysis of Path Compression

    Mon July 26th, 2004 - 2:30 pm2310 CSTheory of Computing Seminar
  • 2002-2003

    Osamu Watanabe (Tokyo Institute of Technology)

    Provably Fast Training Algorithms for Support Vector Machines

    Mon September 9th, 2002 - 12:00 pmTheory of Computing Seminar
    Nicholas Hopper (Carnegie Mellon University)

    Steganography: Undercover Cryptography

    Mon September 23rd, 2002 - 12:00 pmTheory of Computing Seminar
    Jin-Yi Cai (University of Wisconsin - Madison)

    Some geometric descriptions of an expander construction

    Mon September 30th, 2002 - 12:00 pmTheory of Computing Seminar
    Dieter van Melkebeek (University of Wisconsin - Madison)

    Power from Random Strings

    Mon October 7th, 2002 - 12:00 pmTheory of Computing Seminar
    Venkat Chakaravarthy (University of Wisconsin - Madison)

    Time-Space Tradeoff in Derandomizing Probabilistic Logarithmic Space

    Mon October 14th, 2002 - 12:00 pmTheory of Computing Seminar
    Eric Bach (University of Wisconsin - Madison)

    Bounds for the Expected Duration of the Monopolist Game

    Mon November 4th, 2002 - 12:00 pmTheory of Computing Seminar
    Ravi Kannan (Yale University)

    Random sub-problems of a given problem

    Mon November 11th, 2002 - 12:00 pmTheory of Computing Seminar
    Rahul Santhanam (University of Chicago)

    Holographic Proofs and Derandomization

    Mon December 9th, 2002 - 12:00 pmTheory of Computing Seminar
    Jin-Yi Cai (UW Madison)

    On Proving Circuit Lower bounds Against PH: Positive and Negative Results

    Mon February 3rd, 2003 - 2:00 pmCS 2310Theory of Computing Seminar
    Bernard Chazelle

    Nonmonotonicity in Geometric Searching

    Mon February 10th, 2003 - 4:00 pmCS 1325Theory of Computing Seminar
    Dieter van Melkebeek (UW Madison)

    Time-Space Lower Bounds for NP-Complete Problems - Part I

    Mon February 17th, 2003 - 2:10 pmCS 2310Theory of Computing Seminar
    Jon Kleinberg

    The Structure of Information Networks

    Wed February 19th, 2003 - 4:00 pmCS 1325Theory of Computing Seminar
    Dieter van Melkebeek

    Time-Space Lower Bounds for NP-Complete Problems - Part II

    Mon February 24th, 2003 - 2:10 pmCS 2310Theory of Computing Seminar
    Tim Roughgarden

    Selfish Routing and the Price of Anarchy

    Thu March 6th, 2003 - 4:00 pmCS 1221Theory of Computing Seminar
    Uri Keich

    On designing seeds for similarity search in genomic DNA

    Mon March 10th, 2003 - 2:25 pmB135 Van VleckTheory of Computing Seminar
    Adam Kalai

    Efficiency and Simplicity via Randomness

    Thu March 13th, 2003 - 4:00 pmCS 1221Theory of Computing Seminar
    David Kempe

    Gossip and Information flow in Networks

    Mon March 31st, 2003 - 4:00 pmTheory of Computing Seminar
    Jin-Yi Cai (UW Madison)

    Random Access to Advice Strings and Collapsing Results

    Mon April 14th, 2003 - 2:00 pmCS 2310Theory of Computing Seminar
    Seth Pettie

    A shortest path algorithm for real-weighted graphs

    Fri April 25th, 2003 - 10:00 amCS 2310Theory of Computing Seminar
    Cynthia Dwork

    Fighting Spam May Be Easier Thank You Think

    Thu May 1st, 2003 - 4:00 amCS 1325Theory of Computing Seminar
    Jack Lutz

    Randomness and Dimension

    Thu May 8th, 2003 - 11:00 amCS 2310Theory of Computing Seminar
    Mark Ward

    Analysis of a Randomized Selection Algorithm

    Mon May 12th, 2003 - 1:00 amCS 2310Theory of Computing Seminar
    Michael Roman

    A survey of some monotone complexity lower bounds

    Mon May 12th, 2003 - 2:00 amCS 2310Theory of Computing Seminar
    Anne Condon

    Arthur and Merlin take a walk

    Tue June 3rd, 2003 - 3:30 amCS 2310Theory of Computing Seminar
    Lisa Hellerstein (UW Madison)

    Certificates and the Learnability of DNF Formulas

    Wed August 13th, 2003 - 2:30 amCS 2310Theory of Computing Seminar
  • 2001-2002

    Dieter van Melkebeek (University of Wisconsin - Madison)

    Quantum Information Processing: What, How and Why?

    Mon September 17th, 2001 - 12:00 pmTheory of Computing Seminar
    Jin-Yi Cai (University of Wisconsin - Madison)

    On the Average-Case Hardness of CVP

    Mon September 24th, 2001 - 12:00 pmTheory of Computing Seminar
    Eric Bach (University of Wisconsin - Madison)

    Some Combinatorial Problems Motivated by Cryptography

    Mon October 1st, 2001 - 12:00 pmTheory of Computing Seminar
    Denis Charles (University of Wisconsin - Madison)

    The Distribution of Squarefree Smooth Integers in Short Intervals

    Mon October 8th, 2001 - 12:00 pmTheory of Computing Seminar
    Deborah Joseph (University of Wisconsin - Madison)

    Locating Nested Repeats in DNA Sequences

    Mon October 15th, 2001 - 12:00 pmTheory of Computing Seminar
    Robert Joynt (Dept. of Physics, UW Madison)

    Technological Challenges of Quantum Computing

    Mon October 22nd, 2001 - 12:00 pmTheory of Computing Seminar
    Venkat Chakaravarthy (University of Wisconsin - Madison)

    Context Sensitive String Matching

    Mon October 29th, 2001 - 12:00 pmTheory of Computing Seminar
    Eric Bach (University of Wisconsin - Madison)

    Combinatorial Analysis of Quantum Random Walks

    Mon November 5th, 2001 - 12:00 pmTheory of Computing Seminar
    Dieter van Melkebeek (University of Wisconsin - Madison)

    On the Quantum Complexity of Majority

    Mon November 12th, 2001 - 12:00 pmTheory of Computing Seminar
    Neal Young (Akamai Technologies)

    Sequential and Parlallel Algorithms for Mixed Packing and Covering

    Mon November 26th, 2001 - 12:00 pmTheory of Computing Seminar
    John Watrous (University of Calgary)

    Theory and Potential Applications of Quantum Information Processing

    Mon January 28th, 2002 - 12:00 pmTheory of Computing Seminar
    John Watrous (University of Calgary)

    Quantum Interactive Proof Systems

    Tue January 29th, 2002 - 12:00 pmTheory of Computing Seminar
    Jin-Yi Cai (University of Wisconsin - Madison)

    On the Minimum volumne of a Perturbed Unit Cube

    Mon February 18th, 2002 - 12:00 pmTheory of Computing Seminar
    Amir Assadi (Dept. of Mathematics, UW Madison)

    Biological Computation from a Mathematical Viewpoint

    Mon February 25th, 2002 - 12:00 pmTheory of Computing Seminar
    Daniel Stefankovic (University of Chicago)

    Recognizing String Graphs in NP

    Mon March 4th, 2002 - 12:00 pmTheory of Computing Seminar
    Denis Charles (University of Wisconsin - Madison)

    Counting Lattice Vectors (Part I)

    Mon March 11th, 2002 - 12:00 pmTheory of Computing Seminar
    Antal Balog (Renyi Institute)

    On the prime factors of shifted primes

    Mon April 1st, 2002 - 12:00 pmTheory of Computing Seminar
    Andrew Odlyzko (University of Minnesota)

    The History of Communications and its Implications for the Internet

    Wed April 3rd, 2002 - 12:00 pmTheory of Computing Seminar
    Bruno Olshausen (University of California - Davis)

    Sparse coding as a principle of image representation in visual cortex

    Mon April 8th, 2002 - 12:00 pmTheory of Computing Seminar
    Denis Charles (University of Wisconsin - Madison)

    Counting Lattice Vectors (Part II)

    Mon April 22nd, 2002 - 12:00 pmTheory of Computing Seminar
    Venkat Chakaravarthy (University of Wisconsin - Madison)

    Computability and Complexity of Pointer Analysis

    Mon April 29th, 2002 - 12:00 pmTheory of Computing Seminar

Theory Lunch and TCS+ Talks

Regular theory group meetings every Wednesday at 12pm in room 4310. Student talks, discussion or streaming of TCS+ talks. Sign-up to give a talk!

Don't miss out

Make sure you are signed up to our mailing list (theory-seminar) for information about future events. Email any of the faculty if you wish to learn more.