Investigating the Conjectures of Fine-Grained Complexity

Project Information

CONJEXITY

Grant agreement ID: 101078482

DOI

10.3030/101078482

EC signature date 15 November 2022

Start date 1 December 2022

End date 30 November 2027

Funded under

• European Research Council (ERC)

Total cost

€ 1 499 250,00

EU contribution

€ 1 499 250,00

Coordinated by

WEIZMANN INSTITUTE OF SCIENCE
Israel

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Conference proceedings (8)

Worst-Case to Expander-Case Reductions

Author(s): Abboud and Wallheimer
Published in: ITCS 2023, 2023
Publisher: LIPIcs
DOI: 10.4230/LIPIcs.ITCS.2023.1

Deterministic 3SUM-Hardness

Author(s): Fischer, Kaliciak, Polak
Published in: ITCS 2024, 2024
Publisher: LIPIcs
DOI: 10.4230/LIPIcs.ITCS.2024.49

Worst-Case to Expander-Case Reductions: Derandomized and Generalized

Author(s): Abboud and Wallheimer
Published in: ESA 2024, 2024
Publisher: LIPIcs
DOI: 10.4230/LIPIcs.ESA.2024.4

Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics

Author(s): Abboud, Bringmann, Fischer
Published in: STOC 2023, 2023
Publisher: ACM
DOI: 10.1145/3564246.3585240

All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time

Author(s): Abboud, Li, Panigrahi, Saranurak
Published in: FOCS 2023, 2023
Publisher: IEEE
DOI: 10.1109/FOCS57990.2023.00137

Listing 4-cycles

Author(s): Abboud, Khoury, Leibowitz, Safier
Published in: FSTTCS 2023, 2023
Publisher: LIPIcs
DOI: 10.4230/LIPIcs.FSTTCS.2023.25

The Time Complexity of Fully Sparse Matrix Multiplication

Author(s): Abboud, Bringmann, Fischer, Kunnemann
Published in: SODA 2024, 2024
Publisher: SIAM
DOI: 10.1137/1.9781611977912.167

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms

Author(s): Abboud, Fischer, Kelly, Meka, Lovett
Published in: STOC 2024, 2024
Publisher: ACM
DOI: 10.1145/3618260.3649696

Book chapters (1)

Faster Combinatorial k-Clique Algorithms

Author(s): Amir Abboud, Nick Fischer, Yarin Shechter
Published in: Lecture Notes in Computer Science, LATIN 2024: Theoretical Informatics, 2024
Publisher: Springer Nature Switzerland
DOI: 10.1007/978-3-031-55598-5_13