Dr. Markus Maucher

Research interests

  • Boolean functions and networks
  • Randomized algorithms
  • Machine Learning
  • Functional programming
  • Evolutionary algorithms
  • Pseudo-random numbers
  • Information theoretic aspects of algorithmics
  • Heuristics for discrete optimization problems
  • The Satisfiability problem

Publications

  • G. Völkel, M. Maucher, and H. A. Kestler. Group-based ant colony optimization. Proceeding of the fifteenth annual conference on Genetic and evolutionary computation conference, Amsterdam, The Netherlands; 2013. in press.
  • M. Maucher, D. V. Kracht, S. Schober, M. Bossert, and H. A. Kestler. Inferring Boolean functions via higher-order correlations. Computational Statistics, 2012.
  • M. Hopfensitz, C. Müssel, M. Maucher, H.A. Kestler. Attractors in Boolean Networks - A tutorial. Computational Statistics, 2012.
  • C. Müssel, L. Lausser, M. Maucher, H.A. Kestler. Multi-objective parameter selection for classifiers. Journal of Statistical Software 46(5):1-27, 2012.
  • L. Lausser, C. Müssel, M. Maucher, H.A. Kestler. Measuring and visualizing the stability of biomarker selection techniques. Computational Statistics 2011. Online first, doi 10.1007/s00180-011-0284-y.
  • M. Maucher, B. Kracher, M. Kühl, H.A. Kestler. Inferring Boolean network structure via correlation. Bioinformatics 27(11):1529–1536, 2011.
  • M. Hopfensitz, C. Müssel, C. Wawra, M. Maucher, M. Kühl, H. Neumann, H.A. Kestler. Multiscale Binarization of Gene Expression Data For Reconstructing Boolean Networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics 2011. Available online.
  • M. Maucher, U. Schöning, H.A. Kestler. Search heuristics and the influence of non-perfect randomness: examining Genetic Algorithms and Simulated Annealing. Computational Statistics 26(2):303-319, 2011.
  • L. Lausser, C. Müssel, M. Maucher, H.A. Kestler. Feature Reduction and Nearest Neighbours.  In Proceedings of the 34th Annual Conference of the German Classification Society (GfKl), pages 363-370, Springer, 2010.
  • M. Hopfensitz, M. Maucher, H.A. Kestler. Fuzzy Boolean Network Reconstruction. In Proceedings of the 34th Annual Conference of the German Classification Society (GfKl), pages 263-270, Springer, 2010.
  • M. Maucher. On the influence of non-perfect randomness on probabilistic algorithms. Dissertation. October 2009. (Available online)
    Also available as a book:
    On the influence of non-perfect randomness on probabilistic algorithms. Südwestdeutscher Verlag für Hochschulschriften, 2009, ISBN-13:978-3838112312.
  • M. Maucher, U. Schöning, H.A. Kestler. An empirical assessment of local and population based search methods with different degrees of pseudorandomness. Technical Report UIB-2008-07, University of Ulm, June 2008 (pdf).
  • M. Maucher, U. Schöning, H.A. Kestler. On the different notions of pseudorandomness. Technical Report UIB-2008-11, University of Ulm, August 2008 (pdf).
  • B. List, M. Maucher, U. Schöning, R. Schuler. QuickSort from an information-theoretic view. W. Arendt, W. Schleich (eds.), Mathematical analysis of evolution, information, and complexity. Wiley-VCH, Weinheim. 2009.
  • W. Guttmann, M. Maucher: Variations on an Ordering Theme with Constraints, in: Navarro, G., L. Bertossi und Y. Kohayakawa (eds.): 4th IFIP International Conference on Theoretical Computer Science: TCS 2006, pages 77-90, Springer, 2006. (online, slides as pdf)
  • W. Guttmann, M. Maucher. Constrained Ordering. Technical Report UIB-2005-03, University of Ulm, December 2005 (pdf)
  • B. List, M. Maucher, U. Schöning, R. Schuler. Randomized QuickSort and the Entropy of the Random Number Generator. Electronic Colloquium on Computational Complexity, Report No. 59 (2004).

  • B. List, M. Maucher, U. Schöning, R. Schuler. Randomized QuickSort and the Entropy of the Random Source, in: L. Wang (ed.): Computing and Combinatorics, 11th Annual International Conference, August 2005, pages 450-460, Springer, 2005. (pdf)

Function

Scientific Assistant
Academic Advisor

Contact

Room: O27/532
Phone: +49 (0)731 50 24106
Fax: +49 (0)731 50 24102
EMail

Office hours

Every Thursday 11-12 o'clock
or after appointment.