989 search results - page 175 / 198 » Pebbling and Proofs of Work |
172
Voted
SIGCSE
2009
ACM
16 years 23 days ago
2009
ACM
Jeannette Wing’s call for teaching Computational Thinking (CT) as a formative skill on par with reading, writing, and arithmetic places computer science in the category of basic...
182
click to vote
ESOP
2009
Springer
16 years 23 days ago
2009
Springer
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
167
click to vote
DATE
2009
IEEE
16 years 22 days ago
2009
IEEE
—This paper reports on experience gained and lessons learned from an intensive investigation of model-driven engineering methodology and technology for application to high-integr...
161
click to vote
FOCS
2009
IEEE
16 years 22 days ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veri...
177
click to vote
APN
2009
Springer
16 years 17 days ago
2009
Springer
In previous works we defined ν-APNs, an extension of P/T nets with the capability of creating and managing pure names. We proved that, though reachability is undecidable, coverab...