140 search results - page 14 / 28 » ipl 2008 |
IPL
2007
15 years 1 months ago
2007
We present a simple, efficient, and self-contained construction of a wait-free regular register from Byzantine storage components. Our construction utilizes a novel building block...
IPL
2007
15 years 1 months ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
IPL
2007
15 years 1 months ago
2007
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
158
click to vote
IPL
2007
15 years 1 months ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
105
click to vote
IPL
2007
15 years 1 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...