Event archive

26 Oct. 2018, 14:15-15:15

BARC Talk by Vera Traub

On Friday October 26, Vera Traub, PhD student at the University of Bonn, will give a talk in BARC "Beating the integrality ratio for s-t-tours in graphs". 

4 May 2018, 13:15-14:15

BARC/EADS Talk by Matteo Ceccarello

On 4 May, Matteo Ceccarello, a PhD in 2017 from the University of Padova, will give a talk on Making Big Data Small.

24 Apr. 2018, 15:15-15:45

BARC/EADS Talk by Thatchaphol Saranurak: Pattern-avoiding Access in Binary Search Trees

On 24 April, Thatchaphol Saranurak, PhD student at KTH Royal Institute of Technology in Sweden, will give a talk on Pattern-avoiding Access in Binary Search Trees.

9 Mar. 2018, 13:00-14:00

BARC/EADS Talk by Radu Curticapean

On Friday 9 March 2018, Radu Curticapean will give a talk on Counting complexity.

7 Mar. 2018, 14:00-15:00

BARC/EADS Talk by Kasper Green Larsen

On Wednesday 7 March 2018, Kasper Green Larsen, assistant professor at Aarhus University, will give a talk on an Oblivious RAM Lower Bound.

7 Mar. 2018, 13:00-14:00

BARC/EADS Talk by Charalampos Tsourakakis

On 7 March 2018 Charalampos Tsourakakis will give a talk about Predicting Positive and Negative Links with Noisy Queries in theory and practice.

19 Dec. 2017, 14:15-15:15

BARC/EADS Talk by Michael Kapralov

On 19 December 2017, Michael Kapralov, assistant professor at School of Computer and Communication Sciences at EPFL, will give a talk on An Adaptive Sublinear-Time Block Sparse Fourier Transform.

15 Nov. 2017, 14:15-15:15

BARC/EADS Talk by Thatchaphol Saranurak

On 15 November 2017, Thatchaphol Saranurak, PhD student at KTH Royal Institute of Technology in Sweden, will give a talk on Dynamic Spanning Forest: Techniques and Connections to Other Fields.

6 Nov. 2017, 14:15-15:15

BARC/EADS Talk by Kasper Green Larsen

On 6 November 2017, Kasper Green Larsen, assistant professor at Aarhus University, will give a talk on 'Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds'.

15 Aug. 2017, 14:00-15:00

EADS Talk by Thomas Dueholm Hansen

On 15 August 2017, Thomas Dueholm Hansen, Assistant professor at the Department of Computer Science Aarhus University, will give an EADS talk about Decremental Single-Source Reachability and Strongly Connected Components in \tilde{O}(m\sqrt{n}) Total Update Time. 

4 Jan. 2017, 15:15-16:00

EADS Talk by Rasmus Kyng: Approximate Gaussian Elimination for Laplacians

On 4 january 2017 at 3:15-4:00 pm, Rasmus Kyng will give a talk about Approximate Gaussian Elimination for Laplacians at DIKU.

21 Nov. 2016, 15:15-16:00

EADS talk by Amir Abboud: Hardness in P

On 21 November 2016 at 3:15-4:00 pm, Amir Abboud will give a talk about hardness in P at DIKU.

27 Oct. 2016, 15:15

EADS Talk: The Parameterized Hardness of the Art Gallery Problem

On 27 October 2016, Tillmann Miltzow will give a talk on The Parameterized Hardness of the Art Gallery Problem.

2 June 2016, 15:15

EADS Talk by Greg Bodwin on 'The 4/3 Additive Spanner Exponent is Tight'

2 June 2016 at 15:15, Greg Bodwin, Stanford Dept. of Computer Science, will give an EADS talk on 'The 4/3 Additive Spanner Exponent is Tight'.

31 May 2016, 15:15

EADS Talk by Kim Stachenfeld on 'How to shrink your MDPs'

May 31 at 15:15, Kim Stachenfeld, Google Deepmind + Princeton Dept. of Neuroscience, will give an EADS talk on 'How to shrink your MDPs'.

11 May 2016, 14:15-16:00

Double EADS Talk by Antonios Antoniadis and Tobias Mömke

