We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
The aim of P2P computing is to build virtual computing systems dedicated to large-scale computational problems. JXTA1 proposes an underlying infrastructure on which JNGI2 , one of...
In self-adaptive systems, metadata about resources in the system (e.g., services, nodes) must be dynamically published, updated, and removed. Current middleware approaches use sta...
Peer-to-Peer (P2P) computing has become a popular application model because of its easy resource sharing pattern and powerful query search scheme. However, decentralized P2P archi...
Jinsong Han, Yunhao Liu, Li Xiao, Renyi Xiao, Lion...