Sciweavers

382 search results - page 10 / 77
» Proof Theory for Distributed Knowledge
Sort
View
VLDB
1989
ACM
44views Database» more  VLDB 1989»
13 years 11 months ago
Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase
In this paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi se...
Weimin Du, Ahmed K. Elmagarmid
CORR
2002
Springer
96views Education» more  CORR 2002»
13 years 7 months ago
A computer scientist looks at game theory
I consider issues in distributed computation that should be of relevance to game theory. In particular, I focus on (a) representing knowledge and uncertainty, (b) dealing with fai...
Joseph Y. Halpern
ICS
2010
Tsinghua U.
14 years 4 months ago
Proof-Carrying Data and Hearsay Arguments from Signature Cards
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
Alessandro Chiesa, Eran Tromer
ALGORITHMICA
2002
104views more  ALGORITHMICA 2002»
13 years 7 months ago
Security of Quantum Key Distribution against All Collective Attacks
Security of quantum key distribution against sophisticated attacks is among the most important issues in quantum information theory. In this work we prove security against a very ...
Eli Biham, Michel Boyer, Gilles Brassard, Jeroen v...
AI
2007
Springer
13 years 7 months ago
Conservation principles and action schemes in the synthesis of geometric concepts
In this paper a theory for the synthesis of geometric concepts is presented. The theory is focused on a constructive process that synthesizes a function in the geometric domain re...
Luis Alberto Pineda