Výsledky vyhledávání - "• Theory of computation → Communication complexity"

Limits of Preprocessing

Autoři: Filmus, Yuval Ishai, Yuval Kaplan, Avi a další

Přispěvatelé: Filmus, Yuval Ishai, Yuval Kaplan, Avi a další

Zdroj: 35th Computational Complexity Conference

Témata: Theory of computation → Communication complexity, IPPP, 4. Education, 16. Peace & justice, simultaneous messages, 7. Clean energy, communication complexity, ddc:004, preprocessing, Theory of computation → Computational complexity and cryptography, circuit, Theory of computation → Circuit complexity, PRF

Popis souboru: application/pdf

Přístupová URL adresa: https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2020.17
https://dblp.uni-trier.de/db/conf/coco/coco2020.html#FilmusIKK20
https://doi.org/10.4230/LIPIcs.CCC.2020.17
https://drops.dagstuhl.de/opus/volltexte/2020/12569/pdf/LIPIcs-CCC-2020-17.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/12569/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.17

Protecting Single-Hop Radio Networks from Message Drops

Autoři: Efremenko, Klim Kol, Gillat Paramonov, Dmitry a další

Přispěvatelé: Efremenko, Klim Kol, Gillat Paramonov, Dmitry a další

Témata: Theory of computation → Communication complexity, Interactive Coding, ddc:004, Radio Networks, Error Correcting Codes

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.53

Noisy Radio Network Lower Bounds via Noiseless Beeping Lower Bounds

Autoři: Efremenko, Klim Kol, Gillat Paramonov, Dmitry a další

Přispěvatelé: Efremenko, Klim Kol, Gillat Paramonov, Dmitry a další

Témata: Theory of computation → Communication complexity, ddc:004, Beeping Model, Radio Networks

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.46

Repeated Agreement is Cheap! On Weak Accountability and Multishot Byzantine Agreement

Autoři: Civit, Pierre Philippe Dzulfikar, Muhammad Ayaz Gilbert, Seth a další

Témata: CCS Concepts, Theory of computation → Communication complexity, Distributed computing models, Distributed algorithms, • Security and privacy → Distributed systems security, Formal security models, Cryptography Byzantine, Agreement, Consensus, Amortized Complexity, Optimal, Synchrony

Relation: PODC '25: Proceedings of the ACM Symposium on Principles of Distributed Computing; 44th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2025); 979-8-4007-1885-4; #PLACEHOLDER_PARENT_METADATA_VALUE#; MOE-T2EP20122-0014; #40B2-0_218648,#200021_215383; https://infoscience.epfl.ch/handle/20.500.14299/251313

Dostupnost: https://doi.org/10.1145/3732772.3733520
https://infoscience.epfl.ch/handle/20.500.14299/251313
https://hdl.handle.net/20.500.14299/251313

Algebraic Barriers to Halving Algorithmic Information Quantities in Correlated Strings

Autoři: Romashchenko, Andrei Exact Computing (LIRMM Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) a další

Přispěvatelé: Romashchenko, Andrei Exact Computing (LIRMM Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) a další

Zdroj: 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025)
https://hal-lirmm.ccsd.cnrs.fr/lirmm-05041918
50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), Aug 2025, Warsaw (POLAND), Poland. pp.84:1-84:18, ⟨10.4230/LIPIcs.MFCS.2025.84⟩

Témata: Mathematics of computing → Information theory, discrete geometry, communication complexity, Theory of computation → Communication complexity, algorithmic information theory, Kolmogorov complexity, Security and privacy → Information-theoretic techniques, Mathematics of computing → Combinatoric problems, [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Geografické téma: Warsaw (POLAND), Poland

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

Dostupnost: https://hal-lirmm.ccsd.cnrs.fr/lirmm-05041918
https://doi.org/10.4230/LIPIcs.MFCS.2025.84

Submodular Maximization Subject to Matroid Intersection on the Fly

Autoři: Feldman, Moran Norouzi-Fard, Ashkan Svensson, Ola a další

Přispěvatelé: Feldman, Moran Norouzi-Fard, Ashkan Svensson, Ola a další

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs), 244
30th Annual European Symposium on Algorithms (ESA 2022)

Témata: FOS: Computer and information sciences, Theory of computation → Communication complexity, F.2.2, G.2.1, Discrete Mathematics (cs.DM), Submodular Maximization, matroid intersection, Streaming Algorithms, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 68R05 (Primary) 68W27, 68Q25, 90C27 (Secondary), Computer Science - Data Structures and Algorithms, Matroid Intersection, Data Structures and Algorithms (cs.DS), ddc:004, Computer Science - Discrete Mathematics

Popis souboru: application/pdf; application/application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2204.05154
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.52
http://hdl.handle.net/20.500.11850/571185

