Showing 1 - 20 results of 360 for search '"Sublinear algorithms"', query time: 0.81s Refine Results
  1. 1
    Academic Journal

    Testing Connectedness of Images

    Authors: Berman, Piotr, Murzabulatov, Meiram, Raskhodnikova, Sofya, Ristache, Dragos

    Contributors: Piotr Berman and Meiram Murzabulatov and Sofya Raskhodnikova and Dragos Ristache

    Source: Algorithmica. 86:3496-3517

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

    File Description: application/pdf

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

    View record at OpenAIRE View record at Springer
    Linked Full Text
    Save to List
  2. 2
    Academic Journal

    Streaming Algorithms for Geometric Steiner Forest

    Authors: Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý

    Contributors: Artur Czumaj and Shaofeng H.-C. Jiang and Robert Krauthgamer and Pavel Veselý

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

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

    File Description: application/pdf

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

    View record at OpenAIRE Full Text Finder
    Save to List
  3. 3
    Conference

    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)

    Save to List
  4. 4
    Conference

    Estimating the Longest Increasing Subsequence in Nearly Optimal Time

    Authors: Andoni, Alexandr, Nosatzki, Negev Shekel, Sinha, Sandip, Stein, Clifford

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

    Save to List
  5. 5
    Conference

    Streaming Facility Location in High Dimension via Geometric Hashing

    Authors: Czumaj, Artur, Jiang, Shaofeng H.-C., Krauthgamer, Robert, Vesely, Pavel, Yang, Mingwei

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

    Save to List
  6. 6
    eBook

    Improved Sublinear-Time Moment Estimation Using Weighted Sampling

    Authors: Bhattacharya, AnupAff10, Pradhan, PinkiAff10

    Contributors: Goos, Gerhard, Series EditorAff1, Aff3, Hartmanis, Juris, Founding EditorAff2, Bertino, Elisa, Editorial Board MemberAff4, Gao, Wen, Editorial Board MemberAff5, Steffen, Bernhard, Editorial Board MemberAff6, Yung, Moti, Editorial Board MemberAff7, Finocchi, Irene, editorAff8, Georgiadis, Loukas, editorAff9

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

    Save to List
  7. 7
    Conference

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

    Authors: Ron, Dana

    Contributors: Dana Ron

    Subject Terms: Sublinear Algorithms, ddc:004, Tolerant Property Testing, Distance Approximation

    File Description: application/pdf

    Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.2

    View record at OpenAIRE
    Save to List
  8. 8
    Academic Journal

    Deterministic Independent Sets in the Semi-Streaming Model

    Authors: Ye, Daniel

    Contributors: Daniel Ye

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

    File Description: application/pdf

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

    View record at OpenAIRE
    Save to List
  9. 9
    Academic Journal

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

    Authors: Mahabadi, Sepideh, Roghani, Mohammad, Tarnawski, Jakub

    Contributors: Sepideh Mahabadi and Mohammad Roghani and Jakub Tarnawski

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

    File Description: application/pdf

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

    View record at OpenAIRE
    Save to List
  10. 10
    Conference

    Query Complexity of Stochastic Minimum Vertex Cover

    Authors: Derakhshan, Mahsa, Saneian, Mohammad, Xun, Zhiyang

    Contributors: Mahsa Derakhshan and Mohammad Saneian and Zhiyang Xun

    Subject Terms: Vertex cover, Query complexity, Sublinear algorithms, ddc:004

    File Description: application/pdf

    Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.41

    View record at OpenAIRE
    Save to List
  11. 11
    Academic Journal

    Sublinear Time Eigenvalue Approximation via Random Sampling

    Authors: Bhattacharjee, Rajarshi, Dexter, Gregory, Drineas, Petros, Musco, Cameron, Ray, Archan

    Contributors: Rajarshi Bhattacharjee and Gregory Dexter and Petros Drineas and Cameron Musco and Archan Ray

    Source: Algorithmica. 86:1764-1829

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

    File Description: application/pdf

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

    View record at OpenAIRE View record at Springer
    Linked Full Text
    Save to List
  12. 12
    Academic Journal

    Approximate Earth Mover’s Distance in Truly-Subquadratic Time

    Authors: Lorenzo Beretta, Aviad Rubinstein

    Contributors: Mohar, Bojan, Shinkar, Igor, O�Donnell, Ryan

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

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

    File Description: application/pdf

    Access URL: http://arxiv.org/abs/2310.19514

    View record at OpenAIRE
    Save to List
  13. 13
    Academic Journal

    A characterization of testable hypergraph properties

    Authors: Joos, Felix a, Kim, Jaehoon b, Kühn, Daniela c, Osthus, Deryk c

    Source: In Journal of Combinatorial Theory, Series B September 2025 174:133-189

    View record from ScienceDirect
    Linked Full Text
    Save to List
  14. 14
    Academic Journal

    Improved Bounds for Matching in Random-Order Streams

    Authors: Bernstein, Aaron

    Contributors: Aaron Bernstein

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

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

    File Description: application/pdf

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

    View record at OpenAIRE View record at Springer
    Linked Full Text
    Save to List
  15. 15
    Conference

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

    Authors: Andoni, Alexandr, Nosatzki, Negev Shekel

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

    Save to List
  16. 16
    Conference

    Robust and Sample Optimal Algorithms for PSD Low Rank Approximation

    Authors: Bakshi, Ainesh, Chepurko, Nadiia, Woodruff, David P.

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

    Save to List
  17. 17
    Conference

    Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance

    Authors: Kociumaka, Tomasz, Saha, Barna

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

    Save to List
  18. 18
    Academic Journal

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

    Authors: Mahabadi, Sepideh, Roghani, Mohammad, Tarnawski, Jakub

    Contributors: Sepideh Mahabadi and Mohammad Roghani and Jakub Tarnawski

    Subject Terms: Sublinear Algorithms, Maximum Matching, Maximal Matching, Approximation Algorithm

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

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

    View record from BASE
    Save to List
  19. 19
    Academic Journal

    Approximating Dasgupta Cost in Sublinear Time from a Few Random Seeds

    Authors: Kapralov, Michael, Kumar, Akash, Lattanzi, Silvio, Mousavifar, Aida, Wrzos-Kaminska, Weronika

    Contributors: Michael Kapralov and Akash Kumar and Silvio Lattanzi and Aida Mousavifar and Weronika Wrzos-Kaminska

    Subject Terms: Sublinear algorithms, Hierarchical Clustering, Dasgupta’s Cost

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

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

    View record from BASE
    Save to List
  20. 20
    Academic Journal

    Sublinear Metric Steiner Tree via Improved Bounds for Set Cover

    Authors: Mahabadi, Sepideh, Roghani, Mohammad, Tarnawski, Jakub, Vakilian, Ali

    Contributors: Sepideh Mahabadi and Mohammad Roghani and Jakub Tarnawski and Ali Vakilian

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

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

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

    View record from BASE
    Save to List

Search Tools: