Recent Advances in Multi-Pass Graph Streaming Lower Bounds Page 1 Recent Advances in
Multi-Pass Graph Streaming Lower Bounds Sepehr Assadi Cheriton School of Computer …

We consider the Max-Cut problem, asking how much space is needed by a streaming
algorithm in order to estimate the value of the maximum cut in a graph. This problem has …

Motivated by recent works on streaming algorithms for constraint satisfaction problems
(CSPs), we define and analyze oblivious algorithms for the Max-$ k $ AND problem. This …

We initiate a study of the streaming complexity of constraint satisfaction problems (CSPs)
when the constraints arrive in a random order. We show that there exists a CSP, namely Max …

We give an O(n)-space single-pass 0.483-approximation streaming algorithm for estimating
the maximum directed cut size (Max-DICUT) in a directed graph on n vertices. This improves …

An ordering constraint satisfaction problem (OCSP) is defined by a family $\mathcal {F} $ of
predicates mapping permutations on $\{1,\ldots, k\} $ to $\{0, 1\} $. An instance of Max-OCSP …

We investigate the space complexity of two graph streaming problems: MAX-CUT and its
quantum analogue, QUANTUM MAX-CUT. Previous work by Kapralov and Krachun [STOC …

In this survey we describe progress over the last decade or so in understanding the
complexity of solving constraint satisfaction problems (CSPs) approximately in the streaming …

A constraint satisfaction problem (CSP),, is specified by a finite set of constraints for positive
integers q and k. An instance of the problem on n variables is given by m applications of …

We explore the use of local algorithms in the design of streaming algorithms for the
Maximum Directed Cut problem. Specifically, building on the local algorithm of (Buchbinder …