Description: Description: Description: Description: Home> Groups > Theory > Seminar

Microsoft Research Theory Group Seminar

Theory Lunches on Wednesdays: ([NC]=non-catered)
12:30-1:30pm, room varies but often 1915, 2300, or 4300
Microsoft Building 99
Page maintained by: Miklos Racz


Directions
Theory Group
Microsoft Research
Probability in Seattle
Videos: titles marked with [V] link to videos; some additional talks are available via internal access if you are at MSR. Other titles link to an abstract or other material related to the talk.

 

2016:

September 1

15:30, 99/1927

Shashwat Garg

Improved algorithms for some problems in discrepancy theory

August 10

15:30, 99/1915

Sebastien Bubeck

Kernel-based methods for convex bandits, part 3

August 9

15:30, 99/1915

Sebastien Bubeck

Kernel-based methods for convex bandits, part 2

August 8

15:30, 99/2800

Sebastien Bubeck

Kernel-based methods for convex bandits, part 1

June 17

15:30, 99/1915

Daniel Jerison

Random walks on sandpile groups

June 14

15:00, 99/4300

Moumanti Podder

Properties of Galton-Watson trees, continuity, and first order logic

June 13

15:30, 99/1915

Laszlo M. Lovasz

A polynomial bound for Green's arithmetic triangle removal lemma in vector spaces

June 2

15:30, 99/1915

Konstantin Makarychev

Royen's proof of the Gaussian Correlation Conjecture

May 27

15:30, 99/2800

Grant Schoenebeck

Complex Contagions on Social Networks

May 17

15:30, 99/2505

Rebecca Hoberg

An Improved Bin Packing Approximation

May 12

15:30, 99/1927

Alexander Razborov

"Continuous" combinatorics

May 6

15:30, 99/2817

Asaf Nachmias

The connectivity of the uniform spanning forest on planar graphs

May 5

15:30, 99/1915

Yuval Rabani

Matrix balancing in L_p norms: a new analysis of Osborne's iteration

May 3

15:30, 99/1919

Daniel Ahlberg

[V] Competing Growth and Urns

April 20

15:30, 99/1927

Vasilis Gkatzelis

[V] Approximating the Nash Social Welfare with Indivisible Items

March 10

12:00, 99/1927

Bobby Kleinberg, Ravishankar Krishnaswamy, Janardhan Kulkarni, Miklos Racz, Gireeja Ranade, Milan Vojnovic

[V] MSR Theory Day

March 2

13:30, 99/2300

Ronen Eldan

The Power of Depth for Feedforward Neural Networks

February 9

15:30, 99/1915

David Harris

[V] Approximating integer programming problems by partial resampling

February 4

15:30, 99/1915

Alexander Holroyd

[V] Random Games

January 28

15:30, 99/1915

Thomas Rothvoss

[V] A Lasserre-based (1+epsilon)-approximation for Makespan Scheduling with Precedence Constraints

 

2015:

December 1

15:30, 99/1915

Krishna B. Athreya

[V] Coalescence in branching trees and branching random walks

November 19

15:30, 99/1915

Ilya Razenshteyn

[V] Locality-Sensitive Hashing and Beyond

October 28

12:30, 99/2300

Bob Hough

Covering systems of congruences

October 26

15:30, 99/TBA

Matus Telgarsky

[V] Representation power of neural networks

October 24

Savery Hall 264, University of Washington

Mathav Murugan, Yuval Peres, Juan M. Restrepo, Balint Virag, Zhenan Wang

Northwest Probability Seminar 2015

October 22

15:30, 99/1915

Yury Makarychev

[V] Satisfiability of Ordering CSPs Above Average Is Fixed-Parameter Tractable

October 21

16:00, 99/2300

Sebastien Bubeck

Crash course on learning theory, part II

October 13

15:30, 99/2300

Sebastien Bubeck

Crash course on learning theory, part I

September 16

12:30, 99/2300

Victoria Kostina

Nonasymptotic data compression

August 18

14:00, 99/1915

Bruce Kleiner

New examples of spaces satisfying Poincare inequalities

August 14

15:30, 99/1915

Samir Khuller

[V] To Do or Not To Do: Scheduling to Minimize Energy

August 12

13:30, 99/1915

Matt Weinberg