Larger Corner-Free Sets from Combinatorial Degenerations

Autoři: Christandl, Matthias Fawzi, Omar Ta, Hoang a další

Přispěvatelé: Christandl, Matthias Fawzi, Omar Ta, Hoang a další

Zdroj: Christandl, M, Fawzi, O, Ta, H & Zuiddam, J 2022, Larger Corner-Free Sets from Combinatorial Degenerations . in 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) ., 48, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics, LIPIcs, vol. 215, pp. 1-20, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022), Virtuel, 31/01/2022 . https://doi.org/10.4230/LIPIcs.ITCS.2022.48

Témata: FOS: Computer and information sciences, Theory of computation → Communication complexity, number on the forehead, Mathematics of computing → Discrete mathematics, Corner-free sets, 0102 computer and information sciences, [INFO] Computer Science [cs], Computational Complexity (cs.CC), combinatorial degeneration, 01 natural sciences, 05D10, 05C65, Computer Science - Computational Complexity, hypergraphs, Shannon capacity, FOS: Mathematics, Mathematics - Combinatorics, communication complexity, Combinatorics (math.CO), ddc:004, 0101 mathematics, Theory of computation → Algebraic complexity theory, eval problem

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2111.08262
https://hal.science/hal-03581653v1
https://doi.org/10.4230/lipics.itcs.2022.48
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.48
https://curis.ku.dk/ws/files/290726294/Larger_Corner_Free_Sets_from_Combinatorial.pdf

computation over the noisy broadcast channel with malicious parties

Autoři: Efremenko, Klim Kol, Gillat Paramonov, Dmitry a další

Přispěvatelé: Efremenko, Klim Kol, Gillat Paramonov, Dmitry a další

Témata: Theory of computation → Communication complexity, Malicious Parties, Broadcast Network, Communication Complexity, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: https://dblp.uni-trier.de/db/conf/innovations/innovations2021.html#EfremenkoKPS21
https://drops.dagstuhl.de/opus/volltexte/2021/13621/
https://drops.dagstuhl.de/opus/volltexte/2021/13621/pdf/LIPIcs-ITCS-2021-82.pdf/
https://collaborate.princeton.edu/en/publications/computation-over-the-noisy-broadcast-channel-with-malicious-parti
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.82

communication complexity with defective randomness

Autoři: Ball, Marshall Goldreich, Oded Malkin, Tal a další

Přispěvatelé: Ball, Marshall Goldreich, Oded Malkin, Tal a další

Zdroj: 36th Computational Complexity Conference, {CCC} 2021

Témata: Theory of computation → Communication complexity, Randomized Communication Complexity, Randomness Extraction, Min-Entropy, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2021/14288/
https://dblp.uni-trier.de/db/conf/coco/coco2021.html#Ball0M21
https://drops.dagstuhl.de/opus/volltexte/2021/14288/pdf/LIPIcs-CCC-2021-14.pdf/
https://nyuscholars.nyu.edu/en/publications/communication-complexity-with-defective-randomness
https://doi.org/10.4230/LIPIcs.CCC.2021.14
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.14

DARE to Agree: Byzantine Agreement With Optimal Resilience and Adaptive Communication

Autoři: Civit, Pierre Philippe Dzulfikar, Muhammad Ayaz Gilbert, Seth a další

Témata: • Theory of computation → Communication complexity, Distributed computing models, Distributed algorithms, • Security and privacy → Distributed systems security, Formal security models, Cryptography Byzantine, Agreement, Consensus, Adaptive, Communication complexity, Optimal, Synchrony

Relation: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing; 43rd ACM Symposium on Principles of Distributed Computing; 979-8-4007-0668-4; MOE-T2EP20122-0014; 200021_215383; 40B2-0_218648; https://infoscience.epfl.ch/handle/20.500.14299/240854

Dostupnost: https://doi.org/10.1145/3662158.3662792
https://infoscience.epfl.ch/handle/20.500.14299/240854
https://hdl.handle.net/20.500.14299/240854

Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams

Autoři: Dark, Jacques Konrad, Christian Jacques Dark and Christian Konrad a další

Přispěvatelé: Dark, Jacques Konrad, Christian Jacques Dark and Christian Konrad a další

Zdroj: 35th Computational Complexity Conference (CCC 2020)

Témata: FOS: Computer and information sciences, Theory of computation → Communication complexity, 4. Education, Minimum vertex cover, Communication complexity, Lower bounds, 0102 computer and information sciences, Theory of computation → Streaming models, Theory of computation → Lower bounds and information complexity, Computational Complexity (cs.CC), 01 natural sciences, 7. Clean energy, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Dynamic graph streams, Data Structures and Algorithms (cs.DS), Maximum matching, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2005.11116
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.30