Výsledky vyhľadávania - "Local algorithms"

Towards Optimal Deterministic LOCAL Algorithms on Trees

Autori: Sebastian Brandt Ananth Narayanan

Zdroj: Proceedings of the ACM Symposium on Principles of Distributed Computing. :66-76

Predmety: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Distributed, Parallel, and Cluster Computing (cs.DC)

Prístupová URL adresa: http://arxiv.org/abs/2505.01410

Select to Rule : Investigation into ParcourSup’s Local Algorithms

Autori: Eloi‑Hammer, Héloïse

Zdroj: Multitudes. 2025, n° 98(1), p. 182-188.

Dostupnosť: https://shs.cairn.info/revue-multitudes-2025-1-page-182?lang=en

Distributed Computing Column 88 An Invitation to Local Algorithms

Autori: Dan Alistarh

Zdroj: ACM SIGACT News. 55:70-93

Predmety: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree

Autori: El Alaoui, Ahmed Montanari, Andrea Sellke, Mark

Zdroj: Random Structures & Algorithms. 63:689-715

Predmety: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), message passing, Probability (math.PR), Random graphs (graph-theoretic aspects), FOS: Physical sciences, Interacting random processes, statistical mechanics type models, percolation theory, 0102 computer and information sciences, Mathematical Physics (math-ph), 01 natural sciences, maximum cut, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), FOS: Mathematics, Mathematics - Combinatorics, local algorithms, graph partionning, Combinatorics (math.CO), 0101 mathematics, Mathematics - Probability, Mathematical Physics, minimum bisection, Computer Science - Discrete Mathematics

Popis súboru: application/xml

Prístupová URL adresa: http://arxiv.org/abs/2111.06813

Limits of Sequential Local Algorithms on the Random $k$-XORSAT Problem

Autori: Yung, Kingsley Kingsley Yung

Prispievatelia: Yung, Kingsley Kingsley Yung

Predmety: FOS: Computer and information sciences, Computer Science - Computational Complexity, Sequential local algorithms, Average-case complexity, 4. Education, ddc:004, Computational Complexity (cs.CC), Overlap gap property, 7. Clean energy, Random k-XORSAT, Phase transition

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2404.17775
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.123

Streaming Algorithms via Local Algorithms for Maximum Directed Cut

Autori: Saxena, Raghuvansh R. Singer, Noah G. Sudan, Madhu a ďalší

Zdroj: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611978322

Predmety: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Prístupová URL adresa: http://arxiv.org/abs/2411.18829

The Role of Local Algorithms in Privacy (Invited Talk)

Autori: Raskhodnikova, Sofya Sofya Raskhodnikova

Prispievatelia: Raskhodnikova, Sofya Sofya Raskhodnikova

Predmety: reconstruction of Lipschitz functions, differential privacy, Sublinear algorithms, local algorithms, ddc:004

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.2

Computational Complexity and Local Algorithms: On the Interplay Between Randomness and Computation

Zdroj: Lecture Notes in Computer Science ISBN: 9783031889455

SUBOPTIMALITY OF LOCAL ALGORITHMS FOR A CLASS OF MAX-CUT PROBLEMS

Autori: Chen, Wei-Kuo Gamarnik, David Panchenko, Dmitry a ďalší

Zdroj: The Annals of Probability, 2019 May 01. 47(3), 1587-1618.

Prístupová URL adresa: https://www.jstor.org/stable/26730466

A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification

Autori: Marcel Dall’Agnol Tom Gur Oded Lachish a ďalší

Prispievatelia: Marcel Dall’Agnol Tom Gur Oded Lachish a ďalší

Zdroj: SIAM Journal on Computing. 52:1413-1463

Predmety: FOS: Computer and information sciences, Computer Science - Computational Complexity, 4613 Theory Of Computation, 46 Information and Computing Sciences, Discrete Mathematics (cs.DM), 4901 Applied Mathematics, 4903 Numerical and Computational Mathematics, 0103 physical sciences, 49 Mathematical Sciences, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Discrete Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2010.04985

Borel versions of the local Lemma and local algorithms for graphs of finite asymptotic separation index

