What we're about

The purpose of this group is to bring together people that enjoy reading and discussing computer science papers. Do you want to talk about a recent paper that you are excited about? Do you want to explain fundamental papers of your field to a wider audience? Do you want to (re-)discover important research works in computer science? Do you have this really cool paper you want to tell us about? Present the papers that you love, tell us about how you've implemented them and how you use them, or simply listen and discuss!

This meetup, located in Zürich, is inspired and follows the practices of the global "papers we love" community: http://paperswelove.org/ .

We collaborate via a github repository (https://github.com/papers-we-love/zurich). If you are interested in talking about a paper, get in touch or add yourself to the list (https://github.com/papers-we-love/zurich/blob/master/paper_ideas.md) and send us a pull request.

It is extremely important to build a community where everyone can participate. Please read and follow the Papers We Love Code of Conduct (https://github.com/papers-we-love/papers-we-love/blob/master/CODE_OF_CONDUCT.md).

(Background photo: Blue Zurich by kuhnmi (Flickr) (https://www.flickr.com/photos/31176607@N05/31895270053) - CC BY 2.0 (https://creativecommons.org/licenses/by/2.0/) (cropped and reduced brightness))

Upcoming events (1)

Nikolas Göbel: Out of the tar pit

Google Zurich

Papers We Love: Zürich is back! We are grateful to Google for hosting us! Please make sure to RSVP here *and* sign up using the Google registration form (https://docs.google.com/forms/d/e/1FAIpQLSeEi3pmNkS_Le4EMaWsCFyGkMm7JxBDfU2NmrIw1VpPMWgYJg/viewform) - you'll receive a visitor badge at the event. Please fill in the form BY MARCH 24TH. Nikolas Göbel is going to talk software complexity by guiding us through a classic, "Out of the tar pit" by Ben Moseley and Peter Marks. (https://github.com/papers-we-love/papers-we-love/blob/master/design/out-of-the-tar-pit.pdf) Here's Nikolas' abstract for the talk: In 2006, Ben Moseley and Peter Marks explored something that many of us are familiar with: the creeping feeling that the complexity of a software system has outgrown the complexity of the very domain it was designed to capture. By taking a fresh look at which kinds of complexity are to be considered essential and which are merely introduced by accident, they put in words many deceptively obvious insights. Better still, they hinted at Codd's relational model and ideas from functional programming as a way out. Unfortunately, they left implementing their approach as an exercise to the reader, calling their own ideas “purely hypothetical” and “not proven in practice”. What were they on to? What has changed? And how deep is the tar pit today? --- Nikolas is a software consultant at Clockworks and a computer science graduate at ETH Zurich. His interest is in building systems that produce accurate answers to complex questions in near real-time, and simplify the development of powerful, interactive applications.

Past events (4)

Photos (27)