A note on randomized streaming space bounds for the longest increasing subsequence problem (Q413292): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2011.12.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2074139744
@@ Property / OpenAlex ID: W2074139744 / rank @@
+Normal rank
@@ Property / cites work @@
+The space complexity of approximating the frequency moments
+Normal rank
@@ Property / cites work @@
+Q3579382
@@ Property / cites work: Q3579382 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence
+Normal rank
@@ Property / cites work @@
+Q2934610
@@ Property / cites work: Q2934610 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3425115
@@ Property / cites work: Q3425115 / rank @@
+Normal rank
@@ Property / cites work @@
+Private vs. common random bits in communication complexity
+Normal rank