New Algorithms and Lower Bounds for Streaming Tournaments

被引：0
|
作者：
Ghosh, Prantar [1 ]
Kuchlous, Sahil [2 ]
机构：
[1] Department of Computer Science, Georgetown University, Washington,DC, United States
[2] Harvard University, Cambridge,MA, United States
来源：
Leibniz International Proceedings in Informatics, LIPIcs | / 308卷
基金：
美国国家科学基金会;
关键词：
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Approximation algorithms - Audio streaming - Graph algorithms - Hamiltonians - Set theory
引用
收藏
相关论文
共 50 条
  • [1] Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms
    Larsen, Kasper Green
    Nelson, Jelani
    Nguyen, Huy L.
    STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2015, : 803 - 812
  • [2] Polynomial Pass Lower Bounds for Graph Streaming Algorithms
    Assadi, Sepehr
    Chen, Yu
    Khanna, Sanjeev
    PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 265 - 276
  • [3] On Robust Streaming for Learning with Experts: Algorithms and Lower Bounds
    Woodruff, David P.
    Zhang, Fred
    Zhou, Samson
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [4] Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering Cost
    Assadi, Sepehr
    Shah, Vihan
    Wang, Chen
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [5] LOWER BOUNDS ON STREAMING ALGORITHMS FOR APPROXIMATING THE LENGTH OF THE LONGEST INCREASING SUBSEQUENCE
    Gal, Anna
    Gopalan, Parikshit
    SIAM JOURNAL ON COMPUTING, 2010, 39 (08) : 3463 - 3479
  • [6] Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence
    Gal, Anna
    Gopalan, Parikshit
    48TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2007, : 294 - 304
  • [7] New algorithms and lower bounds for monotonicity testing
    Chen, Xi
    Servedio, Rocco A.
    Tan, Li-Yang
    2014 55TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2014), 2014, : 286 - 295
  • [8] Lower bounds for testing digraph connectivity with one-pass streaming algorithms
    Migler, Theresa (Tmigler@gmail.com), 2018, Institute of Electrical and Electronics Engineers Inc. (01):
  • [9] Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms
    Assadi, Sepehr
    Raz, Ran
    2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 342 - 353
  • [10] A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms
    Sudholt, Dirk
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2013, 17 (03) : 418 - 435
12345