In secure multi-party computation n parties jointly evaluate an n-variate function f in the presence of an adversary which can corrupt up till t parties. All honest parties are req...
Empirical evidence shows the ability for computer technology to deliver on its promises of enhancing our quality of life relies on how well the application fits our understanding ...
This paper describes the development and use of practical examinations which include a significant element of software control of the administrative process. The educational metho...
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...