4462 articles – 13151 Notices  [english version]
.:. Consultation > Par discipline > Complexité .:.
18 documents classés par :
fulltext access Connected Surveillance Game
Giroire F., Mazauric D., Nisse N., Pérennes S., Pardo Soares R.
Rapport de recherche (2013) 22 [hal-00820271 - version 1]
fulltext access Descriptive complexity for pictures languages
Grandjean E., Olive F.
Dans CSL'2012 - Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France, France (2012) [hal-00779971 - version 1]
fulltext access A logical approach to locality in pictures languages
Grandjean E., Olive F.
Rapport de recherche [hal-00786148 - version 1]
fulltext access Telling convex from reflex allows to map a polygon
Chalopin J., Das S., Disser Y., Mihalák M., Widmayer P.
In Leibniz International Proceedings in Informatics (LIPIcs) series - Symposium on Theoretical Aspects of Computer Science (STACS2011), Germany (2011) [hal-00573618 - version 1]
fulltext access A speed-up of oblivious multi-head finite automata by cellular automata
Borello A., Richard G., Terrier V.
Dans Leibniz International Proceedings in Informatics (LIPIcs) series - Symposium on Theoretical Aspects of Computer Science (STACS2011), Allemagne (2011) [hal-00573599 - version 1]
fulltext access Fixed-point tile sets and their applications
Durand B., Romashchenko A., Shen A.
[hal-00424024 - version 5] (17/09/2010)
fulltext access Topological Dynamics of Cellular Automata: Dimension Matters
Sablik M., Theyssier G.
Theory of Computing Systems (2009) to appear [hal-00339354 - version 2]
fulltext access An Approximation Algorithm for l∞-Fitting Robinson Structures to Distances
Chepoi V., Seston M.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Allemagne (2009) [inria-00359296 - version 1]
Playing with Population Protocols
Bournez O., Chalopin J., Cohen J., Koegler X.
The Complexity of Simple Program, CSP'08, Irlande (2008) [hal-00760951 - version 1]
fulltext access Fixed Point and Aperiodic Tilings
Durand B., Romashchenko A., Shen A.
Dans Developments in Language Theory - 12th International Conference on Developments in Language Theory, Japon (2008) [hal-00256364 - version 5]
fulltext access Pairs of SAT Assignment in Random Boolean Formulae
Daudé H., Mezard M., Mora T., Zecchina R.
Theoretical Computer Science 393 (2008) 260-279 [hal-00005109 - version 3]
fulltext access A compact topology for sand automata
Dennunzio A., Guillon P., Masson B.
[hal-00259945 - version 1] (29/02/2008)
fulltext access Limit complexities revisited
Bienvenu L., Muchnik A., Shen A., Vereshchagin N.
In Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, France (2008) [hal-00218279 - version 1]
fulltext access Finding a Vector Orthogonal to Roughly Half a Collection of Vectors
Charbit P., Jeandel E., Koiran P., Perifel S., Thomassé S.
Journal of Complexity 24 (2008) 39-53 [lirmm-00292703 - version 1]
fulltext access Fusion de bases propositionnelles : une méthode basée sur les R-ensembles
Hue J., Wurbel E., Papini O.
[hal-00189349 - version 1] (20/11/2007)
fulltext access Kolmogorov complexity
Durand B., Zvonkine A.
Dans Kolmogorov's Heritage in Mathematics (2007) 281-299 [hal-00347376 - version 1]
Resource Control for Synchronous Cooperative Threads
Amadio R., Dal Zilio S.
Theoretical Computer Science 358 (2006) (2-3):229-254 [hal-00109277 - version 1]
fulltext access Polynomial Synthesis of Asynchronous Automata
Baudru N., Morin R.
[hal-00005587 - version 1] (25/06/2005)