FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We investigate the feasibility of a variety of cryptographic tasks with imperfect randomness. The kind of imperfect randomness we consider are entropy sources, such as those consi...
165
click to vote
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Orc is a new language for task orchestration, a form of concurrent programming with applications in workflow, business process management, and web service orchestration. ...
138
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
In this work we look back into the proof of the PCP Theorem, with the goal of finding new proofs that are "more combinatorial" and arguably simpler. For that we introduc...
125
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We present an O(lg lg n)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lg n). This is the first major progress on Sleator...
139
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...