494 articles – 416 references  [version française]
.:. Browse > List by document type > Peer-reviewed conference/proceedings .:.
299 documents ordered by :
1 - 2 - 3 - 4 - 5 - 6 - 7 ... Next Last
fulltext access Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree
Durand-Gasselin A., Habermehl P.
Dans Symposium on Theoretical Aspects of Computer Science - STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), France (2012) [hal-00678190 - version 1]
fulltext access The Denjoy alternative for computable functions
Bienvenu L., Hölzl R., Miller J. S., Nies A.
Dans Symposium on Theoretical Aspects of Computer Science - STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), France (2012) [hal-00678180 - version 1]
fulltext access Forms of Determinism for Automata
Colcombet T.
Dans Symposium on Theoretical Aspects of Computer Science - STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), France (2012) [hal-00678155 - version 1]
fulltext access Low Randomness Rumor Spreading via Hashing
Giakkoupis G., Sauerwald T., Sun H., Woelfel P.
Dans Symposium on Theoretical Aspects of Computer Science - STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), France (2012) [hal-00678212 - version 1]
fulltext access Combinatorial specification of permutation classes
Bassino F., Bouvel M., Pierrot A., Pivoteau C., Rossin D.
Dans Proceedings of FPSAC 2012 (24th International Conference on Formal Power Series and Algebraic Combinatorics) - FPSAC 2012 (24th International Conference on Formal Power Series and Algebraic Combinatorics), Japon (2012) [hal-00685023 - version 1]
fulltext accessible on an other server On the Delone property of (-\beta)-integers
Steiner W.
Dans Proceedings 8th International Conference Words 2011 - WORDS 2011, Tchèque, République (2011) [hal-00647388 - version 1]
Regular Languages of Words over Countable Linear Orderings
Colcombet T., Carton O., Puppis G.
In Language and Automata Theory and Applications - Icalp 2011, Switzerland (2011) [hal-00439263 - version 1]
On the Use of Guards for Logics with Data
Colcombet T., Puppis G., Ley C.
In Mathematical Foundations of Computer Science 2011 - MFCS 2011, Poland (2011) [hal-00638611 - version 1]
fulltext access Probabilistic cellular automata, invariant measures, and perfect sampling
Busic A., Mairesse J., Marcovici I.
Dans Leibniz International Proceedings in Informatics (LIPIcs) series - Symposium on Theoretical Aspects of Computer Science (STACS2011), Allemagne (2011) [hal-00573640 - version 1]
fulltext access Tight bounds for rumor spreading in graphs of a given conductance
Giakkoupis G.
Dans Leibniz International Proceedings in Informatics (LIPIcs) series - Symposium on Theoretical Aspects of Computer Science (STACS2011), Allemagne (2011) [hal-00573638 - version 1]