Sciweavers

209 search results - page 14 / 42
» The Computational Complexity of Weak Saddles
Sort
View
PODC
2010
ACM
13 years 11 months ago
Eventually linearizable shared objects
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
Marco Serafini, Dan Dobre, Matthias Majuntke, P&ea...
EUROCRYPT
2005
Springer
14 years 1 months ago
Cryptanalysis of the Hash Functions MD4 and RIPEMD
MD4 is a hash function developed by Rivest in 1990. It serves as the basis for most of the dedicated hash functions such as MD5, SHAx, RIPEMD, and HAVAL. In 1996, Dobbertin showed ...
Xiaoyun Wang, Xuejia Lai, Dengguo Feng, Hui Chen, ...
BMCBI
2008
93views more  BMCBI 2008»
13 years 7 months ago
Homology modelling of protein-protein complexes: a simple method and its possibilities and limitations
Background: Structure-based computational methods are needed to help identify and characterize protein-protein complexes and their function. For individual proteins, the most succ...
Guillaume Launay, Thomas Simonson
PDPTA
2000
13 years 8 months ago
Managing Distributed Systems with Smart Subscriptions
Abstract We describe an event-based, publishand-subscribe system based on using "smart subscriptions" to recognize weakly structured events. We present a hierarchy of sub...
Robert E. Filman, Diana D. Lee
ECCC
2000
75views more  ECCC 2000»
13 years 7 months ago
Deterministic Turing Machines in the Range between Real-Time and Linear-Time
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
Andreas Klein, Martin Kutrib