![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Arjan Cornelissen (UC Berkeley)
Wednesday 08 April 2026, 13:00-14:00
Randomized algorithms through the st-connectivity framework
- đ¤ Speaker: Arjan Cornelissen (UC Berkeley)
- đ Date & Time: Wednesday 08 April 2026, 13:00 - 14:00
- đ Venue: Computer Laboratory, William Gates Building, Room SS03
Questions? Contact
Tom Gur
Abstract
In this talk, we will take a look at a novel the connection between the st-connectivity framework and randomized and quantum algorithms. Specifically, I will introduce the st-connectivity framework, and then we will see how randomized algorithms can be represented in this framework. If time permits, we can also have a look at some applications of the st-connectivity framework.
Series This talk is part of the Quantum Computing Seminar series.
Included in Lists
- Algorithms and Complexity Seminar
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Quantum Computing Seminar
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.