Department of Computer Science

Previous Events

16 Apr. 2024, 14:01-15:00

BARC Talk by Dan Halperin

Join us for Dan Halperin's talk: From snapping fixtures to multi-robot coordination:
Geometry at the service of robotics

23 Jan. 2024, 14:01-15:00

BARC talk by Andreas Björklund: Another Hamiltonian Cycle in Bipartite Pfaffian Graphs

Come join us for Andreas Björklund's introduction talk on Another Hamiltonian Cycle in Bipartite Pfaffian Graphs

17 Jan. 2024, 14:01-15:00

BARC Talk by Pavel Hrubes: Witnessing for non-negative rank and communication complexity

Come join us for Pavel Hrubes' talk: Witnessing for non-negative rank and communication complexity

18 Dec. 2023, 14:15-15:00

BARC Talk by Dani Dorfman: Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player

Join us for the last BARC talk of the year by Dani Dorfman: Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player

5 Dec. 2023, 12:15-13:00

DIKU Bits: Stochastic convex optimization

Join us when Amir Yehudayoff from the Algorithms and Complexity (AC) section will give a DIKU Bits lecture.

21 Nov. 2023, 14:01-15:00

BARC Talk by Tuukka Korhonen: Dynamic treewidth

Come join us for Tuukka Korhonen's BARC talk on Dynamic treewidth

9 Nov. 2023, 14:01-15:00

Providentia Talk by Boel Nelson: Towards Provable Transport Layer Privacy

Come and join us for Boel Nelson's talk: Towards Provable Transport Layer Privacy

18 Oct. 2023, 14:01-15:00

BARC Talk by Weiqiang Yuan: One-Way Functions vs. TFNP: Simpler and Improved

Join us for Weqiang Yuan's talk: One-Way Functions vs. TFNP: Simpler and Improved on Wednesday the 18th of October 2023!

12 Oct. 2023, 14:01-15:00

BARC Talk by Leonid Reyzin: Approximate Lower Bounds Arguments

Join us for Leonid Reyzin's talk: Approximate Lower Bounds Arguments on Thursday the 12th of October!

9 Oct. 2023, 14:01-15:00

BARC Talk by Katharina Klost: Shortest Path in general disk graphs... & Sarita de Berg: The Complexity of Geodesic Spanners

Join us for Katharina Klost's talk on Shortest Path in general disk graphs and an algorithmic framework for SSSP and Sarita de Berg's talk on The Complexity of Geodesic Spanners.