[V] Interpolating Between Truthful and Non-Truthful Mechanisms for Combinatorial Auctions

August 11

12:30, 99/1915

Elchanan Mossel

Shotgun assembly of labeled graphs

August 7

15:30, 99/1915

Alistair Sinclair

Analysis of a Classical Matrix Preconditioning Algorithm

August 6

15:30, 99/1927

Uriel Feige

[V] Separation between Estimation and Approximation

August 5

15:30, 99/1915

Ewain Gwynne

[V] Asymptotic Behavior of the Eden Model with Positively Homogeneous Edge Weights (a.k.a. The Polya Aggregate Model)

July 29

12:30, 99/1915

Miklos Racz

Braess's paradox for the spectral gap in random graphs

July 23

15:30, 99/1927

Tom Hutchcroft

[V] Circle Packing and Its Applications

July 22

14:00, 99/1915

Ola Svensson

[V] Approximating ATSP by Relaxing Connectivity

July 20

15:30, 99/1927

Rick Kenyon

[V] Fixed-Energy Harmonic Functions

July 16

15:30, 99/1927

Yin-Tat Lee

[V] A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization

July 14

15:30, 99/1915

Joel Spencer

[V] The First Order World of Galton-Watson Trees

July 1

13:30, 99/1915

Shuchi Chawla

[V] Revenue Maximization in Interdependent Value Settings

June 25

MSR NYC

Michael Kearns

[V] From “In” to “Over”: Behavioral Experiments on Whole-Network Computation

June 24

15:30, 99/1915

Debmalya Panigrahi

[V] Energy-efficient Scheduling in the Non-clairvoyant Model

June 24

MSR New England

Yaron Singer

[V] Some Limitations and Possibilities Toward Data-Driven Optimization

June 18

15:30, 99/1927

Hariharan Narayanan

[V] Randomized Interior Point Methods for Sampling and Optimization

June 10

15:30, 99/1915

Zhiyi Huang

[V] Making the Most of Your Samples

June 1

MSR New England

James Lee

[V] Learning, Mixing, and Complexity- A Free Ride on the Second Law

May 22

14:00, 99/1915

Shirshendu Ganguly

[V] Competitive erosion is conformally invariant

May 21

15:30, 99/1927

Roy Schwartz

[V] Fast and Simple Algorithms for Constrained Submodular Maximization

May 20

15:30, 99/1915

Jelena Marasevic

[V] A Fast Distributed Algorithm for alpha-Fair Packing Problems

May 13

15:30, 99/1915

Jordan Greenblatt

[V] Maximal Bounds on Cartesian Powers of Finite Graphs

May 8

13:30, 99/1927

Li-Yang Tan

[V] An average-case depth hierarchy theorem for Boolean circuits

March 26

14:20, 99/1915

Yishay Mansour

[V] Robust inference and local algorithms

March 26

13:30, 99/1915

Ofer Dekel

[V] Bandit Convex Optimization: SqrtT Regret in One Dimension

March 26

12:20, 99/1915

Noam Nisan

[V] On the borders of Border's Theorem

March 20

14:00, 99/1915

Aleksandar Nikolov

[V] Randomized Rounding for the Largest j-Simplex Problem

March 17

MSR New England

Jon Kleinberg

[V] Long-Range Planning with Time-Inconsistency: A Class of Computational Problems in Behavioral Economics

March 12

15:30, 99/1927

Grigory Yaroslavtsev

[V] Near Optimal LP Rounding for Correlation Clustering on Complete Graphs

February 19

14:00, 99/1927

Nikhil R. Devanur

[V] Fast Algorithms for Online Stochastic Convex Programming

January 16

14:00, 99/1927

Shayan Oveis-Gharan

[V] Effective-Resistance-Reducing Flows, Spectrally Thin Trees and Asymmetric TSP

January 7

15:30, 99/1927

Ola Svensson

[V] A Simple O(loglog(rank))-Competitive Algorithm for the Matroid Secretary Problem

 

2014:

December 15

15:30, 99/1915

Konstantin Makarychev

[V] Solving Optimization Problems with Diseconomies of Scale

November 24

16:10, 99/1927

Persi Diaconis

[V] Random Walk on the Heisenberg group

October 25

Building 99

