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

Testing Connectedness of Images

Autori: Berman, Piotr Murzabulatov, Meiram Raskhodnikova, Sofya a ďalší

Prispievatelia: Berman, Piotr Murzabulatov, Meiram Raskhodnikova, Sofya a ďalší

Zdroj: Algorithmica. 86:3496-3517

Predmety: graphs, FOS: Computer and information sciences, lower bounds, sublinear-algorithms, connectivity, Property testing, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004

Popis súboru: application/pdf

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

Streaming Algorithms for Geometric Steiner Forest

Autori: Artur Czumaj Shaofeng H.-C. Jiang Robert Krauthgamer a ďalší

Prispievatelia: Artur Czumaj Shaofeng H.-C. Jiang Robert Krauthgamer a ďalší

Zdroj: ACM Transactions on Algorithms. 20:1-38

Predmety: dynamic programming, FOS: Computer and information sciences, sublinear algorithms, T1, Steiner forest, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, QA76, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), streaming, ddc:004

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2011.04324
http://wrap.warwick.ac.uk/166815/1/WRAP-Streaming-algorithms-for-geometric-Steiner-forest-Czumaj-22.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.47

Let’s Try to Be More Tolerant: On Tolerant Property Testing and Distance Approximation (Invited Talk)

Autori: Ron, Dana Dana Ron

Prispievatelia: Ron, Dana Dana Ron

Predmety: Sublinear Algorithms, ddc:004, Tolerant Property Testing, Distance Approximation

Popis súboru: application/pdf

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

Deterministic Independent Sets in the Semi-Streaming Model

Autori: Ye, Daniel Daniel Ye

Prispievatelia: Ye, Daniel Daniel Ye

Predmety: Semi-Streaming Algorithms, FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Sublinear Algorithms, Data Structures and Algorithms (cs.DS), Derandomization, ddc:004, Computational Complexity (cs.CC)

Popis súboru: application/pdf

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

A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time

Autori: Mahabadi, Sepideh Roghani, Mohammad Tarnawski, Jakub a ďalší

Prispievatelia: Mahabadi, Sepideh Roghani, Mohammad Tarnawski, Jakub a ďalší

Predmety: Maximum Matching, FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Sublinear Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Maximal Matching, Approximation Algorithm

Popis súboru: application/pdf

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

Query Complexity of Stochastic Minimum Vertex Cover

Autori: Derakhshan, Mahsa Saneian, Mohammad Xun, Zhiyang a ďalší

Prispievatelia: Derakhshan, Mahsa Saneian, Mohammad Xun, Zhiyang a ďalší

Predmety: Vertex cover, Query complexity, Sublinear algorithms, ddc:004

Popis súboru: application/pdf

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

Sublinear Time Eigenvalue Approximation via Random Sampling

Autori: Bhattacharjee, Rajarshi Dexter, Gregory Drineas, Petros a ďalší

Prispievatelia: Bhattacharjee, Rajarshi Dexter, Gregory Drineas, Petros a ďalší

Zdroj: Algorithmica. 86:1764-1829

Predmety: FOS: Computer and information sciences, sublinear algorithms, eigenvalue approximation, 0102 computer and information sciences, Numerical Analysis (math.NA), 01 natural sciences, Computer Science - Data Structures and Algorithms, FOS: Mathematics, F.2.1, G.1.3, G.1.2, G.4, I.1.2, Data Structures and Algorithms (cs.DS), randomized linear algebra, Mathematics - Numerical Analysis, ddc:004, 0101 mathematics

Popis súboru: application/pdf

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

Approximate Earth Mover’s Distance in Truly-Subquadratic Time

Autori: Lorenzo Beretta Aviad Rubinstein Mohar, Bojan a ďalší

Prispievatelia: Lorenzo Beretta Aviad Rubinstein Mohar, Bojan a ďalší

Zdroj: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. :47-58

Predmety: Computational Geometry (cs.CG), FOS: Computer and information sciences, Earth Mover's Distance, Sublinear algorithms, Computer Science - Data Structures and Algorithms, Matching, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS)

Popis súboru: application/pdf

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

Improved Bounds for Matching in Random-Order Streams

Autori: Bernstein, Aaron Aaron Bernstein

Prispievatelia: Bernstein, Aaron Aaron Bernstein

Zdroj: Theory of Computing Systems. 68:758-772

Predmety: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Sublinear Algorithms, Matching, Data Structures and Algorithms (cs.DS), Graph Algorithms, 0102 computer and information sciences, ddc:004, Streaming, 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2005.00417
https://drops.dagstuhl.de/opus/volltexte/2020/12419/
https://dblp.uni-trier.de/db/journals/corr/corr2005.html#abs-2005-00417
https://arxiv.org/abs/2005.00417
https://www.researchwithrutgers.com/en/publications/improved-bounds-for-matching-in-random-order-streams
https://doi.org/10.4230/LIPIcs.ICALP.2020.12
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.12

