Sciweavers

1777 search results - page 233 / 356
» Programming Cryptographic Protocols
Sort
View
RSA
2000
170views more  RSA 2000»
13 years 8 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
ARESEC
2011
117views more  ARESEC 2011»
12 years 8 months ago
Non-Parallelizable and Non-Interactive Client Puzzles from Modular Square Roots
—Denial of Service (DoS) attacks aiming to exhaust the resources of a server by overwhelming it with bogus requests have become a serious threat. Especially protocols that rely o...
Yves Igor Jerschow, Martin Mauve
VL
2006
IEEE
104views Visual Languages» more  VL 2006»
14 years 2 months ago
Pair Collaboration in End-User Debugging
The problem of dependability in end-user programming is an emerging area of interest. Pair collaboration in end-user software development may offer a way for end users to debug th...
Thippaya Chintakovid, Susan Wiedenbeck, Margaret M...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 9 months ago
Applying Prolog to Develop Distributed Systems
Development of distributed systems is a difficult task. Declarative programming techniques hold a promising potential for effectively supporting programmer in this challenge. Whil...
Nuno P. Lopes, Juan A. Navarro, Andrey Rybalchenko...
CSUR
1999
114views more  CSUR 1999»
13 years 8 months ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot