Výsledky vyhľadávania - "Local Computation Algorithms"

New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling

Autori: Compton, Spencer Mitrović, Slobodan Rubinfeld, Ronitt a ďalší

Prispievatelia: Compton, Spencer Mitrović, Slobodan Rubinfeld, Ronitt a ďalší

Zdroj: Algorithmica. 86:2997-3026

Predmety: FOS: Computer and information sciences, dynamic algorithms, interval scheduling, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, local computation algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, ddc:004, 01 natural sciences

Popis súboru: application/pdf

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

A Fast Coloring Oracle for Average Case Hypergraphs

Autori: Marcussen, Cassandra Pyne, Edward Rubinfeld, Ronitt a ďalší

Prispievatelia: Marcussen, Cassandra Pyne, Edward Rubinfeld, Ronitt a ďalší

Predmety: FOS: Computer and information sciences, average-case algorithms, Computational Complexity, Data Structures and Algorithms, Combinatorics, graph coloring, FOS: Mathematics, local computation algorithms, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computational Complexity (cs.CC)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2507.10691
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2025.61

Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them

Autori: Canonne, Clément L. Li, Yun Umboh, Seeun William a ďalší

Prispievatelia: Canonne, Clément L. Li, Yun Umboh, Seeun William a ďalší

Predmety: FOS: Computer and information sciences, lower bounds, Computer Science - Data Structures and Algorithms, Local computation algorithms, Data Structures and Algorithms (cs.DS), ddc:004, algorithms, Knapsack

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2504.01543
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2025.45

Locally computing edge orientations

Autori: Mitrović, Slobodan Rubinfeld, Ronitt Singhal, Mihir a ďalší

Prispievatelia: Mitrović, Slobodan Rubinfeld, Ronitt Singhal, Mihir a ďalší

Predmety: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, local computation algorithms, tree coloring, Data Structures and Algorithms (cs.DS), ddc:004, edge orientation

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2501.02136
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.89

Sublinear Random Access Generators for Preferential Attachment Graphs

Autori: Even, Guy Levi, Reut Medina, Moti a ďalší

Prispievatelia: Even, Guy Levi, Reut Medina, Moti a ďalší

Zdroj: 44th International Colloquium on Automata, Languages, and Programming
Leibniz International Proceedings in Informatics

Predmety: FOS: Computer and information sciences, sublinear algorithms, Data Structures and Algorithms, preferential attachment graphs, local computation algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, 01 natural sciences, random recursive trees

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2017/7424/pdf/LIPIcs-ICALP-2017-6.pdf
http://arxiv.org/abs/1602.06159
https://dl.acm.org/doi/10.1145/3464958
https://arxiv.org/pdf/1602.06159
https://dlnext.acm.org/doi/10.1145/3464958
https://doi.org/10.1145/3464958
https://pure.mpg.de/pubman/item/item_2394896_1/component/file_2394895/arXiv%3A1602.06159.pdf
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_2394896
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_3024965
https://dblp.uni-trier.de/db/conf/icalp/icalp2017.html#EvenLMR17
https://drops.dagstuhl.de/opus/volltexte/2017/7424/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.6
http://hdl.handle.net/21.11116/0000-0002-E7E7-5
http://hdl.handle.net/11858/00-001M-0000-002C-5EC7-6
http://hdl.handle.net/11858/00-001M-0000-002C-5EC9-2

The Randomized Local Computation Complexity of the Lovász Local Lemma

Autori: Brandt, Sebastian Grunau, Christoph Rozhoň, Václav

Zdroj: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (PODC '21)
Principles of Distributed Computing (PODC) 2021
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing

Predmety: FOS: Computer and information sciences, Local Computation Algorithms, Lovász Local Lemma, VOLUME Model, Gap Result, 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), 0102 computer and information sciences, 01 natural sciences

Prístupová URL adresa: http://arxiv.org/pdf/2103.16251
http://arxiv.org/abs/2103.16251
https://arxiv.org/abs/2103.16251
https://dl.acm.org/doi/pdf/10.1145/3465084.3467931
https://www.podc.org/podc2021/list-of-accepted-papers/#29
https://doi.org/10.1145/3465084.3467931
https://dblp.uni-trier.de/db/journals/corr/corr2103.html#abs-2103-16251
http://hdl.handle.net/20.500.11850/501448

Local Computation Algorithms for Hypergraph Coloring - Following Beck’s Approach

Autori: Dorobisz, Andrzej Kozik, Jakub Andrzej Dorobisz and Jakub Kozik

Prispievatelia: Dorobisz, Andrzej Kozik, Jakub Andrzej Dorobisz and Jakub Kozik

Predmety: Local Computation Algorithms, local computation algorithms, property B, ddc:004, Property B, Hypergraph Coloring, hypergraph coloring

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.48
https://ruj.uj.edu.pl/xmlui/handle/item/317822

Improved Local Computation Algorithms for Constructing Spanners

Autori: Arviv, Rubi Chung, Lily Levi, Reut a ďalší

Prispievatelia: Arviv, Rubi Chung, Lily Levi, Reut a ďalší

Predmety: Local Computation Algorithms, Spanners

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.42

Dostupnosť: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.42
https://nbn-resolving.org/urn:nbn:de:0030-drops-188671
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.42

New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling

Autori: Compton, Spencer Mitrović, Slobodan Rubinfeld, Ronitt a ďalší

Prispievatelia: Compton, Spencer Mitrović, Slobodan Rubinfeld, Ronitt a ďalší

Predmety: interval scheduling, dynamic algorithms, local computation algorithms

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.45

