238
click to vote
MFCS
15 years 11 months ago
1994 Springer 
We introduce in this paper new communication and synchronization constructs which allow deterministic processes, communicating asynchronously via unbounded FIFO bu ers, to cope wi...
169
click to vote
MFCS
15 years 11 months ago
1994 Springer 
We show that the wavefront approach to Voronoi diagrams (a deterministic line sweep algorithm that does not use geometric transform) can be generalized to distance measures more g...
151
click to vote
MFCS
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...
149
click to vote
MFCS
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...
|
Theoretical Computer Science