Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800: envíos recientes
Mostrando ítems 381-400 de 1776
-
Approximation bounds for Black Hole Search problems
(Networks. vol. 52, n° 4, pp. 216--226, 2008-12)Article de revue -
A randomized algorithm for the joining protocol in dynamic distributed networks
(Theoretical Computer Science. vol. 406, n° 3, pp. 248--262, 2008-10)Article de revue -
On the Complexity of Bandwidth Allocation in Radio Networks
(Theoretical Computer Science. vol. 406, n° 3, pp. 225--239, 2008-10)Article de revue -
On the Complexity of Distributed Graph Coloring with Local Minimality Constraints
(Networks. vol. 54, n° 1, pp. 12--19, 2009-08)Article de revue -
From Balls and Bins to Points and Vertices
(Algorithmic Operations Research. vol. 4, n° 2, pp. 133--143, 2009)Article de revue -
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring
Communication dans un congrès -
Energy Consumption Minimization in Ad Hoc Wireless and Multi-Interface Networks
(Springer-Verlag, 2010)Chapitre d'ouvrage -
Data Gathering in Wireless Networks
(Springer-Verlag, 2010)Chapitre d'ouvrage -
Dissemination of Information in Optical Networks
(Springer-Verlag, 2008)Ouvrage -
On the Locality of Distributed Sparse Spanner Construction
Communication dans un congrès -
The impact of platform models on scheduling techniques
(Taylor and Francis, 2009)Chapitre d'ouvrage -
Steady-State Scheduling
(Taylor and Francis, 2009)Chapitre d'ouvrage -
Autowrite: A Tool for Term Rewrite Systems and Tree Automata
Communication dans un congrès -
Autowrite: A Tool for Checking Properties of Term Rewriting Systems
Communication dans un congrès -
On the Modularity of Deciding Call-by-Need
Communication dans un congrès -
Implementation and Evaluation of Shared-Memory Communication and Synchronization Operations in MPICH2 using the Nemesis Communication Subsystem
(Parallel Computing. vol. 33, n° 9, pp. 634-644, 2007-09)Article de revue -
Decidable Call by Need Computations in Term Rewriting
Communication dans un congrès -
Constructor Equivalent Term Rewriting Systems are Strongly Sequential: a direct proof
(Information Processing Letters. vol. 52, pp. 137--145, 1994)Article de revue -
Constructor Equivalent Term Rewriting Systems
(Information Processing Letters. vol. 47, pp. 131--137, 1993)Article de revue -
Bounded, Strongly Sequential and Forward-branching Term Rewriting Systems
(Journal of Symbolic Computation. vol. 18, pp. 319--352, 1994)Article de revue