default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Kaufmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Marc Kaufmann, Maxime Larcher, Johannes Lengler, Oliver Sieberling:
Hardest Monotone Functions for Evolutionary Algorithms. EvoStar 2024: 146-161- [c5]Marc Kaufmann
, Bogdan Popa:
Continuations: What Have They Ever Done for Us? (Experience Report). FUNARCH 2024: 25-30 - [c4]Cella Florescu, Marc Kaufmann, Johannes Lengler, Ulysse Schaller:
Faster Optimization Through Genetic Drift. PPSN (3) 2024: 70-85 - [i9]Benjamin Dayan, Marc Kaufmann, Ulysse Schaller:
Expressivity of Geometric Inhomogeneous Random Graphs - Metric and Non-Metric. CoRR abs/2402.03837 (2024) - [i8]Cella Florescu, Marc Kaufmann, Johannes Lengler, Ulysse Schaller:
Faster Optimization Through Genetic Drift. CoRR abs/2404.12147 (2024) - [i7]Marc Kaufmann, Raghu Raman Ravi, Ulysse Schaller:
Sublinear Cuts are the Exception in BDF-GIRGs. CoRR abs/2405.19369 (2024) - [i6]Marc Kaufmann, Kostas Lakis, Johannes Lengler, Raghu Raman Ravi, Ulysse Schaller, Konstantin Sturm:
Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models. CoRR abs/2408.01268 (2024) - [i5]Marc Kaufmann, Bogdan Popa:
Continuations: What Have They Ever Done for Us? (Experience Report). CoRR abs/2408.17001 (2024) - 2023
- [j2]Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou:
Self-adjusting population sizes for the (1,λ)-EA on monotone functions. Theor. Comput. Sci. 979: 114181 (2023) - [c3]Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou:
OneMax Is Not the Easiest Function for Fitness Improvements. EvoCOP 2023: 162-178 - [c2]Éric Lubat, Eric Jenn, Dominique Blouin, Marc Kaufmann:
Towards a Development Process for Multi-CPU Distributed Synchronous Software Applications. MoDELS (Companion) 2023: 549-558 - [i4]Annika Heckel, Marc Kaufmann, Noëla Müller, Matija Pasch:
The hitting time of clique factors. CoRR abs/2302.08340 (2023) - [i3]Marc Kaufmann, Maxime Larcher, Johannes Lengler, Oliver Sieberling:
Hardest Monotone Functions for Evolutionary Algorithms. CoRR abs/2311.07438 (2023) - 2022
- [j1]Marc Kaufmann:
Projection bias in effort choices. Games Econ. Behav. 135: 368-393 (2022) - [c1]Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou:
Self-adjusting Population Sizes for the (1, λ )-EA on Monotone Functions. PPSN (2) 2022: 569-585 - [i2]Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou:
Self-adjusting Population Sizes for the (1, λ)-EA on Monotone Functions. CoRR abs/2204.00531 (2022) - [i1]Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou:
OneMax is not the Easiest Function for Fitness Improvements. CoRR abs/2204.07017 (2022)
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-10-07 22:12 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:
