Event archive – University of Copenhagen

26 October 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".

» Read more

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.

» Read more

24 April 2018, 15:15-15:45

BARC/EADS Talk by Thatchaphol Saranurak

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.

» Read more

9 March 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.

» Read more

7 March 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.

» Read more

7 March 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.

» Read more

19 December 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.

» Read more

15 November 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.

» Read more

6 November 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'.

» Read more

13 October 2017, 14:15-15:15

BARC/EADS Talk by Cornelius Brand

Cornelius Brand, PhD student at Saarland University, Germany, will give a talk at DIKU on A unified algebraic approach to the longest path problem.

» Read more

29 September 2017, 14:00-15:00

BARC/EADS Talk by Uri Zwick

On 29 September 2017, Uri Zwick, professor at Tel Aviv University, will give a talk about Selection from heaps, row-sorted matrices and $X+Y$ using soft heaps.

» Read more

21 September 2017, 13:00-14:00

BARC/EADS talk by Chris Schwiegelshohn

On 21 September 2017, Chris Schwiegelshohn, postdoc at the university la Sapienza in Roma, will give a talk at DIKU on Incremental Matching in Amortized Linear Time.

» Read more

1 September 2017, 15:00-16:00

BARC/EADS Talk by Karl Bringmann

On 1 September, Karl Bringmann will give a talk on SETH-Based Lower Bounds for Subset Sum and Bicriteria Path.

» Read more

17 August 2017, 13:00

Tabulation Hashing for Large-Scale Data Processing - PhD Defense by Søren Dahlgaard

Søren Dahlgaard defends his PhD degree on 17 August 2017

» Read more

17 August 2017, 11:00-12:00

Talk by Alexandr Andoni: Near Neighbor Search under General Symmetric Distances

On 17 August 2017, Alexandr Andoni, Associate Professor in the Department of Computer Science at Columbia University, will give a talk on Near Neighbor Search under General Symmetric Distances.

» Read more

15 August 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.

» Read more

10 August 2017, 13:00-15:00

EADS talk by Dmitry Chistikov

On 10 August 2017, Dmitry Chistikov, Assistant Professor at the University of Warwick, UK, will give a talk on Ultimately periodic sets, Presburger arithmetic, and integer programming with quantifiers.

» Read more

4 August 2017, 14:00

PhD Defense by Mathias Bæk Tejs Knudsen: New Results on Hashing, Labeling Schemes and Algorithms

On 4 August at 2:00 pm, Mathias Bæk Tejs Knudsen will defend his PhD Thesis.

» Read more

3 August 2017, 15:30

Double DIKU talk: Robert Tarjan and Giuseppe Italiano

On 3 August 2017 DIKU hosts a double DIKU talk on algorithmic themes by Robert Tarjan, Princeton and Giuseppe Italiano, Rome.

» Read more

21 June 2017, 13:00-14:00

EADS Talk by Arindam Khan: Pseudo-polynomial-time approximation of strip

On 21 June 2017 at 1:00-2:00 pm, Arindam Khan will give a talk about Pseudo-polynomial-time approximation of strip at DIKU.

» Read more

$Read more about: EADS talk by Mikkel Abrahamsen: The Art Gallery Problem is $\exists R$-complete$

9 June 2017, 15:00-16:00

EADS talk by Mikkel Abrahamsen: The Art Gallery Problem is $\exists R$-complete

On 9 June 2017, Mikkel Abrahamsen, PhD student at Department of Computer Science, University of Copenhagen, will give an EADS talk on The Art Gallery Problem is $\exists R$-complete.

» Read more

1 June 2017, 13:00-14:00

EADS talk by Arnaud de Mesmay: Complexity of optimal homotopies

On 1 June 2017, Arnaud de Mesmay will give a talk about 'Complexity of optimal homotopies'.

» Read more

30 May 2017, 13:15-14:00

EADS talk by Viktor Zamaraev: Forbidden induced subgraphs for unit disk graphs

On 30 May 2017, Viktor Zamaraev will give a talk on 'Forbidden induced subgraphs for unit disk graphs'.

» Read more

10 May 2017, 13:00-14:00

EADS Talk by Aaron Bernstein

On 10 May 2017 at 13:00-14:00, Aaron Bernstein will give a talk at DIKU on 'An improved deterministic algorithm for dynamic single source shortest paths'.

