109 articles – 57 Notices  [english version]
.:. Consultation > Liste par équipe > Combinatoire et Algorithmique .:.
11 documents classés par :

Worst-case optimal exploration of terrains with obstacles
Czyzowicz J., Ilcinkas D., Labourel A., Pelc A.
Information and Computation 225 (2013) 16-28 [hal-00863496 - version 1]
fulltext access Kolmogorov complexity
Durand B., Zvonkine A.
In Kolmogorov's Heritage in Mathematics (2007) 281-299 [hal-00347376 - version 1]
About the termination detection in the asynchronous message passing model
Chalopin J., Godard E., Métivier Y., Tel G.
In Theory and Practice of Computer Science - 33rd International conference on Current trends in theory and practice of computer science (SOFSEM 2007), Czech Republic (2007) [hal-00308126 - version 1]
An efficient message passing algorithm based on Mazurkiewicz s algorithm
Chalopin J., Métivier Y.
Fundamenta Informaticae 80, 1-3 (2007) 221-246 [hal-00308125 - version 1]
Mobile agent algorithms versus message passing algorithms
Chalopin J., Godard E., Métivier Y., Ossamy R.
Dans Principle of distributed systems - 10th International Conference On Principles Of Distributed Systems (OPODIS 2006), France (2006) [hal-00308127 - version 1]
fulltext access A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs
Chalopin J., Métivier Y.
In Mathematical Foundations of Computer Science - International Symposium on Mathematical Foundations of Computer Science (MFCS 2005), Poland (2005) [hal-00308135 - version 1]
fulltext access Election, Naming and Cellular Edge Local Computations
Chalopin J., Métivier Y., Zielonka W.
Dans Graph transformation - International Conference on Graph Transformation (ICGT 2004) (EATCS best paper award), Italie (2004) [hal-00308119 - version 1]
fulltext access Election and Local Computations on Edges
Chalopin J., Métivier Y.
In Foundations of System Specification and Computation Structures - International conference on Foundations of System Specification and Computation Structures (FoSSaCS 2004), Spain (2004) [hal-00308121 - version 1]
A characterization of families of graphs in which election is possible
Godard E., Métivier Y.
In Foundations of Software Science and Computation Structures - Foundations of System Specification and Computation Structures (FoSSaCS) (EATCS best paper award), Spain (2002) [hal-00307375 - version 1]
Termination detection of distributed algorithms
Godard E., Métivier Y., Mosbah M., Sellami A.
In Graph transformation - International conference on graph transformation (ICGT), Spain (2002) [hal-00307374 - version 1]
The power of local computations in graphs with initial knowledge
Godard E., Métivier Y., Muscholl A.
In Graph transformation - Theory and applications of graph transformations, Germany (2000) [hal-00307373 - version 1]