.:. Browse > Domain list > Computational Complexity .:.

213 documents ordered by : Date Title first author name document type Submit date

... 3 - 4 - 5 - 6 - 7 - 8 - 9 ...

To Satisfy Impatient Web surfers is Hard Fomin F., Giroire F., Jean-Marie A., Mazauric D., Nisse N. N° RR-7740 (2011) [inria-00625703 - version 2]

Multi-Agent Electro-Location and the Among Constraint Chabert G., Boyer F., Demassey S. N° RR-7640 (2011) [inria-00598712 - version 1]

Tight Analysis of Relaxed Multi-Organization Scheduling Algorithms Cordeiro D., Dutot P.-F., Mounié G., Trystram D. Dans 25th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2011) (2011) [inria-00592174 - version 1]

Weighted Improper Colouring Araujo J., Bermond J.-C., Giroire F., Havet F., Mazauric D., Modrzejewski R. N° RR-7590 (2011) [inria-00583036 - version 4]

Probabilistic cellular automata, invariant measures, and perfect sampling Busic A., Mairesse J., Marcovici I. Dans Symposium on Theoretical Aspects of Computer Science (STACS2011) 9 (2011) 296-307 [hal-00573640 - version 1]

Automata based verification over linearly ordered data domains Segoufin L., Toruńczyk S. Dans Symposium on Theoretical Aspects of Computer Science (STACS2011) 9 (2011) 81-92 [hal-00573615 - version 1]

Unary negation Ten Cate B., Segoufin L. Dans Symposium on Theoretical Aspects of Computer Science (STACS2011) 9 (2011) 344-355 [hal-00573634 - version 1]

Bottom-up automata on data trees and vertical XPath Figueira D., Segoufin L. Dans Symposium on Theoretical Aspects of Computer Science (STACS2011) 9 (2011) 93-104 [hal-00573596 - version 1]

On the Number of Binary-Minded Individuals Required To Compute $\sqrt\frac12$ Bournez O., Aupy G. Theoretical Computer Science 411, 22 (2011) 2262--2267 [hal-00760928 - version 1]

Reconfiguration with physical constraints in WDM networks Belhareth S., Coudert D., Mazauric D., Nisse N., Tahiri I. N° RR-7850 (2011) [hal-00654111 - version 1]