• 9934 - Complex Geometry: Varieties of Low Dimensions 

      [TB-1999-34] (1999) - (22 Aug - 28 Aug 1999)
    • 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 ...
    • 1846 - Complexity Theory 

      [OWR-2018-51] (2018) - (11 Nov - 17 Nov 2018)
      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 ...
    • 0047 - Complexity Theory 

      [TB-2000-44] (2000) - (19 Nov - 25 Nov 2000)
    • 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 ...
    • 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 ...
    • 2146 - Complexity Theory (hybrid meeting) 

      [OWR-2021-54] (2021) - (14 Nov - 20 Nov 2021)
      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 ...
    • Composition of Irreducible Morphisms in Coils 

      [OWP-2017-32] Chaio, Claudia; Malicki, Piotr (Mathematisches Forschungsinstitut Oberwolfach, 2017-10-30)
      We study the non-zero composition of n irreducible morphisms between modules lying in coils in relation with the powers of the radical of their module category.
    • Composition of Irreducible Morphisms in Quasi-Tubes 

      [OWP-2015-03] Chaio, Claudia; Malicki, Piotr (Mathematisches Forschungsinstitut Oberwolfach, 2015-04-09)
      We study the composition of irreducible morphisms between indecomposable modules lying in quasi-tubes of the Auslander-Reiten quivers of artin algebras $A$ in relation with the powers of the radical of their module category ...
    • 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 ...
    • 2117 - Computability Theory (hybrid meeting) 

      [OWR-2021-21] (2021) - (25 Apr - 01 May 2021)
      Over the last decade computability theory has seen many new and fascinating developments that have linked the subject much closer to other mathematical disciplines inside and outside of logic. This includes, for instance, ...
    • Computational algebraic number theory 

      [OWS-21] Pohst, Michael (Birkhäuser Basel, 1993)
      Computational algebraic number theory has been attracting broad interest in the last few years due to its potential applications in coding theory and cryptography. For this reason, the Deutsche Mathematiker Vereinigung ...
    • 0827a - Computational Algebraic Topology 

      [OWR-2008-29] (2008) - (29 Jun - 05 Jul 2008)
    • 0409 - Computational Electromagnetism 

      [OWR-2004-11] (2004) - (22 Feb - 28 Feb 2004)
    • 1007 - Computational Electromagnetism and Acoustics 

      [OWR-2010-10] (2010) - (14 Feb - 20 Feb 2010)
      The challenge inherent in the accurate and efficient numerical modeling of wave propagation phenomena is the common grand theme in both computational electromagnetics and acoustics. Many excellent contributions at this ...
    • 1304 - Computational Electromagnetism and Acoustics 

      [OWR-2013-3] (2013) - (20 Jan - 26 Jan 2013)
      Computational electromagnetics and acoustics revolve around a few key challenges, among which are the non-local nature of the underlying phenomena and resonance effects. The bulk of the contributions to the workshop addressed ...
    • 0706 - Computational Electromagnetism and Acoustics 

      [OWR-2007-5] (2007) - (04 Feb - 10 Feb 2007)
      It is a moot point to stress the significance of accurate and fast numerical methods for the simulation of electromagnetic fields and sound propagation for modern technology. This has triggered a surge of research in ...