المؤلفون: Giakkoupis, George, Turau, Volker, Ziccardi, Isabella

المساهمون: the World Is Distributed Exploring the tension between scale and coordination (WIDE), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT), Hamburg University of Technology (TUHH), Bocconi University Milan, Italy, ANR-20-CE25-0002,ByBloS,Au-delà des Blockchains : Modules de construction pour les applications à grande échelle zero-confiance multi-utilisateurs(2020), European Project: 834861,H2020-EU.1.1.,834861,SO-ReCoDi(2019)

المصدر: Leibniz International Proceedings in Informatics (LIPIcs) ; 38th International Symposium on Distributed Computing (DISC 2024) ; https://inria.hal.science/hal-04896494 ; 38th International Symposium on Distributed Computing (DISC 2024), Oct 2024, Madrid, Spain. pp.28:1-28:21, ⟨10.4230/LIPIcs.DISC.2024.28⟩

مصطلحات موضوعية: Beeping Model, Theory of computation → Distributed algorithms, 2012 ACM Subject Classification Theory of computation → Distributed algorithms, Maximal Independent Set, Self-Stabilization, [INFO]Computer Science [cs]

جغرافية الموضوع: Spain

Time: Madrid, Spain

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2405.04266; info:eu-repo/grantAgreement//834861/EU/Spectral and Optimization Techniques for Robust Recovery, Combinatorial Constructions, and Distributed Algorithms/SO-ReCoDi; ARXIV: 2405.04266

الاتاحة: https://inria.hal.science/hal-04896494
https://inria.hal.science/hal-04896494v1/document
https://inria.hal.science/hal-04896494v1/file/2405.04266v2.pdf
https://doi.org/10.4230/LIPIcs.DISC.2024.28

المؤلفون: Giakkoupis, George, Turau, Volker, Ziccardi, Isabella

مصطلحات موضوعية: Distributed computing | Fault tolerance | Maximal independent set (MIS) | Self-stabilization, 0: Computer Science, Information and General Works::004: Computer Sciences

وصف الملف: application/pdf

Relation: Information processing letters; Projekt DEAL; Information Processing Letters 188: 106531 (2025); https://tore.tuhh.de/handle/11420/52099; https://doi.org/10.15480/882.13723

الاتاحة: https://tore.tuhh.de/handle/11420/52099
https://doi.org/10.15480/882.13723

المؤلفون: Blin, Lélia, Durand, Anaïs, Tixeuil, Sébastien

المساهمون: Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA), Networks and Performance Analysis (NPA), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom Paris (IMT)-Sorbonne Université (SU), Institut universitaire de France (IUF), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), ANR-16-CE25-0009,ESTATE,Auto-stabilisation et amélioration de la sûreté dans les environnements distribués évoluant dans le temps(2016)

المصدر: ISSN: 0304-3975.

مصطلحات موضوعية: Self-stabilizing algorithm, Message passing, Unbounded capacity communication, Nodes coloring, Maximal independent set, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2002.05382; hal-04685228; https://uca.hal.science/hal-04685228; https://uca.hal.science/hal-04685228/document; https://uca.hal.science/hal-04685228/file/main.pdf; ARXIV: 2002.05382

الاتاحة: https://uca.hal.science/hal-04685228
https://uca.hal.science/hal-04685228/document
https://uca.hal.science/hal-04685228/file/main.pdf
https://doi.org/10.1016/j.tcs.2024.114744

المؤلفون: Krivelevich, Michael, Mészáros, Tamás, Michaeli, Peleg, Shikhelman, Clara

مصطلحات موضوعية: greedy maximal independent set, local limit, random graph, ddc:510

وصف الملف: 30 Seiten; application/pdf

Relation: https://refubium.fu-berlin.de/handle/fub188/42062; http://dx.doi.org/10.17169/refubium-41787

الاتاحة: https://refubium.fu-berlin.de/handle/fub188/42062
https://doi.org/10.17169/refubium-41787
https://doi.org/10.1002/rsa.21200

المؤلفون: Stanovic, Stevan, Gaüzère, Benoit, Brun, Luc

