Centrum Wiskunde & Informatica

SPDZ_{2^k}: Efficient MPC mod 2^k for dishonest majority In Proceedings

R.J.F. Cramer (Ronald), I.B. Damgård (Ivan), D. Escudero (Daniel), P. Scholl (Peter) and C. Xing (Chaoping)

August 2018
Speeding up switch Markov chains for sampling bipartite graphs with given degree sequence In Proceedings

C.J. Carstens (Corrie Jacobien) and P.S. Kleer (Pieter)

August 2018
How long can optimal locally repairable codes be? In Proceedings

V. Guruswami (Venkatesan), C. Xing (Chaoping) and C. Yuan (Chen)

August 2018
New lower bound on the Shannon capacity of C7 from circular graphs Tech Report

S.C. Polak (Sven) and A. Schrijver (Lex)

August 2018
The itinerant list update problem In Proceedings

N.K. Olver (Neil), K. Pruhs (Kirk), K. Schewior (Kevin), R.A. Sitters (René) and L. Stougie (Leen)

August 2018
Tree decomposition methods for the periodic event scheduling problem In Proceedings

I.I. van Heuven van Staereling (Irving)

August 2018
Using SWISH to realise interactive web based tutorials for logic based languages Tech Report

J. Wielemaker (Jan), F. Riguzzi (Fabrizio), R.A. Kowalski (Robert), T. Lager (Torbjörn), F. Sadri (Fariba) and M. Calejo (Miguel)

August 2018
Integrating analytics with relational databases In Proceedings

M. Raasveldt (Mark)

August 2018

Previous

Next