Promotores: H.W. Lenstra, K. Belabas (University of Bordeaux)

This thesis has three main parts. The first part gives an algorithm to compute Hilbert modular polynomials for ordinary abelian varieties with maximal real multiplication. Hilbert modular polynomials of a given level b give a way of finding all of the abelian varieties that are b-isogeneous to any given…

Promotor: H.W. Lenstra

Continuous optimization is never easy: the exact solution is always a luxury demand and the theory of it is not always analytical and elegant.

Promotor: S.M. Verduyn Lunel, Co-Promotores: S.C.Hille, O.W. van Gaans

Promotor: Robert Tijdeman, Co-promotor: Cornelis Kraaikamp

Artificial intelligence algorithms govern in subtle, yet fundamental ways, the way we live and are transforming our societies. The promise of efficient, low‐cost or ‘neutral’ solutions harnessing the potential of big data has led public bodies to adopt algorithmic systems in the provision of public…

Promotor: J.N. Kok, P.E. Slagboom Co-promotor: J.F.J. Laros

Het Algorithms and Software Technology (AST) onderzoeksprogramma voert onderzoek uit op het gebied van algoritme-ontwerp en analyse.

Promotor: R. Tijdeman, Co-promotor: H.J.J. te Riele

Promotor: Prof.dr. J.N. Kok, Co-Promotor: W.A. Kosters

Promotor: Prof.dr. J.P. Abrahams, Prof.dr. M. van Heel

With tomography it is possible to reconstruct the interior of an object without destroying.

Systems are called real-time systems, if the correctness of the system does not only depend on the correctness of the system output but also on whether the output is delivered on time.

Multi-objective evolutionary computation aims to find high quality (Pareto optimal) solutions that represent the trade-off between multiple objectives.

Promotor: Peter Stevenhagen

Modern optimization algorithms offer solutions for architectural decisions like spatial, structural and energy efficiency. A young computer scientist from Leiden University co-authored a paper that won the Best Paper Award at a leading conference in Krakow during the summer.

Mining time series is a machine learning subfield that focuses on a particular data structure, where variables are measured over (short or long) periods of time.

Promotor: F.S. de Boer, Co-promotor: M.M. Bonsangue

Op 28 juni 2018 verdedigde Qiuyin Hu zijn proefschrift 'Regulating Working Conditions in Times of Globalization'. Het promotieonderzoek is begeleid door promotoren prof.dr. G.J.J. Heerma van Voss en prof. dr. B. Barentsen.

Promotor: H.J. van den Herik, B.R. Katzy, Co-promotor: K. Sailer

Nout Wellink sprak over de rol van de centrale bank in het huidige roerige financiële klimaat. Daarbij gaat hij ook in op de gewijzigde kapitaaleisen die voor banken gelden.

Promotor: R. Verpoorte, Co-promotores: Y.H.Choi, N.R. Mustafa

Promotor: S.J. Edixhoven, Co-promotor: R.S. de Jong

Promotor: S.M. Verduyn Lunel

In my research, we developed a method to distinguish knots. A knot is a mathematical depiction of the everyday knot that occurs in ropes and cords.

Promotores: Prof.dr. J. Zaanen, Prof.dr. K.E. Schalm

Promotor: A.P.IJzerman, Co-Promotor: L.H. Heitman

We investigate the buildup of galaxies from various vantage points. The first two chapters focus on the stellar content of galaxies, especially the distribution of stellar masses at birth and potential variations therein in various galactic environments.

This thesis focuses on the study of transient and variable radio sources in the universe.

Team Syntax Error, met Bas Nieuwenhuizen, Mathijs van de Nes, Niels ten Dijke, alle drie masterstudenten Computer Science, heeft de Benelux Algorithm Programming Contest gewonnen en heeft zich daarmee geplaatst voor de Northwestern European Regional Contest in Zweden, op 29 en 30 november.

Het Hazelhoff Centre for Financial Law onderzoeksprogramma voor 2020-20203 draait om de integriteit van financiële markten in tijden van crisis en de mogelijke manieren om deze integriteit te bewerkstelligen.

This thesis addresses the problem of designing performance and energy efficient embedded streaming systems, that is, systems which process a stream of input data coming from the environment and generate a stream of output data going into the environment.

Promotores: Prof.dr. T.H.W. Bäck, Prof.dr. M. Bongards (Cologne University)

De Benelux Algorithm Programming Contest 2010 (een van de voorronden van de ACM International Collegiate Programming Contest) vindt a.s. zaterdag 23 oktober plaats in studentencentrum Plexus te Leiden. Deze programmeerwedstrijd wordt georganiseerd door de Leidsche Flesch, de studievereniging van Informatica/Wiskunde/Natuurkunde/Sterrenkunde…

Het Leidse team 'Geen Syntax', bestaande uit Bas Nieuwenhuizen, Mathijs van de Nes en Raymond van Bommel, heeft in Utrecht de Benelux Algorithm Programming Contest (BAPC) 2013 gewonnen.

Promotor: S.M. Verduyn Lunel

Promotor: J. N. Kok, Co-promotor: A. J. Knobbe

Met het SAPPAO-project willen we de voorspelling van geplande vluchten nauwkeuriger en betrouwbaarder maken. De volledige naam van het project is ‘A Systems Approach towards Data Mining and Prediction in Airlines Operations’.

Promotores: J.N. Kok, H.J. Hoogeboom

Promotoren: R. Tijdeman, A.K. Lenstra, Co-promotor: H.J.J. te Riele

Promotor: S.J. Edixhoven

Promotie

Promoter: Ed F. Deprettere, Co-promoter: Todor P. Stefanov

Promotor: H.W. Lenstra

Het Leidse team 'Geen Syntax', bestaande uit Bas Nieuwenhuizen, Mathijs van de Nes en Raymond van Bommel, heeft in Utrecht de Benelux Algorithm Programming Contest (BAPC) 2013 gewonnen. Deze Leidse studenten wiskunde en informatica losten de 10 opgaven een uur sneller op dan alle andere teams.

Promotor: Prof.dr. K.H. Kuijken, Co-Promotor: H.Hoekstra

Drug-target binding kinetics determine the time course of the central event in pharmacotherapy: Drug-target interaction.

My PhD project studies how the temporally sequential Hox gene expression is regulated during head-tail patterning of the frog embryo.