Antonios Antoniadis, Max-Planck-Institut fur Informatik, Saarbrucken, Germany, and Tobias Mömke, from Saarland University, Germany give a double EADS Talk on May 11.

25 Apr. 2016, 15:15-16:30

EADS talk by Katherine St. John

Katherine St. John, professor at City University of New York & American Museum of Natural History, will give an EADS talk on 'Improving Searches for Evolutionary Trees'.

5 Feb. 2016, 14:15-15:00

EADS Talk by Alan Roytman

Zero-One Laws for Sliding Windows and Universal Sketches

6 Nov. 2015, 15:15-16:00

Fully Dynamic Approximate Matching

EADS talk by Aaron Bernstein

14 Oct. 2015, 15:15-16:00

EADS talk by Alexandru Popa on The Maximum Generalized Pattern Matching Problem

Alexandru Popa, Nazarbayev University, Kazakhstan, are visiting UCPH and will give a talk on October 14th from 15:15-16:00.

24 Sept. 2015, 15:15-16:00

On-line Approach to Off-line Graph Coloring Problems

EADS talk by Bartosz Walczak

23 Sept. 2015, 16:15-17:30

Double EADS-talk by Katarzyna Paluch & Matthias Mnich

Double EADS-talk from 16.15-17.30. Katarzyna Paluch on 'Maximum ATSP with weights zero and one via half-edges' and Matthias Mnich on 'On Routing Disjoint Paths in Bounded Treewidth Graphs'.

18 Sept. 2015, 17:15-18:00

Bottleneck Paths and Trees and Deterministic Graphical Games

EADS talk by Or Zamir, Dept. of Computer Science, Tel Aviv University

18 Aug. 2015, 15:00-16:00

Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms

EADS Talk by Kasper Green Larsen, Aarhus University, starting at 15:00.

14 Aug. 2015, 15:15-16:00

Toward a unified theory of sparse dimensionality reduction in Euclidean space

EADS Talk by Jelani Nelson, Harvard University, USA, starting 15.15

7 Aug. 2015, 15:00-16:00

Pairwise Distance Preservers and Additive Spanners

Talk with Greg Bodwin from Stanford University on Pairwise Distance Preservers and Additive Spanners on August 7th at 3pm.

3 June 2015, 15:15-16:00

New Deterministic Algorithms for Solving Parity Games

EADS talk by Matthias Mnich from Bonn University on Wednesday June 3rd at 3:15 PM.

 

26 May 2015, 13:00-14:00

Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor

On Tuesday, May 26th, assistant professor at Aarhus University, Thomas Dueholm Hansen will give an EADS talk on strategy iteration.

13 May 2015, 13:00-15:00

Hollow Heaps

EADS Talk by Robert E. Tarjan, Wednesday May 13th, 2015 at 13:00-15:00.

11 May 2015, 13:00-14:00

(Min,+)-Convolutions, 3SUM and Additive Combinatorics

EADS talk by Moshe Lewenstein on Monday May 11th 2015 from 1-2 PM.

11 May 2015, 11:00-12:00

Group Testing, Compressed sensing and Algorithmic applications

EADS talk by Ely Porat on Monday May 11th 2015 from 11-12 AM.

30 Apr. 2015, 15:00-16:00

Higher lower bounds from the 3SUM conjecture

EADS talk by Tsvi Kopelowitz, Thursday April 30th, 2015 at 15:00-16:00.

29 Apr. 2015, 13-15

Algorithms for the symmetric traveling salesman problem

EADS Talk by Ola Svensson, assistant professor in the theory group at EPFL

24 Apr. 2015, 15:00-16:00

Decremental Single Source Shortest Paths in Near-Linear Time

EADS talk by Danupon Nanongkai (KTH)

6 Mar. 2015, 14:00-15:00

Beyond the Euler characteristic: Approximating the genus of general graphs

EADS talk by Ken-ichi Kawarabayashi on Friday, March 6th, from 2-3 PM.

20 Jan. 2014, 16:00

Computing Triplet and Quartet Distances Between Trees

Talk by Gerth Stølting Brodal, Friday 20th January 2014 at 16:00

17 Jan. 2014, 14:00-15:00

The Work and Visions of Mihai Patrascu

Talk by Mikkel Thorup, January 17th 2014 at 14:00-15:00