المساهمون: École Nationale Supérieure d'Ingénieurs de Caen (ENSICAEN), Normandie Université (NU), Université de Caen Normandie (UNICAEN), Equipe Image - Laboratoire GREYC - UMR6072, Groupe de Recherche en Informatique, Image et Instrumentation de Caen (GREYC), Normandie Université (NU)-Normandie Université (NU)-École Nationale Supérieure d'Ingénieurs de Caen (ENSICAEN), Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS)-Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS), Institut national des sciences appliquées Rouen Normandie (INSA Rouen Normandie), Institut National des Sciences Appliquées (INSA)-Normandie Université (NU), Université de Rouen Normandie (UNIROUEN), Université Le Havre Normandie (ULH), Laboratoire d'Informatique, du Traitement de l'Information et des Systèmes (LITIS), Normandie Université (NU)-Normandie Université (NU)-Université de Rouen Normandie (UNIROUEN), Normandie Université (NU)-Institut national des sciences appliquées Rouen Normandie (INSA Rouen Normandie), Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Institut National des Sciences Appliquées (INSA), ANR-21-CE23-0025,CoDeGNN,Convolution et Decimation pour les réseaux de neurones sur graphes(2021)

المصدر: 13th IAPR-TC15 International Workshop on Graph-Based Representations in Pattern Recognition (GbR 2023)
https://hal.science/hal-04160860
13th IAPR-TC15 International Workshop on Graph-Based Representations in Pattern Recognition (GbR 2023), Sep 2023, Vietri Sul Mare, Italy. ⟨10.1007/978-3-031-42795-4_11⟩

مصطلحات موضوعية: Graph Neural Networks, Graph Pooling, Graph Classification, Maximal Independent Set, Edge Selection, Graph Neural Networks Graph Pooling Graph Classification Maximal Independent Set Edge Selection, [STAT.ML]Statistics [stat]/Machine Learning [stat.ML], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]

جغرافية الموضوع: Vietri Sul Mare, Italy

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2307.13011; hal-04160860; https://hal.science/hal-04160860; https://hal.science/hal-04160860/document; https://hal.science/hal-04160860/file/Maximal%20Independent%20Sets%20for%20Pooling%20in%20Graph%20Neural%20Networks.pdf; ARXIV: 2307.13011

الاتاحة: https://hal.science/hal-04160860
https://hal.science/hal-04160860/document
https://hal.science/hal-04160860/file/Maximal%20Independent%20Sets%20for%20Pooling%20in%20Graph%20Neural%20Networks.pdf
https://doi.org/10.1007/978-3-031-42795-4_11

المؤلفون: Dubois, Swan, Feuilloley, Laurent, Petit, Franck, Rabie, Mikaël

المساهمون: DistributEd aLgorithms and sYStems (DELYS), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Graphes, AlgOrithmes et AppLications (GOAL), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), ANR-22-CE25-0008,SKYDATA,Un nouveau paradigme de donnée: Les données autononomes et intelligentes(2022), ANR-18-CE40-0032,GrR,Reconfiguration de Graphes(2018)

المصدر: 2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)
https://hal.science/hal-04101692
2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023), Jun 2023, Pisa, Italy. pp.7:1--7:15, ⟨10.4230/LIPIcs.SAND.2023.7⟩

مصطلحات موضوعية: NP-hardness, Robustness, dynamic network, temporal graphs, edge removal, connectivity, packing/covering problems, maximal independent set, maximal matching, minimum dominating set, perfect matching, [INFO]Computer Science [cs]

جغرافية الموضوع: Pisa, Italy

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2304.05831; ARXIV: 2304.05831

الاتاحة: https://hal.science/hal-04101692
https://hal.science/hal-04101692v2/document
https://hal.science/hal-04101692v2/file/LIPIcs.SAND.2023.7.pdf
https://doi.org/10.4230/LIPIcs.SAND.2023.7

المؤلفون: Giakkoupis, George, Ziccardi, Isabella

المساهمون: the World Is Distributed Exploring the tension between scale and coordination (WIDE), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT), Bocconi University Milan, Italy, ANR-20-CE25-0002,ByBloS,Au-delà des Blockchains : Modules de construction pour les applications à grande échelle zero-confiance multi-utilisateurs(2020)

المصدر: PODC 2023 - ACM Symposium on Principles of Distributed Computing ; https://inria.hal.science/hal-04393730 ; PODC 2023 - ACM Symposium on Principles of Distributed Computing, Jun 2023, Orlando (FL), United States. pp.310-320, ⟨10.1145/3583668.3594581⟩

مصطلحات موضوعية: maximal independent set, parallel/distributed algorithms, self-stabilizing algorithms, beeping model, [INFO]Computer Science [cs]

جغرافية الموضوع: Orlando (FL), United States

الاتاحة: https://inria.hal.science/hal-04393730
https://inria.hal.science/hal-04393730v1/document
https://inria.hal.science/hal-04393730v1/file/ssMIS.pdf
https://doi.org/10.1145/3583668.3594581

المؤلفون: Ghaffari, Mohsen, Grunau, Christoph, id_orcid:0 000-0002-1057-9429

المساهمون: Saha, Barna, Servedio, Rocco A.

المصدر: STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of Computing

مصطلحات موضوعية: distributed algorithms, maximal independent set, matching, derandomization, rounding

وصف الملف: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-1-4503-9913-5; info:eu-repo/semantics/altIdentifier/wos/001064640700144; info:eu-repo/grantAgreement/EC/H2020/853109; http://hdl.handle.net/20.500.11850/620429; urn:isbn:978-1-4503-9913-5

الاتاحة: https://hdl.handle.net/20.500.11850/620429
https://doi.org/10.3929/ethz-b-000620429

المؤلفون: Naoki KITAMURA, Rongcheng DONG, Taisuke IZUMI, Toshimitsu MASUZAWA, Yuichi SUDO

المصدر: IEICE Transactions on Information and Systems. 2023, E106.D(11):1762

المؤلفون: Antaki, Shiri, Liu, Quanquan C., Solomon, Shay

المساهمون: Shiri Antaki and Quanquan C. Liu and Shay Solomon

مصطلحات موضوعية: dynamic graph algorithms, distributed algorithms, symmetry breaking problems, maximal independent set, matching, coloring

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.7

الاتاحة: https://doi.org/10.4230/LIPIcs.ITCS.2022.7
https://nbn-resolving.org/urn:nbn:de:0030-drops-156039
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.7

المؤلفون: Fahimeh Esmaeeli, Ahmad Erfanian, Madjid Mirzavaziri

المصدر: Electronic Journal of Graph Theory and Applications, Vol 9, Iss 1, Pp 223-234 (2021)

مصطلحات موضوعية: vector weighted stirling numbers, generalized stirling numbers, $k$-intersection graph, maximal independent set, stirling numbers, Mathematics, QA1-939

وصف الملف: electronic resource

Relation: https://www.ejgta.org/index.php/ejgta/article/view/1180; https://doaj.org/toc/2338-2287

URL الوصول: https://doaj.org/article/2dc0d446e65a4e5e82cef39c6c9d3acf

المؤلفون: Vyacheslav Korolyov, Oleksandr Khodzinskyi

المصدر: Кібернетика та комп'ютерні технології, Iss 2, Pp 5-13 (2020)

مصطلحات موضوعية: quantum computer, quantum computer mathematics, qubit, maximal independent set for a graph, Cybernetics, Q300-390

وصف الملف: electronic resource

Relation: http://cctech.org.ua/13-vertikalnoe-menyu-en/122-abstract-20-2-1-arte; https://doaj.org/toc/2707-4501; https://doaj.org/toc/2707-451X

URL الوصول: https://doaj.org/article/8b649e9ab7ed45cc97319d814d357bb7

المؤلفون: Giakkoupis, George, Turau, Volker, Ziccardi, Isabella

مصطلحات موضوعية: beeping model, maximal independent set, self-stabilization, 0: Computer Science, Information and General Works::005: Computer Programming, Programs, Data and Security

Relation: 43rd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2024; https://hdl.handle.net/11420/48666

الاتاحة: https://hdl.handle.net/11420/48666

المؤلفون: Krivelevich, Michael, Mészáros, Tamás, Michaeli, Peleg, Shikhelman, Clara

المساهمون: Michael Krivelevich and Tamás Mészáros and Peleg Michaeli and Clara Shikhelman

مصطلحات موضوعية: Greedy maximal independent set, random graph, local limit

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 159, 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.20

الاتاحة: https://doi.org/10.4230/LIPIcs.AofA.2020.20
https://nbn-resolving.org/urn:nbn:de:0030-drops-120507
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.20

المؤلفون: Delmas, Jean-François, Dronnier, Dylan, Zitt, Pierre-André

المساهمون: Centre d'Enseignement et de Recherche en Mathématiques et Calcul Scientifique (CERMICS), École des Ponts ParisTech (ENPC), Laboratoire Analyse et Mathématiques Appliquées (LAMA), Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel, Université Gustave Eiffel

المصدر: https://hal.archives-ouvertes.fr/hal-03391546 ; 2021.

مصطلحات موضوعية: effective reproduction number, multi-objective optimization, Pareto frontier, maximal independent set, vaccination strategy, kernel operator, October 22, 2021. 2010 Mathematics Subject Classification. 92D30, 47B34, 47A25, 58E17 Kernel operator, maximal independent set. This work is partially supported by Labex Bézout reference ANR-10-LABX-58, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2110.12693; hal-03391546; https://hal.archives-ouvertes.fr/hal-03391546; https://hal.archives-ouvertes.fr/hal-03391546/document; https://hal.archives-ouvertes.fr/hal-03391546/file/main.pdf; ARXIV: 2110.12693

الاتاحة: https://hal.archives-ouvertes.fr/hal-03391546
https://hal.archives-ouvertes.fr/hal-03391546/document
https://hal.archives-ouvertes.fr/hal-03391546/file/main.pdf

المؤلفون: Necla Kırcalı Gürsoy, Alper Ülker, Arif Gürsoy

المصدر: Soft Computing. 26:6989-6997

مصطلحات موضوعية: Zero-divisor Graph, Zero-divisor graph, Independent Dominating Set, Independent set, Independent Set, Domination number, Maximal Independent Set, Independent domination polynomial, Independent dominating set, Theoretical Computer Science, Domination Number, Independent Domination Polynomial, Geometry and Topology, Maximal independent set, Software

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0998fd2ee79f0bf32dfb446980a3cf36
https://doi.org/10.1007/s00500-022-07217-2

المؤلفون: Ghaffari, Mohsen, Portmann, Julian

المساهمون: Suomela, Jukka

المصدر: Leibniz International Proceedings in Informatics (LIPIcs), 146 ; 33rd International Symposium on Distributed Computing (DISC 2019)

مصطلحات موضوعية: Distributed graph algorithms, Network decomposition, Maximal independent set, Neighborhood covers

وصف الملف: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-126-9; info:eu-repo/grantAgreement/SNF/Projekte MINT/184735; http://hdl.handle.net/20.500.11850/377526; urn:isbn:978-3-95977-126-9

الاتاحة: https://hdl.handle.net/20.500.11850/377526
https://doi.org/10.3929/ethz-b-000377526

المؤلفون: Konrad, Christian, Pemmaraju, Sriram V., Riaz, Talal, Robinson, Peter

المساهمون: Christian Konrad and Sriram V. Pemmaraju and Talal Riaz and Peter Robinson

مصطلحات موضوعية: communication complexity, information theory, k-machine model, maximal independent set, ruling set, streaming algorithms

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 146, 33rd International Symposium on Distributed Computing (DISC 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.26

الاتاحة: https://doi.org/10.4230/LIPIcs.DISC.2019.26
https://nbn-resolving.org/urn:nbn:de:0030-drops-113337
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.26

المؤلفون: Censor-Hillel, Keren, Rabie, Mikaël

المساهمون: Keren Censor-Hillel and Mikaël Rabie

مصطلحات موضوعية: distributed graph algorithms, reconfiguration, maximal independent set

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.135

الاتاحة: https://doi.org/10.4230/LIPIcs.ICALP.2019.135
https://nbn-resolving.org/urn:nbn:de:0030-drops-107111
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.135

المؤلفون: Assadi, Sepehr, Solomon, Shay

المساهمون: Sepehr Assadi and Shay Solomon

مصطلحات موضوعية: Maximal Independent Set, Maximal Matching, Sublinear-Time Algorithms, Bounded Neighborhood Independence

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.17

الاتاحة: https://doi.org/10.4230/LIPIcs.ICALP.2019.17
https://nbn-resolving.org/urn:nbn:de:0030-drops-105931
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.17