Ioana Dumitriu, Alexander Holroyd, Tim Hulshof, Srinivasa Varadhan, Benjamin Young

Northwest Probability Seminar 2014

October 15

99/1927

Navin Goyal, Anup Rao

[V] MSR Theory Day - Part 3

October 15

99/1927

Sebastien Bubeck, Nick Gravin

[V] MSR Theory Day - Part 2

October 8

MSR Bangalore

Madhu Sudan

[V] Communication with Imperfectly Shared Randomness

October 8

15:30, 99/1927

Philippe Rigollet

Multistage bandits

August 15

15:30, 99/1915

Eyal Lubetzky

Information percolation for the Ising model 2

August 14

15:30, 99/1927

Eyal Lubetzky

Information percolation for the Ising model 1

August 7

15:30, 99/1927

Balasubramanian Sivan

[V] Towards optimal algorithms for prediction with expert advice

August 6

15:30, 99/1927

Elchanan Mossel

Strong and weak consistency in block model

August 5

15:30, 99/1927

Nicolo Cesa-Bianchi

[V] Graphical Bandits

July 29

15:30, 99/1915

Ronen Eldan

[V] Talagrand's convolution conjecture

July 28

15:30, 99/1927

James R. Lee

[V] Ito processes, correlated sampling and applications

July 24

15:30, 99/1927

David Woodruff

[V] Turnstile Streaming Algorithms Might as Well Be Linear Sketches

July 21

15:30, 99/1927

Jonathan Hermon

Characterization of cutoff for reversible Markov chains

July 18

15:30, 99/1919

Matthew Junge

[V] The Frog Model on Trees

June 19

10:30, 99/1915

Debmalya Panigrahi

Precedence-constrained Scheduling of Malleable Jobs

May 28

15:30, 99/1927

Benoit Laslier

[V] Mixing Time for Glauber Dynamics on Lozenge Tilings

 

2013:

November 25

15:30, 99/1927

Gil Kalai

[V] Analysis of Boolean Functions: advances and challenges

November 19

15:30, 99/1927

Yuan Zhou

[V] Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of Random Graphs

September 26

15:30, 99/1927

Yuval Peres

Concentration of Lipschitz functions of determinantal and other negatively associated variables

September 19

15:30, 99/1927

Balasubramanian Sivan

[V] Revenue Maximization and Prophet Inequalities

September 11

15:30, 99/1927

Yuval Peres

[V] Random Walks on Groups and the Kaimanovich-Vershik Conjecture for Lamplighter Groups

September 3

15:30, 99/1927

Nikhil Bansal

[V] On the Number of Matroids

May 16

15:30, 99/1927

James Lee

Approximate constraint satisfaction requires large LP relaxations

May 16

15:30, 99/1927

Jacob Leshno

Dynamic Matching in Overloaded Systems

May 15

15:30, 99/1927

Alexander Holroyd

[V] Self-Organizing Cellular Automata

May 7

15:30, 99/1927

Anupam Gupta

Sparsest Cut on Bounded Treewidth Graphs

April 17

15:30, 99/1927

Louigi Addario-Berry

[V] Probabilistic aspects of minimum spanning trees

April 3

15:30, 99/1927

Alex Bocharov

[V] The Incredible Shrinking Quantum Circuit

March 14

15:30, 99/1927

Yashodhan Kanoria

[V] Which side chooses in large random matching markets?

March 13

15:30, 99/1927

Laszlo Vegh

[V] Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives

February 12

15:30, 99/1927

Anand Louis

[V] Graph Multi-partitioning and Higher Order Cheeger Inequalities

February 7

15:30, 99/1927

Balasubramanian Sivan

[V] Prior Robust Optimization

January 9

15:30, 99/1927

Jonathan Hermon

[V] The Social Network Model

 

2012:

December 18

15:30, 99/1927

Ola Svensson

Approximating k-Median via Pseudo-approximation

December 4

10:30, 99/1927

Alistair Sinclair

Random Lattice Triangulations: Structure and Algorithms

November 15

13:30, 99/1915

James Lee

Markov type and the multi-scale geometry of metric spaces – How well can martingales aim?

November 15

15:30, 99/1927

Geoffrey Grimmett

Counting self-avoiding walks

November 6

15:30, 99/1927

Eviatar Procaccia

Asymptotic behavior of the Cheeger constant of super-critical percolation in the square lattice

