IFIP
1997
Springer
13 years 11 months ago
1997
Springer
We deal with a two-queue model with mixed exhaustive and gated-type K-limited services. This model can achieve various degrees of priority in each queue by varying the value of K....
ICALP
1995
Springer
13 years 11 months ago
1995
Springer
ICALP
1995
Springer
13 years 11 months ago
1995
Springer
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilistic class ZPP(NP). As a consequence we get a deeper collapse of the polynomial-...
ICALP
1995
Springer
13 years 11 months ago
1995
Springer
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) w...
ICALP
1995
Springer
13 years 11 months ago
1995
Springer
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be ef...
ICALP
1995
Springer
13 years 11 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
ICALP
1995
Springer
13 years 11 months ago
1995
Springer
The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the...
ICALP
1995
Springer
13 years 11 months ago
1995
Springer
GI
1995
Springer
13 years 11 months ago
1995
Springer
In the past decade, the programming languages C++, FORTRAN 90 and Oberon-2 allevolved from their ancestors. This invites to reflect upon the suitability ofthese modern programming...
FPLE
1995
13 years 11 months ago
1995