Our current research into programming models for parallel web services composition is targeted at providing mechanisms for obtaining higher throughput for large scale compute and ...
Peter M. Kelly, Paul D. Coddington, Andrew L. Wend...
Dynamic storage allocation (DSA) algorithms play an important role in the modern software engineering paradigms and techniques (such as object oriented programming). Using DSA inc...
Miguel Masmano, Ismael Ripoll, Alfons Crespo, Jorg...
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...