Visitors
April 2024 Dan Halperin Professor. Department of Computer Science, Tel Aviv University, Israel. Host: Mikkel Abrahamsen |
January 2024 |
January 2024 |
December 2023 |
November 2023 |
October 2023 |
October 2023 |
Oktober 2023 |
September 2023 |
September 2023 |
August 2023 |
August 2023 |
August 2023 |
July 2023 |
June 2023 |
June 2023 |
May 2023 |
May 2023 |
May 2023 |
April 2023 |
March 2023 |
March 2023 |
March 2023 |
February 2023 |
February 2023 |
February 2023 |
January 2023 |
December 2022 |
1 October 2022 - 1 June 2023 |
28 June - 2 July 2022 |
25 June - 8 July 2022 |
9 - 16 July 2022 |
7 - 10 June 2022 |
21 - 28 May 2022 |
16 - 20 May 2022 |
29 April - 3 May 2022 |
21 - 25 March 2022 |
15 - 22 March 2022 |
20 February - 20 May 2022 Joakim Blikstad PhD student at KTH in Stockholm, Sweden. During his visit he gave a talk on Sublinear-round Parallel Matroid Intersection. Host: Danupon Nanongkai |
13 - 17 December 2021 Wu Zihang Master student at ETH Zürich, Switzerland. Host: Danupon Nanongkai |
6 - 9 December 2021 Boel Nelson PostDoc at Aarhus University, Denmark. During her visit she gave a talk on Examining the Balancing Act of Differential Privacy. Host: Rasmus Pagh |
5 - 11 December 2021 Jan van den Brand Simons-Berkeley Postdoctoral Researcher, USA. Host: Danupon Nanongkai |
2 - 12 November 2021 Joachim Spoerhase Research Associate at University of Würzburg, Germany and Research Fellow at Aalto University, Finland. During his visit he gave a talk on Constant-Factor Approximation for Ordered k-Median. Host: Danupon Nanongkai |
18 October - 13 November 2021 |
23 August - 17 December 2021 |
18 July - 26 September 2021 |
28 June - 09 July 2021 |
14 June - 29 August 2021 |
26 April - 10 July 2021 |
30 August - 3 September 2020 |
2 - 6 March 2020 Kitty Meeks Royal Society of Edinburgh Research Fellow at the University of Glasgow, UK. Host: Holger Dell |
2 - 6 March 2020 John Lapinskas Lecturer at the University of Bristol, UK. Host: Holger Dell |
1 - 14 March 2020 |
22 - 29 January 2020 |
2 - 5 & 10 - 11 December 2019 |
27 - 30 November 2019 Ken-ichi Kawarabayashi Professor at National Institute of Informatics Host: Mikkel Thorup |
25 - 29 November 2019 Daniela Kaufmann PhD student at the Institute for Formal Models and Verification, Johannes Kepler University, Austria. During her visit she gave a talk on Combining SAT and Computer Algebra to successfully verify Large Multiplier Circuits. Host: Jakob Nordström |
19 - 21 November 2019 Silvio Lattanzi Research scientist at Google Zurich, Switzerland. During his visit he gave a talk on Residual Based Sampling for Online Low Rank Approximation. Host: Nikos Parotsidis |
18 - 27 November 2019 Vincent Liew Associate PhD student at the University of Washington, USA. During his visit he gave a talk on Proof complexity with multiplier circuits. Host: Jakob Nordström |
18 - 22 November 2019 Cornelius Brand PhD student at Saarland University, Germany Host: Holger Dell |
18 - 22 November 2019 Kevin Pratt Doctoral Research Assistant at the Carnegie Mellon University in Pittsburgh, USA. During his visit he gave a talk on Waring rank, parameterized and exact algorithms. Host: Holger Dell |
17 - 23 November 2019 Chris Schwiegelshohn Assistant Professor, Sapienza, University of Rome, Italy Host: Nikos Parotsidis |
12 - 16 November 2019 Daniel Neuen PhD student at the RWTH Aachen University, Germany. During his visit he gave a talk on Faster Isomorphism Tests for Graphs of Bounded Degree and Beyond. Host: Holger Dell |
27 October - 1 November 2019 Loukas Georgiadis Associate Professor, University of Ioannina, Greece. During his visit he gave a talk on Dynamic Dominators, Low-High Orders, and Related Problems. Host: Nikos Parotsidis |
14 - 18 October 2019 Susan Margulies Assistant Professor, Department of Mathematics, United States Naval Academy, USA. During her visit she gave a talk on Hilbert's Nullstellensatz and Linear Algebra: An Algorithm for Determining Combinatorial Infeasibility. Host: Jakob Nordström |
7 - 11 October 2019 Vincent Cohen-Addad Permanent CNRS researcher at Sorbonne Université, Paris, France. During his visit he gave a talk on Local Search Algorithms Beyond the Worst-Case Analysis. Host: Mikkel Thorup |
3 October 2019 Petteri Kaski Assistant Professor, Aalto University, Finland. During his visit he gave a talk on Probabilistic tensors and opportunistic Boolean matrix multiplication. Host: Andreas Björklund |
30 September - 23 October 2019 Marc Vinyals Postdoc at the School of Technology and Computer Science at the Tata Institute of Fundamental Research in Mumbai, India. During his visit he gave a talk on Equality Alone Does not Simulate Randomness. Host: Jakob Nordström |
30 September - 11 October 2019 Anastasia Sofronova Laboratory Аssistant, St. Petersburg Department of Steklov Mathematical Institute of Russian Academy of Sciences, Russia Host: Jakob Nordström |
17 September 2019 Shou Pang Graduate Student at the University of Chicago, USA. During his visit he gave a talk on Large clique is hard on average for resolution. Host: Jakob Nordström |
16 September - 11 October 2019 Kilian Risse Graduate Student at the KTH Royal Institute of Technology, Sweden Host: Jakob Nordström |
26 - 30 August 2019 Chris Schwiegelshohn Assistant Professor, Sapienza, University of Rome, Italy Host: Nikos Parotsidis / Jacob Holm |
26 - 30 August 2019 Daniel Dadush Researcher at the Centrum Wiskunde & Informatica (CWI), Amsterdam, Netherlands. During his visit he gave a talk on A Friendly Smoothed Analysis of the Simplex Method. Host: Jakob Nordström |
16 - 19 July 2019 Adam Karczmarz Postdoc, Institute of Informatics, University of Warsaw, Poland Host: Nikos Parotsidis |
16 - 18 July 2019 Jakub Łącki Research scientist at Google Research, New York, USA. During his visit he gave a talk on Massively Parallel Algorithms for Finding Connected Components. Host: Nikos Parotsidis |
8 - 12 July 2019 John Kallaugher PhD student, University of Texas, Austin, USA. During his visit he gave a talk on Exponential Separations Between Turnstile Streaming and Linear Sketching. Host: Thomas Dybdahl Ahle |
1 July - 6 September 2019 Hongxun Wu Student, Tsinghua University, Beijing, China Host: Mikkel Thorup |
12 - 18 June 2019 Tillmann Miltzow Assistant Professor, Utrecht University, Netherlands. During his visit he gave a talk on Smoothe Analysis of the Art Gallery Problem. Host: Mikkel Abrahamsen |
10 - 13 June 2019 Chris Schwiegelshohn Assistant Professor, Sapienza, University of Rome, Italy. During his visit he gave a talk on Oblivious Dimension Reduction for k-Means. Host: Nikolaos Parotsidis |
6 - 13 June 2019 Thatchaphol Saranurak Research Assistant Professor, Toyota Technological Institute, Chicago, USA. During his visit he gave a talk on Breaking Quadratic Time for Small Vertex Connectivity. Host: Christian Wulff-Nilsen |
14 - 15 May 2019 Avi Wigderson Professor, Institute for Advanced Study, Princeton, USA. During his visit he gave a talk on Optimization, Complexity and Math. Host: Mikkel Thorup |
12 - 15 April 2019 Mika Göös Postdoc, Institute for Advanced Study, Princeton, USA. During his visit he gave a talk on Adventures in Monotone Complexity. Host: Mikkel Thorup |
11 - 12 April 2019 Rasmus Kyng Postdoc, Theory of Computation Group at Harvard, USA Host: Mikkel Thorup |
18 - 22 February 2019 Konrad Swanepoel Professor, Department of Mathematics, London School of Economics and Political Science, UK. During his visit he gave a talk on A survey of combinatorial distance problems in normed spaces. Host: Mikkel Abrahamsen |
13 - 14 February 2019 Aurélien Ooms PhD student in Algoritmhs Research Group, Université libre de Bruxelles, Belgium. During his visit he gave a talk on Sorting-like problems. Host: Mikkel Abrahamsen |
7 February 2019 Kasper Green Larsen Associate Professor, Ph.D. Department of Computer Science, Aarhus University, Denmark. During his visit he gave a talk on Exponential Lower Bounds for Secret Sharing. Host: Christian Wulff-Nilsen |
20 January - 4 February 2019 Timothy Chu Graduate Reseach Assistant at School of Computer Science, Carnegie Mellon University, Pittsburgh, USA. During his visit he gave a talk on Graph Sparsification via Short Cycle Decomposition. Host: Jacob Holm |
13 - 18 January 2019 Bartosz Walczak Theoretical Computer Science, Jagiellonian University, Poland. During his visit he gave a talk on Sparse Kneser graphs are Hamiltonian. Host: Mikkel Abrahamsen |
17 - 18 December 2018 Evangelos Kipouridis Researcher from Aristotle University of Thessaloniki, Greece Host: Mikkel Stephen Alstrup |
27 - 30 November 2018 Valerie King Professor at Department of Computer Science, University of Victoria, Canada. During her visist she gave a talk on Constructing a minimum spanning tree with sublinear communication in a distributed network. Host: Mikkel Thorup |
26 - 30 November 2018 Debarati Das PhD student at Charles University, Prague, Czech Republic. During her visit she gave a talk on Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time. Host: Mikkel Thorup |
6 - 8 November 2018 Claire Mathieu Professor and research director at CNRS, Paris, France. During her visit she gave a talk on Approximation schemes for rank aggregation. Host: Mikkel Thorup |
21 - 27 October 2018 Danupon Nanongkai Associate professor, docent at KTH, Sweden. During his visit he gave a talk on Distributed Shortest Paths, Exactly. Host: Mikkel Thorup |
21 - 26 October 2018 Vera Traub Ph.D student at University of Bonn, Germany. During her visist she gave a talk on Beating the integrality ratio for s-t-tours in graphs. Host: Mikkel Thorup |
16 September 2018- 15 January 2019 Uri Zwick Professor at Tel Aviv University, Israel Host: Mikkel Thorup |
1 October 2018- 31 January 2019 Or Zamir Research assistant at Tel Aviv University, Israel Host: Mikkel Thorup |
1 - 5 September 2018 Ken-ichi Kawarabayashi Professor at National Institute of Informatics, Japan Host: Mikkel Thorup |
23 - 31 July 2018 Aaron Bernstein Postdoc at The Technical University of Berlin, Germany Host: Christian Wulff-Nilsen |
11 - 15 June 2018 Petteri Kaski Assistant Professor at Aalto University, Helsinki, Finland. During his visit he gave a talk on How proofs are prepared at Camelot. Host: Thore Husfeldt |
6 - 8 June 2018 Robert Tarjan Professor at Princeton University, USA. During his visit he gave a talk on Finding and Verifying Dominators in Flow Graphs. Host: Stephen Alstrup |
1 - 5 June 2018 Yufei Tao Professor at Chinese University of Hong Kong. During his visit he gave a talk on Entity Matching with Active Monotone Classification. Host: Rasmus Pagh |
23 – 24 April 2018 Thatchaphol Saranurak PhD student at KTH Royal Institute of Technology, Sweden. During his visit he gave a talk on Pattern-avoiding Access in Binary Search Trees. Host: Mikkel Thorup |
12 – 18 April 2018 Holger Dell Independent Research Group Leader at Saarland University and the Cluster of Excellence, MMCI, Germany. During his visit he gave a talk on Lovász Meets Weisfeiler and Leman. Host: Thore Husfeldt |
7 March 2018 Kasper Green Larsen Assistant Professor at Aarhus University, Denmark. During his visit he gave a talk on Oblivious RAM Lower Bound. Host: Christian Wulff-Nilsen |
5 – 10 March 2018 Charalampos Tsourakakis Assistant Professor at Boston University, USA. During his visit he gave a talk on Predicting Positive and Negative Links with Noisy Queries: Theory & Practice. Host: Rasmus Pagh |
29 January – 2 February 2018 Yasuo Tabei Unit Leader at RIKEN Center for Advanced Intelligence Project, Japan Host: Rasmus Pagh |
18 – 22 December 2017 Michael Kapralov Assistant Professor at École Polytechnique Fédérale de Lausanne, Switzerland. During his visit he gave a talk on An Adaptive Sublinear-Time Block Sparse Fourier Transform. Host: Mikkel Thorup |
26 November – 2 December 2017 Or Zamir PhD student at Tel Aviv University, Israel Host: Stephen Alstrup |
24 November 2017 Anna Lubiw Professor at University of Waterloo, Canada Host: Mikkel Thorup |
24 November 2017 Helmut Alt Professor at Freie Universität Berlin, Germany Host: Mikkel Thorup |
14 – 17 November 2017 Danupon Nanongkai Assistant Professor at KTH Royal Institute of Technology, Sweden Host: Mikkel Thorup |
14 – 17 November 2017 Thatchaphol Saranurak PhD student at KTH Royal Institute of Technology, Sweden. During his visit he gave a talk on Dynamic Spanning Forest: Techniques and Connections to Other Fields. Host: Mikkel Thorup |
6 November 2017 Kasper Green Larsen Assistant Professor at Aarhus University, Denmark. During his visit he gave a talk on Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds. Host: Mikkel Thorup |
9 - 20 October 2017 Francesco Silvestri Assistant Professor at University of Padova, Italy Host: Thore Husfeldt |
9 - 13 October 2017 Cornelius Brand PhD student at Saarland University, Germany. During his visit he gave a talk on A unified algebraic approach to the longest path problem. Host: Thore Husfeldt |
2 - 5 October 2017 Ken-Ichi Kawarabayashi Professor at National Institute of Informatics Host: Mikkel Thorup |
25 - 29 September 2017 Valerie King Professor at University of Victoria Host: Mikkel Thorup |
25 - 29 September 2017 Uri Zwick Professor at Tel Aviv University. During his visit he gave a talk on Selection from heaps, row-sorted matrices and $X+Y$ using soft heaps. Host: Mikkel Thorup |
20 - 22 September 2017 Chris Schwiegelshohn Postdoc at the university la Sapienza in Roma. During his visit he gave a talk on Incremental Matching in Amortized Linear Time. Host: Vincent Viallat Cohen-Addad |
1 - 8 September 2017 Karl Bringmann Senior researcher at Max Planck Institute for Informatics. During his visit he gave a talk on SETH-Based Lower Bounds for Subset Sum and Bicriteria Path. Host: Mikkel Thorup More info |
Visit BARC
BARC is shaped by the people working at the center: PhD students, postdocs, core researchers, and others. In addition, a large number of visitors help create a fun, creative, and collaborative environment.
A typical visitor is an experienced algorithms researcher with papers in conferences such as STOC, FOCS, or SODA, or a promising junior researcher who would like to pursue a career in design and analysis of algorithms, or in an application area.
Some visitors are financed by their own grants, but BARC also has money to cover expenses in connection with visits. If you would like to visit, please contact one of the core researchers to inquire about the possibilities.