.:. Consultation > Liste par discipline > Complexité .:.

62 documents classés par : Date Titre Nom du premier auteur Type de documents Date de dépôt

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

Improved and Generalized Upper Bounds on the Complexity of Policy Iteration Scherrer B. [hal-00829532 - version 2]

On the query complexity of real functionals Férée H., Hoyrup M., Gomaa W. Dans LICS - 28th ACM/IEEE Symposium on Logic in Computer Science (2013) [hal-00773653 - version 1]

Type-based heap and stack space analysis in Java Hainry E., Péchoux R. Rapport technique (2013) [hal-00773141 - version 2]

Synthesis of sup-interpretations: a survey Péchoux R. Theoretical Computer Science (2012) 24 [hal-00744915 - version 1]

Computability of the entropy of one-tape Turing Machines Jeandel E. (01/08/2012) [hal-00785232 - version 1]

A circuit uniformity sharper than DLogTime Bonfante G., Mogbil V. N° rapport interne LIPN[hal-00701420 - version 1]

Complexity Information Flow in a Multi-threaded Imperative Language Marion J.-Y., Péchoux R. (2012) [hal-00684026 - version 1]

The dimension of ergodic random sequences Hoyrup M. Dans STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14 (2012) 567-576 [hal-00678161 - version 1]

Computing the Distance between Piecewise-Linear Bivariate Functions Moroz G., Aronov B. Dans SODA - Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms - 2012 (2012) [inria-00608255 - version 2]

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]