Difference between revisions of "Main Page"
m |
|||
| Line 19: | Line 19: | ||
*[[Waiting|Submiting a new problem]] | *[[Waiting|Submiting a new problem]] | ||
| − | == Contact == | + | == Contact information == |
| − | Please send questions and comments to [mailto:admin@sublinear.info admin@sublinear.info]. | + | *Please send questions and comments to [mailto:admin@sublinear.info admin@sublinear.info]. |
| + | *[//www.youtube.com/watch?v=_Sy9c0bQRsU Who we are] | ||
__NOTOC__ | __NOTOC__ | ||
Revision as of 06:49, 12 December 2012
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 10, 2012: Email confirmation is now required to prevent spammers.
Oct 01, 2012: This website will contain a list of open problems. There will be an official opening soon! Stay tuned!
Content
- Ordered list of open problems
- Workshops where open problems were suggested
- Resources on sublinear algorithms
Citing and Editing
Contact information
- Please send questions and comments to admin@sublinear.info.
- Who we are
