148
Voted
RANDOM
2001
Springer
15 years 10 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
195
Voted
RANDOM
2001
Springer
15 years 10 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
150
click to vote
MFCS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...
198
click to vote
MFCS
2001
Springer
15 years 10 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
119
click to vote
MFCS
2001
Springer
15 years 10 months ago
2001
Springer
We describe a class of simple transitive semiautomata that exhibit full exponential blow-up during deterministic simulation. For arbitrary semiautomata we show that it is PSPACE-c...
128
click to vote
MFCS
2001
Springer
15 years 10 months ago
2001
Springer
We describe an explicit simulation of 2-way nondeterministic automata by 1-way alternating automata with quadratic blow-up. We first describe the construction for automata on fin...
155
click to vote
MFCS
2001
Springer
15 years 10 months ago
2001
Springer
This paper shows that the traces of rational graphs coincide with the context-sensitive languages.
135
click to vote
MFCS
2001
Springer
15 years 10 months ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...