989 search results - page 5 / 198 » Pebbling and Proofs of Work |
129
click to vote
PODC
2011
ACM
14 years 2 months ago
2011
ACM
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
112
click to vote
POPL
2012
ACM
13 years 7 months ago
2012
ACM
Despite recent successes, large-scale proof development within proof assistants remains an arcane art that is extremely timeconsuming. We argue that this can be attributed to two ...
CCS
2011
ACM
13 years 11 months ago
2011
ACM
Cloud storage systems are becoming increasingly popular. A promising technology that keeps their cost down is deduplication, which stores only a single copy of repeating data. Cli...
91
Voted
CHI
2002
ACM
16 years 1 days ago
2002
ACM
Embedded processors are making it possible for common appliances, such as cable boxes, microwaves and fax machines, to provide even more functionality. Unfortunately, as these app...
TAMC
2007
Springer
15 years 5 months ago
2007
Springer
We say that A ≤LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real γ, oracle B can also find patterns on ...