4850 search results - page 369 / 970 » Proof and Computation in Geometry |
169
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
156
click to vote
CCS
2009
ACM
16 years 1 months ago
2009
ACM
We introduce HAIL (High-Availability and Integrity Layer), a distributed cryptographic system that allows a set of servers to prove to a client that a stored file is intact and r...
210
click to vote
WOLLIC
2009
Springer
16 years 1 months ago
2009
Springer
Bi-intuitionistic logic is the extension of intuitionistic logic with exclusion, a connective dual to implication. Cut-elimination in biintuitionistic logic is complicated due to t...
163
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
184
click to vote
EUROCRYPT
2007
Springer
16 years 1 months ago
2007
Springer
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...