We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
Roman Dementiev, Peter Sanders, Dominik Schultes, ...
We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an ...
The development of case studies in selected Portuguese cities and regions which have been engaged in “digital city” projects is considered in this paper in a way to discuss mai...
In this paper, an approach to symbolic model checking of process networks is introduced. It is based on interval decision diagrams (IDDs), a representation of multi-valued functio...
This article discusses the treatment of collocations in the context of a long-term project on the development of multilingual NLP tools. Besides "classical" two-word col...