Dr. rer. nat. Christian Pech Curriculum Vitae - Technische Universität ...

More documents

Recommendations

Info

Supervisor: R. Pöschel Advisors: M. Droste, H. Vogler, H. Reichel 08/2003 Defense of Ph.D. Theses “Kleene Type Results for Weighted Tree Automata.” Overall eveluation “summa cum laude” Other Qualifications Programming skills in C, C++, GAP, Maple. In particular I write (wrote) software for: • the COCO II project (development of a share package for GAP dealing with coherent configurations) (GAP,C,C++), • the enumeration of graphs having prescribed symmetries (GAP,C,C++), • the computation of chromatic polynomials of recursive families of graphs (Maple) • the computation of fusions of flag algebras of families of incidence structures (Maple) • the computation of normalizers of 2-closed permutation groups (GAP, C) Scholarships 1. PhD Scholarship by the German Research Community (DFG) in frames of the graduate program ”Specification of Discrete Processes and Systems of Processes by Operational Models and Logics” at Dresden University of Technology, November 2000 – August 2003 2. Post doc scholarship by the German Research Community (DFG) in frames of the graduate program ”Specification of Discrete Processes and Systems of Processes by Operational Models and Logics” at Dresden University of Technology, September 2003 – August 2005 3. Post doc scholarship at Ben Gurion University of the Negev in Beer Sheva, Israel, October 2007 – Awards December 8, 2004: Georg Helm Price of the TU Dresden for distinguished Master- & Ph.D. Theses 2
Scientific interests Algebraic Combinatorics (coherent configurations, strongly regular graphs, incidence structures, algorithmic methods), Theoretical Computer Science (formal power-series, formal tree-series, weighted automata, weighted tree-automata, co-algebras, categorical methods), Universal Algebra (theory of functional and relational algebras) List of publications Preprints: 1. A. Betten, M. Klin, R. Laue, C. Pech. A computer approach to the enumeration of block designs which are invariant with respect to a prescribed permutation group. Preprint MATH-AL-13-1997, TU-Dresden, 1997. 2. M. Klin, Ch. Pech, P.-H. Zieschang. Flag algebras of block designs. Preprint MATH-AL-10-1998, TU-Dresden, 1998. Refereed articles: 1. F. Fiedler, M. Klin, Ch. Pech. Directed strongly regular graphs as elements of coherent algebras. in: K. Denecke, H.-J. Vogel (Eds.). General Algebra and Discrete Mathematics. Proceedings of the ”Conference on General Algebra and Discrete Mathematics, Potsdam 1998”, Shaker Verlag, Aachen 1999, 69-88. 2. Ch. Pech. Kleene’s Theorem for Weighted Tree-Automata. in: A. Lingas, B.J. Nilsson (Eds.). Fundamentals of Computation Theory. Proceedings of the 14th International Symposium, FCT 2003, Malmö, Sweeden 2003, LNCS 2751, 2003, 387-399. 3. M. Droste, Ch. Pech, H. Vogler. A Kleene Theorem for Weighted Tree Automata. Theory of Computing Systems, 38(1), 2004, 1-38. 4. L. Kwuida, Ch. Pech, H. Reppe. Generalizations of Boolean algebras. An attribute exploration. Math. Slovaca, 56(2), 2006, 145–165. 5. M. Klin, M. Muzychuk, Ch. Pech, A. Woldar and P.-H. Zieschang, Association schemes on 28 points as fusions of a half-homogeneous coherent configuration. European Journal of Combinatorics 28(7), 2007, 1994–2025. Theses: 3
Page 1: Dr. rer. nat. Christian Pech Curric
Page 5 and 6: 6. Workshop “Weighted Automata: T

Dr. rer. nat. Christian Pech Curriculum Vitae - Technische Universität ...

Create successful ePaper yourself

Delete template?

Save as template?