Sciweavers

73 search results - page 14 / 15
» An Improved Construction for Universal Re-encryption
Sort
View
112
Voted
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
16 years 2 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
PADS
2003
ACM
15 years 7 months ago
Parallel Network Simulation under Distributed Genesis
We describe two major developments in the General Network Simulation Integration System (Genesis): the support for BGP protocol in large network simulations and distribution of th...
Boleslaw K. Szymanski, Yu Liu, Rashim Gupta
127
Voted
GI
1997
Springer
15 years 5 months ago
Persistent Object Systems: From Technology to Market
Abstract. This text describes how persistent object system technology developed in European basic research is being used by a small German startup software company to realize innov...
Andreas Gawecki, Florian Matthes, Joachim W. Schmi...
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
16 years 2 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
DCC
2006
IEEE
16 years 1 months ago
Compressed Data Structures: Dictionaries and Data-Aware Measures
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Sco...