Sciweavers

1497 search results - page 131 / 300
» A Computational Model for Message Passing
Sort
View
PLDI
2012
ACM
11 years 10 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
SACRYPT
1998
Springer
14 years 16 days ago
Computational Alternatives to Random Number Generators
In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accident...
David M'Raïhi, David Naccache, David Pointche...
CN
2007
115views more  CN 2007»
13 years 8 months ago
Energy-aware QoS for application sessions across multiple protocol domains in mobile computing
The proliferation of heterogeneous devices and diverse networking technologies demands flexible models to guarantee the quality-of-service(QoS) at the application session level, ...
Hanping Lufei, Weisong Shi
HICSS
1997
IEEE
109views Biometrics» more  HICSS 1997»
14 years 16 days ago
Performance Evaluation of a C++ Library Based Multithreaded System
One model of multithreading gaining popularity on multiprocessor systems is the message-driven model of computation. The message-driven model is a reactive model in which an arriv...
John G. Holm, Steven Parkes, Prithviraj Banerjee
EUROCRYPT
2008
Springer
13 years 10 months ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky