Coding for Interactive Communication and the Power of Adaptivity

Información del proyecto

Interactive

Identificador del acuerdo de subvención: 949707

DOI

10.3030/949707

Fecha de la firma de la CE 4 Septiembre 2020

Fecha de inicio 1 Enero 2021

Fecha de finalización 31 Diciembre 2026

Financiado con arreglo a

• EXCELLENT SCIENCE - European Research Council (ERC)

Coste total

€ 1 499 375,00

Aportación de la UE

€ 1 499 375,00

Coordinado por

BEN-GURION UNIVERSITY OF THE NEGEV
Israel

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Publicaciones

Peer reviewed articles (12)

Algorithmic aspects of temporal betweenness

Autores: Buß, Sebastian and Molter, Hendrik and Niedermeier, Rolf and Rymar, MacIej
Publicado en: Network Science, 2024, ISSN 2050-1250
Editor: 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

Autores: Fried, Sela
Publicado en: Statistics & Probability Letters, Edición 1, 2022, ISSN 0167-7152
Editor: Elsevier BV
DOI: 10.1016/j.spl.2022.109414

The complexity of transitively orienting temporal graphs

Autores: George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche
Publicado en: Journal of Computer and System Sciences, Edición 150, 2025, Página(s) 103630, ISSN 0022-0000
Editor: 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

Autores: Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
Publicado en: Journal of Computer and System Sciences,, 2024, ISSN 0022-0000
Editor: 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)$

Autores: Fried, Sela
Publicado en: Journal of Integer Sequences, Edición 1, 2022, ISSN 1530-7638
Editor: University of Waterloo
DOI: 10.48550/arxiv.2111.07331

Optimal Short-Circuit Resilient Formulas

Autores: Mark Braverman and Klim Efremenko and Ran Gelles and Michael A. Yitayew
Publicado en: J. {ACM}, 2022, ISSN 0004-5411
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3538390

Realizing temporal graphs from fastest travel times

Autores: Klobas, Nina; Mertzios, George B.; Molter, Hendrik; Spirakis, Paul G.
Publicado en: Journal of Computer and System Sciences, Edición 3, 2023, ISSN 0022-0000
Editor: Academic Press
DOI: 10.1016/j.jcss.2023.01.004

Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality

Autores: Maciej Rymar; Hendrik Molter; André Nichterlein; Rolf Niedermeier
Publicado en: Crossref, Edición 1, 2023, Página(s) 173-194, ISSN 1526-1719
Editor: Brown University
DOI: 10.7155/jgaa.00619

. On Finding Separators in Temporal Split and Permutation Graphs

Autores: Maack, N., Molter, H., Niedermeier, R., Renken, M.
Publicado en: Fundamentals of Computation Theory, 2023, ISSN 0022-0000
Editor: Academic Press
DOI: 10.1007/978-3-030-86593-1_27

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

Autores: Sela Fried
Publicado en: Statistical Inference for Stochastic Processes, Edición 1, 2022, ISSN 1572-9311
Editor: SPRINGER
DOI: 10.1007/s11203-022-09283-7

The Complexity of Computing Optimum Labelings for Temporal Connectivity

Autores: Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
Publicado en: Journal of Computer and System Sciences, 2023, ISSN 1090-2724
Editor: ScienceDirect
DOI: 10.2139/ssrn.4382912

Temporal reachability minimization: Delaying vs. deleting

Autores: Hendrik Molter , Malte Renken , Philipp Zschoche
Publicado en: Journal of Computer and System Sciences, 2024, ISSN 0022-0000
Editor: Academic Press
DOI: 10.1016/j.jcss.2024.103549

Conference proceedings (16)

Interactive Coding with Small Memory

Autores: Efremenko, Klim and Haeupler, Bernhard and Kalai, Yael Tauman and Kol, Gillat and Resch, Nicolas and Saxena, Raghuvansh R.
Publicado en: 2023
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977554.ch137

On Limits of Symbolic Approach to SAT Solving

Autores: Itsykson, Dmitry; Ovcharov, Sergei
Publicado en: Edición 3, 2024
Editor: "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

Autores: Efremenko, Klim; Kol, Gillat; Paramonov, Dmitry; Raz, Ran; Saxena, Raghuvansh R.
Publicado en: Edición 20, 2024
Editor: "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?

Autores: Pascal Kunz; Hendrik Molter; Meirav Zehavi
Publicado en: Crossref, Edición 1, 2023
Editor: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2023/21

Binary Codes with Resilience Beyond 1/4 via Interaction

Autores: Klim Efremenko; Gillat Kol; Raghuvansh R. Saxena; Zhijun Zhang
Publicado en: 2022
Editor: IEEE
DOI: 10.1109/focs54457.2022.00008

The Rate of Interactive Codes Is Bounded Away from 1

Autores: Efremenko, Klim and Kol, Gillat and Paramonov, Dmitry and Saxena, Raghuvansh R.
Publicado en: 2023
Editor: Association for Computing Machinery
DOI: 10.1145/3564246.3585249

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

Autores: Kaul, Matthias; Mnich, Matthias; Molter, Hendrik
Publicado en: Edición 4, 2024, ISBN 978-3-95977-353-9
Editor: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
DOI: 10.15480/882.13862

Computation over the Noisy Broadcast Channel with Malicious Parties.

Autores: Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
Publicado en: 2021
Editor: Schloss Dagstuhl--Leibniz-Zentrum
DOI: 10.4230/lipics.itcs.2021.82

Cluster Editing for Multi-Layer and Temporal Graphs

Autores: Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondřej Suchy
Publicado en: 2023
Editor: Research Square Platform LLC
DOI: 10.21203/rs.3.rs-2759843/v1

Temporal Graph Realization from Fastest Paths

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

Counting Temporal Paths

Autores: Enright, Jessica; Meeks, Kitty; Molter, Hendrik
Publicado en: Edición 4, 2023
Editor: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.stacs.2023.30

How to Make Knockout Tournaments More Popular?

Autores: haudhary, Juhi and Molter, Hendrik and Zehavi, Meirav
Publicado en: Proceedings of the AAAI Conference on Artificial Intelligence, 2024
Editor: {AAAI} Press
DOI: 10.1609/aaai.v38i9.28814

Lower Bounds for Regular Resolution over Parities

Autores: Klim Efremenko and Michal Garl{\'{\i}}k and Dmitry Itsykson
Publicado en: 2024
Editor: {ACM}
DOI: 10.1145/3618260.3649652

Protecting Single-Hop Radio Networks from Message Drops

Autores: Efremenko, Klim and Kol, Gillat and Paramonov, Dmitry and Saxena, Raghuvansh R.
Publicado en: 2023
Editor: "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}

Autores: Efremenko, Klim and Kol, Gillat and Paramonov, Dmitry and Saxena, Raghuvansh R.
Publicado en: 2023
Editor: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.itcs.2023.46

Tight Bounds for General Computation in Noisy Broadcast Networks.

Autores: Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
Publicado en: 2021
Editor: IEEE
DOI: 10.1109/focs52979.2021.00068