154
click to vote
STACS
15 years 8 months ago
2005 Springer 
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
143
click to vote
STACS
15 years 8 months ago
2005 Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
111
click to vote
STACS
15 years 8 months ago
2005 Springer 
We introduce and study Recursive Markov Chains (RMCs), which extend ordinary finite state Markov chains with the ability to invoke other Markov chains in a potentially recursive m...
131
click to vote
STACS
15 years 8 months ago
2005 Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
103
click to vote
STACS
15 years 8 months ago
2005 Springer 
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
|
Theoretical Computer Science