Seminal
The magazine and atlas of EU-funded researchA new publication from the web and AI team at Scott Charnley

Atlas / Israel

European Research Council grant · Running

DERAND Optimal Tradeoffs between Randomness, Time, and Space

Coordinator
Ben-Gurion University of the Negev, Israel
Runs
1 December 2026 to 30 November 2031
Status
Running
EU funding
€1.5m
Total cost
€1.5m
Partners
1 organisations in 1 countries
Type
European Research Council grant
Grant agreement
101301055

What the project is doing

In the project's own words, from its summary on CORDIS.

Randomization is remarkably effective in algorithm design. In practice, randomized algorithms often outperform their deterministic counterparts; for example, there are randomized linear-time algorithms for problems where the best-known deterministic algorithms require exponential time. Yet, randomness is itself a computational resource, which may be scarce or costly. While some settings---such as cryptography---provably require randomness, in many others, notably time- and space-bounded computation, the situation is less clear.

This raises the central question of when randomness is necessary or useful for efficient algorithms, and how to devise practical, generic recipes for efficient derandomization. In cases where randomness is indispensable, one typically requires access to purely random bits; however, natural sources of randomness are usually defective, making it a central goal to purify such crude randomness in a way suitable for applications.

Understanding the power and limitations of derandomization is one of the biggest challenges in complexity theory, with deep connections to many other areas. This project tackles fundamental problems in derandomization and pseudorandomness, aiming to resolve the longstanding BPL vs. L problem, settling whether randomness is needed for space-efficient computation. It will also deepen the study of minimal-overhead derandomization, producing deterministic algorithms that match, up to negligible loss, the speed and memory footprint of their randomized counterparts.

In parallel, it will develop the efficient use of weak randomness in algorithms and cryptographic protocols. A unifying theme across all goals is the design of new pseudorandomness primitives and the development of computational analogues of fundamental random-like mathematical structures. The project's outcomes are expected not only to push the frontiers of pseudorandomness but also to have a broad impact on other areas of computer science.

Topics

Who is involved

OrganisationCityCountryRole
Ben-Gurion University of the NegevBeer ShevaIsraelCoordinator

Source: CORDIS, European Commission. Data of 5 Nov 2026, reused under the Commission's reuse policy. View on CORDIS · Grant DOI