Sciweavers

6978 search results - page 1 / 1396
» On Proofs in System P
Sort
View
ICALP
2010
Springer
13 years 10 months ago
On p-Optimal Proof Systems and Logics for PTIME
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
Yijia Chen, Jörg Flum
ICNP
2002
IEEE
13 years 10 months ago
A Lightweight, Robust P2P System to Handle Flash Crowds
Abstract— Internet flash crowds (a.k.a. hot spots) are a phenomenon that result from a sudden, unpredicted increase in an on-line object’s popularity. Currently, there is no e...
Angelos Stavrou, Dan Rubenstein, Sambit Sahu
IJUFKS
2000
45views more  IJUFKS 2000»
13 years 5 months ago
On Proofs in System P
Simon Parsons, Rachel A. Bourne
CONEXT
2008
ACM
13 years 7 months ago
Maintaining replicas in unstructured P2P systems
Replication is widely used in unstructured peer-to-peer systems to improve search or achieve availability. We identify and solve a subclass of replication problems where each obje...
Christof Leng, Wesley W. Terpstra, Bettina Kemme, ...
ICDCS
2007
IEEE
13 years 12 months ago
Combating Double-Spending Using Cooperative P2P Systems
An electronic cash system allows users to withdraw coins, represented as bit strings, from a bank or broker, and spend those coins anonymously at participating merchants, so that ...
Ivan Osipkov, Eugene Y. Vasserman, Nicholas Hopper...