• 0719 - Algorithm Engineering 

      [OWR-2007-25] (2007) - (06 May - 12 May 2007)
      Algorithm Engineering is concerned with the design, theoretical analysis, implementation, and experimental evaluation of algorithms. It provides methodologies and tools for designing, developing and engineering efficient ...
    • 1041 - Arbeitsgemeinschaft: Topological Robotics 

      [OWR-2010-47] (2010) - (10 Oct - 16 Oct 2010)
      The purpose of the Arbeitsgemeinschaft was to enable PhD students and researchers to study Topological Robotics, a new field investigating topological problems motivated by robotics and engineering as well as problems of ...
    • Categoric Aspects of Authentication 

      [OWP-2012-05] Schillewaert, Jeroen; Thas, Koen (Mathematisches Forschungsinstitut Oberwolfach, 2012-04-24)
    • 0749 - Coding Theory 

      [OWR-2007-56] (2007) - (02 Dec - 08 Dec 2007)
      Coding theory lies naturally at the intersection of a large number of disciplines in pure and applied mathematics: algebra and number theory, probability theory and statistics, communication theory, discrete mathematics ...
    • 1823b - Cohomological and Metric Properties of Groups of Homeomorphisms of R 

      [OWR-2018-26] (2018) - (03 Jun - 09 Jun 2018)
      In recent years, the family of groups sharing features or design principles with classical Thompson groups has grown considerably. The workshop highlights new developments in this field with special emphasis on algorithmic ...
    • 1101 - Combinatorics 

      [OWR-2011-1] (2011) - (02 Jan - 08 Jan 2011)
      Combinatorics is a fundamental mathematical discipline which focuses on the study of discrete objects and their properties. The current workshop brought together researchers from diverse fields such as Extremal and ...
    • 0601 - Combinatorics 

      [OWR-2006-1] (2006) - (01 Jan - 07 Jan 2006)
      This is the report on the Oberwolfach workshop on Combinatorics, held 1–7 January 2006. Combinatorics is a branch of mathematics studying families of mainly, but not exclusively, finite or countable structures – discrete ...
    • 0802 - Combinatorics 

      [OWR-2008-1] (2008) - (06 Jan - 12 Jan 2008)
    • 0918 - Combinatorics and Probability 

      [OWR-2009-23] (2009) - (26 Apr - 02 May 2009)
      The effective application of probabilistic reasoning in the study of problems in diverse areas is one of the most exciting recent developments in Mathematics. Probabilistic methods turned out to be very powerful in Discrete ...
    • 0644 - Combinatorics, Probability and Computing 

      [OWR-2006-48] (2006) - (29 Oct - 04 Nov 2006)
      One of the exciting phenomena in mathematics in recent years has been the widespread and surprisingly effective use of probabilistic methods in diverse areas. The probabilistic point of view has turned out to be
    • 0947 - Complexity Theory 

      [OWR-2009-52] (2009) - (15 Nov - 21 Nov 2009)
      Computational Complexity Theory is the mathematical study of the intrinsic power and limitations of computational resources like time, space, or randomness. The current workshop focused on recent developments in various ...
    • 0726 - Complexity Theory 

      [OWR-2007-31] (2007) - (24 Jun - 30 Jun 2007)
      Computational Complexity Theory is the mathematical study of the intrinsic power and limitations of computational resources like time, space, or randomness. The current workshop focused on recent developments. Connections ...
    • 0523 - Complexity Theory 

      [OWR-2005-26] (2005) - (05 Jun - 11 Jun 2005)
      Computational Complexity Theory is the mathematical study of resources like time, space, or randomness that are required to solve computational problems. The current workshop was focused on recent developments, and the ...
    • 1547 - Complexity Theory 

      [OWR-2015-54] (2015) - (15 Nov - 21 Nov 2015)
      Computational Complexity Theory is the mathematical study of the intrinsic power and limitations of computational resources like time, space, or randomness. The current workshop focused on recent developments in various ...
    • 1246 - Complexity Theory 

      [OWR-2012-54] (2012) - (11 Nov - 17 Nov 2012)
      Computational Complexity Theory is the mathematical study of the intrinsic power and limitations of computational resources like time, space, or randomness. The current workshop focused on recent developments in various ...
    • 1206 - Computability Theory 

      [OWR-2012-8] (2012) - (05 Feb - 11 Feb 2012)
      Computability is one of the fundamental notions of mathematics, trying to capture the effective content of mathematics. Starting from Gödel’s Incompleteness Theorem, it has now blossomed into a rich area with strong ...
    • 1802 - Computability Theory 

      [OWR-2018-1] (2018) - (07 Jan - 13 Jan 2018)
      Computability and computable enumerability are two of the fundamental notions of mathematics. Interest in effectiveness is already apparent in the famous Hilbert problems, in particular the second and tenth, and in early ...
    • 1542 - Computational Geometric and Algebraic Topology 

      [OWR-2015-45] (2015) - (11 Oct - 17 Oct 2015)
      Computational topology is a young, emerging field of mathematics that seeks out practical algorithmic methods for solving complex and fundamental problems in geometry and topology. It draws on a wide variety of techniques ...
    • 0627 - Computational Group Theory 

      [OWR-2006-30] (2006) - (02 Jul - 08 Jul 2006)
      This workshop on Computational Group Theory revealed the close connections between its main themes “finitely presented groups”, “permutation groups”, “matrix groups” and “representations of groups”. The meeting also presented ...
    • 1131 - Computational Group Theory 

      [OWR-2011-37] (2011) - (31 Jul - 06 Aug 2011)
      This sixth workshop on Computational Group Theory proved that its main themes “finitely presented groups”, “$p$-groups”, “matrix groups” and “representations of groups” are lively and active fields of research. The talks ...