BARC (Basic Algorithms Research Copenhagen) is new center for foundational research in design and analysis of algorithms. The center, which will be inaugurated on December 1, is led by Mikkel Thorup. We aim to attract top talent from around the world to an ambitious, creative, collaborative, and fun environment in Copenhagen, Denmark. Other core scientists in the center are Stephen Alstrup, Thore Husfeldt, and Rasmus Pagh. The center is part of a larger effort increasing the ...number of faculty members in algorithms research, and making Copenhagen a hub for algorithms research. The BARC center has received funding of over 6 million USD for the next 6 years from VILLUM Fonden to employ graduate students and post-docs, and to attract a stream of long- and short-term visitors. People interested in BARC should follow this page on Facebook and visit the web pages at — the first assistant/associate professor, post-doc, and PhD student positions are already announced, with deadlines in November and December.

See More
No automatic alt text available.

PhD scholarships at ITU Copenhagen, application deadline April 3. One of the PhD positions is affiliated with BARC. Do you have a publication record in algorithms theory, or an outstanding master thesis in the area, and want to do a PhD? Apply to join our team!

The IT University of Copenhagen invites highly motivated individuals to apply for a PhD position starting in summer 2018 or soon thereafter.    Succes
BARC has no reviews yet.
Tell people what you think
BARC, SODA, and all that jazz
BARC shared a link.
BARC welcomes a new postdoc Radu Curticapean to the team.
BARC shared a link.
On Friday 9 March 2018, Radu Curticapean will give a talk on Counting complexity.
BARC shared a link.
On Wednesday 7 March 2018, Kasper Green Larsen, assistant professor at Aarhus University, will give a talk on an Oblivious RAM Lower Bound.
On 7 March 2018 Charalampos Tsourakakis will give a talk about Predicting Positive and Negative Links with Noisy Queries in theory and practice.

Three papers authored by BARC researchers accepted to STOC 2018. Congratulations to them all!

Mixture Models, Robustness, and Sum of Squares ProofsSamuel B. Hopkins (Cornell), Jerry Li (MIT)The Adaptive Complexity of Maximizing a Submodular FunctionEric Balkanski (Harvard), Yaron Singer (Harvard)Learning Geometric Concepts with Nasty NoiseIlias Diakonikolas (USC), Daniel M. Kane (UCSD), Alis...

BARC is very happy to welcome Thomas Dueholm Hansen, who joined the Copenhagen University algorithms group as associate professor on January 1. Thomas received his PhD from Aarhus University in 2012, worked as postdoc for a year at Tel Aviv University, followed by a year at Stanford University, after which he returned to Aarhus University to work as assistant professor for three years. His research interests include design and analysis of algorithms for solving problems in optimization and computational game theory. He is particularly interested in problems related to linear programming and games on graphs.

Image may contain: 1 person, smiling, closeup

Mikkel invited talk at SODA

Image may contain: 1 person
Image may contain: one or more people, crowd and indoor


Image may contain: 1 person

BARC, SODA, and all that jazz

It looks like you may be having problems playing this video. If so, please try restarting your browser.
Posted by BARC

Thank you for joining us at the official inauguration of BARC today!

Image may contain: one or more people and indoor
Image may contain: 5 people, people sitting and indoor
Image may contain: 2 people, indoor

BARC/EADS Talk by Michael Kapralov, 19 December, DIKU, Big Auditorium at 14:15

On 12 December 2017, Michael Kapralov, assistant professor at School of Computer and Communication Sciences at EPFL, will give a talk on An Adaptive Sublinear-TimeBlock Sparse Fourier Transform.
PhD student at DIKU Jacob Holm has in cooperation with Aaron Bernstein (Columbia University, USA) and Eva Rotenberg (DTU) received the Best Paper Award at ACM-SIAM Symposium on Discrete Algorithm (SODA’18) in New Orleans, USA for the article Online Bipartite Matching with Amortized O(log&s...

Congratulations to BARC's Christian Wulff-Nilsen!

Shorter paths to shortest path research with 6m DKK grant for research in dynamic and static graphs to DIKU's Christian Wulff-Nilsen

With a Sapere Aude Starting Grant of nearly 6m DKK (0.9m USD) from The Independent Research Fund Denmark DIKU's Christian Wulff-Nilsen will during the next four years perform research in algorithms and data structures for dynamic and static graphs.

BARC Talk tomorrow at DIKU!

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.