Výsledky vyhledávání - Theory of computation → Distributed algorithms

Optimizing Large-Scale Educational Assessment with a 'Divide-and-Conquer' Strategy: Fast and Efficient Distributed Bayesian Inference in IRT Models

Autoři: Sainan Xu Jing Lu Jiwei Zhang a další

Zdroj: Grantee Submission. 2024.

Peer Reviewed: Y

Page Count: 76

Sponsoring Agency: Institute of Education Sciences (ED)

Descriptors: Educational Assessment, Bayesian Statistics, Statistical Inference, Item Response Theory, Educational Testing, Algorithms, Computation, Accuracy, Achievement Tests, Foreign Countries, Secondary School Students, International Assessment, Data Collection, Data Analysis, Data Processing, Evaluation Methods

Assessment and Survey Identifiers: Program for International Student Assessment

IES Funded: Yes

Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts

Autoři: Anagnostides, Ioannis Lenzen, Christoph Haeupler, Bernhard a další

Přispěvatelé: Anagnostides, Ioannis Lenzen, Christoph Haeupler, Bernhard a další

Zdroj: 36th International Symposium on Distributed Computing
Leibniz International Proceedings in Informatics
Leibniz International Proceedings in Informatics (LIPIcs), 246
36th International Symposium on Distributed Computing (DISC 2022)
Distributed Computing, 36 (4)

Témata: FOS: Computer and information sciences, Universal optimality, Distributed algorithms, Laplacian solvers, low-congestion shortcuts, 0102 computer and information sciences, 01 natural sciences, Low-congestion shortcuts, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), Theory of computation → Distributed algorithms, ddc:004

Popis souboru: application/pdf; application/xhtml+xml; application/application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2109.05151
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.6
http://hdl.handle.net/21.11116/0000-000C-7314-C
http://hdl.handle.net/21.11116/0000-000C-731B-5
http://hdl.handle.net/21.11116/0000-0009-B841-E
http://hdl.handle.net/21.11116/0000-0009-B83F-2
http://hdl.handle.net/20.500.11850/579757
http://hdl.handle.net/20.500.11850/627797

Fast and Lightweight Distributed Suffix Array Construction

Autoři: Haag, Manuel Kurpicz, Florian Sanders, Peter a další

Zdroj: ISSN: 1868-8969.

Témata: Distributed Computing, Suffix Array Construction, Theory of computation → Distributed algorithms, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004

Popis souboru: application/pdf

Relation: Leibniz International Proceedings in Informatics (LIPIcs); info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000187240; https://publikationen.bibliothek.kit.edu/1000187240/169679610; https://doi.org/10.5445/IR/1000187240

Dostupnost: https://publikationen.bibliothek.kit.edu/1000187240
https://publikationen.bibliothek.kit.edu/1000187240/169679610
https://doi.org/10.5445/IR/1000187240

The topology of local computing in networks

Autoři: Fraigniaud, Pierre Paz, Ami Pierre Fraigniaud and Ami Paz

Přispěvatelé: Fraigniaud, Pierre Paz, Ami Pierre Fraigniaud and Ami Paz

Zdroj: Journal of Applied and Computational Topology. 8:1069-1098

Témata: combinatorial topology, FOS: Computer and information sciences, 0102 computer and information sciences, 02 engineering and technology, 2012 ACM Subject Classification Theory of computation → Distributed algorithms Distributed computing, [INFO] Computer Science [cs], 01 natural sciences, 7. Clean energy, Distributed computing, 102031 Theoretische Informatik, Computer Science - Distributed, Parallel, and Cluster Computing, 2012 ACM Subject Classification Theory of computation → Distributed algorithms Distributed computing distributed graph algorithms combinatorial topology, distributed graph algorithms, 102031 Theoretical computer science, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2003.03255
https://ucrisportal.univie.ac.at/de/publications/8b94d914-dcb8-4035-a20f-89f5b9cfd352
https://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-03255
https://doi.org/10.4230/LIPIcs.ICALP.2020.128
https://arxiv.org/pdf/2003.03255
http://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-03255
https://drops.dagstuhl.de/opus/volltexte/2020/12535/pdf/LIPIcs-ICALP-2020-128.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/12535/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.128

Streamlining Distributed SAT Solver Design

Autoři: Schreiber, Dominik Rigi-Luperti, Niccolò Biere, Armin

Zdroj: ISSN: 1868-8969.

