Centrum Wiskunde & Informatica

Complexity analysis of a decentralised graph colouring algorithm Article

Information Processing Letters, 107(2), 60-63.

K. Duffy, N. O'Connell and A. Sapozhnikov (Artem)

January 2008
Modular control of discrete-event systems with coalgebra Article

IEEE Transactions on Automatic Control, 447-460.

J. Komenda and J.H. van Schuppen (Jan)

January 2008
Enhancing the Performance of Maximum-Likelihood Gaussian EDAs Using Anticipated Mean Shift In Proceedings

P.A.N. Bosman (Peter), J. Grahl and D. Thierens (Dirk)

January 2008
Modeling Component Connectors: Synchronisation and Context-Dependency In Proceedings

M.M. Bonsangue (Marcello), M. Izadi (Mohammad) and D.G. Clarke (David)

January 2008
Identifying minimal and dominant solutions for Kummer recursions Article

Mathematics of Computation, 77(264), 2277-2293.

A. Deaño, J. Segura (Javier) and N.M. Temme (Nico)

January 2008
Entangled games are hard to approximate In Proceedings

J. Kempe, H. Kobayashi, K. Matsumoto, B.F. Toner (Ben) and T. Vidick (Thomas)

January 2008
Unique games with entangled provers are easy In Proceedings

J. Kempe, O. Regev (Oded) and B.F. Toner (Ben)

January 2008
State Discrimination With Post-Measurement Information Article

IEEE Transactions on Information Theory, 54(9), 4183-4198.

M.A. Ballester Sanches (Manuel Alberto), S.D.C. Wehner (Stephanie) and A. Winter

January 2008

Previous

Next