We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
In this paper, we present an approach to global transactionmanagementinworkflowenvironments.Thetransaction mechanism is based on the well-known notion of compensation, but extended...
Paul W. P. J. Grefen, Jochem Vonk, Peter M. G. Ape...
Abstract. In dynamic environments like the Web, data sources may change not only their data but also their schemas, their semantics, and their query capabilities.When a mapping is ...
Autocompletion is a widely deployed facility in systems that require user input. Having the system complete a partially typed "word" can save user time and effort. In th...