1. Recherche
753 résultats  enregistrer la recherche
...
hal-00350416v1  Communication dans un congrès
Nicolas Caniart, Emmanuel Fleury, Jérôme Leroux, Marc Zeitoun. Accelerating Interpolation-Based Model-Checking
C. R. Ramakrishnan and J. Rehof. 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'08), 2008, Budapest, Hungary. Springer, 4963, pp.428-442, 2008, Lecture Notes in Computer Science. <10.1007/978-3-540-78800-3_32>
hal-00307375v1  Communication dans un congrès
Emmanuel Godard, Yves Métivier. A characterization of families of graphs in which election is possible
Foundations of System Specification and Computation Structures (FoSSaCS) (EATCS best paper award), 2002, Spain. Springer, 2303, pp.159--171, 2002, Lecture notes in computer science
hal-00307380v1  Communication dans un congrès
Cyril Gavoille, Akka Zemmari. The Compactness of Adaptive Routing Tables
$7^$ International Colloquium on Structural Information & Communication Complexity (SIROCCO 2000), 2000, Italy. pp.127-140, 2000
hal-00307382v1  Communication dans un congrès
Cyril Gavoille. Distributed Data Structures: a Survey (invited lecture)
12th International Colloquium on Structural Information & Communication Complexity (SIROCCO), 2005, Mont St-Michel, France. 3499 of Lecture Notes in Computer Science, pp.2, 2005
hal-00307397v1  Communication dans un congrès
Pierre Fraigniaud, Cyril Gavoille. Lower Bounds for Oblivious Single-Packet End-to-End Communication
$17^$ International Symposium on Distributed Computing (DISC), 2003, Italy. 2848 Lecture Notes i, pp.211-223, 2003
hal-00307412v1  Communication dans un congrès
Pascal Ferraro, Christophe Godin. Un algorithme de comparaison d'arborescences non ordonnées appliqué à la comparaison de la structure topologique des plantes
SFC98 : Société Francophone de classification, 1998, Montpellier, France. pp.77--81, 1998
hal-00307450v1  Communication dans un congrès
Yves Métivier, Nasser Saheb-Djahromi. Probabilistic analysis of an election algorithm in a tree
Colloquium on Trees in Algebra and Programming (CAAP), 1994, United Kingdom. Springer, 787, pp.234-245, 1994, Lecture notes in computer science
hal-00307451v1  Communication dans un congrès
Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari. Randomized rendezvous
Colloquium on mathematics and computer science: algorithms, trees, combinatorics and probabilities, 2000, France. Birkhauser Verlag, pp.183-194, 2000, Trends in mathematics
hal-00307510v1  Communication dans un congrès
Vu Duong, Frederic Ferchaud, Cyril Gavoille, Mohamed Mosbah. Reducing Disturbances by Using Absorption Areas
$1^$ International Conference on Research in Air Transportation (ICRAT), 2004, Slovakia. pp.111-115, 2004
hal-00307516v1  Communication dans un congrès
Serge Dulucq, Hélène Touzet. Analysis of tree edit distance algorithms
Combinatorial pattern matching, 14th Annual Symposium, CPM 2003, 2003, Germany. 2676, pp.83--95, 2003
hal-00307555v1  Communication dans un congrès
Philippe Duchon, Maylis Delest. Exploration de paramètres inconnus par des Q-grammaires
FPSAC 99, 1999, Spain. Martinez, Conrado and Noy, Marc and Serra, Oriol, pp.158--167, 1999
hal-00307452v1  Communication dans un congrès
Yves Métivier, Mohamed Mosbah. Workshop on graph computation models
Third International Conference on Graph Transformations, ICGT 2006, 2006, Brazil. Springer, 4178, pp.463-464, 2006, Lecture notes in computer science
hal-00307459v1  Communication dans un congrès
Yves Métivier, Mohamed Mosbah, Rodrigue Ossamy, Afif Sellami. Synchronizers for local computations
International conference on graph transformation (ICGT), 2004, Italy. Springer, 3256, pp.271--286, 2004, Lecture notes in computer science
hal-00307521v1  Communication dans un congrès
Serge Dulucq, Olivier Guibert. Mots de piles, tableaux standard et permutations de Baxter
6th International Conference on Formal Power Series and Algebraic Combinatorics, May 1994, États-Unis. R. Simion, pp.119--128, 1994
hal-00307531v1  Communication dans un congrès
Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel. Could any graph be turned into a small world ?
International Symposium on Distributed Computing (DISC), 2005, France. Pierre Fraigniaud, 3724, pp.511-513, 2005
hal-00307552v1  Communication dans un congrès
Maylis Delest, T. Munzner, David Auber, Jean-Philippe Domenger. Exploring InfoVis Publication History with Tulip
InfoVis 2004, 2004, United States. pp.216.10, 2004
hal-00307595v1  Communication dans un congrès
Nicolas Bonichon, S. Felsner, Mohamed Mosbah. Convex Drawings of 3-Connected Planar Graphs - (Extended Abstract)
Graph Drawing: 12th International Symposium, GD 2004, 2004, United States. 3383, pp.60--70, 2005
hal-00307501v1  Article dans une revue
Jean-François Marckert, Svante Janson. Convergence of Discrete Snakes
Journal of Theoretical Probability, Sprnger, 2005, 18, pp.615-645
hal-00307526v1  Communication dans un congrès
Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer. Random Sampling from {B}oltzmann Principles
Proceedings of the 29th ICALP, 2002, Spain. Widmayer, P. and Triguero, F. and Morales, R. and Hennessy, M. and Eidenbenz, S. and Conejo, R., 2380, pp.501--513, 2002
hal-00307527v1  Communication dans un congrès
Philippe Duchon, Nicolas Hanusse, Sébastien Tixeuil. Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings
Proceedings of DISC'2004, Oct 2004, Netherlands. Guerraoui, Rachid, pp.216--229, 2004
hal-00307539v1  Ouvrage (y compris édition critique et traduction)
A. Don, Lionel Carminati, Jenny Benois-Pineau. Detection of visual dialog scenes in video content based on structural and semantic features
Moncef Gabbouj, pp.électronique, 2005
hal-00307545v1  Communication dans un congrès
B. Derbel, Mohamed Mosbah. A Fully Distributed Linear Time Algorithm for Cluster Network Decomposition
The $16^$ IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS, MIT, 2004, Austria. pp.548-553, 2004
hal-00307546v1  Communication dans un congrès
B. Derbel, Mohamed Mosbah, Akka Zemmari. Fast Distributed Graph Partition and Application (Extended Abstract)
$20^$ IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2006, Greece. pp.électronique, 2006
hal-00307032v1  Communication dans un congrès
A. Bottreau, Yves Métivier. Minor searching, normal forms of graph relabelling: two applications based on enumeration by graph relabelling
International conference on Foundations of System Specification and Computation Structures (FoSSaCS), 1998, Portugal. Springer, 1378, pp.110-124, 1998, Lecture notes in computer science
hal-00307041v1  Article dans une revue
I. Litovsky, Yves Métivier. Computing trees with graph rewriting systems with priorities
Tree Automata and Languages, 1992, pp.115-139
hal-00307046v1  Communication dans un congrès
I. Litovsky, Yves Métivier, W. Zielonka. The power and the limitations of local computations in graphs
International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 1993, Netherlands. Springer, 657, pp.333-345, 1993, Lecture notes in computer science
hal-00307126v1  Communication dans un congrès
Pascal Ochem. A generator of morphisms for infinite words
Proceedings of the Workshop on Words avoidability, complexity and morphisms - Edited by G. Richomme, 2004, Finland. pp.427-441, 2004
...
hal-00307153v1  Communication dans un congrès
Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey Shallit. Avoiding approximate squares
DLT 2007, 2007, Finland. pp.278-289, 2007
hal-00307161v1  Article dans une revue
I. Lesur, J.L. Campbell. The transcriptome of prematurely aging yeast cells is similar to that of telomerase-deficient cells.
Molecular Biology of the Cell, American Society for Cell Biology, 2004, 15, pp.1297-1312
hal-00307173v1  Article dans une revue
J. Lovejoy, K. Ono. Extension of {R}amanujan's congruences for the partition function modulo powers of $5$
journal für die reine und angewandte Mathematik (Crelles Journal), de Gruyter, 2002, 542, pp.123-132

Contact


archive-ouverte@inria.fr