Dostupnosť: https://doi.org/10.4230/LIPIcs.ICALP.2023.45
https://nbn-resolving.org/urn:nbn:de:0030-drops-180978
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.45

Improved Local Computation Algorithms for Constructing Spanners

Autori: Arviv, Rubi Chung, Lily Levi, Reut a ďalší

Prispievatelia: Arviv, Rubi Chung, Lily Levi, Reut a ďalší

Predmety: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Local Computation Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, 01 natural sciences, Spanners

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2105.04847
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.42

Local Computation Algorithms for Spanners

Autori: Parter, Merav Rubinfeld, Ronitt Vakilian, Ali a ďalší

Prispievatelia: Parter, Merav Rubinfeld, Ronitt Vakilian, Ali a ďalší

Predmety: Local Computation Algorithms, Sub-linear Algorithms, Graph Spanners

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 124, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.58

Dostupnosť: https://doi.org/10.4230/LIPIcs.ITCS.2019.58
https://nbn-resolving.org/urn:nbn:de:0030-drops-101510
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.58

Constant-Time Local Computation Algorithms

Autori: Boaz Patt-Shamir Shai Vardi Yishay Mansour

Zdroj: Lecture Notes in Computer Science ISBN: 9783319286839

Predmety: Sublinear algorithms, 0202 electrical engineering, electronic engineering, information engineering, Local computation algorithms, 0102 computer and information sciences, 02 engineering and technology, Maximal weight forest, 01 natural sciences, Approximation algorithms

Prístupová URL adresa: https://dblp.uni-trier.de/db/conf/waoa/waoa2015.html#MansourPV15
https://rd.springer.com/chapter/10.1007/978-3-319-28684-6_10
https://link.springer.com/chapter/10.1007%2F978-3-319-28684-6_10
https://link.springer.com/chapter/10.1007/978-3-319-28684-6_10/fulltext.html
https://link.springer.com/article/10.1007/s00224-017-9788-3
https://dblp.uni-trier.de/db/journals/mst/mst62.html#MansourPV18
https://doi.org/10.1007/s00224-017-9788-3

On the Probe Complexity of Local Computation Algorithms

Autori: Feige, Uriel Patt-Shamir, Boaz Vardi, Shai a ďalší

Prispievatelia: Feige, Uriel Patt-Shamir, Boaz Vardi, Shai a ďalší

Predmety: Local computation algorithms, sublinear algorithms

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.50

Dostupnosť: https://doi.org/10.4230/LIPIcs.ICALP.2018.50
https://nbn-resolving.org/urn:nbn:de:0030-drops-90543
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.50

Sublinear Random Access Generators for Preferential Attachment Graphs

Autori: Even, Guy Levi, Reut Medina, Moti a ďalší

Prispievatelia: Even, Guy Levi, Reut Medina, Moti a ďalší

Predmety: local computation algorithms, preferential attachment graphs, random recursive trees, sublinear algorithms

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.6

Dostupnosť: https://doi.org/10.4230/LIPIcs.ICALP.2017.6
https://nbn-resolving.org/urn:nbn:de:0030-drops-74242
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.6

On the Probe Complexity of Local Computation Algorithms

Autori: Feige, Uriel Patt-Shamir, Boaz Vardi, Shai a ďalší

Prispievatelia: Feige, Uriel Patt-Shamir, Boaz Vardi, Shai a ďalší

Predmety: FOS: Computer and information sciences, sublinear algorithms, Computer Science - Data Structures and Algorithms, Local computation algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, 01 natural sciences

Popis súboru: application/pdf

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

Space-Efficient Representations of Graphs

Autori: Tardos, Jakab

Predmety: Maximum Matching, Random Walks, Sparsification, Local Computation Algorithms, Graph Sketching, Sublinear Algorithms, Streaming Algorithms, Hypergraphs, Parallel Computation

Sublinear Algorithms for Spectral Graph Clustering

Autori: Mousavifar, Aidasadat

Predmety: Graph Clustering, Local Computation Algorithms, Sublinear Algorithms, Spectral Methods, Property Testing Framework

Αλγόριθμοι τοπικού υπολογισμού και εφαρμογές τους ; Local computation algorithms and their applications

Autori: Ματίκας, Γεώργιος Matikas, Georgios

Predmety: Αλγόριθμοι τοπικού υπολογισμού, Υπογραμμικοί αλγόριθμοι, 2-Χρωματισμός υπεργράφου, Maximal ανεξάρτητο σύνολο, Σχεδιασμός μηχανισμών, Local computation algorithms, Sublinear algorithms, Hypergraph 2-coloring, Maximal independent set, Mechanism design

Popis súboru: application/pdf

Relation: http://dspace.lib.ntua.gr/xmlui/handle/123456789/43786; http://dx.doi.org/10.26240/heal.ntua.13485

Dostupnosť: http://dspace.lib.ntua.gr/xmlui/handle/123456789/43786
https://doi.org/10.26240/heal.ntua.13485

Local Computation Algorithms for Hypergraph Coloring - Following Beck’s Approach

Autori: Andrzej Dorobisz and Jakub Kozik Dorobisz, Andrzej Kozik, Jakub

Témy: Local Computation Algorithms, Hypergraph Coloring, Property B, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.48
Is Part Of LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)

Local Computation Algorithms for Spanners

Autori: Merav Parter and Ronitt Rubinfeld and Ali Vakilian and Anak Yodpinyanee Parter, Merav Rubinfeld, Ronitt a ďalší

Témy: Local Computation Algorithms, Sub-linear Algorithms, Graph Spanners, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.58
Is Part Of LIPIcs, Volume 124, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019)