|2018-09-13||15:15||ITC 1311||Erez Petrank, Technion, Israel||Persistent Data Structures for Non-Volatile Memory|
|2018-09-13||16:15||ITC 1311||Jesper Larsson Träff, TU Wien, Faculty of Informatics, Institute of Computer Engineering, Austria||On Optimal Trees for Irregular Gather and Scatter Collectives|
What is it?
(TAS)@UpMARC is a seminar serie on various topics related to UPMARC. It used to be held every Thursday Afternoon (hence, the name), but this constraint has somewhat been loosen with time. It is now renamed to Theory and Applications.
The purpose is to meet and learn what people in related areas are doing. It is necessary for any researcher to make presentations, and this is a great opportunity to train your presentation skills in a context that is more relaxed than a big conference. Your colleagues want to know what you are doing.
Scope: Presentations may give a broad overview of the person's research area, or go into details on some specific topic the speaker has worked on. The presentations should be accessible to anyone who is at least a PhD student in computer science without reading any related research papers.
PhD course credits: Indeed, you can get some for a presentation. (disclaimer )
It historically started as TAPVES and got extended to UPMARC.
How does it work?
Anyone is welcome to present and attend, including PhD students, senior researchers, and undergraduate students near finishing.
You can sign up to present on a (TAS)@UpMarc! Simply:
Or do it yourself:
|2016-11-30||15:15||ITC 1212||Prof. Peter Sewell, Cambridge University|
|2016-04-22||10:15||ITC 1145||Magnus Myreen (Chalmers)||The CakeML project and its new verified compiler|
|2016-02-18||14:15||ITC 1145||Rumyana Neykova (Imperial College London)||Verify me if you can: Supervisors, Actors and Session Types|
|2016-02-16||10:00||ITC 1146||Peter Hsu, Oracle Labs||The CAVA 1 Computer: Exceptional Parallelism and Energy Efficiency|
|Wednesday, 2015-11-04||14:15||1112||Peter Schrammel, Oxford||Synthesising Interprocedural Bit-Precise Termination Proofs|
|Wednesday, 2015-11-11||13:15||1145||Jakob Nordström, KTH||A Survey of Proof Complexity from a SAT Solving Perspective|
|Thursday, 2015-11-12||15:15||2446||Dimitrios Kouzapas, University of Glasgow||Mungo: Typechecking Protocols|