Department of Computer Science

Theory of Combinatorial Algorithms
Prof. Emo Welzl
up 
People
Activity Report
Previous Reports
Research
Mittagsseminar
Teaching
Workshops
Social Activities

Topics for Master / Bachelor Theses

CGAL Geometric Algorithms Library
  Mittagsseminar (in cooperation with A. Steger and B. Sudakov)

Talks by Jiří Matoušek

1996

    May

    • May 14, 1996, Jiří Matoušek: Approximation by zonotopes, numerical integration, and discrepancy [details]

    June

    • June 04, 1996, Jiří Matoušek: Constants for Cuttings [details]

    1998

      May

      • May 07, 1998, Jiří Matoušek: Noga Alon on the Shannon capacity of a disjoint union [details]

      June

      • June 02, 1998, Jiří Matoušek: Graphs without small complete bipartite subgraphs (according to Kollar, Ronyai, Szabo, and Alon) [details]

      1999

      • June 08, 1999, Jiří Matoušek: Embedding trees in Euclidean space [details]

      2000

        July

        • July 06, 2000, Jiří Matoušek: Weak epsilon-nets in high dimensions [details]

        2003

          February

          • Friday, February 07, 2003, Jiří Matoušek (Charles University, Prague): Crossing Number and Small Nonplanar Subgraphs [details]

          June

          • Monday, June 16, 2003, Jiří Matoušek (Charles University, Prague): A Briefing on Dimension Reduction [details]

          2004

          • Friday, June 18, 2004, Jiří Matoušek (Charles Univ.): Simplex Reptiles Could Help the Net Police, But Probably They Do Not Exist [details]

          2005

          • June 23, 2005, Jiří Matoušek (Charles Univ.): New badly embeddable spaces (presenting work of Subhash Khot and Assaf Naor) [details]

          2006

            April

            • April 25, 2006, Jiří Matoušek (Charles Univ., Prague): Zone diagrams [details]

            May

            • May 04, 2006, Jiří Matoušek (Charles Univ., Prague): On the Johnson-Lindenstrauss flattening lemma [details]

            2007

            • May 03, 2007, Jiří Matoušek (Charles Univ., Prague): How many points can be reconstructed from k projections? [details]
            • May 31, 2007, Jiří Matoušek (Charles Univ., Prague): Large Monochromatic Components in Two-colored Grids [details]

            2008

            • May 08, 2008, Jiří Matoušek (Charles Univ., Prague): On the difficulty of removing degeneracy in LP-type problems: The way of topology [details]
            • May 27, 2008, Jiří Matoušek (Charles Univ., Prague): Low-distortion embeddings in R^d [details]

            July

            • Monday, July 14, 2008, Jiří Matoušek (Charles Univ., Prague): Blocking visibility for points in general position [details]

            2009

              May

              • May 12, 2009, Jiří Matoušek (Charles Univ., Prague): Kakeya's conjecture over finite fields according to Zeev Dvir [details]

              2011

                June

                • June 07, 2011, Jiří Matoušek (Charles Univ.): Discrepancy, Bansal's algorithm and the determinant bound [details]


                Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

                Previous talks by year:   2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

                Information for students and suggested topics for student talks


                Automatic MiSe System Software Version 1.3900:4624   |   admin login

                11-Jul-2013 / vincent-mise@inf.ethz.ch