The Prague Computer Science seminar series, coorganized by Department of Computer Science, presents:
Lower bounds and the physical reality by Michal Koucký
Thursday, January 28, at 4 p.m. in room KNE:107.
Algorithms provide bounds (upper bounds) on the amount of resources such as time and space that suffice to solve various computational problems. On the other hand, lower bounds provide bounds on the amount of resources that are necessary to solve such problems.
More about the lecturer:
Michal Koucký works in theoretical computer science where he focuses on computational complexity, data structures, and combinatorics. He is best known for introducing exploration sequences, his work on parallel random walks, and various lower bounds. He is the recepient of the ERC Consolidator grant Lower bounds for combinatorial algorithms and dynamic problems. He obtained Ph.D. from Rutgers University. Afterwards he worked at the Mathematical Institute of the Academy of Sciences of the Czech Republic and at the universities in Austin, Montreal, Amsterdam, Toronto and Aarhus. Since 2013 he is a member of the Computer Science Institute of Charles University in Prague.