535 search results - page 4 / 107 » Checking Computations in Polylogarithmic Time |
SPAA
2010
ACM
13 years 11 months ago
2010
ACM
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
SPAA
2009
ACM
14 years 7 months ago
2009
ACM
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...
STOC
1997
ACM
13 years 11 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
STACS
1997
Springer
13 years 11 months ago
1997
Springer