Témata: Satisfiability, parallel SAT solving, distributed computing, preprocessing, Hardware → Theorem proving and SAT solving, Theory of computation → Distributed algorithms, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004

Relation: Leibniz International Proceedings in Informatics (LIPIcs); info:eu-repo/semantics/altIdentifier/isbn/978-3-9597738-1-2; info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000186448

Dostupnost: https://publikationen.bibliothek.kit.edu/1000186448

A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization

Autoři: Rouet, François-Henry Li, Xiaoye S Ghysels, Pieter a další

Zdroj: ACM Transactions on Mathematical Software. 42(4)

Témata: 46 Information and Computing Sciences (for-2020), 4903 Numerical and Computational Mathematics (for-2020), 49 Mathematical Sciences (for-2020), Design, Algorithms, Performance, HSS matrices, randomized sampling, ULV factorization, parallel algorithms, distributed-memory, cs.MS, cs.MS, 0802 Computation Theory and Mathematics (for), 0806 Information Systems (for), Numerical & Computational Mathematics (science-metrix), 4606 Distributed computing and systems software (for-2020), 4613 Theory of computation (for-2020), 4901 Applied mathematics (for-2020)

Popis souboru: application/pdf

Přístupová URL adresa: https://escholarship.org/uc/item/2c32t3cs
https://escholarship.org/content/qt2c32t3cs/qt2c32t3cs.pdf

PSelInvA Distributed Memory Parallel Algorithm for Selected Inversion

Autoři: Jacquelin, Mathias Lin, Lin Yang, Chao

Zdroj: ACM Transactions on Mathematical Software. 43(3)

Témata: 46 Information and Computing Sciences (for-2020), 4601 Applied Computing (for-2020), Selected inversion, sparse direct method, distributed memory parallel, algorithm, high-performance computation, electronic structure theory, math.NA, math.NA, cs.DC, cs.NA, 0802 Computation Theory and Mathematics (for), 0806 Information Systems (for), Numerical & Computational Mathematics (science-metrix), 4606 Distributed computing and systems software (for-2020), 4613 Theory of computation (for-2020), 4901 Applied mathematics (for-2020)

Přístupová URL adresa: https://escholarship.org/uc/item/0p13r5v0

Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms

Autoři: Bertrand, Nathalie Thomas, Bastien Widder, Josef a další

Přispěvatelé: Bertrand, Nathalie Thomas, Bastien Widder, Josef a další

Témata: Theory of computation → Distributed algorithms phrases Verification, Theory of computation → Verification by model checking, Domain theory, Verification, Distributed algorithms, ddc:004, [INFO] Computer Science [cs]

Popis souboru: application/pdf

Přístupová URL adresa: https://inria.hal.science/hal-03480241v1/document
https://inria.hal.science/hal-03480241v1
https://doi.org/10.4230/lipics.concur.2021.15
https://drops.dagstuhl.de/opus/volltexte/2021/14392/pdf/LIPIcs-CONCUR-2021-15.pdf/
https://dblp.uni-trier.de/db/conf/concur/concur2021.html#0001TW21
https://drops.dagstuhl.de/opus/volltexte/2021/14392/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.15

Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics

Autoři: Brandt, Sebastian Chang, Yi-Jun Grebík, Jan a další

Přispěvatelé: Brandt, Sebastian Chang, Yi-Jun Grebík, Jan a další

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs), 215
13th Innovations in Theoretical Computer Science Conference (ITCS 2022)

Témata: FOS: Computer and information sciences, Probability (math.PR), Descriptive Combinatorics, Mathematics - Logic, Descriptive combinatorics, Distributed algorithms, Distributed Algorithms, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Distributed, Parallel, and Cluster Computing (cs.DC), Theory of computation → Distributed algorithms, ddc:004, QA, Logic (math.LO), Mathematics - Probability

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

Přístupová URL adresa: http://arxiv.org/abs/2106.02066
http://wrap.warwick.ac.uk/163695/1/WRAP-Local-problems-on-trees-from-the-perspectives-of-distributed-algorithms-Grebik-2022.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.29
http://hdl.handle.net/20.500.11850/532088

A Shift Selection Strategy for Parallel Shift-invert Spectrum Slicing in Symmetric Self-consistent Eigenvalue Computation

Autoři: Williams-Young, David B Beckman, Paul G Yang, Chao

Zdroj: ACM Transactions on Mathematical Software. 46(4)

