Sciweavers

233 search results - page 20 / 47
» Interactive Proofs For Quantum Computations
Sort
View
CIE
2010
Springer
15 years 4 months ago
Focusing in Asynchronous Games
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
Samuel Mimram
JIIS
2008
104views more  JIIS 2008»
14 years 11 months ago
A framework for checking proofs naturally
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...
Masahiko Sato
SPAA
2003
ACM
15 years 5 months ago
A proportionate fair scheduling rule with good worst-case performance
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
Micah Adler, Petra Berenbrink, Tom Friedetzky, Les...
DNA
2004
Springer
15 years 5 months ago
DNA-Based Computation Times
Abstract. Speed of computation and power consumption are the two main parameters of conventional computing devices implemented in microelectronic circuits. As performance of such d...
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Petar...
WECWIS
2005
IEEE
116views ECommerce» more  WECWIS 2005»
15 years 5 months ago
Security and Privacy Using One-Round Zero-Knowledge Proofs
A zero-knowledge proof (ZKP) is an interactive proof that allows a prover to prove the knowledge of a secret to a verifier without revealing it. ZKPs are powerful tools to deal wi...
Sultan Almuhammadi, Clifford Neuman