M.Sc. in computer science from University of Paderborn. Since March 2011 I am a Ph.D. student of Prof. Dr. Martin Ziegler at the mathematics department at Darmstadt University of Technology.
Short note about this domain’s name
caero arose from a simple reshuffling of my name (Carsten Roesnick) as an attempt to find a short, sufficiently memorable, and persistent online identity. Voilá, caero. :)
Pronounciation is a bit tricky since it is a madeup word. However, I suggest to pronounce it /kærəʊ/ (with c as in canada plus aero). For german speakers, this pronounciation might sound odd. If you are amongst them, try to pronounce each letter individually, i.e., kaero. If you have different suggestions or even pronounciations for further languages, feel free to send me an email.
Contact
 Technische Universität Darmstadt
Fachbereich Mathematik, AG Logik
Schloßgartenstraße 7
64289 Darmstadt, Germany  Office: S2/15228
 Phone: +49 6151 164181
 Email (work): roesnick at mathematik dot tudarmstadt dot de
Email (private): carsten at caero dot de
Please encrypt your emails whenever possible using my public PGP key.  GitHub: github.com/croesnick
 Jabber: cr@jabber.de
 Social: Xing, LinkedIn, Twitter
Blog posts
 (October 28, 2013) LaTeX Packages
Presentations/Talks
 PhD defense talk (in german), Darmstadt (October 7th, 2014): Parametrisierte uniforme Komplexität numerischer, geometrischer und topologischer Operatoren im normierten Raum IR^d
 Colloquium Logicum 2014, Munich (September 2014): On Type2 Complexity of some Operators in Geometry, Topology and Analysis

CiE’14 in Budapest, Hungary (June 2014):
Smoothness+\epsilon: Complexity on Gevrey’s Hierarchy  Seminar talk at University of Cape Town, South Africa (May 2014): On Type2 Complexity of Some Operators
 Workshop talk at University of South Africa in Pretoria, South Africa (May 2014): On Type2 Complexity of Some Operators
 Workshop at Nll Shonan, Japan (November 2013):
About Representations of and Operators on Sets  Seminar talk at JAIST, Japan (October 2013):
On Parameterizations in Real Complexity Theory (revised version of the talk I gave in Greifswald)  Workshop in Greifswald, Germany (July 2013):
On Parameterizations in Real Complexity Theory 
CCA’13 in Nancy, France (July 2013):
Parameterized Uniform Complexity in Numerics,
Closed Sets and Operators thereon 
CCC’13 in Gregynog, Wales, UK (June 2013):
Parameterized Uniform Complexity in Numerics 
65. GI Theorietag in Paderborn, Germany (March 2013):
Closed Sets and Operators thereon 
LiCS’12 in Dubrovnik, Croatia (June 2012):
Uniform Polytime Computable Operators on Univariate Real Analytic Functions 
CiE’12 in Cambridge, UK (June 2012):
Parameterized Maximization is SecondOrder Polytime Computable,
SecondOrder Representations and Complexity of Compact Sets 
CCC’12 in Trier, Germany (May 2012):
Parameterized Maximization is SecondOrder Polytime Computable  Workshop in Greifswald, Germany (July 2011):
About Akitoshi Kawamura’s approach on defining a complexity theory for numerical operators 
61. GI Theorietag in Trier, Germany (March 2011):
Approximate Real Function Maximization and Query Complexity  Workshop in Greifswald, Germany (July 2010):
TuringMaschinen: Von IN zu IR
Teaching
 Summer term 2013: Assistent for “Formal Foundations of Computer Science I+II”
 Winter term 2012/13: Assistent for “Mathematics for Chemists”
 Summer term 2012: Assistent for “Linear Algebra II for Physicists”
 Winter term 2011/12: Assistent for “Mathematics for Chemists”
 Summer term 2011: Assistent for “Formal Foundations of Computer Science I+II”