Témata: 46 Information and Computing Sciences (for-2020), 4601 Applied Computing (for-2020), Eigenvalues, parallel eigenvalue algorithms, self-consistent field, shift-invert spectrum slicing, math.NA, math.NA, cs.DC, cs.NA, physics.comp-ph, 0802 Computation Theory and Mathematics (for), 0806 Information Systems (for), Numerical & Computational Mathematics (science-metrix), 4606 Distributed computing and systems software (for-2020), 4613 Theory of computation (for-2020), 4901 Applied mathematics (for-2020)

Přístupová URL adresa: https://escholarship.org/uc/item/8wq6g5t4

Sparse Approximate Multifrontal Factorization with Composite Compression Methods

Autoři: Claus, Lisa Ghysels, Pieter Liu, Yang a další

Zdroj: ACM Transactions on Mathematical Software. 49(3)

Témata: 4613 Theory Of Computation (for-2020), 4606 Distributed Computing and Systems Software (for-2020), 46 Information and Computing Sciences (for-2020), Sparse direct solver, multifrontal method, butterfly algorithm, block low-rank compression, 0802 Computation Theory and Mathematics (for), 0806 Information Systems (for), Numerical & Computational Mathematics (science-metrix), 4606 Distributed computing and systems software (for-2020), 4613 Theory of computation (for-2020), 4901 Applied mathematics (for-2020)

Popis souboru: application/pdf

Přístupová URL adresa: https://escholarship.org/uc/item/4950t8q9
https://escholarship.org/content/qt4950t8q9/qt4950t8q9.pdf

Distributed Partial Coloring via Gradual Rounding

Autoři: Das, Avinandan Fraigniaud, Pierre Rosén, Adi a další

Přispěvatelé: Das, Avinandan Fraigniaud, Pierre Rosén, Adi a další

Témata: partial coloring, weak coloring, Theory of computation → Distributed algorithms, [INFO] Computer Science [cs], ddc:004, Distributed graph coloring

Popis souboru: application/pdf

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

Complexity Landscape for Local Certification

Autoři: Bousquet, Nicolas Feuilloley, Laurent Zeitoun, Sébastien a další

Přispěvatelé: Bousquet, Nicolas Feuilloley, Laurent Zeitoun, Sébastien a další

Zdroj: 39th International Symposium on Distributed Computing
https://hal.science/hal-05369384
39th International Symposium on Distributed Computing, Oct 2025, Berlin, Germany. ⟨10.4230/LIPICS.DISC.2025.18⟩

Témata: complexity gap, Theory of computation → Distributed algorithms, distributed graph algorithms, space complexity, locally checkable proofs, proof-labeling schemes, Local certification, [INFO]Computer Science [cs], [MATH]Mathematics [math]

Geografické téma: Berlin, Germany

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

Dostupnost: https://hal.science/hal-05369384
https://hal.science/hal-05369384v1/document
https://hal.science/hal-05369384v1/file/LIPIcs.DISC.2025.18.pdf
https://doi.org/10.4230/LIPICS.DISC.2025.18

On the h-majority dynamics with many opinions

Autoři: d'Amore, Francesco d'Archivio, Niccolò Giakkoupis, George a další

Přispěvatelé: d'Amore, Francesco d'Archivio, Niccolò Giakkoupis, George a další

Zdroj: 39th International Symposium on Distributed Computing (DISC 2025)
https://hal.science/hal-05198643
39th International Symposium on Distributed Computing (DISC 2025), European Association for Theoretical Computer Science (EATCS), Oct 2025, Berlin, Germany. ⟨10.4230/LIPIcs.DISC.2025.27⟩

Témata: Consensus Problem, Networks → Network protocols, Applied computing → Systems biology, Mathematics of computing → Markov processes, Mathematics of computing → Probabilistic algorithms, Theory of computation → Distributed algorithms, Plurality Consensus, Opinion dynamics, Markov Chains, Randomized Algorithms, Distributed Algorithms, Distributed, Parallel, and Cluster Computing (cs.DC), Multiagent Systems (cs.MA), FOS: Computer and information sciences, [INFO]Computer Science [cs]

Geografické téma: Berlin, Germany

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

Dostupnost: https://hal.science/hal-05198643
https://hal.science/hal-05198643v1/document
https://hal.science/hal-05198643v1/file/arxiv.pdf
https://doi.org/10.4230/LIPIcs.DISC.2025.27

