13306 search results - page 424 / 2662 » Theoretical Computer Science |
142
click to vote
MFCS
1993
Springer
15 years 11 months ago
1993
Springer
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...
133
click to vote
MFCS
1993
Springer
15 years 11 months ago
1993
Springer
Abstract This paper offers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models...
138
click to vote
MFCS
1994
Springer
15 years 11 months ago
1994
Springer
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present re...
133
click to vote
MFCS
1994
Springer
15 years 11 months ago
1994
Springer
We introduce the notion of empty alternation by investigating alternating automata which are restricted to empty their storage except for a logarithmically space-bounded tape befor...
188
click to vote
FOCS
1992
IEEE
15 years 11 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...