Search Results - sublinear and near linear time algorithms phrases Streaming algorithms

Semi-streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints

Authors: Chien-Chung Huang François Sellier Huang, Chien-Chung

Contributors: Chien-Chung Huang François Sellier Huang, Chien-Chung

Source: Algorithmica. 86:3598-3628

Subject Terms: FOS: Computer and information sciences, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching submodular function maximization streaming matroid matchoid, sublinear and near linear time algorithms, 0211 other engineering and technologies, 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 2012 ACM Subject Classification Theory of computation → Streaming, matchoid, 01 natural sciences, Computer Science - Data Structures and Algorithms, matroid, Data Structures and Algorithms (cs.DS), streaming, submodular function maximization

File Description: application/pdf

Access URL: http://arxiv.org/abs/2107.13071
https://hal.science/hal-03982431v1

Sliding Window Property Testing for Regular Languages

Authors: Ganardi, Moses Hucke, Danny Lohrey, Markus et al.

Contributors: Ganardi, Moses Hucke, Danny Lohrey, Markus et al.

Source: 30th International Symposium on Algorithms and Computation (ISAAC 2019)
https://hal.science/hal-03942948
30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019, ShangHai, China. ⟨10.4230/LIPIcs.ISAAC.2019.6⟩

Subject Terms: 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms phrases Streaming algorithms approximation algorithms regular languages, 2012 ACM Subject Classification Theory of computation → Streaming, sublinear and near linear time algorithms phrases Streaming algorithms, approximation algorithms, regular languages, [INFO]Computer Science [cs]

Subject Geographic: ShangHai, China

Relation: hal-03942948; https://hal.science/hal-03942948; https://hal.science/hal-03942948/document; https://hal.science/hal-03942948/file/LIPIcs-ISAAC-2019-6.pdf

Availability: https://hal.science/hal-03942948
https://hal.science/hal-03942948/document
https://hal.science/hal-03942948/file/LIPIcs-ISAAC-2019-6.pdf
https://doi.org/10.4230/LIPIcs.ISAAC.2019.6

Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints

Authors: Huang, Chien-Chung Sellier, François École normale supérieure - Paris (ENS-PSL) et al.

Contributors: Huang, Chien-Chung Sellier, François École normale supérieure - Paris (ENS-PSL) et al.

Source: APPROX/RANDOM ; https://hal.science/hal-03982431 ; APPROX/RANDOM, Aug 2021, Seattle, United States

Subject Terms: 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching submodular function maximization streaming matroid matchoid, 2012 ACM Subject Classification Theory of computation → Streaming, sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching, submodular function maximization, streaming, matroid, matchoid, [INFO]Computer Science [cs]

Subject Geographic: Seattle, United States

Availability: https://hal.science/hal-03982431
https://hal.science/hal-03982431v1/document
https://hal.science/hal-03982431v1/file/2107.13071.pdf

Enhancing Data Compression: Recent Innovations in LZ77 Algorithms.

Authors: Hong, Aaron Boucher, Christina

Source: Journal of Computational Biology; Aug2025, Vol. 32 Issue 8, p761-780, 20p

Optimizing Offer Sets in Sub-Linear Time.

Authors: FARIAS, VIVEK F. LI, ANDREW A. SINHA, DEEKSHA

Source: EC: Economics & Computation; 2020, p639-640, 2p

Subject Terms: COMMERCIAL products, MANUFACTURED products, ALGORITHMS, MACHINE theory, ECONOMICS, SOCIAL sciences

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time.

Authors: Dong, Sally Gao, Yu Goranci, Gramoz et al.

Source: Journal of the ACM; Aug2025, Vol. 72 Issue 4, p1-75, 75p

Subject Terms: PLANAR graphs, INTERIOR-point methods, SPARSE graphs, ALGORITHMS, DATA structures, FLUID flow, TIME complexity

Vertex Connectivity in Poly-logarithmic Max-Flows.

Authors: Li, Jason Nanongkai, Danupon Panigrahi, Debmalya et al.

Source: Journal of the ACM; Aug2025, Vol. 72 Issue 4, p1-34, 34p

Subject Terms: GRAPH connectivity, COMPUTATIONAL complexity, DIRECTED graphs, ALGORITHMS, UNDIRECTED graphs

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

RANGE (RÉNYI) ENTROPY QUERIES AND PARTITIONING.

Authors: ESMAILPOUR, ARYAN KRISHNAN, SANJAY SINTOS, STAVROS

