default search action
Markus Maucher
Person information
- affiliation: University of Ulm, Institute of Theoretical Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j7]Christoph Müssel, Nensi Ikonomi
, Silke D. Werle
CANTATA - prediction of missing links in Boolean networks using genetic programming. Bioinform. 38(21): 4893-4900 (2022)
2010 – 2019
- 2014
- [j6]Markus Maucher, David Kracht, Steffen Schober, Martin Bossert, Hans A. Kestler
Inferring Boolean functions via higher-order correlations. Comput. Stat. 29(1): 97-115 (2014) - [c7]Gunnar Völkel, Markus Maucher, Christoph Müssel, Uwe Schöning, Hans A. Kestler
Information Theoretic Measures for Ant Colony Optimization. ECDA 2014: 519-530 - [c6]Gunnar Völkel, Markus Maucher, Uwe Schöning, Hans A. Kestler
Ant colony optimization with group learning. GECCO 2014: 57-64 - 2013
- [j5]Martin Hopfensitz, Christoph Müssel, Markus Maucher, Hans A. Kestler
Attractors in Boolean networks: a tutorial. Comput. Stat. 28(1): 19-36 (2013) - [j4]Ludwig Lausser, Christoph Müssel, Markus Maucher, Hans A. Kestler
Measuring and visualizing the stability of biomarker selection techniques. Comput. Stat. 28(1): 51-65 (2013) - [c5]Gunnar Völkel, Markus Maucher, Hans A. Kestler:
Group-based ant colony optimization. GECCO 2013: 121-128 - 2012
- [j3]Martin Hopfensitz, Christoph Müssel, Christian Wawra, Markus Maucher, Michael Kühl, Heiko Neumann, Hans A. Kestler
Multiscale Binarization of Gene Expression Data for Reconstructing Boolean Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 9(2): 487-498 (2012) - 2011
- [j2]Markus Maucher, Barbara Kracher, Michael Kühl, Hans A. Kestler
Inferring Boolean network structure via correlation. Bioinform. 27(11): 1529-1536 (2011) - [j1]Markus Maucher, Uwe Schöning, Hans A. Kestler
Search heuristics and the influence of non-perfect randomness: examining Genetic Algorithms and Simulated Annealing. Comput. Stat. 26(2): 303-319 (2011) - 2010
- [c4]Martin Hopfensitz, Markus Maucher, Hans A. Kestler:
Fuzzy Boolean Network Reconstruction. GfKl 2010: 263-270 - [c3]Ludwig Lausser, Christoph Müssel, Markus Maucher, Hans A. Kestler:
Feature Reduction and Nearest Neighbours. GfKl 2010: 363-370
2000 – 2009
- 2009
- [b1]Markus Maucher:
On the influence of non-perfect randomness on probabilistic algorithms. University of Ulm, Germany, 2009 - 2006
- [c2]Walter Guttmann
Variations on an Ordering Theme with Constraints. IFIP TCS 2006: 77-90 - 2005
- [c1]Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler:
Randomized Quicksort and the Entropy of the Random Source. COCOON 2005: 450-460 - 2004
- [i2]Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler:
Randomized QuickSort and the Entropy of the Random Source. Algebraic Methods in Computational Complexity 2004 - [i1]Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler:
Randomized Quicksort and the Entropy of the Random Number Generator. Electron. Colloquium Comput. Complex. TR04 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: