Sciweavers

2043 search results - page 298 / 409
» Some Basics on Tolerances
Sort
View
FSE
1993
Springer
89views Cryptology» more  FSE 1993»
15 years 10 months ago
Parallel FFT-Hashing
Parallel FFT-Hashing was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a m...
Claus-Peter Schnorr, Serge Vaudenay
AC
1992
Springer
15 years 10 months ago
Logic and Databases
Logic and databases have gone a long way together since the advent of relational databases. Already the rst basic query languages for relational databases beside relational algebra...
Johann Eder
ISKI
1994
15 years 10 months ago
Evolution towards, in, and beyond Object Databases
There is a manifold of meanings we could associate with the term \evolution" in the database arena. This paper tries to categorize some of these into a unique framework, showi...
Marc H. Scholl, Markus Tresch
MAAMAW
1993
Springer
15 years 10 months ago
Coalition Formation Among Autonomous Agents: Strategies and Complexity
Autonomous agents are designed to reach goals that were pre-de ned by their operators. An important way to execute tasks and to maximize payo is to share resources and to cooperate...
Onn Shehory, Sarit Kraus
PODC
1993
ACM
15 years 10 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld