33 search results - page 7 / 7 » A Fast State Reduction Algorithm for Incompletely Specified ... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
CIAC
2000
Springer
13 years 9 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
STOC
2010
ACM
13 years 9 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...