This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
|
en:group:members:ola [2011/07/06 10:47] osven created |
en:group:members:ola [2018/03/19 09:43] (current) shokroll |
||
|---|---|---|---|
| Line 13: | Line 13: | ||
| /* Here you should write the content of the page (and remove the lorem ipsum placeholder */ | /* Here you should write the content of the page (and remove the lorem ipsum placeholder */ | ||
| - | Lorem ipsum dolor sit amet, consectetur adipisicing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum. | + | Ola Svensson received his M.Sc. degree in Computer Science from the University of Uppsala in May 2005. His major was on theoretical aspects of computer science and in particular algorithms. Ola received his PhD from IDSIA affiliated to the University of Lugano in 2009 for which he worked on approximation algorithms and inapproximability results for combinatorial optimization problems. |
| + | |||
| + | Research interests include: approximation algorithms, combinatorial optimization, computational complexity and scheduling. | ||
| + | |||
| + | |||
| + | [[http://algo.epfl.ch/~osven|personal home page]] | ||
| - | Lorem ipsum dolor sit amet, consectetur adipisicing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum. | ||
| Line 31: | Line 35: | ||
| birthday_dt : 1981-11-15 | birthday_dt : 1981-11-15 | ||
| join_dt : 2011-07-01 | join_dt : 2011-07-01 | ||
| - | left_dt : 2035-12-31 | + | left_dt : 2012-12-31 |
| - | webpage_url : http://giovanni.cangiani.name | + | webpage_url : http://theory.epfl.ch/osven/|Ola Svensson |
| portrait_media : en:group:members:rimg_ola.jpg | portrait_media : en:group:members:rimg_ola.jpg | ||
| avatar_img64 : en:group:members:rimg_ola.jpg | avatar_img64 : en:group:members:rimg_ola.jpg | ||
| Line 39: | Line 43: | ||
| position : Post-Doc | position : Post-Doc | ||
| listgroup : c_svensson | listgroup : c_svensson | ||
| - | status : active | + | state : past |
| table : members | table : members | ||
| + | Summary : Ola Svensson received his M.Sc. degree in Computer Science from the University of Uppsala in May 2005. His major was on theoretical aspects of computer science and in particular algorithms. Ola received his PhD from IDSIA affiliated to the University of Lugano in 2009 for which he worked on approximation algorithms and inapproximability results for combinatorial optimization problems.Research interests include: approximation algorithms, combinatorial optimization, computational complexity and scheduling.He is currently a professor in the Theory Group at EPFL. | ||
| ---- | ---- | ||
| - | |||
| - | |||