Sources of open problems? I'm wondering if there are some known sources of open TCS problems? I'm a junior studying math/CS and would like to know of some accessible problems that I could start thinking about! 

Thanks so much!
Here's a partial list of collections of open problems in TCS, broadly construed. Note that a collection of "major open problems" exists already on this site: http://cstheory.stackexchange.com/questions/174/major-unsolved-problems-in-theoretical-computer-science/251#251.


In Computer Science (Wikipedia): https://en.wikipedia.org/wiki/List_of_unsolved_problems_in_computer_science
Sublinear time algorithms: http://sublinear.info/index.php?title=Main_Page
Analysis of Boolean Functions: http://lanl.arxiv.org/abs/1204.6447
Computational geometry: http://cs.smith.edu/~orourke/TOPP/
Exact algorithms: http://faculty.cs.tamu.edu/chen/courses/cpsc669/2011/notes/ww1.pdf
Formal languages, etc.: https://www.student.cs.uwaterloo.ca/~cs462/openproblems.html
Parameterized complexity: http://fpt.wikidot.com/open-problems
Topological graph theory: http://www.cems.uvm.edu/~darchdea/problems/problems.html
Embeddings of finite metric spaces: http://kam.mff.cuni.cz/~matousek/metrop.ps
Lambda calculus, proof theory, semantics, and programming languages: http://tlca.di.unito.it/opltlca/
Perfect graphs: http://www.aimath.org/WWN/perfectgraph/
Real analysis in computer science: https://simons.berkeley.edu/sites/default/files/openprobsmerged.pdf
Fine-grained complexity: http://duch.mimuw.edu.pl/~malcin/opl.pdf
Communication complexity: https://sublinear.info/index.php?title=Workshops:Banff_2017
Erdős problems: http://www.math.ucsd.edu/~erdosproblems/All.html