» Read more

8 May 2017, 13:00-14:00

EADS Talk by Sebastian Krinninger

On 8 May 2017 at 1-2 pm, Sebastian Krinninger will give a talk at DIKU on Approximate Single-Source Shortest Paths in Distributed Networks.

» Read more

3 April 2017, 12:00-14:00

EADS Mini-Workshop on Computational Geometry

EADS is hosting a mini-workshop on Computational Geometry consisting of four talks by Mehran Mehr (Eindhoven University of Technology), Eva Rotenberg (DIKU), Mikkel Abrahamsen (DIKU) and Anna Adamaszek (DIKU).

» Read more

16 March 2017, 14:15-15:00

EADS Talk by Rasmus Pagh: Set Similarity Search Beyond Minhash

On 16 March, Rasmus Pagh, professor at IT University of Copenhagen (ITU), will give a talk on Set Similarity Search Beyond Minhash.

» Read more

28 February 2017, 13:15-14:00

EADS Talk by Arnold Filtser

On 28 February, Arnold Filtser will give a talk 'On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion'.

» Read more

26 January 2017, 15:15-16:00

Talk by Tillmann Miltzow

On 26 January 2017, Tillmann Miltzow will give a talk on 'Intersection
Graphs of Rays and Grounded Segments'.

» Read more

4 January 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.

» Read more

22 November 2016, 15:15-16:00

EADS Talk by: Mira Shalah

On 22 November 2016 at 3:15-4:00 pm, Mira Shalah will give a talk about A Method for Generating Formulae for n-cell Polycubes Proper in n-k Dimensions at DIKU.

» Read more

21 November 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.

» Read more

27 October 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.

» Read more

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'.

» Read more

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'.

» Read more

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.

» Read more

25 April 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'.

» Read more

5 February 2016, 14:15-15:00

EADS Talk by Alan Roytman

Zero-One Laws for Sliding Windows and Universal Sketches

» Read more

4 February 2016, 14:15-15:00

EADS Talk by Ilan Reuven Cohen, Tel Aviv Univ.

Serving in the Dark should be done Non-Uniformly, EADS Talk

» Read more

6 November 2015, 15:15-16:00

Fully Dynamic Approximate Matching

EADS talk by Aaron Bernstein

» Read more

14 October 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.

» Read more

24 September 2015, 15:15-16:00

On-line Approach to Off-line Graph Coloring Problems

EADS talk by Bartosz Walczak

» Read more

23 September 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'.

» Read more

18 September 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

» Read more

18 August 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.

» Read more

14 August 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

» Read more

7 August 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.

» Read more

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.

» Read more

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.

» Read more

13 May 2015, 13:00-15:00

Hollow Heaps

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

» Read more

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.

» Read more

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.

» Read more

30 April 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.

» Read more

29 April 2015, 13-15

Algorithms for the symmetric traveling salesman problem

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

» Read more

24 April 2015, 15:00-16:00

Decremental Single Source Shortest Paths in Near-Linear Time

EADS talk by Danupon Nanongkai (KTH)

» Read more

6 March 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.

» Read more

16 February 2015, 14:00-15:00

Fast Tree Approximations of Graphs

EADS Talk by Harald Räcke, Monday February 16th, 2015 14:00-15:00

» Read more

29 January 2015, 13:00-14:00

The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction

EADS talk by Kasper Green Larsen on January 29th 2015 from 1-2PM.

» Read more

25 November 2014, 13:00-14:00

Preserving Statistical Validity in Adaptive Data Analysis

EADS Talk by Moritz Hardt, Tuesday November 25 at 13:00-14:00

» Read more

7 November 2014, 14:00-15:00

Online bipartite matching in offline time

EADS Talk by Piotr Sankowski, Friday November 7th, 2014 14:00-15:00

» Read more

24 October 2014, 14:00-15:00

Graph reconstruction and verification via distance oracles

EADS talk by Zhou Hang on October 24th, from 14:00-15:00 at HCØ, aud. 9.

» Read more

13 October 2014, 13:00-14:00

Deterministic Global Minimum Cut in Near-Linear Time

EADS talk by Mikkel Thorup, Monday October 13th at 1-2 pm, at A101 HCØ.

