Lower Bounds for Testing Digraph Connectivity with One-Pass Streaming Algorithms

Letters of the IEEE Computer Society ◽

10.1109/lcos.2018.2854761 ◽

2018 ◽

Vol 1 (1) ◽

pp. 9-11

Author(s):

Theresa Migler

Keyword(s):

Lower Bounds ◽

Streaming Algorithms

Download Full-text

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

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs46700.2020.00040 ◽

2020 ◽

Author(s):

Sepehr Assadi ◽

Ran Raz

Keyword(s):

Lower Bounds ◽

Streaming Algorithms ◽

Graph Streaming

Download Full-text

Polynomial pass lower bounds for graph streaming algorithms

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 ◽

10.1145/3313276.3316361 ◽

2019 ◽

Author(s):

Sepehr Assadi ◽

Yu Chen ◽

Sanjeev Khanna

Keyword(s):

Lower Bounds ◽

Streaming Algorithms ◽

Graph Streaming

Download Full-text

Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing - STOC '15 ◽

10.1145/2746539.2746542 ◽

2015 ◽

Author(s):

Kasper Green Larsen ◽

Jelani Nelson ◽

Huy L. Nguyên

Keyword(s):

Lower Bounds ◽

Streaming Algorithms

Download Full-text

Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) ◽

10.1109/focs.2007.54 ◽

2007 ◽

Author(s):

Anna Gal ◽

Parikshit Gopalan

Keyword(s):

Lower Bounds ◽

Streaming Algorithms ◽

Longest Increasing Subsequence

Download Full-text

Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) ◽

10.1109/focs.2007.4389501 ◽

2007 ◽

Author(s):

Anna Gal ◽

Parikshit Gopalan

Keyword(s):

Lower Bounds ◽

Streaming Algorithms ◽

Longest Increasing Subsequence

Download Full-text

Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence

SIAM Journal on Computing ◽

10.1137/090770801 ◽

2010 ◽

Vol 39 (8) ◽

pp. 3463-3479 ◽

Author(s):

Anna Gál ◽

Parikshit Gopalan

Keyword(s):

Lower Bounds ◽

Streaming Algorithms ◽

Longest Increasing Subsequence

Download Full-text

Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits

RAIRO - Theoretical Informatics and Applications ◽

10.1051/ita:2001120 ◽

2001 ◽

Vol 35 (3) ◽

pp. 277-286 ◽

Author(s):

Jan Johannsen

Keyword(s):

Download Full-text

Lower Bounds in Communication Complexity

10.1561/9781601982599 ◽

2007 ◽

Author(s):

T. Lee ◽

A. Shraibman

Keyword(s):

Lower Bounds ◽

Communication Complexity

Download Full-text

Lower Bounds on the Aperiodic Hamming Correlations of Frequency Hopping Sequences

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e96.a.1445 ◽

2013 ◽

Vol E96.A (6) ◽

pp. 1445-1450 ◽

Author(s):

Xing LIU ◽

Daiyuan PENG ◽

Xianhua NIU ◽

Fang LIU

Keyword(s):

Lower Bounds ◽

Frequency Hopping ◽

Frequency Hopping Sequences

Download Full-text

Two Lower Bounds for Shortest Double-Base Number System

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e98.a.1310 ◽

2015 ◽

Vol E98.A (6) ◽

pp. 1310-1312 ◽

Author(s):

Parinya CHALERMSOOK ◽

Hiroshi IMAI ◽

Vorapong SUPPAKITPAISARN

Keyword(s):

Lower Bounds ◽

Number System ◽

Base Number ◽

Download Full-text