Sciweavers

169 search results - page 24 / 34
» Which Languages Have 4-Round Zero-Knowledge Proofs
Sort
View
133
Voted
COMPSAC
2002
IEEE
15 years 9 months ago
A Toolset for Supporting UML Static and Dynamic Model Checking
The Unified Modeling Language has become widely accepted as a standard in software development. Several tools have been produced to support UML model validation. However, most of...
Wuwei Shen, Kevin J. Compton, James Huggins
ERSHOV
1989
Springer
15 years 8 months ago
Experiments with Implementations of Two Theoretical Constructions
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...
Torben Amtoft Hansen, Thomas Nikolajsen, Jesper La...
151
Voted
AAAI
1996
15 years 6 months ago
Formalizing Narratives Using Nested Circumscription
The representation of narratives of actions and observations is a current issue in Knowledge Representation, where traditional plan-oriented treatments of action seem to fall shor...
Chitta Baral, Alfredo Gabaldon, Alessandro Provett...
133
Voted
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
15 years 11 months ago
Pseudorandom Generators and Typically-Correct Derandomization
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel
151
Voted
LICS
2007
IEEE
15 years 11 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic