Sciweavers

2393 search results - page 463 / 479
» Fuzzy-UCS: preliminary results
Sort
View
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 1 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
EUROCRYPT
1990
Springer
15 years 1 months ago
Experimental Quantum Cryptography
We describe results from an apparatus and protocol designed to implement quantum key distribution, by which two users, who share no secret information initially: 1) exchange a ran...
Charles H. Bennett, François Bessette, Gill...
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
15 years 1 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
CHI
2009
ACM
15 years 1 months ago
A comparison of mobile money-transfer UIs for non-literate and semi-literate users
Due to the increasing penetration of mobile phones even into poor communities, mobile payment schemes could bring formal financial services to the "unbanked". However, b...
Indrani Medhi, S. N. Nagasena Gautama, Kentaro Toy...
ISSTA
2010
ACM
15 years 1 months ago
Proving memory safety of floating-point computations by combining static and dynamic program analysis
Whitebox fuzzing is a novel form of security testing based on dynamic symbolic execution and constraint solving. Over the last couple of years, whitebox fuzzers have found many ne...
Patrice Godefroid, Johannes Kinder