Sciweavers

3415 search results - page 472 / 683
» Lower bounds on kernelization
Sort
View
CORR
2007
Springer
47views Education» more  CORR 2007»
15 years 6 months ago
Data Structures for Mergeable Trees
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robe...
DC
2007
15 years 6 months ago
The overhead of consensus failure recovery
Abstract Many reliable distributed systems are consensusbased and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery m...
Partha Dutta, Rachid Guerraoui, Idit Keidar
DM
2007
83views more  DM 2007»
15 years 6 months ago
Codes identifying sets of vertices in random networks
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
Alan M. Frieze, Ryan Martin, Julien Moncel, Mikl&o...
JCT
2006
89views more  JCT 2006»
15 years 6 months ago
Revlex-initial 0/1-polytopes
We introduce revlex-initial 0/1-polytopes as the convex hulls of reverse-lexicographically initial sets of 0/1-vectors. Thus for each n 2d , we consider the 0/1-knapsack polytope ...
Rafael Gillmann, Volker Kaibel
ECCC
2007
69views more  ECCC 2007»
15 years 6 months ago
Testing Symmetric Properties of Distributions
We introduce the notion of a Canonical Tester for a class of properties on distributions, that is, a tester strong and general enough that “a distribution property in the class ...
Paul Valiant