Sciweavers

5171 search results - page 5 / 1035
» Deterministic Parallel Processing
Sort
View
LICS
2008
IEEE
16 years 7 days ago
On the Expressiveness and Decidability of Higher-Order Process Calculi
In higher-order process calculi the values exchanged in communications may contain processes. A core calculus of higher-order concurrency is studied; it has only the operators nec...
Ivan Lanese, Jorge A. Pérez, Davide Sangior...
STOC
1997
ACM
129views Algorithms» more  STOC 1997»
15 years 10 months ago
Better Bounds for Online Scheduling
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
Susanne Albers
PODC
2004
ACM
15 years 11 months ago
Brief announcement: degree: optimal deterministic routing for P2P systems
Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vi...