Welcome to the DC/NoVA Papers We Love meetup! Celebrate Thanksgiving early by spending some time with fundamental computer science principles and puzzles.
Papers We Love is an international organization centered around the appreciation of computer science research papers. There's so much we can learn from the landmark research that shaped the field and the current studies that are shaping our future. Our goal is to create a community of tech professionals passionate about learning and sharing knowledge. Come join us!
New to research papers? Watch The Refreshingly Rewarding Realm of Research Papers (https://www.youtube.com/watch?v=8eRx5Wo3xYA) by Sean Cribbs.
Ideas and suggestions are welcome–fill our our interest survey here (https://docs.google.com/forms/d/e/1FAIpQLSeJwLQhnmzWcuyodPrSmqHgqrvNxRbnNSbiWAuwzHwshhy_Sg/viewform) and let us know what motivates you!
// Tentative Schedule
• 7:00-7:30–Networking and informal paper discussion
• 7:30-7:35–Introduction and announcements
• 7:35-8:40–Combinatorics and Computing Power presented by David Bock (see papers below)
• 8:40-9:00–Networking and informal paper discussion
Look for the white manor house just off Old Reston Ave. There's plenty of parking in the lot; after that, just follow the Papers We Love signs down the stairs and to the meeting room.
After the main event, anyone interested is welcome to join us at Reston Town Center (a very short walk/drive away) to continue the discussion.
The talk today by David Bock will encompass two papers:
Combinatorial Analysis and Computers (http://poncelet.math.nthu.edu.tw/disk5/js/computer/hall-knuth.pdf) by Marshall Hall Jr. and Donald E. Knuth, California Institute of Technology
Computer Investigation of Orthogonal Latin Squares of Order Ten by E. T. Parker (not free to share) Much of the talk will focus on the puzzle of orthogonal latin squares (http://mathworld.wolfram.com/LatinSquare.html).