5639 search results - page 224 / 1128 » Timed Abstract Non-interference |
108
click to vote
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k.
103
click to vote
EUROPAR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. With the increasing popularity of large-scale distributed computing networks, a new aspect has to be considered for scheduling problems: machines may not be available per...
107
click to vote
AAECC
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We consider the problem of determining the period of a binary sequence. For sequences with small autocorrelation we prove the existence of a polynomial time quantum algor...
SIGMETRICS
2006
ACM
15 years 9 months ago
2006
ACM
Abstract— We consider a wireless system with multiple channels where each channel is either on or off, and probing the state of any channel incurs a cost. We present a polynomial...
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...