Výsledky vyhledávání - "local computation algorithms"
-
1
Autoři: a další
Přispěvatelé: a další
Zdroj: Algorithmica. 86:2997-3026
Témata: 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 souboru: application/pdf
-
2
Autoři: a další
Přispěvatelé: a další
Témata: 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 souboru: application/pdf
-
3
Autoři: a další
Přispěvatelé: a další
Témata: 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 souboru: application/pdf
-
4
Autoři: a další
Přispěvatelé: a další
Témata: 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 souboru: application/pdf
-
5
Autoři: a další
Přispěvatelé: a další
Zdroj: 44th International Colloquium on Automata, Languages, and Programming
Leibniz International Proceedings in InformaticsTémata: 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 souboru: application/pdf
Pří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 -
6
Autoři:
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 ComputingTémata: 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
Pří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 -
7
Autoři:
Přispěvatelé:
Témata: Local Computation Algorithms, local computation algorithms, property B, ddc:004, Property B, Hypergraph Coloring, hypergraph coloring
Popis souboru: application/pdf
-
8
Autoři: a další
Přispěvatelé: a další
Témata: Local Computation Algorithms, Spanners
Popis souboru: 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
-
9
Autoři: a další
Přispěvatelé: a další
Popis souboru: 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
-
10
Autoři: a další
Přispěvatelé: a další
Témata: 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 souboru: application/pdf
-
11
Autoři: a další
Přispěvatelé: a další
Popis souboru: 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
-
12
Autoři:
Zdroj: Lecture Notes in Computer Science ISBN: 9783319286839
Témata: 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
Pří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 -
13
Autoři: a další
Přispěvatelé: a další
Popis souboru: 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
-
14
Autoři: a další
Přispěvatelé: a další
Témata: local computation algorithms, preferential attachment graphs, random recursive trees, sublinear algorithms
Popis souboru: 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
-
15
Autoři: a další
Přispěvatelé: a další
Témata: 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 souboru: application/pdf
-
16
-
17
-
18
Autoři:
Témata: Αλγόριθμοι τοπικού υπολογισμού, Υπογραμμικοί αλγόριθμοι, 2-Χρωματισμός υπεργράφου, Maximal ανεξάρτητο σύνολο, Σχεδιασμός μηχανισμών, Local computation algorithms, Sublinear algorithms, Hypergraph 2-coloring, Maximal independent set, Mechanism design
Popis souboru: application/pdf
Relation: http://dspace.lib.ntua.gr/xmlui/handle/123456789/43786; http://dx.doi.org/10.26240/heal.ntua.13485
-
19
Autoři:
Témata: 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) -
20
Autoři: a další
Témata: 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)
Full Text Finder
Nájsť tento článok vo Web of Science