Centrum Wiskunde & Informatica

NP-hard sets are exponentially dense unless coNP C NP/poly In Proceedings

H.M. Buhrman (Harry) and J.M. Hitchcock (John)

January 2008
Randomised Individual Communication Complexity In Proceedings

H.M. Buhrman (Harry), M. Koucký (Michal) and N.K. Vereshchagin (Nikolay Konstantinovich)

January 2008
Asymptotic analysis of Lévy-driven tandem queues Article

Queueing Systems, 60(3-4), 203-226.

P.M.D. Lieshout (Pascal) and M.R.H. Mandjes (Michel)

January 2008
Simulation of a Jackson tandem network using state-dependent importance sampling In Proceedings

D.I. Miretskiy, W.R.W. Scheinhardt (Werner) and M.R.H. Mandjes (Michel)

January 2008
Learning Structure Illuminates Black Boxes: an Introduction into Estimation of Distribution Algorithms Book Chapter

J. Grahl, S. Minner and P.A.N. Bosman (Peter)

January 2008
On a generic class of two-node queueing systems Article

Queueing Systems, 37-63.

I.J.B.F. Adan, M.R.H. Mandjes (Michel), W.R.W. Scheinhardt (Werner) and E. Tzenova

January 2008
Comparison of bandwidth-sharing policies in a linear network In Proceedings

I.M. Verloop (Maaike), U. Ayesta (Urtzi) and S.C. Borst (Sem)

January 2008
On the correlation structure of a Lévy-driven queue Article

Journal of Applied Probability, 45(4), 940-952.

A. Es-Saghouani (Abdelghafour) and M.R.H. Mandjes (Michel)

January 2008

Previous

Next