Marc Kaufmann

Orcid: 0000-0001-8489-2058

According to our database1, Marc Kaufmann authored at least 15 papers between 2022 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Hardest Monotone Functions for Evolutionary Algorithms.
SN Comput. Sci., June, 2025

Expanders in Models of Social Networks.
CoRR, June, 2025

Adversarially-Robust Gossip Algorithms for Approximate Quantile and Mean Computations.
CoRR, February, 2025

OneMax Is Not the Easiest Function for Fitness Improvements.
Evol. Comput., 2025

2024
The hitting time of clique factors.
Random Struct. Algorithms, 2024

Balanced Bidirectional Breadth-First Search on Scale-Free Networks.
CoRR, 2024

Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models.
CoRR, 2024

Sublinear Cuts are the Exception in BDF-GIRGs.
CoRR, 2024

Expressivity of Geometric Inhomogeneous Random Graphs - Metric and Non-Metric.
CoRR, 2024

Faster Optimization Through Genetic Drift.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024

Continuations: What Have They Ever Done for Us? (Experience Report).
Proceedings of the 2nd ACM SIGPLAN International Workshop on Functional Software Architecture, 2024

2023
Self-adjusting population sizes for the (1,<i>λ</i>)-EA on monotone functions.
Theor. Comput. Sci., November, 2023

Towards a Development Process for Multi-CPU Distributed Synchronous Software Applications.
Proceedings of the ACM/IEEE International Conference on Model Driven Engineering Languages and Systems, 2023

2022
Projection bias in effort choices.
Games Econ. Behav., 2022

Self-adjusting Population Sizes for the (1, λ )-EA on Monotone Functions.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022


  Loading...