Autori: Bernshteyn, Anton Weilacher, Felix

Predmety: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, FOS: Mathematics, Mathematics - Combinatorics, Mathematics - Logic, Distributed, Parallel, and Cluster Computing (cs.DC), Combinatorics (math.CO), Logic (math.LO)

Prístupová URL adresa: http://arxiv.org/abs/2308.14941

Local algorithms for coplactic switching and evacuation of Young tableaux

Autori: Brown, Kelsey M. Moran, Derek

Predmety: FOS: Mathematics, Mathematics - Combinatorics, 05E14 (Primary), 05E10 (Secondary), Combinatorics (math.CO)

Prístupová URL adresa: http://arxiv.org/abs/2503.11840

LIMITS OF LOCAL ALGORITHMS OVER SPARSE RANDOM GRAPHS

Autori: Gamarnik, David Sudan, Madhu

Zdroj: The Annals of Probability, 2017 Jul 01. 45(4), 2353-2376.

Prístupová URL adresa: https://www.jstor.org/stable/26362256

LOCAL ALGORITHMS FOR INDEPENDENT SETS ARE HALF-OPTIMAL

Autori: Rahman, Mustazee Virág, Bálint

Zdroj: The Annals of Probability, 2017 May 01. 45(3), 1543-1577.

Prístupová URL adresa: http://www.jstor.org/stable/44245578

Efficient Edge Preserving Image Denoising using Non-Local Algorithms

Autori: Pavani Bhasuthkar Javalkar Dinesh Kumar Tapsi Nagpal

Zdroj: 2023 5th International Conference on Advances in Computing, Communication Control and Networking (ICAC3N). :246-250

Systems of fixpoint equations: Abstraction, games, up-to techniques and local algorithms

Autori: Paolo Baldan Barbara König Tommaso Padoan a ďalší

Prispievatelia: Paolo Baldan Barbara König Tommaso Padoan a ďalší

Zdroj: Information and Computation. 301:105233

Predmety: Informatik, Local algorithm, Bisimilarity, Fixpoint equation systems, Complete lattices, Parity games, Abstract interpretation, Up-to techniques, Local algorithms, μ-calculus, mu-calculus, Fixpoint equation system, Complete lattice, μ-calculu, Parity game, Up-to technique

Popis súboru: application/pdf

Prístupová URL adresa: https://hdl.handle.net/11368/3097038
https://www.sciencedirect.com/science/article/pii/S0890540124000981
https://hdl.handle.net/11577/3540623
https://doi.org/10.1016/j.ic.2024.105233
https://hdl.handle.net/11368/3097038
https://www.sciencedirect.com/science/article/pii/S0890540124000981
https://doi.org/10.1016/j.ic.2024.105233
https://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&origin=inward&scp=85207552322
https://doi.org/10.1016/j.ic.2024.105233

Mini-Workshop: Descriptive Combinatorics, LOCAL Algorithms and Random Processes

Autori: Jan Grebík Oleg Pikhurko Anush Tserunyan

Zdroj: Oberwolfach Reports. 19:429-455

A STRUCTURAL THEOREM FOR LOCAL ALGORITHMS WITH APPLICATIONS TO CODING, TESTING, AND VERIFICATION

Autori: Dall'Agnol, M Gur, T Lachish, O

Témy: 4613 Theory Of Computation, 4901 Applied Mathematics, 46 Information and Computing Sciences, 4903 Numerical and Computational Mathematics, 49 Mathematical Sciences, Article

URL: https://www.repository.cam.ac.uk/handle/1810/362845
https://doi.org/10.17863/CAM.104778

Invitation to Local Algorithms

Autori: Rozhoň, Václav

Témy: Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, Mathematics - Combinatorics, text

URL: http://arxiv.org/abs/2406.19430

The Role of Local Algorithms in Privacy (Invited Talk)

Autori: Sofya Raskhodnikova Raskhodnikova, Sofya

Témy: Sublinear algorithms, differential privacy, reconstruction of Lipschitz functions, local algorithms, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.2
Is Part Of LIPIcs, Volume 289, 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)