Testing Connectedness of Images

Συγγραφείς: Berman, Piotr, Murzabulatov, Meiram, Raskhodnikova, Sofya, Ristache, Dragos

Συνεισφορές: Piotr Berman and Meiram Murzabulatov and Sofya Raskhodnikova and Dragos Ristache

Πηγή: Algorithmica. 86:3496-3517

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý

Συνεισφορές: Artur Czumaj and Shaofeng H.-C. Jiang and Robert Krauthgamer and Pavel Veselý

Πηγή: ACM Transactions on Algorithms. 20:1-38

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

Local Computation of Maximal Independent Set

Συγγραφείς: Ghaffari, Mohsen

Πηγή: 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)

Estimating the Longest Increasing Subsequence in Nearly Optimal Time

Συγγραφείς: Andoni, Alexandr, Nosatzki, Negev Shekel, Sinha, Sandip, Stein, Clifford

Πηγή: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2022 IEEE 63rd Annual Symposium on. :708-719 Oct, 2022

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

Streaming Facility Location in High Dimension via Geometric Hashing

Συγγραφείς: Czumaj, Artur, Jiang, Shaofeng H.-C., Krauthgamer, Robert, Vesely, Pavel, Yang, Mingwei

Πηγή: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2022 IEEE 63rd Annual Symposium on. :450-461 Oct, 2022

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

Improved Sublinear-Time Moment Estimation Using Weighted Sampling

Συγγραφείς: Bhattacharya, Anup^Aff10, Pradhan, Pinki^Aff10

Συνεισφορές: Goos, Gerhard, Series Editor^{Aff1, Aff3}, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff4, Gao, Wen, Editorial Board Member^Aff5, Steffen, Bernhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Finocchi, Irene, editor^Aff8, Georgiadis, Loukas, editor^Aff9

Πηγή: Algorithms and Complexity : 14th International Conference, CIAC 2025, Rome, Italy, June 10–12, 2025, Proceedings, Part I. 15679:170-186

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

Συγγραφείς: Ron, Dana

Συνεισφορές: Dana Ron

Θεματικοί όροι: Sublinear Algorithms, ddc:004, Tolerant Property Testing, Distance Approximation

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.2

Deterministic Independent Sets in the Semi-Streaming Model

Συγγραφείς: Ye, Daniel

Συνεισφορές: Daniel Ye

Θεματικοί όροι: 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)

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Mahabadi, Sepideh, Roghani, Mohammad, Tarnawski, Jakub

Συνεισφορές: Sepideh Mahabadi and Mohammad Roghani and Jakub Tarnawski

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Derakhshan, Mahsa, Saneian, Mohammad, Xun, Zhiyang

Συνεισφορές: Mahsa Derakhshan and Mohammad Saneian and Zhiyang Xun

Θεματικοί όροι: Vertex cover, Query complexity, Sublinear algorithms, ddc:004

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.41

Sublinear Time Eigenvalue Approximation via Random Sampling

Συγγραφείς: Bhattacharjee, Rajarshi, Dexter, Gregory, Drineas, Petros, Musco, Cameron, Ray, Archan

Συνεισφορές: Rajarshi Bhattacharjee and Gregory Dexter and Petros Drineas and Cameron Musco and Archan Ray

Πηγή: Algorithmica. 86:1764-1829

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Lorenzo Beretta, Aviad Rubinstein

Συνεισφορές: Mohar, Bojan, Shinkar, Igor, O�Donnell, Ryan

Πηγή: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. :47-58

Θεματικοί όροι: 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)

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2310.19514

A characterization of testable hypergraph properties

Συγγραφείς: Joos, Felix ^a, Kim, Jaehoon ^b, Kühn, Daniela ^c, Osthus, Deryk ^c

Πηγή: In Journal of Combinatorial Theory, Series B September 2025 174:133-189

Improved Bounds for Matching in Random-Order Streams

Συγγραφείς: Bernstein, Aaron

Συνεισφορές: Aaron Bernstein

Πηγή: Theory of Computing Systems. 68:758-772

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

Edit Distance in Near-Linear Time: it's a Constant Factor

Συγγραφείς: Andoni, Alexandr, Nosatzki, Negev Shekel

Πηγή: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2020 IEEE 61st Annual Symposium on. :990-1001 Nov, 2020

Relation: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)

Robust and Sample Optimal Algorithms for PSD Low Rank Approximation

Συγγραφείς: Bakshi, Ainesh, Chepurko, Nadiia, Woodruff, David P.

Πηγή: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2020 IEEE 61st Annual Symposium on. :506-516 Nov, 2020

Relation: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)

Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance

Συγγραφείς: Kociumaka, Tomasz, Saha, Barna

Πηγή: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2020 IEEE 61st Annual Symposium on. :1168-1179 Nov, 2020

Relation: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)

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

Συγγραφείς: Mahabadi, Sepideh, Roghani, Mohammad, Tarnawski, Jakub

Συνεισφορές: Sepideh Mahabadi and Mohammad Roghani and Jakub Tarnawski

Θεματικοί όροι: Sublinear Algorithms, Maximum Matching, Maximal Matching, Approximation Algorithm

Περιγραφή αρχείου: 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

Διαθεσιμότητα: 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

Συγγραφείς: Kapralov, Michael, Kumar, Akash, Lattanzi, Silvio, Mousavifar, Aida, Wrzos-Kaminska, Weronika

Συνεισφορές: Michael Kapralov and Akash Kumar and Silvio Lattanzi and Aida Mousavifar and Weronika Wrzos-Kaminska

Θεματικοί όροι: Sublinear algorithms, Hierarchical Clustering, Dasgupta’s Cost

Περιγραφή αρχείου: 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

Διαθεσιμότητα: 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

Συγγραφείς: Mahabadi, Sepideh, Roghani, Mohammad, Tarnawski, Jakub, Vakilian, Ali

Συνεισφορές: Sepideh Mahabadi and Mohammad Roghani and Jakub Tarnawski and Ali Vakilian

Θεματικοί όροι: Sublinear Algorithms, Steiner Tree, Set Cover, Maximum Matching, Approximation Algorithm

Περιγραφή αρχείου: 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

Διαθεσιμότητα: 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