Search Results - Graph Streaming Algorithms

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms

Authors: Sepehr Assadi Ran Raz

Source: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). :342-353

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences

Access URL: http://arxiv.org/pdf/2009.01161
http://arxiv.org/abs/2009.01161
https://www.researchwithrutgers.com/en/publications/near-quadratic-lower-bounds-for-two-pass-graph-streaming-algorith-2
http://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-01161
https://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-01161
https://collaborate.princeton.edu/en/publications/near-quadratic-lower-bounds-for-two-pass-graph-streaming-algorith

Learning-Augmented Streaming Algorithms for Approximating MAX-CUT

Authors: Dong, Yinhao Peng, Pan Vakilian, Ali et al.

Contributors: Dong, Yinhao Peng, Pan Vakilian, Ali et al.

Subject Terms: Graph Streaming Algorithms, FOS: Computer and information sciences, Learning-Augmented Algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), MAX-CUT, ddc:004

File Description: application/pdf

Access URL: http://arxiv.org/abs/2412.09773
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.44

Fast shared-memory streaming multilevel graph partitioning

Authors: Jafari, Nazanin Selvitopi, Oguz Aykanat, Cevdet

Source: Journal of Parallel and Distributed Computing. 147

Subject Terms: 46 Information and Computing Sciences (for-2020), 4603 Computer Vision and Multimedia Computation (for-2020), Networking and Information Technology R&D (NITRD) (rcdc), Streaming algorithms, Graph partitioning, Multilevel graph partitioning, Parallel graph partitioning, 0803 Computer Software (for), 0805 Distributed Computing (for), Distributed Computing (science-metrix), 4606 Distributed computing and systems software (for-2020)

File Description: application/pdf

Access URL: https://escholarship.org/uc/item/8jq8x3vf
https://escholarship.org/content/qt8jq8x3vf/qt8jq8x3vf.pdf

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $\Delta$-Coloring

Authors: Sepehr Assadi Pankaj Kumar Parth Mittal

Source: TheoretiCS, Vol 2 (2023)

Subject Terms: computer science - data structures and algorithms, f.2, Electronic computers. Computer science, QA75.5-76.95

File Description: electronic resource

Relation: https://theoretics.episciences.org/9739/pdf; https://doaj.org/toc/2751-4838

Access URL: https://doaj.org/article/ffab2e0c5c474015b5e4200cc0f3663c

Streaming data analytics via message passing with application to graph algorithms

Contributors: Shead, Tim [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)]

Source: Journal of Parallel and Distributed Computing; 74; 8

File Description: Medium: ED; Size: p. 2687-2698

Access URL: http://www.osti.gov/scitech/servlets/purl/1062811

Polynomial pass lower bounds for graph streaming algorithms

Authors: Sanjeev Khanna Sepehr Assadi Yu Chen

Source: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. :265-276

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences

Access URL: http://arxiv.org/abs/1904.04720
https://dblp.uni-trier.de/db/journals/corr/corr1904.html#abs-1904-04720
http://arxiv.org/pdf/1904.04720.pdf
https://www.researchwithrutgers.com/en/publications/polynomial-pass-lower-bounds-for-graph-streaming-algorithms
https://arxiv.org/abs/1904.04720
https://dl.acm.org/doi/pdf/10.1145/3313276.3316361

Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time.

Authors: Bhattacharya, Sayan Kiss, Peter Saranurak, Thatchaphol et al.

Source: Journal of the ACM; Oct2024, Vol. 71 Issue 5, p1-32, 32p

Subject Terms: GRAPH algorithms, OPEN-ended questions, ALGORITHMS

Sampling and Streaming Algorithms for Counting Small Patterns in BIG Graphs.

Contributors: Pinar, Ali

Source: Conference: Proposed for presentation at the Dagstuhl Workshop on Grapjh algorithms for scientific computing held November 10-14, 2014, Germany.

File Description: Medium: ED; Size: 42 p.

Access URL: http://www.osti.gov/scitech/servlets/purl/1367646

Graph streaming lower bounds for parameter estimation and property testing via a streaming XOR lemma

Authors: Sepehr Assadi Vishvajeet N

Source: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. :612-625

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences

Access URL: http://arxiv.org/pdf/2104.04908
http://arxiv.org/abs/2104.04908
https://dblp.uni-trier.de/db/journals/corr/corr2104.html#abs-2104-04908
https://dl.acm.org/doi/pdf/10.1145/3406325.3451110
http://acm-stoc.org/stoc2021/accepted-papers.html#117
https://www.researchwithrutgers.com/en/publications/graph-streaming-lower-bounds-for-parameter-estimation-and-propert
https://arxiv.org/abs/2104.04908

Streaming algorithms for triangle counting: adversarial robustness and the weighted case.

Authors: Cao, Jing Pan, Yicheng Peng, Pan

