Výsledky vyhledávání - "distributed computational complexity"

How much does randomness help with locally checkable problems?

Autoři: Brandt, Sebastian Olivetti, Dennis Suomela a další

Zdroj: Proceedings of the 39th Symposium on Principles of Distributed Computing. :299-308

Témata: ta113, FOS: Computer and information sciences, Computer Science - Computational Complexity, distributed computational complexity, Computer Science - Distributed, Parallel, and Cluster Computing, LOCAL model, locally checkable labeling problems, Distributed, Parallel, and Cluster Computing (cs.DC), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences

Přístupová URL adresa: http://arxiv.org/pdf/1902.06803
http://arxiv.org/abs/1902.06803
http://juuli.fi/Record/0370707220
https://doi.org/10.1145/3382734.3405715
https://arxiv.org/abs/1902.06803
https://arxiv.org/pdf/1902.06803.pdf
https://jukkasuomela.fi/lcl-randomness/
https://dblp.uni-trier.de/db/journals/corr/corr1902.html#abs-1902-06803
https://doi.org/10.1145/3382734.3405715
https://dl.acm.org/doi/pdf/10.1145/3382734.3405715

Efficient Classification of Locally Checkable Problems in Regular Trees

Autoři: Balliu, Alkida Brandt, Sebastian Chang, Yi-Jun a další

Přispěvatelé: Balliu, Alkida Brandt, Sebastian Chang, Yi-Jun a další

Témata: locally checkable labeling, locality, distributed computational complexity

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 246, 36th International Symposium on Distributed Computing (DISC 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.8

Dostupnost: https://doi.org/10.4230/LIPIcs.DISC.2022.8
https://nbn-resolving.org/urn:nbn:de:0030-drops-171993
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.8

Brief Announcement: Classification of Distributed Binary Labeling Problems

Autoři: Brandt, Sebastian Efron, Yuval Hirvonen, Juho a další

Přispěvatelé: Brandt, Sebastian Efron, Yuval Hirvonen, Juho a další

Zdroj: Proceedings of the 39th Symposium on Principles of Distributed Computing. :349-351

Témata: ta113, distributed computational complexity, LOCAL model, locally checkable labeling problems, 0102 computer and information sciences, graph problems, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: https://research.aalto.fi/files/75427235/SCI_Suomela_Brief_Announcement_Classification_of_Distributed_Binary_Labeling_Problems.pdf
http://juuli.fi/Record/0370733020
https://doi.org/10.1145/3382734.3405703
https://dblp.uni-trier.de/db/conf/podc/podc2020.html#Balliu0EHMOS20
https://aaltodoc.aalto.fi/handle/123456789/111066

Brief announcement: Distributed graph problems through an automata-theoretic lens

Autoři: Chang, Yi-Jun Studený, Jan Suomela a další

Přispěvatelé: Chang, Yi-Jun Studený, Jan Suomela a další

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs), 179
34th International Symposium on Distributed Computing (DISC 2020)

Témata: ta113, Algorithm synthesis, Locally checkable labeling problems, LOCAL model, Locality, Distributed computational complexity, Nondeterministic finite automata, distributed computational complexity, 4. Education, 15. Life on land, 16. Peace & justice, 7. Clean energy, nondeterministic finite automata, 12. Responsible consumption, locality, algorithm synthesis, 8. Economic growth, 11. Sustainability, locally checkable labeling problems, ddc:004

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

Přístupová URL adresa: https://www.research-collection.ethz.ch/handle/20.500.11850/495622
https://dblp.uni-trier.de/db/conf/wdag/disc2020.html#ChangSS20
https://drops.dagstuhl.de/opus/volltexte/2020/13119/pdf/LIPIcs-DISC-2020-41.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/13119/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.41
http://hdl.handle.net/20.500.11850/495622
https://aaltodoc.aalto.fi/handle/123456789/61641

Classification of Distributed Binary Labeling Problems

Autoři: Balliu, Alkida Brandt, Sebastian Efron, Yuval a další

Přispěvatelé: Balliu, Alkida Brandt, Sebastian Efron, Yuval a další

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs), 179 ; 34th International Symposium on Distributed Computing (DISC 2020)

Témata: LOCAL model, graph problems, locally checkable labeling problems, distributed computational complexity

Popis souboru: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-168-9; http://hdl.handle.net/20.500.11850/466923

Dostupnost: https://hdl.handle.net/20.500.11850/466923
https://doi.org/10.3929/ethz-b-000466923

Classification of distributed binary labeling problems

Autoři: Sebastian, Brandt Efron, Yuval Hirvonen, Juho a další

Přispěvatelé: Sebastian, Brandt Efron, Yuval Hirvonen, Juho a další

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs), 179
34th International Symposium on Distributed Computing (DISC 2020)
34th International Symposium on Distributed Computing

Témata: ta113, FOS: Computer and information sciences, LOCAL model, graph problems, locally checkable labeling problems, distributed computational complexity, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Computer Science - Distributed, Parallel, and Cluster Computing, Theory of computation → Distributed computing models, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004, Theory of computation → Complexity classes

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

Přístupová URL adresa: http://arxiv.org/abs/1911.13294
http://juuli.fi/Record/0371446220
https://doi.org/10.4230/LIPIcs.DISC.2020.17
https://dblp.uni-trier.de/db/journals/corr/corr1911.html#abs-1911-13294
https://drops.dagstuhl.de/opus/volltexte/2020/13095/pdf/LIPIcs-DISC-2020-17.pdf/
https://doi.org/10.4230/LIPIcs.DISC.2020.17
https://www.research-collection.ethz.ch/handle/20.500.11850/466923
https://drops.dagstuhl.de/opus/volltexte/2020/13095/
https://www.arxiv-vanity.com/papers/1911.13294/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.17
http://hdl.handle.net/20.500.11850/466923
https://aaltodoc.aalto.fi/handle/123456789/101541

Efficient Classification of Locally Checkable Problems in Regular Trees

Autoři: Alkida Balliu and Sebastian Brandt and Yi-Jun Chang and Dennis Olivetti and Jan Studený and Jukka Suomela Balliu, Alkida Brandt, Sebastian a další

Témata: locally checkable labeling, locality, distributed computational complexity, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.8
Is Part Of LIPIcs, Volume 246, 36th International Symposium on Distributed Computing (DISC 2022)