Main Page

About

The goal of this wiki is to collate a set of open problems in sub-linear algorithms and to track progress that is made on these problems. Important topics within sub-linear algorithms include data stream algorithms (sub-linear space), property testing (sub-linear time), and communication complexity (sub-linear communication) but this list isn't exhaustive. Indeed many of the early problems were posted at related workshops. We invite you to add further questions and update the wiki when progress is made on existing questions.

News

Nov 08, 2017: A list of open problems from Frontiers in Distribution Testing, a workshop at FOCS 2017, has been posted.

Apr 28, 2017: A list of open problems from a BIRS workshop on communication complexity has been posted.

Jan 19, 2017: We made the switch to HTTPS for more security. Please let us know at admin@sublinear.info if something stops to work. Consider also updating your password.

Old news…

Content

• Ordered list of open problems
• The entire list compiled into a single pdf (May be out of date. Save trees! Don't print unless you really have to.)
• Workshops where open problems were suggested
• Resources on sublinear algorithms

Random (Unsolved) Problem

• Problem 91: Cut-Sparsification of Hypergraphs

Citing and Editing

• Citing open problems
• Editing
• Submiting a new problem
• Improvement suggestions

Contact information

• Please send questions and comments to admin@sublinear.info.
• Who we are