Author Search Results

Select result number 1
1

How entropy-theorems can show that approximating high-dim Pareto-fronts is too hard

by Teytaud, Olivier
Published 2006
Contributors: “... Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique...”

Get access
Get access

Other/Unknown Material
Select result number 2
2

How entropy-theorems can show that approximating high-dim Pareto-fronts is too hard

by Teytaud, Olivier
Published 2006
Contributors: “... Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique...”

Get access
Get access
Get access

Conference Object
Select result number 3
3

A type checking algorithm for qualified session types

by Giunti, Marco
Published in Electronic Proceedings in Theoretical Computer Science (2011)
Contributors: “... Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique...”

Get access
Get access
Get access
Get access

Conference Object
Select result number 4
4

Solving discrete logarithms on a 170-bit MNT curve by pairing reduction

by Guillevic, Aurore, Morain, François, Thomé, Emmanuel
Published 2016
Contributors: “... Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique...”

Get access
Get access
Get access
Get access

Conference Object