Version française - Deutsche Version - Русская Версия
安卓green
Assistant professor at University of Alaska Anchorage (UAA).
Maître de conférences habilité en disponiblité in the PEQUAN project at the SurfVIP破解版 lab of Sorbonne University.
Before that, Software Engineer for Intel Corporation, member of the Numerics team.
Former Ph.D. student under
SurfVIP破解版, in the Arénaire project, at
LIP.
Married, one little daughter, one little son.
Research interests:
The subject of my Ph.D. thesis has been the correct rounding of
elementary functions, such as exp(x), log(x), sin(x), asin(x), green加速器官网下载,
in IEEE 754 double precision.
SGreen浏览器官方网站-免费科学加速:SGreen浏览器官网提供新一代基于全新Shadowsocks & VNP架构科学加速浏览器，流畅访问Google、YouTube、Facebook、Twitter等各种热门网站，为用户带来更轻、更快、更安全的浏览体验
- theoretical issues as the
table maker's dilemma,
- applicational problems like the computation and the proof of approximation error bounds or like the testing of
极光加速器安卓,
- challenges like certifiying the behaviour of 100 lines of floating-point code or
- difficulties in the (automatized) efficient implementation on current hardware.
I participated on the revision of the IEEE 754 standard that reigns
floating-point arithmetic. With green加速器极光版 and
green加速器极光版破解, I proposed the following
reformulation of the chapter on
elementary functions. The proposal can be found
here. A second remark on the draft version 1.6.0 of january 10, 2008 can be
found here.
I have done research on how the implementation and certification of
a mathematical function can be automatized. Starting from this, I have been interested
on safe algorithms for some high-level computation problems. As an example,
let me mention the computation of the infinity norm
of a composite function. Here, computation means giving an under- and, more important, an over-estimate of the
unknown supremum of the function. The function itself is given as an expression tree. Its leaves are basic functions or
"black-box" codes. Of course, the multi-precision evaluation of such a tree in a point or small interval is an important sub-problem.
This yields directly to questions on how intermediate precision must be adapted for ensuring a faithful rounding...
I have integrated those algorithms in the software tool Sollya. Sollya is intended as a safe support for the development of elementary functions. I used then Sollya for my Metalibm project, striving to an automatic implementer for mathematical (libm) functions.
In the recent years, for my research published e.g. with
my Habilitation à
Diriger des Recherches, I investigated means to implement and,
in particular, extend the typical IEEE754 floating-point environment
with respect to several dimensions, such as:
- implementation of the IEEE754 heterogeneous operations without special hardware by reusing Ziv's rounding test,
- providing implementations for correctly rounded IEEE754 decimal-character-to-binary-floating-point conversions with O(1) bounded memory consumption and O(n) time complexity,
- providing proven implementations in both floating-point and integer arithmetic to implement the so-called IEEE754-2019 augmented operations,
- extending IEEE754 by providing exact, i.e. error-free, comparisons between binary and decimal floating-point formats,
- extending IEEE754 by providing general-purpose mixed-radix arithmetical operations working on any combination of binary and decimal floating-point inputs and outputs,
- 迅游国际网游加速器 - xunyou.com:迅游网游加速器是最专业的国际网游加速器!有效解决玩家在玩绝地大逃杀美服等服务器玩网络游戏时遇到的延时过高,登录困难,容易掉线等问题,迅游国际网游加速器为网游保驾护航!
- extending the floating-point environment with code generation for mathematical functions, including functions for which no reference implementation is available,
- extending the floating-point environment with high-level, multi-precision operations with a priori error bounds, such as the WCPG measure for LTI filters.
Short curriculum vitae:
- Born April, 24 1980 in Amberg, Germany
- Bavarian A-levels 1999, specialization in Mathematics and French.
- Start of the studies at Technische Universität München in 2000
- Year Erasmus at École Normale Supérieure de Lyon 2002
- Internship in the 天行破解版无限免费 2003
- Diploma in Computer Science (Master's) at Technische Universität München 2005
- Ph.D. thesis in the Arénaire team at 热血冰球下载- 全方位下载:2021-8-3 · 热血冰球中文版是一款简单的冰球题材的体育竞技类的手机游戏，冰球运动在世界各地都收到许多人的喜爱，冰球世界杯更是冰球迷们最喜欢的赛事，许多球技精湛的球员也都变成了人们追捧的球星。 2005-2008
- Software Engineer for green加速器极光版破解 in the Numerics Group 2008-2010
- Maître de Conférences at Sorbonne University since 2010
- Assistant Professor at University of Alaska Anchorage (UAA) since 2018
Ph.D. students and interns I work with or I used to work with:
- Olga Kupriianova who defended her Ph.D. on a Modern Floating-Point Environment
- Anastasiia Volkova who defended her Ph.D. on automatic implementation of digital signal filters
- Clothilde Jeangoudoux who defended her Ph.D. on numerical validation aspects in aeronautics
Publications:
Articles in international journals:
- Arithmetic approaches for rigorous design of Fixed-Point LTI filters,
with Thibault Hilaire,
and Anastasiia Volkova, in IEEE Transactions on Computers, 2019.
- MPDI: A Decimal Multiple-Precision Interval Arithmetic Library,
with Stef Graillat and Clothilde Jeangoudoux, in Reliable Computing Journal, vol. 25, 2017.
- Comparison between binary and decimal floating-point
numbers,
with Nicolas
Brisebarre, Marc
Mezzarobba
and Jean-Michel
Muller, in IEEE Transactions on Computers, vol. 65, number 7, July 2016.
- 飞猪IP-高匿独享代理ip-一键修改免费切换ip软件【官方网站】:2 天前 · 飞猪ip，可能是东半球第二好的修改IP地址神器，能一键轻松更换国内200多个地区的IP，有行业质量最好的IP池，拥有独享高速带宽线路，实测速度可达到20兆以上，能带来更加好的体验，可免费试用。,
with Stef Graillat, Ping Tak Peter Tang, Naoya Yamanaka
and Shin'ichi Oishi, in ACM Transactions on Mathematical Software, vol. 41, number 4, October 2015.
- On Ziv's rounding test,
with Florent de Dinechin,
Jean-Michel
Muller
and Serge
Torres, in ACM Transactions on Mathematical Software, vol. 39,
number 4, 2013; Preprint in research report ensl-00693317,
LIP, CNRS/ENS Lyon/INRIA/Université de Lyon, LIP6, PEQUAN, UPMC
Paris 6, May 2012.
- Efficient and accurate computation of upper bounds of approximation errors,
with Sylvain Chevillard,
John Harrison and Mioara
Joldeş, in Theoretical Computer Science, vol. 412, issue 16, pages 1523-1543, 2011, Final version; Preprint
in research report 2010-2, LIP, École Normale Supérieure de
Lyon, July 2010.
- Certifying the floating-point implementation of an
elementary function using Gappa,
with Florent
de Dinechin
and Guillaume
Melquiond, in IEEE Transactions on Computers, vol. 60, number 2, pages 242-253, 2011, Final version; Preprint
in research report INRIA inria-00533968, November 2010.
- 2021最新极限加速器破解版可加速多种平台上千游戏-夜河资源网:2021-3-29 · 智能加速 极限加速器疾风加速引擎，采用人工 智能算法精选路径数千节点无需选择 一次点击轻松开启全区服加速 稳定急速 极限加速器采用SDN网络加速服务拥有 全球超过1000+节点覆盖，即使在网络 高峰时段也能拥有稳定的加速效果 专项优化 针对P2P、FPS、RPG、MOBA等不同 的主流游戏类 …,
with Jean-Michel Muller,
Peter Kornerup,
greenⅴpn安卓版 and
Nicolas
Louvet, in ACM Transactions on Mathematical Software, Vol. 37,
No. 1, Article 4, January 2010,
Preprint
in research report 2008-15, LIP, École Normale Supérieure de
Lyon, May 2008.
- An efficient rounding boundary test for pow(x,y) in double
precision, with Vincent
Lefèvre, in IEEE Transactions on Computers, 2009, vol. 58, 2, pages 197-207, February 2009.
Preprint
in research report 2007-36, LIP, École Normale Supérieure de
Lyon, August 2007.
- Fast and correctly rounded logarithms in double-precision,
with greenⅴpn安卓版
and 安卓Green极光版, in
RAIRO, Theoretical Informatics and Applications, 2007, vol. 41, pages 85-102,
green加速器极光版
in research report 2005-37, LIP, École Normale Supérieure de
Lyon, September 2005.
Articles in the proceedings of international conferences:
- A Framework for Semi-Automatic Precision and Accuracy Analysis for Fast and Rigorous Deep Learning,
with Anastasiia Volkova, in Proceedings of the 27th IEEE Symposium on
Computer Arithmetic, Online due to Covid-19, USA.
- Precision Adaptation for Fast and Accurate Polynomial Evaluation Generation,
with Nicolas Brunie and Guillaume Revy, in Proceedings of the 2019 IEEE 30th International Conference on Application-specific Systems, New York, NY, USA.
- Rigorous Polynomial Approximation,
in Proceedings of
the 2018 Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA, 2018.
- A correctly rounded mixed-radix fused-multiply-add,
with Clothilde Jeangoudoux, in Proceedings of the 2018 IEEE 25th SYMPOSIUM on Computer Arithmetic, Amherst, MA, USA, July 2018.
- Why Taylor models and modified Taylor models are empirically successful: a symmetry-based explanation,
with Mioara
Joldeş, green加速器极光版破解, Olga Kosheleva and Vladik Kreinovich, in Proceedings of the 8th International Workshop on Reliable Engineering Computing REC'2018, July 2018.
- A parallel compensated Horner scheme,
with Stef Graillat, Youness Ibrahimy and 免费翻国外墙的app, in Proceedings of CSE 2017, SIAM Conference on Computational Science and Engineering (CSE), 2017.
- An efficient software implementation of correctly rounded operations extending FMA: a + b + c and a * b + c * d,
in Proceedings of
the 2017 Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA, 2017.
- Rigorous determination of recursive filter fixed-point implementation with input signal frequency specifications,
with Anastasiia Volkova, 极光加速器安卓 and Marc Mezzarobba,
in Proceedings of
the 2017 Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA, 2017.
- Reliable verification of digital implemented filters against frequency specifications,
with Anastasiia Volkova and Thibault Hilaire,
in Proceedings of
the 2017 IEEE 24th SYMPOSIUM on Computer Arithmetic, London, UK, July 2017.
- A new Open-Source SIMD Vector Libm Fully Implemented With High Level Scalar C,
in Proceedings of
the 2016 Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA, 2016.
- MPDI: A Decimal Multiple-Precision Interval Arithmetic Library,
with Stef Graillat and Clothilde Jeangoudoux, in Proceedings of SCAN 2016, Uppsala, Sweden, 2016.
- Easing Development of Precision-Sensitive Applications with a Beyond-Quad-Precision Library,
in Proceedings of
the 2015 Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA, 2015.
- Determining Fixed-Point Formats for a Digital Filter Implementation using the Worst-Case Peak Gain Measure,
with Anastasiia Volkova and Thibault Hilaire,
in Proceedings of
the 火箭加速器电脑版|火箭加速器pc版下载 v1.1.4官方版 - 多多 ...:2021-5-17 · 火箭加速器电脑版是手机加速软件“火箭加速器app”的桌面pc版本，由安卓模拟器而生成，简单的一键直连，任何小白用户都能快速使用，加上支持多个线路自由切换，以及通过端到端的加密链路，可以有效保证数据传输过程中的安全，是用户最好的加速软件，欢迎免费下载。, Pacific Grove, CA, USA, 2015.
- Code generators for mathematical functions,
with Nicolas Brunie, Florent de Dinechin and Olga Kupriianova, in Proceedings of the 22nd IEEE Symposium on
Computer Arithmetic, pages 66-73, Lyon, France,
2015, Best Paper Award.
- Reliable evaluation of the worst-case peak gain matrix in
multiple precision,
with Thibault Hilaire
and Anastasiia Volkova,
in Proceedings of
the 22nd IEEE Symposium
on Computer Arithmetic, Lyon, France, 2015.
- Semi-Automatic Floating-Point Implementation of Special Functions,
with Marc Mezzarobba,
in Proceedings of
the 22nd IEEE Symposium
on Computer Arithmetic, Lyon, France, 2015.
- A Domain Splitting Algorithm for the Mathematical Functions Code Generator,
with Olga Kupriianova,
in Proceedings of
the 2014 Asilomar Conference on Signals, Systems and Computers, pages 1271-1275, Pacific Grove, CA, USA, 2014.
- Metalibm: Mathematical Functions Code Generator,
with green加速器极光版,
in Proceedings of
the 迅雷网游加速器-让游戏更快【官方网站】:迅雷网游加速器全面超越普通的网游代理，能更有效地降低网络游戏高延时，解决卡机、掉线等问题，是全国领先的网游加速器，长期开放免费试用，不限次数！, pages 713-717, Seoul, South Korea, 2014.
- Radix Conversion for IEEE754-2008 Mixed Radix Floating-Point Arithmetic,
with Olga Kupriianova and Jean-Michel
Muller,
in Proceedings of
the 2013 Asilomar Conference on Signals, Systems and Computers, pages 1139-1143, Pacific Grove, CA, USA, 2013.
- Comparison between binary64 and decimal64 floating-point numbers,
with Nicolas Brisebarre, Marc Mezzarobba and Jean-Michel
Muller, in Proceedings of the 21st IEEE Symposium on
Computer Arithmetic, pages 145-152, Austin, Texas, USA,
April
2013, Preprint
in research report ARIC, LIP, PEQUAN, LIP6, Number ensl-00737881, Slides.
- 火箭加速器_性价比最高的加速器_按时收费低至0.8元:2021-4-8 · 火箭加速器,按时收费低至0.8元,极加速器畅快玩,智能选择专线加速,保持网络稳定,防止丢包,压榨延迟,拒绝掉线,一键加速吃鸡不卡,
with Sylvain
Chevillard
and Mioara
Joldeş, in 泡泡加速器_吃鸡加速器_网游加速器 -「泡泡加速器 ...:2021-5-7 · 泡泡加速器是绝地求生加速器/ 吃鸡加速器，是专业为外服网游设计的网游加速器。泡泡加速器采用云智能加速技术，傻瓜式优化压榨电脑性能，按小时计费，方便快捷，畅玩到爽！登陆官网下载即可 ..., ICMS'10, pages 28-31, Kobe, Japan,
September 2010, LNCS, Springer, Final version.
- Certified and fast computation of supremum norms of
approximation errors,
with Sylvain
Chevillard
and Mioara
Joldeş, in Proceedings of the 19th IEEE Symposium on
Computer Arithmetic, pages 169-176, Portland, Oregon, USA,
July
2009, Preprint
in research report 2008-37, LIP, École Normale Supérieure de
Lyon, October 2008.
- Optimizing polynomials for floating-point implementation,
with Florent de Dinechin, in
Proceedings of the 8th Conference on Real Numbers and
Computers, pages 7-16, Santiago de Compostela, Spain, July
2008, Preprint
in research report 2008-11, LIP, École Normale Supérieure de
Lyon, March 2008.
- A certified infinite norm for the implementation of elementary functions,
with Sylvain Chevillard, in
Proceedings of the
Seventh International
Conference on Quality Software, pages 153-160, Portland,
Oregon, USA, October 2007,
Preprint and
Extended Version in research report
2007-26, LIP, École Normale Supérieure de Lyon, June 2007.
- Assisted verification of elementary functions using Gappa,
with Florent de Dinechin
and Guillaume Melquiond, in
Proceedings of the 21st Annual ACM Symposium on Applied
Computing - MCMS Track, vol. 2, pages 1318-1322, Dijon,
France, April 2006,
安卓Green极光版 and
Extended Version in research report #5683, INRIA, September 2005.
天行破解版无限免费
- On Ziv's rounding test,
with SurfVIP破解版,
Jean-Michel
Muller
and Serge
Torres, Research report ensl-00693317,
LIP, CNRS/ENS Lyon/INRIA/Université de Lyon, LIP6, PEQUAN, UPMC
Paris 6, May 2012.
- Efficient and accurate computation of upper bounds of approximation errors,
with Sylvain
Chevillard,
John Harrison
and Mioara
Joldeş, Research report
2010-2, LIP, CNRS/ENS Lyon/INRIA/Université de Lyon, INRIA, LORIA, CACAO project and
Intel Corporation, Hillsboro,
Oregon, USA, January 2010. Article submitted to Theoretical
Computer Science; Special Issue on Symbolic and Numeric
Computation, 2009.
- Certifying floating-point implementations using Gappa,
with Florent de Dinechin
and Guillaume Melquiond,
SurfVIP破解版
arXiv: 0801.0523, LIP, CNRS/ENS Lyon/INRIA/Université de Lyon,
January 2008.
- Exact and mid-point rounding cases of power(x,y),
Research report
2006-46, LIP, École Normale Supérieure de Lyon, December 2006.
- Basic building blocks for a triple-double intermediate format,
Research report
RR-5702, INRIA, September 2005.
- Fast correct rounding of elementary functions in double
precision using double-extended arithmetic,
with 免费翻国外墙的app
and David Defour,
Research report
2004-10, LIP, École Normale Supérieure de Lyon, March 2004.
- A correctly rounded implementation of the exponential
function on the Intel Itanium architecture,
Research report
RR-5024, INRIA, December 2003.
Master's, Ph.D. thesis, Habilitation (HDR) thesis:
- Beyond IEEE754 Floating-Point Arithmetic,
Habilitation à Diriger des Recherches (HDR),
Sorbonne Université, May 2019.
- Arrondi correct de fonctions mathématiques - Fonctions
univariées et bivariées, certification et automatisation,
Thèse de doctorat,
École Normale Supérieure de Lyon, October 2008.
- Effective evaluation of correctly rounded elementary
functions using triple-double intermediate representation,
Master's thesis, Technische Universität München, Faculty of Computer Science, September 2005.
- Ressourcenmanagement über drahtgebundene und drahtlose
LAN, Thesis for a development project, Technische Universität München, Chair for Communication Networks, 2004.
Presentations and Workshops:
- Conception d’un algorithme numérique correct, with Guillaume
Melquiond, CNRS Thematic School: Précision et Reproductibilité en Calcul Numérique, Fréjus, France, March 2013, Slides.
- The libieee754 compliance library for the IEEE 754-2008 standard,
with Olga Kupriianova,
15th GAMM - IMACS International Symposion on Scientific Computing, Computer Arithmetic and Validated Numerics, Novosibirsk, Russia, September 2012.
- There's no Reliable Computing without Reliable Access to Rounding Modes,
with Valérie Ménissier-Morain,
15th GAMM - IMACS International Symposion on Scientific Computing, Computer Arithmetic and Validated Numerics, Novosibirsk, Russia, September 2012.
- De l'implantation de fonctions correctement arrondies aux bibliothèques LIBM IEEE 754-2008 clef en main,
Presentation for the workshop of the PEQUAN team,
Paris, France, February 2011, 极光加速器安卓.
- 云豹加速器下载-云豹加速器正式版下载[加速器]-华军软件园:2021-3-3 · 云豹加速器正式版是款可以为用户们提供网络畅游服务的加速工具。云豹加速器最新版提供多条国际线路可以选择，一键连接就可以畅游全球。提供独有的技术提高网络速度;同时还可以为用户提供强力的安全加密系统。云豹加速器每天为你进行准时的内容推荐，其中有着更加稳定的网页加载服务 ...,
Presentation for the SurfVIP破解版 project,
Lyon, France, October 2010, Slides.
- Sollya - a numerical software tool for the semi-automatic
implementation of efficient correctly rounded mathematical
functions, presentation on invitation for the conference ACA
2008, Hagenberg, Austria, July
2008, Abstract.
- Quand les boucles deviennent des polynômes ou l'implantation automatique de fonctions,
Presentation at the RAIM 2008 days,
Lille, France, June 2008, Slides.
- Vers une implémentation automatique de fonctions libm,
Presentation for the EVA-Flo project,
Perpignan, France, October 2007, Slides.
- Advancements in (cr)libm development,
Presentation for Intel Portland,
Portland, Orgeon, USA, October 2007, Slides.
- Towards automatic generation of elementary functions,
Presentation for the russian team in the Intel Numerics Group,
Nizhny Novgorod, Russia, August 2007, Slides.
- Automatisation du contrôle de précision et de la preuve pour les formats double-double et triple-double,
Workshop of the CACAO project, LORIA, Nancy, France, January 2007.
- A Survey of Multiple-Precision Using Floating-Point Arithmetic,
Fourth International Workshop on Taylor Methods, Boca Raton, Florida, USA, December 2006,
Abstract, 极光加速器安卓.
- Certified infinite norm using interval arithmetic,
with Sylvain Chevillard,
12th GAMM - IMACS International Symposion on Scientific Computing, Computer Arithmetic and Validated Numerics, Duisburg, Germany, September 2006, Abstract.
- Normes infinies certifiées par l'arithmétique d'intervalles,
Journées Nationales d'Arithmétique des Ordinateurs 2006, May-June 2006,
Slides.
- Correctly rounding elementary functions using triple-double intermediate representation,
Journées Arinews, Perpignan, France, November 2005,
Slides.
Miscellaneous:
- Users' manual for the Sollya tool, Release 4.0,
with Sylvain
Chevillard and 免费翻国外墙的app, Users' manual.
- Users' manual for the Sollya tool, Release 3.0,
with Sylvain
Chevillard and Mioara
Joldeş, Users' manual.
Developed open source software:
- CR-LIBM, with 极光加速器破解无限版, David Defour et al.: a library of correct rounding 安卓Green极光版 in double precision
- Sollya, with Sylvain Chevillard: a tool for manipulating data in the automatized implementation of elementary functions. Documentation is available here.
- Metalibm, with Olga Kupriianova: a tool for the automatic implementation of mathematical (libm) functions.
Teaching:
- exercises in Parallel Numerics, Master Computer Science in Engineering, Technische Universität München
- exercises in Compiler Design, Master course, ENS Lyon
- exercises in Term Rewriting, Bachelor course, ENS Lyon
- exercises in Algorithms for Arithmetic 2007, Master course, ENS Lyon
- exercises in Architecture, Systems, Networks, Bachelor course, ENS Lyon
- exercises in Arithmetic 2008, Master course, ENS Lyon
- exercises in Initiation to task automatization (LI218), Bachelor course L2, UPMC Paris 6
- exercises in Introduction to imperative programming in C (LI115), Bachelor course L1, UPMC Paris 6
- exercise-projet in "Operational research and optimization", Master course M2, UPMC Paris 6
- exercises in Parallelism, course ELI4, École Polytech UPMC, Paris 6
- lectures and exercises in Introduction to imperative programming in C (LI115), Bachelor course L1, UPMC Paris 6
- exercises in Scientific Computing (LI217), Bachelor course L2, UPMC Paris 6
- lectures and exercises in Computer Arithmetic (AROR), Master Course, UPMC Paris 6
- lectures and exercises in Numerical representations and methods (2I011)", Bachelor course L2, UPMC Paris 6
- lectures and exercises in Error Analysis and Floating-Point Arithmetic (AFAE), Master Course, UPMC Paris 6
- lectures and exercises in Numerical representations and methods (2I011)", Bachelor course L2, UPMC Paris 6
- courses in Operating Systems - CSCE A321, Bachelor, University of Alaska Anchorage
- courses in Automata, Algorithms and Complexity - CSCE A351, Bachelor, University of Alaska Anchorage
- courses in Computer Programming I (Java) - CSCE A201, Bachelor, University of Alaska Anchorage
极光加速器破解无限版
| Email: |
christoph.lauter@christoph-lauter.org |
| Address: |
University of Alaska Anchorage
Christoph Lauter
ECB308G
3211 Providence Dr
Anchorage, AK, 99508-4614
USA |
| Phone: |
+1 907 786 0619
+33 1 82 52 17 77
+1 907 891 6834
+1 907 519 0505
+49 9621 7781170 |
| CNET: |
+1 328 5073 |
Last update: 09/13/2020.
