Filtrer vos résultats
- 7
- 1
- 4
- 2
- 1
- 1
- 1
- 8
- 1
- 1
- 1
- 2
- 2
- 1
- 1
- 7
- 1
- 6
- 6
- 2
- 1
- 1
- 1
- 1
- 8
- 5
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
8 résultats
|
|
|
triés par
|
|
|
Complexité d'ordre supérieur et analyse récursiveComplexité [cs.CC]. Université de Lorraine, 2014. Français. ⟨NNT : 2014LORR0173⟩
Thèse
tel-01751160v2
|
||
|
|
Probing for Surface Mesh Generation through Delaunay Refinement[Research Report] RR-8123, INRIA. 2012
Rapport
hal-00747344v1
|
||
|
|
On the query complexity of real functionalsLICS - 28th ACM/IEEE Symposium on Logic in Computer Science, Jun 2013, New Orleans, United States. pp.103-112, ⟨10.1109/LICS.2013.15⟩
Communication dans un congrès
hal-00773653v1
|
||
|
|
Characterizing polynomial time complexity of stream programs using interpretationsTheoretical Computer Science, 2015, 585, pp.41-54. ⟨10.1016/j.tcs.2015.03.008⟩
Article dans une revue
hal-01112160v1
|
||
|
|
Analytical properties of resource-bounded real functionalsJournal of Complexity, 2014, 30 (5), pp.33. ⟨10.1016/j.jco.2014.02.008⟩
Article dans une revue
hal-00848482v1
|
||
|
|
Higher-order complexity in analysisCCA - 10th International Conference on Computability and Complexity in Analysis - 2013, Jul 2013, Nancy, France
Communication dans un congrès
hal-00915973v1
|
||
|
|
Interpretation of stream programs: characterizing type 2 polynomial time complexity21st International Symposium on Algorithms and Computation - ISAAC 2010, Dec 2010, Jeju Island, South Korea
Communication dans un congrès
inria-00518381v1
|
||
Formal proof of polynomial-time complexity with quasi-interpretations7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018, Jan 2018, Los Angeles, United States. ⟨10.1145/3167097⟩
Communication dans un congrès
hal-01712390v1
|