» Read more

10 October 2014, 14:00-15:00

Open and Closed Problems in NP-Completeness - Distinguished Lecture by David S. Johnson

DIKU Distinguished Lecture by David S. Johnson, Friday October 10, at 14:00-15:00, Small UP1 DIKU-building

» Read more

8 October 2014, 10:00-11:00

The Traveling Salesman Problem for random points in the unit square: An experimental and statistical study

Talk by David S. Johnson, Wednesday October 8, 10:00-11:00, AUD 2 HCØ buidling

» Read more

15 September 2014, 14:00-15:00

Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem

Talk by Amr Elmasry, Monday September 15th from 14:00-15:00 in the APL-meeting room.

» Read more

12 September 2014, 14:00-15:00

Shortest Paths in Practice

Talk by Renato Werneck, Friday, September 12

» Read more

8 September 2014, 11:00-12:00

Towards graph minors for directed graphs

Talk by Ken-Ichi Kawarabayashi, Monday September 8, 2014, 11:00-12:00

» Read more

14 July - 17 July 2014

Summer School on Hashing: Theory and Applications

July 14-17, 2014 (after ICALP'14). Registration required.

» Read more

13 June 2014, 14:00-15:00

3SUM is Subquadratic

Talk by Seth Pettie, Friday June 13th, 2014 14:00-15:00

» Read more

19 May 2014, 15:15-17:00

Dynamic graph connectivity in polylogarithmic worst case time

Talk by Valerie King, Monday May 19 at 15:15-17:00

» Read more

12 May 2014, 15:15-17:00

Data Structure Lower Bounds and the Cell Probe Model

Talk by Kasper Green Larsen, Monday May 12 at 15.15-17.00

» Read more

14 March 2014, 14:00-15:00

A forward-backward algorithm for single-source shortest paths

Talk by Uri Zwick, Friday March 14th at 14:00-15:00

» Read more

28 February 2014, 14:00-15:00

FPT Colour Coding

Talk by Marek Cygan, Friday February 28th at 14:00-15:00

» Read more

21 February 2014, 14:00-15:00

Approximating Maximum Independent Set of Polygons

Talk by Anna Adamaszek, Friday February 21st 2014 at 14:00-15:00

» Read more

14 February 2014, 14:00-15:00

Graph Guessing Games and new laws of Information Theory

Talk by Søren Riis, Friday February 14th at 14:00-15:00

» Read more

6 February 2014, 14:00-15:00

Sharp Bounds on Davenport-Schinzel Sequences of Every Order

Talk by Seth Pettie, Thursday February 6th 2014 14:00-15:00

» Read more

20 January 2014, 16:00

Computing Triplet and Quartet Distances Between Trees

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

» Read more

17 January 2014, 14:00-15:00

The Work and Visions of Mihai Patrascu

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

» Read more

3 December 2013, 14:00-15:00

(Electrical) Flows and Graph Algorithms

Talk by Alexander Madry December 3rd at 14:00

» Read more

15 November 2013, 14:00

Colour Refinement: A Simple Partitioning Algorithm with Applications From Graph Isomorphism Testing to Machine Learning

Talk by Martin Grohe, RWTH Aachen. It's at 14.00 hours

» Read more

21 October 2013, 15:00

Talk by Thomas Dueholm Hansen, Stanford University

» Read more

9 October 2013, 15:15

Talk by Mikkel Thorup

Hashing and Pseudo-Random Numbers with Strong Distributional Guarantees. Starting at 15.15

» Read more

16 September 2013, 16:00

Talk by Shiri Chechik, Microsoft Research

Fully Dynamic Approximate Distance Oracles for Planar Graphs via Forbidden-Set Distance Labels, talk by Shiri Chechik, Microsoft Research. Starting 16.00.

» Read more

23 August 2013, 14:00-15:00

Simple Algorithms Whose Analysis Isn't - Talk by Robert Tarjan, Princeton

Simple Algorithms Whose Analysis Isn't - Talk by Robert Tarjan

» Read more

16 August 2013, 11:00

Peeling Arguments: Invertible Bloom Lookup Tables and Biff Codes -Talk by professor Michael Mitzenmacher, Harvard

DIKU/Harvard Talk by professor Michael Mitzenmacher

» Read more