Mining in Logarithmic Space with Variable Difficulty

Autoři: Miller, Loïc Pacaud, Dorian Derousseaux-Lebert, Nathanaël a další

Přispěvatelé: Miller, Loïc Pacaud, Dorian Derousseaux-Lebert, Nathanaël a další

Témata: • Theory of computation → Distributed algorithms, • Computing methodologies → Concurrent algorithms, Security and privacy → Distributed systems security, [INFO] Computer Science [cs]

Popis souboru: application/pdf

Přístupová URL adresa: https://cnrs.hal.science/hal-05294549v1
https://cnrs.hal.science/hal-05294549v1/document
https://doi.org/10.1145/3719027.3744874

On the $h$-majority dynamics with many opinions

Autoři: d'Amore, Francesco d'Archivio, Niccolò Giakkoupis, George a další

Přispěvatelé: d'Amore, Francesco d'Archivio, Niccolò Giakkoupis, George a další

Témata: FOS: Computer and information sciences, Networks → Network protocols, Consensus Problem, Mathematics of computing → Probabilistic algorithms, Randomized Algorithms, Plurality Consensus, [INFO] Computer Science [cs], Parallel, Distributed Algorithms, Markov Chains, Distributed, Applied computing → Systems biology, and Cluster Computing (cs.DC), Distributed, Parallel, and Cluster Computing, Distributed, Parallel, and Cluster Computing (cs.DC), Theory of computation → Distributed algorithms, ddc:004, Opinion dynamics, Mathematics of computing → Markov processes, Multiagent Systems, Multiagent Systems (cs.MA)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2506.20218
https://hal.science/hal-05198643v1/document
https://hal.science/hal-05198643v1
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2025.27
https://hal.science/hal-05198643v1/document
https://doi.org/10.4230/lipics.disc.2025.27
https://hal.science/hal-05198643v1

Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs

Autoři: Censor-Hillel, Keren Fischer, Orr Gonen, Tzlil a další

Přispěvatelé: Censor-Hillel, Keren Fischer, Orr Gonen, Tzlil a další

Zdroj: DISC
34th International Symposium on Distributed Computing

Témata: FOS: Computer and information sciences, cycles, 0102 computer and information sciences, 01 natural sciences, girth, Congested Clique, Computer Science - Distributed, Parallel, and Cluster Computing, distributed graph algorithms, CONGEST, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), Networks → Network algorithms, Theory of computation → Distributed algorithms, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2101.07590
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.33

Secure Distributed Network Optimization Against Eavesdroppers

Autoři: Hitron, Yael Parter, Merav Yogev, Eylon a další

Přispěvatelé: Hitron, Yael Parter, Merav Yogev, Eylon a další

Témata: network optimization, Networks → Network algorithms, Theory of computation → Distributed algorithms, ddc:004, congest, secure computation

Popis souboru: application/pdf

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

Proceedings of the twelfth annual ACM symposium on principles of distributed computing : Ithaca, New York, USA : August 15-18, 1993 / spons. by the ACM Special Interest Group for Algorithms and Computation Theory and ACM Special Interest Group for Operating System Principles.

Autoři: ACM Symposium on Principles of Distributed Computing (12 ; 1993 ; Ithaca, Nowy Jork). ACM Special Interest Group for Algorithms and Computation Theory. ACM Special Interest Group for Operating System Principles.

Přispěvatelé: ACM Symposium on Principles of Distributed Computing (12 ; 1993 ; Ithaca, Nowy Jork). ACM Special Interest Group for Algorithms and Computation Theory. ACM Special Interest Group for Operating System Principles.

Zdroj: Bibliogr. przy rozdz.
Index.

Témata: Sieci komputerowe -- konferencje, Komputery -- konferencje

Přístupová URL adresa: http://katalog.nukat.edu.pl/lib/item?id=chamo:1759871&theme=nukat

Making Self-Stabilizing Algorithms for Any Locally Greedy Problem

Autoři: Cohen, Johanne Pilard, Laurence Sénizergues, Jonas a další

Přispěvatelé: Cohen, Johanne Pilard, Laurence Sénizergues, Jonas a další

Témata: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Ruling Set, [SCCO.COMP] Cognitive science/Computer science, Self-Stabilizing Algorithm, Distance-K Coloring, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Greedy Problem, Theory of computation → Distributed algorithms, [INFO] Computer Science [cs], ddc:004

Popis souboru: application/pdf

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