• Richard Petersens Plads, 322, 012

    2800 Kgs. Lyngby

    Denmark

20092022
If you made any changes in Pure these will be visible here soon.

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2009 2019

26 Downloads (Pure)

Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint

Neumann, F., Pourhassan, M. & Witt, C., 13 Jul 2019, Proceedings of the 2019 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, p. 1506-1514 (GECCO 2019 - Proceedings of the 2019 Genetic and Evolutionary Computation Conference).

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Open Access
File
24 Downloads (Pure)

Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs

Sutton, A. M. & Witt, C., 13 Jul 2019, Proceedings of the 2019 Genetic and Evolutionary Computation Conference. Association for Computing Machinery, p. 1515-1522 (GECCO 2019 - Proceedings of the 2019 Genetic and Evolutionary Computation Conference).

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Open Access
File

Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax

Krejca, M. S. & Witt, C., 2019, (Accepted/In press) In : Theoretical Computer Science. 23 p.

Research output: Contribution to journalJournal articleResearchpeer-review

5 Downloads (Pure)

Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools

Hwang, H-K. & Witt, C., 2019, Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. Association for Computing Machinery, p. 1-12 12 p. (Proceedings of the 15th Acm/sigevo Conference on Foundations of Genetic Algorithms).

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Open Access
File
21 Downloads (Pure)

Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax

Witt, C., 15 Feb 2019, In : Algorithmica. 81, 2, p. 632-667

Research output: Contribution to journalJournal articleResearchpeer-review

Open Access
File

Projects 2011 2022

Compressed Computation on Structured Data

Ettienne, M. B., Bille, P., Gørtz, I. L., Witt, C., Fischer, J. C. & Munro, J. I.

Samfinansieret - Andet

01/05/201514/11/2018

Project: PhD

Algorithms for Compressed Computation

Christiansen, A. R., Bille, P., Gørtz, I. L., Witt, C., Grossi, R. & Puglisi, S. J.

Samfinansieret - Andet

01/11/201413/03/2018

Project: PhD

Bridging the Gap Between Theory and Practice in Nature-inspired algorithms

Gießen, C., Witt, C., Bille, P., Lehre, P. K. & Sudholt, D.

Forskningsrådsfinansiering

01/10/201411/04/2018

Project: PhD