- A classical approach to quantum algorithms
- Astar, Singapore, Feb. 14, 2013
- (pdf)
- Quantum query algorithms for triangle finding and associativity testing
- SODA 2013, New Orleans, Jan 8, 2013
- (pdf)
- New bounds on the communication complexity of graph properties
- FSTTCS 2012, Hyderabad, India, Dec 15, 2012
- (pdf)
- A strong direct product theorem for quantum query complexity
- CCC 2012, Porto, June 28, 2012
- (pdf)
- Composition Theorems in Communication Complexity
- ICALP, Bordeaux, July 9, 2010
- (pdf)
- Grothendieck Inequalities, XOR games, and Communication Complexity
- Centre for Quantum Technologies, Singapore, December 10, 2009
- (pdf)
- From adversaries to algorithms
- AT&T, November 4, 2009
- (pdf)
- Grothendieck Inequalities, XOR games, and Communication Complexity
- Institute for Advanced Study, November 2, 2009
- (pdf)
- Rank minimization via the gamma_2 norm
- Dimacs Seminar, September 9, 2009
- (pdf)
- An approximation algorithm for approximation rank
- CCC 2009, Paris, July 18, 2009
- (pdf)
- Rank minimization via the gamma_2 norm
- Technion, Haifa, June 7, 2009
- (pdf)
- Approximation rank and quantum communication complexity with entanglement
- University of Tokyo, November 25, 2008
- (pdf)
- Quantum ordered search problem
- Workshop on quantum algorithms and complxity theory, Singapore, November 17, 2008
- (pdf)
- Approximation norms, duality, and communication complexity lower bounds
- Columbia University, September 26, 2008
- (pdf)
- Approximation norms, duality, and communication complexity lower bounds
- Dagstuhl, September 17, 2008
- (pdf)
- Optimal quantum adversary bounds for ordered search
- ICALP, July 11, 2008
- (pdf)
- Disjointness is hard in the number-on-the-forehead model
- CCC, June 23, 2008
- (pdf)
- A direct product theorem for discrepancy
- CCC, June 23, 2008
- (pdf)
- Disjointness is hard in the number-on-the-forehead model
- CWI, May 26, 2008
- (pdf)
- Disjointness is hard in the number-on-the-forehead model
- Orsay, May 20, 2008
- Product theorems via semidefinite programming
- Tel Aviv University, April 8, 2008
- Disjointness is hard in the number-on-the-forehead model
- NYU, March 13, 2008
- (pdf)
- Disjointness is hard in the number-on-the-forehead model
- IAS, March 3, 2008
- (pdf)
- Disjointness is hard in the number-on-the-forehead model
- DIMACS theory seminar, January 30, 2008
- (pdf)
- Direct product theorem for discrepancy
- DIMACS theory seminar, October 17, 2007
- (pdf)
- Direct product theorem for discrepancy
- Dagstuhl, October 9, 2007
- (pdf)
- Negative weights make adversaries stronger
- DIMACS theory seminar, September 12, 2007
- Negative weights make adversaries stronger
- QIP, Brisbane, Australia, February 1, 2007
- (pdf)
- Negative weights make adversaries stronger
- LRI, Orsay, January 18, 2007
- (pdf)
- A new rank technique for formula size lower bounds
- Dagstuhl, November 9, 2006
- Negative weights make adversaries stronger
- University of Calgary, November 1, 2006
- Matrix methods for formula size lower bounds
- University of Porto, May 30, 2006
- (pdf)
- Quantum adversary method and formula size lower bounds
- CCC June 12, 2005
- (pdf)
- Quantum adversary method and formula size lower bounds
- CWI April 12, 2005
- (pdf)
- Resource Bounded Symmetry of Information
- Schloss Dagstuhl, Germany, October 15, 2004
- (pdf)
- Language Compression, Pseudorandom Generators and Symmetry of Information
- Aarhus, Denmark, September 27, 2004
- (ps)(pdf)
- On Polynomially Time Bounded Symmetry of Information
- Presentation in MFCS, Prague, August 24th, 2004
- (pdf)
- Language Compression and Pseudorandom Generators
- Presentation in CCC, Amherst, June 21st, 2004
- (pdf)