Coding for Interactive Communication and the Power of Adaptivity

Project Information

Interactive

Grant agreement ID: 949707

DOI

10.3030/949707

EC signature date 4 September 2020

Start date 1 January 2021

End date 31 December 2026

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 499 375,00

EU contribution

€ 1 499 375,00

Coordinated by

BEN-GURION UNIVERSITY OF THE NEGEV
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

Peer reviewed articles (12)

Algorithmic aspects of temporal betweenness

Author(s): Buß, Sebastian and Molter, Hendrik and Niedermeier, Rolf and Rymar, MacIej
Published in: Network Science, 2024, ISSN 2050-1250
Publisher: Cambridge University Press
DOI: 10.1017/nws.2024.5

The restrictiveness of the hazard rate order and the moments of the maximal coordinate of a random vector uniformly distributed on the probability n-simplex

Author(s): Fried, Sela
Published in: Statistics & Probability Letters, Issue 1, 2022, ISSN 0167-7152
Publisher: Elsevier BV
DOI: 10.1016/j.spl.2022.109414

The complexity of transitively orienting temporal graphs

Author(s): George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche
Published in: Journal of Computer and System Sciences, Issue 150, 2025, Page(s) 103630, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1016/j.jcss.2025.103630

On the parameterized complexity of interval scheduling with eligible machine sets,Journal of Computer and System Sciences

Author(s): Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
Published in: Journal of Computer and System Sciences,, 2024, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1016/j.jcss.2024.103533

On the coefficients of the distinct monomials in the expansion of $x_1(x_1+x_2)\cdots(x_1+x_2+\cdots+x_n)$

Author(s): Fried, Sela
Published in: Journal of Integer Sequences, Issue 1, 2022, ISSN 1530-7638
Publisher: University of Waterloo
DOI: 10.48550/arxiv.2111.07331

Optimal Short-Circuit Resilient Formulas

Author(s): Mark Braverman and Klim Efremenko and Ran Gelles and Michael A. Yitayew
Published in: J. {ACM}, 2022, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3538390

Realizing temporal graphs from fastest travel times

Author(s): Klobas, Nina; Mertzios, George B.; Molter, Hendrik; Spirakis, Paul G.
Published in: Journal of Computer and System Sciences, Issue 3, 2023, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1016/j.jcss.2023.01.004

Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality

Author(s): Maciej Rymar; Hendrik Molter; André Nichterlein; Rolf Niedermeier
Published in: Crossref, Issue 1, 2023, Page(s) 173-194, ISSN 1526-1719
Publisher: Brown University
DOI: 10.7155/jgaa.00619

. On Finding Separators in Temporal Split and Permutation Graphs

Author(s): Maack, N., Molter, H., Niedermeier, R., Renken, M.
Published in: Fundamentals of Computation Theory, 2023, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1007/978-3-030-86593-1_27

On the $$\alpha $$-lazy version of Markov chains in estimation and testing problems

Author(s): Sela Fried
Published in: Statistical Inference for Stochastic Processes, Issue 1, 2022, ISSN 1572-9311
Publisher: SPRINGER
DOI: 10.1007/s11203-022-09283-7

The Complexity of Computing Optimum Labelings for Temporal Connectivity

Author(s): Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
Published in: Journal of Computer and System Sciences, 2023, ISSN 1090-2724
Publisher: ScienceDirect
DOI: 10.2139/ssrn.4382912

Temporal reachability minimization: Delaying vs. deleting

Author(s): Hendrik Molter , Malte Renken , Philipp Zschoche
Published in: Journal of Computer and System Sciences, 2024, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1016/j.jcss.2024.103549

Conference proceedings (16)

Interactive Coding with Small Memory

Author(s): Efremenko, Klim and Haeupler, Bernhard and Kalai, Yael Tauman and Kol, Gillat and Resch, Nicolas and Saxena, Raghuvansh R.
Published in: 2023
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977554.ch137

On Limits of Symbolic Approach to SAT Solving

Author(s): Itsykson, Dmitry; Ovcharov, Sergei
Published in: Issue 3, 2024
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.sat.2024.19

Information Dissemination via Broadcasts in the Presence of Adversarial Noise

Author(s): Efremenko, Klim; Kol, Gillat; Paramonov, Dmitry; Raz, Ran; Saxena, Raghuvansh R.
Published in: Issue 20, 2024
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik}"
DOI: 10.4230/lipics.ccc.2024.19

In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?

Author(s): Pascal Kunz; Hendrik Molter; Meirav Zehavi
Published in: Crossref, Issue 1, 2023
Publisher: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2023/21

Binary Codes with Resilience Beyond 1/4 via Interaction

Author(s): Klim Efremenko; Gillat Kol; Raghuvansh R. Saxena; Zhijun Zhang
Published in: 2022
Publisher: IEEE
DOI: 10.1109/focs54457.2022.00008

The Rate of Interactive Codes Is Bounded Away from 1

Author(s): Efremenko, Klim and Kol, Gillat and Paramonov, Dmitry and Saxena, Raghuvansh R.
Published in: 2023
Publisher: Association for Computing Machinery
DOI: 10.1145/3564246.3585249

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates

Author(s): Kaul, Matthias; Mnich, Matthias; Molter, Hendrik
Published in: Issue 4, 2024, ISBN 978-3-95977-353-9
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
DOI: 10.15480/882.13862

Computation over the Noisy Broadcast Channel with Malicious Parties.

Author(s): Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
Published in: 2021
Publisher: Schloss Dagstuhl--Leibniz-Zentrum
DOI: 10.4230/lipics.itcs.2021.82

Cluster Editing for Multi-Layer and Temporal Graphs

Author(s): Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondřej Suchy
Published in: 2023
Publisher: Research Square Platform LLC
DOI: 10.21203/rs.3.rs-2759843/v1

Temporal Graph Realization from Fastest Paths

Author(s): Klobas, Nina and Mertzios, George B. and Molter, Hendrik and Spirakis, Paul G.
Published in: 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024, ISSN 1868-8969
Publisher: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/lipics.sand.2024.16

Counting Temporal Paths

Author(s): Enright, Jessica; Meeks, Kitty; Molter, Hendrik
Published in: Issue 4, 2023
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.stacs.2023.30

How to Make Knockout Tournaments More Popular?

Author(s): haudhary, Juhi and Molter, Hendrik and Zehavi, Meirav
Published in: Proceedings of the AAAI Conference on Artificial Intelligence, 2024
Publisher: {AAAI} Press
DOI: 10.1609/aaai.v38i9.28814

Lower Bounds for Regular Resolution over Parities

Author(s): Klim Efremenko and Michal Garl{\'{\i}}k and Dmitry Itsykson
Published in: 2024
Publisher: {ACM}
DOI: 10.1145/3618260.3649652

Protecting Single-Hop Radio Networks from Message Drops

Author(s): Efremenko, Klim and Kol, Gillat and Paramonov, Dmitry and Saxena, Raghuvansh R.
Published in: 2023
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.icalp.2023.53

{Noisy Radio Network Lower Bounds via Noiseless Beeping Lower Bounds}

Author(s): Efremenko, Klim and Kol, Gillat and Paramonov, Dmitry and Saxena, Raghuvansh R.
Published in: 2023
Publisher: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.itcs.2023.46

Tight Bounds for General Computation in Noisy Broadcast Networks.

Author(s): Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
Published in: 2021
Publisher: IEEE
DOI: 10.1109/focs52979.2021.00068