A 0.51-Approximation of Maximum Matching in Sublinear n^{1.5} Time

Autori: Mahabadi, Sepideh Roghani, Mohammad Tarnawski, Jakub a ďalší

Prispievatelia: Mahabadi, Sepideh Roghani, Mohammad Tarnawski, Jakub a ďalší

Predmety: Sublinear Algorithms, Maximum Matching, Maximal Matching, Approximation Algorithm

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 334, 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.116

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

Approximating Dasgupta Cost in Sublinear Time from a Few Random Seeds

Autori: Kapralov, Michael Kumar, Akash Lattanzi, Silvio a ďalší

Prispievatelia: Kapralov, Michael Kumar, Akash Lattanzi, Silvio a ďalší

Predmety: Sublinear algorithms, Hierarchical Clustering, Dasgupta’s Cost

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 334, 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.103

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

Sublinear Metric Steiner Tree via Improved Bounds for Set Cover

Autori: Mahabadi, Sepideh Roghani, Mohammad Tarnawski, Jakub a ďalší

Prispievatelia: Mahabadi, Sepideh Roghani, Mohammad Tarnawski, Jakub a ďalší

Predmety: Sublinear Algorithms, Steiner Tree, Set Cover, Maximum Matching, Approximation Algorithm

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 325, 16th Innovations in Theoretical Computer Science Conference (ITCS 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.74

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

Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity

Autori: Yingchareonthawornchai Sorrachai Franck, Max a ďalší

Prispievatelia: Yingchareonthawornchai Sorrachai Franck, Max a ďalší

Zdroj: SEA

Predmety: ta113, FOS: Computer and information sciences, sublinear algorithms, engineering, Sublinear Algorithms, Algorithm Engineering, 0102 computer and information sciences, 01 natural sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Algorithm , algorithmic graph theory, Algorithmic Graph Theory

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2103.15703
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.1
https://aaltodoc.aalto.fi/handle/123456789/118483
https://aaltodoc.aalto.fi/handle/123456789/108573

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems

Autori: Le Gall, François Seddighin, Saeed François Le Gall and Saeed Seddighin

Prispievatelia: Le Gall, François Seddighin, Saeed François Le Gall and Saeed Seddighin

Zdroj: Algorithmica. 85:1251-1286

Predmety: FOS: Computer and information sciences, Quantum algorithms, Quantum Physics, Sublinear algorithms, FOS: Physical sciences, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Longest common substring, Longest palindrome substring, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, 0101 mathematics, Quantum Physics (quant-ph)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2010.12122
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.97

Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs

Autori: Marco Bressan

Zdroj: ACM Transactions on Algorithms. 19:1-40

Predmety: Social and Information Networks (cs.SI), FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Subgraph sampling, random walks, sublinear algorithms, Computer Science - Social and Information Networks, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computer Science - Discrete Mathematics

Popis súboru: application/pdf

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

Strongly Sublinear Algorithms for Testing Pattern Freeness

Autori: Newman, Ilan Varma, Nithin Ilan Newman and Nithin Varma

Prispievatelia: Newman, Ilan Varma, Nithin Ilan Newman and Nithin Varma

Zdroj: TheoretiCS. 3

Predmety: FOS: Computer and information sciences, F.2, 68W20, 68W25, Property testing, Sublinear algorithms, 0102 computer and information sciences, 02 engineering and technology, Pattern freeness, 01 natural sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ddc:004, 0101 mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2106.04856
https://theoretics.episciences.org/10131
https://doi.org/10.46298/theoretics.24.1
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.98

Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs

Autori: Levi, Reut Medina, Moti Tubul, Omer a ďalší

Prispievatelia: Levi, Reut Medina, Moti Tubul, Omer a ďalší

Predmety: Sublinear algorithms, Spanning Subgraphs, ddc:004, Locally Computable Algorithms, Clusterbale Graphs

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.60

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

Differential privacy and Sublinear time are incompatible sometimes

Autori: Blocki, Jeremiah Fichtenberger, Hendrik Grigorescu, Elena a ďalší

Prispievatelia: Blocki, Jeremiah Fichtenberger, Hendrik Grigorescu, Elena a ďalší

Predmety: one-way marginals, FOS: Computer and information sciences, sublinear algorithms, lower bounds, Computer Science - Cryptography and Security, differential privacy, Computer Science - Data Structures and Algorithms, sublinear-time algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Cryptography and Security (cs.CR)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2407.07262
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.19

A Sublinear Time Tester for Max-Cut on Clusterable Graphs

Autori: Jha, Agastya Vibhuti Kumar, Akash Agastya Vibhuti Jha and Akash Kumar

Prispievatelia: Jha, Agastya Vibhuti Kumar, Akash Agastya Vibhuti Jha and Akash Kumar

Predmety: Clusterable Graphs, Sublinear Algorithms, Graph Algorithms, ddc:004, Property Testung

Popis súboru: application/pdf

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