<p>There is a list of <a href="http://cs.smith.edu/%7Ejorourke/TOPP/" rel="nofollow noreferrer">open problems in computational geometry</a>. It is edited and maintained by Demaine, Mitchell, and O'Rourke.</p>

CC BY-SA 4.0
2020-06-18T19:08:20.713Z
Thanks, I will add this source to the question
Johana T.
CC BY-SA 4.0
2020-06-22T14:26:16.170Z
This was one of the resources I linked to in the list above.
Huck Bennett
CC BY-SA 4.0
2020-06-18T04:13:59.770Z
2020-06-18T04:20:03.680Z
2020-06-18T04:20:03.680Z
Mohammad Al-Turkistany
<p>There is a list of <a href="https://faculty.math.illinois.edu/%7Ewest/openp/" rel="nofollow noreferrer">open problems in graph theory and combinatorics</a> collected and maintained by Douglas B. West.</p>
<p><a href="http://fpt.wikidot.com/open-problems" rel="nofollow noreferrer">This page</a> maintains a list of lists of open problems in parameterized complexity.</p>

CC BY-SA 4.0
2020-06-22T14:27:22.247Z
The parameterized complexity page also appears in the list I linked to above.
Huck Bennett
CC BY-SA 4.0
2020-06-22T13:42:10.450Z
2020-06-22T14:01:36.347Z
2020-06-22T14:01:36.347Z
Vinicius dos Santos
<p>There's the <a href="http://tlca.di.unito.it/opltlca/" rel="nofollow noreferrer">TLCA List of Open Problems</a>, collecting unsolved problems in <span class="math-container">$\lambda$</span>-calculi and related areas, such as proof theory, semantics and theory of programming languages.  It is maintained by Ryu Hasegawa, Luca Paolini and Paweł Urzyczyn.</p>
<p>There's also a related list, the <a href="https://www.win.tue.nl/rtaloop/" rel="nofollow noreferrer">RTA list of open problems</a>, concerning rewriting theory.  At some point it was maintained by Nachum Dershowitz and Ralf Treinen, but it seems to have not been updated in a while.</p>

CC BY-SA 4.0
2020-06-24T14:53:13.960Z
Both lists don't seems to be under active and recent curation. That's a shame, since so many new and interesting new open problems have shown up in the last decade.
Martin Berger
CC BY-SA 4.0
2020-06-24T11:28:26.470Z
2020-06-24T11:28:26.470Z
Damiano Mazza
<p>In the conference on learning theory (COLT), a list of open problems is published every year, <a href="http://proceedings.mlr.press/v99/#open" rel="noreferrer">for example, the list of 2019</a>.</p>
<p>The open problems are being submitted and peer reviewed, which makes this list reliable (in the sense that the problems are well-defined, motivated and &quot;accessible&quot;).</p>
<p>In the area of sublinear algorithms and property testing, <a href="https://sublinear.info/index.php?title=Main_Page" rel="noreferrer">there is this wiki page</a>, which similarity includes a list of open problems.</p>
<p>My question is: are there similar lists for other areas in TCS (e.g. complexity, cryptography etc.)? I didn't find such a list in common conferences, and I wonder if there are blogs/websites with a list of known open problems (which are accessible in some sense, i.e. not just &quot;p,np&quot; and problems at that level)</p>

CC BY-SA 4.0
2020-06-17T15:39:26.600Z
Like this? https://cstheory.stackexchange.com/q/1015/129
Joshua Grochow
CC BY-SA 4.0
2020-06-17T17:12:52.163Z
Also: https://cstheory.stackexchange.com/questions/38560/sources-of-open-problems.
Huck Bennett
CC BY-SA 4.0
2020-06-17T17:47:11.480Z
thanks! I am aware of those lists. My question is about either maintained projects (such that the sublinear algorithms project), or about peer reviewed sources (such as the COLT one). A blog of a known researcher for example, or a project maintained by a community of reputable authors
Johana T.
<reference-request><big-list><open-problem>
"Refined" list of open problems in TCS
Johana T.
# "Refined" list of open problems in TCS

(Asked by: username_0 on 2020-06-17)

In the conference on learning theory (COLT), a list of open problems is published every year, [for example, the list of 2019](http://proceedings.mlr.press/v99/#open).

The open problems are being submitted and peer reviewed, which makes this list reliable (in the sense that the problems are well-defined, motivated and "accessible").

In the area of sublinear algorithms and property testing, [there is this wiki page](https://sublinear.info/index.php?title=Main_Page), which similarity includes a list of open problems.

My question is: are there similar lists for other areas in TCS (e.g. complexity, cryptography etc.)? I didn't find such a list in common conferences, and I wonder if there are blogs/websites with a list of known open problems (which are accessible in some sense, i.e. not just "p,np" and problems at that level)

**Tags:** reference-request, big-list, open-problem

> **Comments:**
> **username_1**: Like this? https://cstheory.stackexchange.com/q/1015/129  
> **username_2**: Also: https://cstheory.stackexchange.com/questions/38560/sources-of-open-problems.  
> **username_0**: thanks! I am aware of those lists. My question is about either maintained projects (such that the sublinear algorithms project), or about peer reviewed sources (such as the COLT one). A blog of a known researcher for example, or a project maintained by a community of reputable authors  

---

## 3 answers

### Answer by username_3 on 2020-06-18. Score: 4

There is a list of [open problems in computational geometry](http://cs.smith.edu/%7Ejorourke/TOPP/). It is edited and maintained by Demaine, Mitchell, and O'Rourke.

> **Comments:**
> **username_0**: Thanks, I will add this source to the question  
> **username_2**: This was one of the resources I linked to in the list above.  

---

### Answer by username_4 on 2020-06-22. Score: 3

There is a list of [open problems in graph theory and combinatorics](https://faculty.math.illinois.edu/%7Ewest/openp/) collected and maintained by Douglas B. West.

[This page](http://fpt.wikidot.com/open-problems) maintains a list of lists of open problems in parameterized complexity.

> **Comments:**
> **username_2**: The parameterized complexity page also appears in the list I linked to above.  

---

### Answer by username_5 on 2020-06-24. Score: 2

There's the [TLCA List of Open Problems](http://tlca.di.unito.it/opltlca/), collecting unsolved problems in $\lambda$-calculi and related areas, such as proof theory, semantics and theory of programming languages. It is maintained by Ryu Hasegawa, Luca Paolini and Paweł Urzyczyn.

There's also a related list, the [RTA list of open problems](https://www.win.tue.nl/rtaloop/), concerning rewriting theory. At some point it was maintained by Nachum Dershowitz and Ralf Treinen, but it seems to have not been updated in a while.

> **Comments:**
> **username_6**: Both lists don't seems to be under active and recent curation. That's a shame, since so many new and interesting new open problems have shown up in the last decade.  

---

