Project Details
Description
Basic Algorithms Research Copenhagen (BARC) seeks fundamental understanding of the complexity of algorithmic problems, i.e., how computers can solve problems with minimal resources. The research is theoretical, but with a strong record for real-word impact. We attract top talent from around the world to join our ambitious, creative, and collaborative environment. By exploring high-impact areas with significant gaps in our understanding, we strive to make surprising discoveries that challenge the status quo. For instance, random hash functions are integral to data analysis, but there are significant gaps between theoretical understanding and practical implementation. Our mission is to bridge such divides and establish fundamental limits on algorithmic efficiency.
| Acronym | BARC |
|---|---|
| Status | Finished |
| Effective start/end date | 01/09/2017 → 31/08/2024 |
Collaborative partners
- IT University of Copenhagen
- University of Copenhagen (lead)
Funding
- Villum Foundation: DKK39,974,950.00
Keywords
- Algorithms
Fingerprint
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.
Research output
- 3 Article in proceedings
-
#SAT-Algorithms for Classes of Threshold Circuits Based on Probabilistic Rank
Limaye, N., Srinivasan, A. & Srinivasan, S., 20 Aug 2025, 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, p. 1-18 18 p. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 345).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open Access -
Efficient Differentially Private F0 Linear Sketching
Pagh, R. & Nielsen, N. M. S., 2021, 24th International Conference on Database Theory (ICDT 2021). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, (Leibniz International Proceedings in Informatics (LIPIcs)).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
Hardness of Bichromatic Closest Pair with Jaccard Similarity
Pagh, R., Nielsen, N. M. S. & Thorup, M., 2019, LIPIcs - Leibniz International Proceedings in Informatics - 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Vol. 144. p. 80:1–80:13 13 p. 80. (Leibniz International Proceedings in Informatics).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile
Projects
- 1 Active
-
BARC2 : Basic Algorithms Research Copenhagen
Husfeldt, T. (PI), Limaye, N. (CoI), Björklund, A. (CoI), Lebeda, C. J. (CoI) & Hansen, M. R. D. (CoI)
01/01/2024 → 31/12/2029
Project: Research