1135 search results - page 211 / 227 » Interactive Problem Solving via Algorithm Visualization |
128
click to vote
TLCA
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we solve an open problem posed in our previous work on asynchronous subtyping [12], extending the method to higher-order session communication and functions. Our syst...
118
click to vote
ACMACE
2006
ACM
15 years 8 months ago
2006
ACM
Massively multiplayer online computer games are played in complex, persistent virtual worlds. Over time, the landscape of these worlds evolves and changes as players create and pe...
125
click to vote
EUROCRYPT
2010
Springer
15 years 5 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
109
click to vote
CN
2011
14 years 9 months ago
2011
In this paper, we take a holistic approach to the protocol architecture design in multihop wireless networks. Our goal is to integrate various protocol layers into a rigorous fram...
108
Voted
CC
2007
Springer
15 years 2 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...