Found 4 relevant results in 2.47s where lecturer="Jiri Matousek"
Discrete geometry investigates combinatorial properties of configurations of geometric objects.The topics of this course include: basics on convex sets, convex polytopes, and hyperplane arrangements; combinatorial complexity of geometric configurations; intersection patterns and transversals of convex sets; geometric Ramsey-type results; polyhedral combinatorics and high-dimensional convexity.
Theory of Computing
Theoretische Informatik
Advanced design and analysis methods for algorithms and data structures (Random(ized) Search Trees, Network Flows, Minimum Cut, Randomized Algebraic Algorithms, Point Location, PCP Theorem).
Theory of Computing
Theoretische Informatik
Advanced design and analysis methods for algorithms and data structures (Random(ized) Search Trees, Network Flows, Minimum Cut, Randomized Algebraic Algorithms, Point Location, PCP Theorem).
Elementary topological notions and results: simplicial & cell complexes, homotopy of maps, nerve theorem, Borsuk-Ulam-type theorems, connectivity, (deleted) joins & products, finite group actions and equivariant maps. Geometric & combinatorial applications: Ham-Sandwich & partition theorems, Kneser's conjecture, van Kampen-Flores-type theorems, topological & colored Tverberg theorem.