1331 search results - page 186 / 267 » Complexity bounds for zero-test algorithms |
115
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
133
click to vote
EMSOFT
2004
Springer
15 years 8 months ago
2004
Springer
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
138
click to vote
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
154
click to vote
PODC
2011
ACM
14 years 6 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
117
click to vote
CP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...