Source: Logical Methods in Computer Science (LMCS); 2025, Vol. 21 Issue 4, p17:1-17:49, 49p

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

A Framework for Adversarially Robust Streaming Algorithms.

Authors: BEN-ELIEZER, OMRI JAYARAM, RAJESH WOODRUFF, DAVID P. et al.

Source: Journal of the ACM; Mar2022, Vol. 69 Issue 2, p1-33, 33p

Subject Terms: DETERMINISTIC algorithms, ALGORITHMS

Sketching Approximability of All Finite CSPs.

Authors: Chou, Chi-Ning Golovnev, Alexander Sudan, Madhu et al.

Source: Journal of the ACM; Apr2024, Vol. 71 Issue 2, p1-74, 74p

Subject Terms: CONSTRAINT satisfaction, BOOLEAN functions, SEPARATION of variables, FOURIER analysis, APPROXIMATION algorithms, COMMUNICATION barriers, HYPERCUBES

A Linear-Time n^0.4-Approximation for Longest Common Subsequence.

Authors: BRINGMANN, KARL COHEN-ADDAD, VINCENT DAS, DEBARATI

Source: ACM Transactions on Algorithms; Jan2023, Vol. 19 Issue 1, p1-24, 24p

Subject Terms: APPROXIMATION algorithms, DYNAMIC programming, COMMUNITIES, EXPECTATION-maximization algorithms

Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time.

Authors: CHAKRABORTY, DIPTARKA DAS, DEBARATI GOLDENBERG, ELAZAR et al.

Source: Journal of the ACM; 2020, Vol. 67 Issue 6, p1-22, 22p

Subject Terms: DISTANCES, DYNAMIC programming, APPROXIMATION algorithms

Counting Subgraphs in Degenerate Graphs.

Authors: BERA, SUMAN K. GISHBOLINER, LIOR LEVANZOV, YEVGENY et al.

Source: Journal of the ACM; May2022, Vol. 69 Issue 3, p1-21, 21p

Subject Terms: PLANAR graphs, COUNTING, STOCHASTIC processes, CHARTS, diagrams, etc., HOMOMORPHISMS, GRAPH algorithms, PROBLEM solving, SUBGRAPHS

Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance.

Authors: Gudmundsson, Joachim Seybold, Martin P. Wong, Sampson

Source: ACM Transactions on Algorithms; Apr2024, Vol. 20 Issue 2, p1-33, 33p

Subject Terms: DATA structures, POLYNOMIAL time algorithms, PLANAR graphs, GRAPH algorithms, APPROXIMATION algorithms, MATCHING theory, COMPUTATIONAL geometry

Towards Optimal Moment Estimation in Streaming and Distributed Models.

Authors: JAYARAM, RAJESH WOODRUFF, DAVID P.

Source: ACM Transactions on Algorithms; Jul2023, Vol. 19 Issue 3, p1-35, 35p

Subject Terms: MATRIX multiplications, DISTRIBUTED algorithms, TOPOLOGY, MESSAGE passing (Computer science), DATA modeling

Tolerant Testers of Image Properties.

Authors: BERMAN, PIOTR MURZABULATOV, MEIRAM RASKHODNIKOVA, SOFYA

Source: ACM Transactions on Algorithms; Nov2022, Vol. 18 Issue 4, p1-39, 39p

Subject Terms: APPROXIMATION algorithms, IMAGE processing, CONVEX sets, DYNAMIC programming, MATHEMATICAL connectedness, COMPUTATIONAL geometry, POLYGONS

Delegating Computation: Interactive Proofs for Muggles.

Authors: GOLDWASSER, SHAFI KALAI, YAEL TAUMAN ROTHBLUM, GUY N.

Source: Journal of the ACM; Aug2015, Vol. 62 Issue 4, p1-64, 64p

Subject Terms: POLYNOMIAL time algorithms, COMPUTATIONAL complexity, ALGORITHMS, COMPUTABLE functions, THEORY

CoCoS: Fast and Accurate Distributed Triangle Counting in Graph Streams.

Authors: KIJUNG SHIN EUIWOONG LEE HAMMOUD, MOHAMMAD et al.

Source: ACM Transactions on Knowledge Discovery from Data; Apr2021, Vol. 15 Issue 3, p1-30, 30p

Subject Terms: DISTRIBUTED algorithms, TRIANGLES, ANOMALY detection (Computer security), COUNTING, UNBIASED estimation (Statistics)