# “Refined” list of open problems in TCS

In the conference on learning theory (COLT), a list of open problems is published every year, for example, the list of 2019.

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, 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)

• Like this? cstheory.stackexchange.com/q/1015/129 – Joshua Grochow Jun 17 '20 at 15:39
• – Huck Bennett Jun 17 '20 at 17:12
• 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. Jun 17 '20 at 17:47

There is a list of open problems in computational geometry. It is edited and maintained by Demaine, Mitchell, and O'Rourke.

• Thanks, I will add this source to the question – Johana T. Jun 18 '20 at 19:08
• This was one of the resources I linked to in the list above. – Huck Bennett Jun 22 '20 at 14:26

There is a list of open problems in graph theory and combinatorics collected and maintained by Douglas B. West.

This page maintains a list of lists of open problems in parameterized complexity.

• The parameterized complexity page also appears in the list I linked to above. – Huck Bennett Jun 22 '20 at 14:27

There's the TLCA List of Open Problems, 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, 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.

• 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 Jun 24 '20 at 14:53