Sciweavers

1411 search results - page 28 / 283
» Interactive Coding for Interactive Proofs
Sort
View
FSTTCS
1994
Springer
14 years 2 months ago
On the Interactive Complexity of Graph Reliability
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
Jean Marc Couveignes, Juan Francisco Diaz-Frias, M...
SIGCSE
1999
ACM
145views Education» more  SIGCSE 1999»
14 years 3 months ago
Using JFLAP to interact with theorems in automata theory
An automata theory course can be taught in an interactive, hands-on manner using a computer. At Duke we have been using the software tool JFLAP to provide interaction and feedback...
Eric Gramond, Susan H. Rodger
ICS
2010
Tsinghua U.
14 years 8 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
ISWC
2002
IEEE
14 years 3 months ago
Minimal Social Weight User Interactions for Wearable Computers in Business Suits
This paper presents the e-SUIT, a wearable computer incorporated in a traditional business suit. A key feature of the system is an array of input/output devices integrated into th...
Aaron Toney, Barrie Mulley, Bruce H. Thomas, Wayne...
CORR
2007
Springer
103views Education» more  CORR 2007»
13 years 11 months ago
Interactive Small-Step Algorithms I: Axiomatization
Abstract. In earlier work, the Abstract State Machine Thesis — that arbitrary algore behaviorally equivalent to abstract state machines — was established for several classes of...
Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Ben...