Sciweavers

4250 search results - page 357 / 850
» Understanding the Requirements on Modelling Techniques
Sort
View
FOCS
1993
IEEE
15 years 11 months ago
A Tight Lower Bound for k-Set Agreement
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M...
ER
2006
Springer
157views Database» more  ER 2006»
15 years 10 months ago
Representing Transitive Propagation in OWL
Transitive propagation along properties can be modelled in various ways in the OWL description logic. Doing so allows existing description logic reasoners based on the tableaux alg...
Julian Seidenberg, Alan L. Rector
EDO
2000
Springer
15 years 10 months ago
Towards Designing Distributed Systems with ConDIL
Abstract Designing and maintaining a distributed system requires consideration of dependencies and invariants in the system's model. This paper suggests expressing distributio...
Felix Bübl
EUROCRYPT
2010
Springer
15 years 7 months ago
On the Impossibility of Three-Move Blind Signature Schemes
We investigate the possibility to prove security of the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model, i.e., without random oracle...
Marc Fischlin, Dominique Schröder
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 5 months ago
Strong direct product theorems for quantum communication and query complexity
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
Alexander A. Sherstov