Source: Frontiers of Computer Science; Jan2026, Vol. 20 Issue 1, p1-3, 3p

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms

Authors: Assadi, Sepehr Raz, Ran

Index Terms: Computer Science - Data Structures and Algorithms, Computer Science - Computational Complexity, text

URL: http://arxiv.org/abs/2009.01161

FREIGHT: Fast Streaming Hypergraph Partitioning.

Authors: Eyubov, Kamal Fonseca Faraj, Marcelo Schulz, Christian

Source: Algorithmica. Mar2025, Vol. 87 Issue 3, p405-428. 24p.

Subject Terms: *PARALLEL algorithms, *DISTRIBUTED computing, *ELECTRONIC data processing, *ALGORITHMS, *MATHEMATICS

Evaluating HAS and Low-Latency Streaming Algorithms for Enhanced QoE.

Authors: Uddin, Syed Grega, Michał Leszczuk, Mikołaj et al.

Source: Electronics (2079-9292); Jul2025, Vol. 14 Issue 13, p2587, 24p

Subject Terms: STREAMING video & television, QUALITY of service, IMAGE quality analysis, NETWORK performance

Polynomial Pass Lower Bounds for Graph Streaming Algorithms

Authors: Assadi, Sepehr Chen, Yu Khanna, Sanjeev

Index Terms: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/1904.04720

Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy

Authors: Assadi, Sepehr Ghosh, Prantar Loff, Bruno et al.

Contributors: Assadi, Sepehr Ghosh, Prantar Loff, Bruno et al.

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Graph streaming, Computer Science - Data Structures and Algorithms, Communication complexity, Data Structures and Algorithms (cs.DS), Lower bounds, k-Cores and degeneracy, ddc:004, Computational Complexity (cs.CC)

File Description: application/pdf

Access URL: http://arxiv.org/abs/2405.14835
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.7

Testable Properties in General Graphs and Random Order Streaming

Authors: Czumaj, Artur Fichtenberger, Hendrik Peng, Pan et al.

Contributors: Czumaj, Artur Fichtenberger, Hendrik Peng, Pan et al.

Subject Terms: FOS: Computer and information sciences, sublinear algorithms, TK, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Graph property testing, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ddc:004, QA, graph streaming algorithms

File Description: application/pdf

Access URL: http://arxiv.org/abs/1905.01644
http://wrap.warwick.ac.uk/139228/1/main.pdf
https://arxiv.org/abs/1905.01644
https://eprints.whiterose.ac.uk/162666/
https://drops.dagstuhl.de/opus/volltexte/2020/12619/pdf/LIPIcs-APPROX16.pdf/
http://wrap.warwick.ac.uk/139228/
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.16
https://dblp.uni-trier.de/db/journals/corr/corr1905.html#abs-1905-01644
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.16

Space-Efficient Algorithms and Verification Schemes for Graph Streams

Authors: Ghosh, Prantar

Source: Dartmouth College Ph.D Dissertations

Subject Terms: graph algorithms, streaming, graph streams, adversarial robustness, interactive proofs, Theory and Algorithms

File Description: application/pdf

Relation: https://digitalcommons.dartmouth.edu/dissertations/81; https://digitalcommons.dartmouth.edu/context/dissertations/article/1082/viewcontent/GhoshPrantar_thesis.pdf

Availability: https://digitalcommons.dartmouth.edu/dissertations/81
https://digitalcommons.dartmouth.edu/context/dissertations/article/1082/viewcontent/GhoshPrantar_thesis.pdf

Testable Properties in General Graphs and Random Order Streaming

Authors: Czumaj, Artur Fichtenberger, Hendrik Peng, Pan et al.

Contributors: Czumaj, Artur Fichtenberger, Hendrik Peng, Pan et al.

Subject Terms: Graph property testing, sublinear algorithms, graph streaming algorithms

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.16

Availability: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.16
https://nbn-resolving.org/urn:nbn:de:0030-drops-126190
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.16

Streaming Algorithms for Geometric Steiner Forest.

Authors: Czumaj, Artur Jiang, Shaofeng H.-C. Krauthgamer, Robert et al.

Source: ACM Transactions on Algorithms; Oct2024, Vol. 20 Issue 4, p1-38, 38p

Subject Terms: COST estimates, OPEN-ended questions, GENERALIZATION, ALGORITHMS, MEMORY

An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams

Authors: Assadi, Sepehr Shah, Vihan Sepehr Assadi and Vihan Shah

Contributors: Assadi, Sepehr Shah, Vihan Sepehr Assadi and Vihan Shah

Subject Terms: FOS: Computer and information sciences, Sketching, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Maximum matching, 0102 computer and information sciences, ddc:004, Graph streaming algorithms, 01 natural sciences

File Description: application/pdf

Access URL: http://arxiv.org/abs/2201.12710
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.9