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

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

1 - 2 - 3 - 4 - 5 - 6 - 7 ...

Path-Based Supports for Hypergraphs Brandes U., Cornelsen S., Pampel B., Sallaberry A. Journal of Discrete Algorithms 14 (2012) 248-261 [hal-00735894 - version 1]

A Survey of Recursive Analysis and Moore's Notion of Real Computation Gomaa W. Natural Computing 11, 1 (2012) 37-49 [hal-00767334 - version 1]

Optimal flux spaces of genome-scale stoichiometric models are determined by a few subnetworks. Kelk S. M., Olivier B. G., Stougie L., Bruggeman F. J. Nature Scientific Reports 2 (2012) 580 [hal-00763439 - version 1]

Natural Computing Bournez O., Dowek G. Springer (Ed.) (2012) 1 [hal-00760732 - version 1]

Type-based complexity analysis for concurrent programs Hainry E., Marion J.-Y., Péchoux R. (2012) [hal-00755450 - version 1]

To Satisfy Impatient Web surfers is Hard Fomin F. V., Giroire F., Jean-Marie A., Mazauric D., Nisse N. Dans 6th International Conference on FUN with Algorithms (FUN) (2012) 166-176 [hal-00704201 - version 1]

Reconfiguration with physical constraints in WDM networks Belhareth S., Coudert D., Mazauric D., Nisse N., Tahiri I. Dans Workshop on New Trends in Optical Networks Survivability (2012) 5 [hal-00704199 - version 1]

Satisfaire un internaute impatient est difficile Fomin F. V., Giroire F., Jean-Marie A., Mazauric D., Nisse N. Dans 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel) (2012) ... [hal-00687102 - version 1]

Good edge-labelling of graphs. Araujo J., Cohen N., Giroire F., Havet F. Discrete Applied Mathematics 160, 18 (2012) 2502-2513 [inria-00639005 - version 1]

Complexité implicite des calculs : interprétation de programmes Bonfante G. Institut National Polytechnique de Lorraine - INPL (09/12/2011), Claude Kirchner (Pr.) [tel-00656766 - version 1]