Centrum Wiskunde & Informatica

Staging the Network: A Discussion about Telecommunications for Performance Magazine Article

P.S. César Garcia (Pablo Santiago)

January 2014
How low can approximate degree and quantum query complexity be for total Boolean functions? Article

Computational Complexity, 23(2), 305-322.

A. Ambainis (Andris) and R.M. de Wolf (Ronald)

January 2014
Modelling risk & uncertainty using accept & reject statements Lecture

E. Quaeghebeur (Erik)

January 2014
Connecting choice functions and sets of desirable gambles Lecture

A. Van Camp (Arthur), G. de Cooman and E. Quaeghebeur (Erik)

January 2014
Exact Reconciliation of undated trees Tech Report

L.J.J. van Iersel (Leo), C. Scornavacca and S.M. Kelk (Steven)

January 2014
Kernelizations for the hybridization number problem on multiple nonbinary trees In Proceedings

L.J.J. van Iersel (Leo), S.M. Kelk (Steven) and C. Scornavacca

January 2014
The agreement problem for unrooted phylogenetic trees is FPT Article

Journal of Graph Algorithms and Applications, 18(3), 385-392.

C. Scornavacca, L.J.J. van Iersel (Leo), S.M. Kelk (Steven) and D. Bryant

January 2014
HTTP must die! Presentation

S. Pemberton (Steven)

January 2014

Previous

Next