- Abstr act models for problems that are solved by distributed systems\, and for t he algorithms used to solve them ;
- Rigorous proofs of algorithm correctness and performance properties (also some error discoveries) ;
- Impossibility results and lower bounds\, expressing inherent limi tations of distributed systems ;
- Some new algorithms ; < li> and General mathematical foundations for modeling and analyzing distri buted systems.

These various results have spanned many d ifferent kinds of systems\, ranging from distributed data-management syste ms\, to communication systems\, to biological systems such as insect colon ies and brains. In this talk\, I will overview some highlights of our wo rk over many years on theory for distributed systems. I will break this do wn in terms of three intertwined “research threads”: algorithms for t raditional distributed systems\, impossibility results\, and mathematical foundations. At the end\, I will say something about our recent work on al gorithms for new kinds of distributed systems. DTSTAMP:20191210T033306Z DTSTART;TZID=Europe/Paris:20190912T180000 DURATION:PT2H URL;VALUE=URI:https://www.lip6.fr/colloquium/?guest=Lynch UID:LIP6/SEM/C46 LOCATION:Sorbonne Université (Amphi 44)\, 4\, place Jussieu\, 75005 Paris GEO:48.846643;2.355248 END:VEVENT END:VCALENDAR