August 23

15:30, 99/1927

James Lee

The Margulis expanders

August 15

15:30, 99/1927

Laszlo Lovasz

The similarity distance on graphs and graphons

April 25

15:30, 99/1927

Janko Gravner

Digital Snowflakes

February 17

13:30, 99/1915

Roberto Imbuzeiro Oliveira

On the coalescence time of reversible random walks

 

2011:

December 8

15:30, 99/1927

Nisheeth Vishnoi

Approximating the Exponential, the Lanczos Method and an O(m polylog(n))-Time Spectral Algorithm for Balanced Graph Partitioning

October 27

15:30, 99/1927

James Lee

Laplacian eigenvalues and expansion of small sets

October 20

15:30, 99/1927

Niv Buchbinder

The randomized k-server conjecture

October 13

15:30, 99/1927

Nicolas Curien

Introduction to the theory of random planar maps

September 29

15:30, 99/1927

James Lee

[V] Sparsest Cut, discrete differentiation, and local rigidity of sets in the plane

September 21

15:30, 99/1927

Tanmoy Chakraborty

Mechanism Design for a Risk Averse Seller

September 7

15:30, 99/1927

Amin Saberi

Game Dynamics, Equilibrium Selection and Network Structure

September 1

15:30, 99/1927

Itai Benjamini

Aspects of random walks on groups

August 17

15:30, 99/1927

Klaus Schmidt

[V] Abelian Sandpiles and the Harmonic Model

August 11

15:30, 99/1927

Benny Sudakov

[V] Nonnegative k-sums, fractional covers, and probability of small deviations

August 10

15:30, 99/1927

R. Ravi

[V] Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits

August 4

15:30, 99/1927

Balasubramanian Sivan

[V] Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems

July 28

15:30, 99/1927

Omer Tamuz

From Agreement to Asymptotic Learning

July 21

10:30, 99/1915

Venkatesan Guruswami

[V] Bridging Shannon and Hamming: Codes for Computationally Simple Channels

July 20

15:30, 99/1927

Ivan Corwin

[V] Beyond the Gaussian Universality Class

July 7

15:30, 99/1927

Jian Ding

Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees

July 5

15:30, 99/1919

Andrey Raigorodsky

[V] Web graph models: properties and applications

June 30

15:30, 99/1927

Asaf Nachmias

[V] The percolation phase transition in the Hamming cube

June 29

15:30, 99/1927

Charles Smart

[V] Convergence of the Abelian sandpile

May 27

15:30, 99/1927

Sebastian Cioaba

[V] On a conjecture of Brouwer regarding the connectivity of strongly regular graphs

 

2010:

November 12

3:30, 99/1927

S. Muthukrishnan

Ad Exchanges: Auctions and Optimizations

November 5

3:30, 99/1927

Jeff Kahn

Factors in random graphs and hypergraphs

November 3

3:30, 99/1927

Elliot Anshelevich

[V] Contribution Games in Social Networks

October 28

3:30, 99/1927

Dan Romik

Arctic circles, random domino tilings and square Young tableaux

October 27

3:30, 99/1927

Leonard Schulman

[V] Solvency Games

October 22

3:30, 99/1927

Nick Wormald

Asymptotic enumeration of sparse 2-connected graphs

October 20

3:30, 99/1927

Ran Raz

[V] How to fool people to work on circuit lower bounds

October 15

1:30, 99/1927

Sergey Fomin

[V] Total positivity and cluster algebras

September 28

1:30, 99/1927

Elchanan Mossel

Learning on social networks

September 2

3:30, 99/1927

Fabio Martinelli

[V] Glauber dynamics for the 2D Ising model at low temperature

September 1

3:30, 99/1927

Fabio Toninelli

[V] Metastabiity and logarithmic energy barriers for a polymer dynamics

September 1

1:30, 99/1919

Debmalya Panigrahi

Online Non-Metric Facility Location and Related Problems

August 31

1:30, 99/1927

Yossi Azar

Ranking with Unrelated Intents or Submodular Valuations

August 30

3:30, 99/1927

Pietro Caputo

[V] Proof of Aldous' spectral gap conjecture

August 27

3:30, 99/2917

Fabio Toninelli

Zero-temperature 3D Ising dynamics and dimer coverings

