New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling

Authors: Compton, Spencer, Mitrović, Slobodan, Rubinfeld, Ronitt

Contributors: Spencer Compton and Slobodan Mitrović and Ronitt Rubinfeld

Source: Algorithmica. 86:2997-3026

Subject Terms: 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

File Description: application/pdf

Access URL: http://arxiv.org/abs/2012.15002
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.45

Local Computation of Maximal Independent Set

Authors: Ghaffari, Mohsen

Source: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2022 IEEE 63rd Annual Symposium on. :438-449 Oct, 2022

Relation: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)

Properly learning monotone functions via local correction

Authors: Lange, Jane, Rubinfeld, Ronitt, Vasilyan, Arsen

Source: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2022 IEEE 63rd Annual Symposium on. :75-86 Oct, 2022

Relation: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)

A Fast Coloring Oracle for Average Case Hypergraphs

Authors: Marcussen, Cassandra, Pyne, Edward, Rubinfeld, Ronitt, Shapira, Asaf, Tauber, Shlomo

Contributors: Cassandra Marcussen and Edward Pyne and Ronitt Rubinfeld and Asaf Shapira and Shlomo Tauber

Subject Terms: 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)

File Description: application/pdf

Access URL: 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

Authors: Canonne, Clément L., Li, Yun, Umboh, Seeun William

Contributors: Clément L. Canonne and Yun Li and Seeun William Umboh

Subject Terms: 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

File Description: application/pdf

Access URL: http://arxiv.org/abs/2504.01543
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2025.45

Locally computing edge orientations

Authors: Mitrović, Slobodan, Rubinfeld, Ronitt, Singhal, Mihir

Contributors: Slobodan Mitrović and Ronitt Rubinfeld and Mihir Singhal

Subject Terms: 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

File Description: application/pdf

Access URL: 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

Authors: Even, Guy, Levi, Reut, Medina, Moti, Rosén, Adi

Contributors: Guy Even and Reut Levi and Moti Medina and Adi Rosén

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

Subject Terms: 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

File Description: application/pdf

Access URL: 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

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

Source: 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

Subject Terms: 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

Access URL: 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

Authors: Dorobisz, Andrzej, Kozik, Jakub

Contributors: Andrzej Dorobisz and Jakub Kozik

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

File Description: application/pdf

Access URL: 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

Authors: Arviv, Rubi, Chung, Lily, Levi, Reut, Pyne, Edward

Contributors: Rubi Arviv and Lily Chung and Reut Levi and Edward Pyne

Subject Terms: Local Computation Algorithms, Spanners

File Description: 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

Availability: 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

Authors: Compton, Spencer, Mitrović, Slobodan, Rubinfeld, Ronitt

Contributors: Spencer Compton and Slobodan Mitrović and Ronitt Rubinfeld

Subject Terms: interval scheduling, dynamic algorithms, local computation algorithms

File Description: 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

Availability: 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

Simple Local Computation Algorithms for the General Lovász Local Lemma

Authors: Achlioptas, Dimitris, Gouleakis, Themis, Iliopoulos, Fotis

Source: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. :1-10

Availability: http://dl.acm.org/doi/10.1145/3350755.3400250

Improved Local Computation Algorithms for Constructing Spanners

Authors: Arviv, Rubi, Chung, Lily, Levi, Reut, Pyne, Edward

Contributors: Rubi Arviv and Lily Chung and Reut Levi and Edward Pyne

Subject Terms: 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

File Description: application/pdf

Access URL: http://arxiv.org/abs/2105.04847
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.42

Sublinear Graph Augmentation for Fast Query Implementation

Authors: Czumaj, Artur^Aff15, Mansour, Yishay^Aff16, Vardi, Shai^Aff17

Contributors: Hutchison, David, Series Editor^Aff1, Kanade, Takeo, Series Editor^Aff2, Kittler, Josef, Series Editor^Aff3, Kleinberg, Jon M., Series Editor^Aff4, Mattern, Friedemann, Series Editor^Aff5, Mitchell, John C., Series Editor^Aff6, Naor, Moni, Series Editor^Aff7, Pandu Rangan, C., Series Editor^Aff8, Steffen, Bernhard, Series Editor^Aff9, Terzopoulos, Demetri, Series Editor^Aff10, Tygar, Doug, Series Editor^Aff11, Weikum, Gerhard, Series Editor^Aff12, Epstein, Leah, editor^Aff13, Erlebach, Thomas, editor^Aff14

Source: Approximation and Online Algorithms : 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers. 11312:181-203

Can We Locally Compute Sparse Connected Subgraphs?

Authors: Rubinfeld, Ronitt^{Aff14, Aff15}

Contributors: Hutchison, David, Series editor^Aff1, Kanade, Takeo, Series editor^Aff2, Kittler, Josef, Series editor^Aff3, Kleinberg, Jon M., Series editor^Aff4, Mattern, Friedemann, Series editor^Aff5, Mitchell, John C., Series editor^Aff6, Naor, Moni, Series editor^Aff7, Pandu Rangan, C., Series editor^Aff8, Steffen, Bernhard, Series editor^Aff9, Terzopoulos, Demetri, Series editor^Aff10, Tygar, Doug, Series editor^Aff11, Weikum, Gerhard, Series editor^Aff12, Weil, Pascal, editor^Aff13

Source: Computer Science – Theory and Applications : 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings. 10304:38-47

Local Computation Algorithms for Spanners

Authors: Parter, Merav, Rubinfeld, Ronitt, Vakilian, Ali, Yodpinyanee, Anak

Contributors: Merav Parter and Ronitt Rubinfeld and Ali Vakilian and Anak Yodpinyanee

Subject Terms: Local Computation Algorithms, Sub-linear Algorithms, Graph Spanners

File Description: 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

Availability: 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

Authors: Boaz Patt-Shamir, Shai Vardi, Yishay Mansour

Source: Lecture Notes in Computer Science ISBN: 9783319286839

Subject Terms: 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

Access URL: 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

Robust Inference and Local Algorithms

Authors: Mansour, Yishay^Aff16

Contributors: Hutchison, David, Series editor^Aff1, Kanade, Takeo, Series editor^Aff2, Kittler, Josef, Series editor^Aff3, Kleinberg, Jon M., Series editor^Aff4, Mattern, Friedemann, Series editor^Aff5, Mitchell, John C., Series editor^Aff6, Naor, Moni, Series editor^Aff7, Pandu Rangan, C., Series editor^Aff8, Steffen, Bernhard, Series editor^Aff9, Terzopoulos, Demetri, Series editor^Aff10, Tygar, Doug, Series editor^Aff11, Weikum, Gerhard, Series editor^Aff12, Italiano, Giuseppe F, editor^Aff13, Pighizzini, Giovanni, editor^Aff14, Sannella, Donald T., editor^Aff15

Source: Mathematical Foundations of Computer Science 2015 : 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I. 9234:53-60

New techniques and tighter bounds for local computation algorithms

Authors: Reingold, Omer ^a, Vardi, Shai ^{b, ⁎, 1}

Source: In Journal of Computer and System Sciences November 2016 82(7):1180-1200

On the Probe Complexity of Local Computation Algorithms

Authors: Feige, Uriel, Patt-Shamir, Boaz, Vardi, Shai

Contributors: Uriel Feige and Boaz Patt-Shamir and Shai Vardi

Subject Terms: Local computation algorithms, sublinear algorithms

File Description: 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

Availability: 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