A community-curated directory of notable computer science papers with local chapters for discussion and learning.
Papers We Love is a community-driven project that curates and organizes notable academic papers from computer science and related fields. It solves the problem of scattered research documents by providing a centralized directory, and fosters learning through local chapter meetups and online discussions.
Computer science students, researchers, software engineers, and tech enthusiasts who want to deepen their understanding of foundational research and engage with a community of learners.
Developers choose Papers We Love for its carefully selected paper collection, active global community, and structured opportunities for discussion—offering both curated content and social learning beyond typical paper repositories.
Papers from the computer science community to read and discuss.
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.
Organizes high-quality computer science papers with links to official sources, saving time in finding influential research beyond scattered web searches.
Hosts local chapter meetups and a Discord server for discussions, enabling peer learning and networking around academic topics.
Includes guides on how to read academic papers effectively, helping newcomers navigate complex material with practical advice.
Accepts pull requests for new paper recommendations, allowing the community to continuously expand and improve the directory.
Due to licensing restrictions, many papers are not hosted directly; only links are provided, which can lead to broken links or access issues if sources change.
Local chapters rely on volunteer organizers, so meetup availability and activity levels can vary significantly by region, affecting engagement opportunities.
The directory is extensive but not finely categorized, making it difficult for beginners to find entry-level papers without additional guidance or filtering.