August 24

1:30, 99/1915

Siddhartha Sen

New Balanced Search Trees

August 23

10:30, 99/1915

Claire Mathieu

[V] Approximation Schemes for Optimization

August 18

1:30, 99/1927

Konstantin Makarychev

Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability

August 17

1:30, 99/1927

Glencora Borradaile

[V] Finding all min st-cuts in planar graphs.

August 16

3:30, 99/1927

Persi Diaconis

Random Tri-Diagonal Doubly Stochastic Matrices.

August 10

1:30, 99/1927

Michael Krivelevich

[V] Embedding spanning trees in random graphs.

July 30

1:30, 99/1927

Benny Sudakov

[V] All pairs shortest path in quadratic time with high probability.

July 27

1:30, 99/1927

Alexandre Stauffer

Mobile Geometric Graphs: Detection, Coverage and Percolation.

July 26

3:30, 99/1927

Rick Kenyon

[V] The double dimer model with quaternions.

July 22

10:30, 99/1927

Maria Florina Balcan

[V] Approximate Clustering without the Approximation.

July 9

2:00, 99/2817

Zhongyang Li

Vertex models and holographic projection.

July 8

3:30, 99/2817

Nike Sun

On a result by Chatterjee on the maximum of a discrete Gaussian free field.

July 6

3:30, 99/1919

Christos Papadimitriou

[V] Simple stochastic games and a new class of total functions .

June 30

3:30, 99/1919

James Lee

[V] Talagrand's majorizing measure theorem: The proof.

June 30

2:00, 99/1927

Hugo Duminil-Copin

[V] Self-avoiding walks on the honeycomb lattice.

June 23

5:00, 99/1915

James Lee

[V] Talagrand's majorizing measure theory: Lower bounds.

June 22

1:30, 99/1927

Vijay Vazirani

[V] Can the Theory of Algorithms Ratify the "Invisible Hand of the Market"?.

June 17

10:30, 99/1919

Claire Mathieu

How to Route Vehicles in the Plane, in Theory.

June 17

10:30, 99/1915

Aravind Srinivasan

New Constructive Aspects of the Lovasz Local Lemma.

June 15

3:30, 99/1915

David Aldous

[V] Scale-invariant random spatial networks.

June 14

4:00, 99/2817

James Lee

An introduction to Talagrand's majorizing measure theory.

June 11

1:30, 99/1915

Anup Rao

[V] Pseudorandom Generators for Regular Branching Programs.

June 9

3:30, 99/1927

Jonah Sherman

Breaking the Multicommodity Flow Barrier for \sqrt{log(n)}-Approximations to Sparsest Cut.

June 4

1:30, 99/1927

Tobias Friedrich

[V] Quasirandom Load Balancing.

June 3

3:30, 99/1927

Yuval Peres

[V] Cover times, blanket times, and the Gaussian free field.

May 28

1:30, 99/1915

Ryan O'Donnell

[V] Kahn-Kalai-Linial and Kruskal-Katona.

May 27

3:30, 99/1927

Alexandre Stauffer

[V] Percolation in a mobile environment.

May 27

10:30, 99/1927

Chinmay Karande

New Algorithmic Developments in Ad-auctions.

May 25

3:30, 99/1927

Jay Rosen

[V] A sufficient condition for the continuity of permanental processes with applications to local times of Markov processes and loop soups

May 24

10:30, 99/1927

Gunnar Carlsson

[V] Topology and Data.

May 21

3:30, 99/1927

Vladas Sidoravicius

Abundance of Maximal Paths.

May 18

3:30, 99/2817

Marcelo Hilario

Fixation for Distributed Clustering Processes.

May 14

3:30, 99/2817

David Wilson

xor-Ising model

May 13

3:30, 99/2817

Karl Mahlburg

Percolation, Probability, and Partitions

May 7

4:00, 99/1915

Svante Janson

[V] Width and height of conditioned Galton-Watson trees

Apr 29

3:30, 99/2817

Robert Masson

[V] Random walks on the two dimensional uniform spanning tree

Apr 27

3:30, 99/2817

Chris Hillar

Word equations in a uniquely divisible group

Apr 23

3:30, 99/2817

Vladas Sidoravicius

Growth and random walks in dynamically evolving random environment

Apr 22

