Selected Talks

  • Interfaces of Attention, Theory & Practice talk series, 2009,
    talk slides.
  • Combinatorial Approach to Similarity Search, Invited talk at SISAP 2009,
    talk slides.
  • Data Cloud, Stanford, Caltech, UCLA, 2009,
    talk slides.
  • The Future of Search, Helsinki University and St.Petersburg CS Club, 2008,
    talk slides.
  • Social Design, Stanford RAIN Seminar, June 2008,
    talk slides, handout, TEX source.
  • The Architecture of the Web, Caltech IST Bunch Lunch, May 2008,
    talk slides, handout, TEX source, video, MP3.
  • Business-Consumer Networks, Microsoft adLabs 2008,
    talk slides.
  • Combinatorial Approach to Data Mining,
    MIT / U of Washington / Microsoft Research / IPAM, December 2007,
    Video on ResearchChannel.Org (works only in Internet Explorer),   talk slides, handout.
  • Open Problems TO GO, MIT, 2007,
    talk slides, handout
  • Similarity Search: A Web Perspective
    Talk at Google/IBM Research/Microsoft Research, October 2007

    Watch this talk on Youtube!

    Slides
    Handout
    MP3
    Paper about Disorder
    Paper about Zipf model
  • Estimation of the Click Volume by Large Scale Regression Analysis, CSR 2007,
    talk slides, handout and MP3 (27 min, 12 Mb).
  • Maximal Intersection Queries in Randomized Graph Models, CSR 2007,
    talk slides, prepared and presented by Benjamin Hoffmann.
  • Decidability of Parameterized Probabilistic Information Flow, CSR 2007,
    talk slides, handout and MP3 (22 min, 10 Mb).
  • Novel Approaches to Nearest Neighbors, Workshop on Computational, Descriptive and Proof complexity, and Algorithms, Moscow, August 2007,
    talk slides and handout.
  • Algorithms for Nearest Neighbors: Background and Two Challenges, McGill University, July 2007,
    talk slides and handout.
  • Algorithms for Nearest Neighbors: Classic Ideas, New Ideas, University of Toronto, July 2007,
    talk slides, talk handout and MP3 (52 min, 24 Mb).
  • Tiling Periodicity, CPM'07, July 2007,
    talk slides and MP3 (24 min, 11 Mb).
  • Processing Compressed Texts: A Tractability Border, CPM'07, July 2007,
    talk slides and MP3 (22 min, 10 Mb).
  • PhD Defence of Yury Lifshits, May 31, 2007,
    [Rus] talk slides and talk handout.
  • Four Results of Jon Kleinberg, St.Petersburg Mathematical Society, May 2007,
    talk slides and talk handout and mp3 (74 min/34 mb).
  • Algorithms for Nearest Neighbors: Theoretical Aspects, Kolmogorov seminar at Moscow State University, April 2007,
    talk slides and talk handout.
  • Algorithms for Nearest Neighbors, Yandex Tech Seminar, April 2007,
    talk slides and talk handout , mp3 (63 min/29 mb).
  • Web Research: Open Problems, Steklov Institute, November 2006,
    talk slides and talk handout.
  • [Rus] Invitation to Computer Science, Welcome lecture at ITMO, November 2006,
    talk slides and talk handout.
  • Compression for Data Structures, Steklov Institute, October 2006,
    talk slides and talk handout.
  • Querying and Embedding Compressed Texts, MFCS'06, August 2006,
    talk slides and talk handout.
  • Window Subsequence Problems for Compressed Texts, from CSR'06, June 2006,
    talk slides and talk handout.
  • Tiling periodicity, from Dagstuhl seminar 06201, May 2006,
    talk slides and talk handout.
  • A New Algorithm for Mean Payoff Games,, from spring school EPIT'06, May 2006,
    talk slides and talk handout.
  • Processing Compressed Texts,, from research seminar at Tallin Technological Institute, March 2006,
    talk slides and talk handout.
  • Applications of Obfuscation, from seminar at St.Petersburg Department of Intel, Spring 2005,
    talk slides and talk handout.
  • Brief Introduction to Obfuscation, from research seminar at Stuttgart University, February 2005,
    talk slides.
  • Quantum Algorithm for the Hilbert's 10th Problem,, from FerienAkademie'03, September 2003,
    talk slides and talk handout.