3:30, 99/2817

Lionel Levine

Fast simulation of large-scale growth models

Apr 20

3:30, 99/2817

Nikhil Devanur

Local Dynamics in Bargaining Networks via Random Turn Games

Apr 15

3:30, 99/2817

Allan Sly

Cutoff for the Ising model on the lattice

Apr 12

3:30, 99/2817

Jian Ding

Cover times, blanket times, and majorizing measures.

Apr 1

3:30, 99/2817

Ori Gurel-Gurevich

Nonconcentration of Return Times

Mar 25

3:30, 99/2817

Ander Holroyd

Multi-dimensional percolation

Mar 18

3:30, 99/1927

Soumik Pal

Wright-Fisher model with negative mutation rates

Mar 11

3:30, 99/1919

Nicole Immorlica

[V] Pricing Information Cascades

Mar 10

3:30, 99/1927

Christos Papadimitriou

[V] Computing Nash equilibria: The plot thickens

Feb 18

3:30, 99/1927

David Aldous

Concentration for Markov chain cover times

Feb 16

3:30, 99/1915

Nati Linial

Some computational and combinatorial applications of simplicial topology

Feb 4

1:30, 99/1915

Zoya Svitkina

Asymmetric Traveling Salesman Path and Directed Latency Problems

Jan 27

1:30, 99/1915

Warren Schudy

Approximation Schemes for Dense Variants of Feedback Arc Set, Correlation Clustering, and Other Fragile Min Constraint Satisfaction Problems

Jan 25

10:30, 99/1919

Mike Hochman

[V] Local entropy averages and projections of fractal measures

Jan 21

10:30, 99/1919

Grant Schoenebeck

[V] Understanding the Limitations of Linear and Semidefinite Programming

Jan 20

10:30, 99/1919

Niv Buchbinder

The Randomized k-Server Conjecture (Online Algorithms meet Linear Programming)

Jan 19

3:30, 99/1915

Remco van der Hofstad

[V] First passage percolation on random graphs

Jan 15

10:30, 99/1927

Anne Fey

[V] Limiting shapes for a nonabelian sandpile growth model

Jan 8

10:30, 99/1915

Nitish Korula

Online Allocations and Advertising

Jan 7

10:30, 99/1919

Ilias Diakonikolas

[V] Threshold Functions: Approximation, Pseudorandomness and Learning

Jan 6

10:30, 99/1915

Nikhil Srivastava

[V] Twice-Ramanujan Sparsifiers

 

2009:

Nov 20

15:30, 99/2817

Gagan Goel

Algorithms for Auctions with budget constraints

Oct 22

15:30, 99/2817

Mohammad-Taghi Hajiaghayi

[V] Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP

Oct 8

15:30, 99/2817

Geoffery Grimmett (Cambridge University)

Influence and sharp thresholds for product and FKG measures

Oct 1

15:30, 99/1927B

Robin Moser (ETH Zurich)

A Constructive Proof of the Lovász Local Lemma

Oct 1

14:00, 99/1927B

Noga Alon (Tel-Aviv University)

[V] Eliminating Cycles in the Torus

Sep 29

3:30, 99/1919

Eyal Winter (Hebrew University)

[V] Contracting with Asymmetric Externalities

Sep 24

3:30, 99/1927B

Sven Seuken (MSR and Harvard)

[I] [V] Economics meets UI Design: Toll Bridge Pricing and P2P Backup Markets

Sep 23

12:30, 99/4300, [NC]

Nikhil Devanur (MSR)

An O(n log n) algorithm for a load balancing problem on a tree

Sep 17

3:30, 99/1927B

Ben Birnbaum (U Washington)

[I] [V] On Local Dynamics for Two Equilibrium Concepts

Sep 16

12:30, 99/4300, [NC]

Kamal Jain (MSR)

 

2005:

Aug 30

15:30, 99/2817

Gil Kalai

[V] Is there a model for noise which reduces quantum computation to classical computation?

 

2003:

Aug 19

15:30, 99/2817

Gil Kalai

[V] A topological colorful Helly theorem

 

2002:

Jul 29

15:30, 99/2817

Gil Kalai

[V] Around Borsuk’s Problem

 

2001:

Aug 23

15:30, 99/2817

Gil Kalai

[V] Threshold phenomena and social choice