Vienna Chapter
In the spirit of the "Papers We Love" groups around the globe we are running our own version in Vienna: Within the realm of computing, which is your favorite paper, the one that inspired or taught you the most, and which you want to tell the rest of the group about? Present the paper, show how you've implemented and used it, or simply discuss!
The Vienna Chapter meets monthly at StockWerk - Pater-Schwartz-Gasse 11A, 1150 Wien, Austria.
Papers We Love has a Code of Conduct. Please contact one of the Meetup's organizers if anyone is not following it. Be good to each other and to the PWL community!
Chapter details
Location: StockWerk - Pater-Schwartz-Gasse 11A, 1150 Wien, Austria
Sign-up: Please RSVP for meetings via Meetup.com
Twitter: @PapersWeLoveVIE
Organizers: Philipp Krenn, Dominik Gruber
Chapter Meetups
April: The Exponential Time Hypothesis (How hard is k-SAT?)
This time, our paper is strictly on the theory side of CS. The Exponential Time Hypothesis is basically the deluxe version of the common assumption that P!=NP. If you don't have the time or energy to make it through the paper (which is short, but mathy) don't be afraid, I (Lisa) already read this in the course of my studies and can present the content and answer your questions.
Get the paper here: [On the Complexity of k-SAT](https://cseweb.ucsd.edu/~paturi/myPapers/pubs/ImpagliazzoPaturi_2001_jcss.pdf)
Also interesting: The followup paper [Which Problems Have Strongly Exponential Complexity?](https://www.sciencedirect.com/science/article/pii/S002200000191774X)
Note: The location is tentative, we may move to a pub nearby.
…March: NixOS, A Purely Functional Linux Distribution
We take a break from our infatuation with crypto stuff to talk about package managers. Could there be a better way to celebrate NixOS turning 20, than to end a Thursday with a discussion of package management?
Get the paper here:[ NixOS: A Purely Functional Linux Distribution](https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=9ede9d1754a7346d573d8f430ec0fadb92cec8f2)
Note: The location is tentative, we may move to a pub nearby.
I case this paper roused your interest in NixOS, on Saturday, the 11th, there is a NixOS-themed event at metaLab: [https://metalab.at/wiki/20_years_of_Nix(OS)](https://metalab.at/wiki/20_years_of_Nix(OS))
…
February: Decentralized Storage and Proof of Spacetime
This time we read and discuss the FileCoin whitepaper. We'll try our best to understand Proof of Spacetime. Don't feel too bad If you couldn't make it through the whole thing, since it is quite long.
https://api-new.whitepaper.io/documents/pdf?id=B1F5C0bYD
Don't forget to bring you own printout ;)
…
January: Myths and Legends in High-Performance Computing
We will discuss the following very recent paper:
# Myths and Legends in High-Performance Computing
Find it here: https://arxiv.org/abs/2301.02432
Don't forget to bring you own printout ;)
…We're back: Large Language Models
We'll discuss this paper:
\* [BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding](https://arxiv.org/abs/1810.04805)
Please bring your own printout/digitial copy.
…February: Distributed Locking
Not a paper in the strict sense this time, but something similar:
* Please read https://martin.kleppmann.com/2016/02/08/how-to-do-distributed-locking.html for the theory of distributed locking.
* As well as http://antirez.com/news/101 for the practical implementation and we'll then discuss both.
Too Much Crypto
Let's kick off the year with a brand new paper: https://eprint.iacr.org/2019/1492.pdf
Please read it and bring a printed or digital copy for the discussion.
…Cassandra - A Decentralized Structured Storage System
Please read the paper https://www.cs.cornell.edu/projects/ladis2009/papers/lakshman-ladis2009.pdf — thanks to Christoph for suggesting it and leading the discussion!
…October: In Search of an Understandable Consensus Algorithm
Hey everyone,
Please read https://raft.github.io/raft.pdf and bring a printed / digital copy for the discussion. Thanks to Christoph for suggesting the paper and leading the discussion!
See you there,
Philipp
September: The ϕ Accrual Failure Detector
Please read the paper https://paperhub.s3.amazonaws.com/f516fdfa940caa08c679d3946b273128.pdf and bring a printed or digital copy for the discussion to the meetup.
http://gearons.org/2016-11-15-phifail/ also provides a nice overview that might help with the understanding.
See you at the event,
Philipp
May: I/O Is Faster Than the CPU
This time we are going for a cutting edge paper: I/O Is Faster Than the CPU – Let’s Partition Resourcesand Eliminate (Most) OS Abstractions
Please read https://penberg.org/parakernel-hotos19.pdf and bring a printed or digital copy for the discussion.
…April: A Critique of the CAP Theorem
Please read https://arxiv.org/pdf/1509.05393.pdf and bring a printed or digital copy for the discussion
…March: Lessons from Giant-Scale Services
Please read https://people.eecs.berkeley.edu/~brewer/papers/GiantScale-IEEE.pdf and bring a printed or digital copy for the discus
…February: Software Aging
Please read https://www.cs.drexel.edu/~yfcai/CS451/RequiredReadings/SoftwareAging.pdf and bring a printed or digital copy to the discussion. Thanks to Siegfried for suggesting the paper and leading the discussion.
See you in February,
Philipp
January: Amazon Aurora Design Considerations
After taking a short break we are back.
Please read https://media.amazonwebservices.com/blog/2017/aurora-design-considerations-paper.pdf and bring a printed or digital copy to the discussion.
See you in January,
Philipp
Sagas
Please read the Sagas paper from 1987 for this meetup: https://www.cs.cornell.edu/andru/cs711/2002fa/reading/sagas.pdf
Don't forget to bring a printed or digital copy to the event for our discussion.
…A Fast File System for UNIX
Please read the "A Fast File System for UNIX" paper from 1984 for this meetup: https://people.eecs.berkeley.edu/~brewer/cs262/FFS.pdf
Don't forget to bring a printed or digital copy to the event for our discussion.
…June: The Log-Structured Merge-Tree
Please read "The Log-Structured Merge-Tree (LSM-Tree)"
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.44.2782&rep=rep1&type=pdf
The paper is with 30 pages a bit long for our format, so I suggest to skip over chapter 3 if necessary (LSM-Tree cost-performance analysis).
Please don't forget to bring your (digital) copy of the paper to the meetup.
…May: Immutability Changes Everything!
Please read
Pat Helland: Immutability Changes Everything!
http://cidrdb.org/cidr2015/Papers/CIDR15_Paper16.pdf
and bring a copy to the meetup.
See you there,
Peter
April: Modelling Network Traffic using Game Theory
Please read the chapter "Modelling Network Traffic using Game Theory" from the book Networks, Crowds, and Markets: Reasoning about a Highly Connected World. By David Easley and Jon Kleinberg. Cambridge University Press, 2010.
https://www.cs.cornell.edu/home/kleinber/networks-book/networks-book-ch08.pdf
and bring a copy to the meetup.
See you there,
Peter
March: Game Theory
Please read the paper about "Game Theory": http://www.cdam.lse.ac.uk/Reports/Files/cdam-2001-09.pdf
See you at the meetup,
Philipp
February: A Knowledge-Grounded Neural Conversation Model
Svitlana suggested "A Knowledge-Grounded Neural Conversation Model". So please read https://arxiv.org/pdf/1702.01932.pdf and bring a physical or digital copy to the meetup.
See you on Thursday!
January: Meltdown
Let's start the new year with a hot topic: the Meltdown paper —
https://meltdownattack.com/meltdown.pdf
As always, please read the paper, so we can discuss it during the meetup.
See you soon,
Philipp
PS: Please bring a (printed or digital) copy of the paper for the discussion.
…
November: IPFS
Please read the IPFS paper, suggested by Peter.
See you in late November :)
…October: Bitcoin
We are a bit late with picking the paper, but I assume most people only read it over the weekend before the meetup anyway ;-)
Anyway, I've picked the original Bitcoin paper — only 8 pages long, but should be an interesting topic. Please read https://bitcoin.org/bitcoin.pdf
See you on Monday,
Philipp
Mastering the Game of Go with Deep Neural Networks and Tree Search
While we're taking a summer break, we've already planned the next meetup:
Please read Mastering the Game of Go with Deep Neural Networks and Tree Search, which was suggested by László who will also lead the discussion :)
See you in August,
Philipp
Consensus on Transaction Commit
We will continue the consensus discussion from last time with Consensus on Transaction Commit by Jim Gray & Leslie Lamport. So please read the paper: https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/tr-2003-96.pdf
Thanks to László for leading the discussion!
…Paxos Made Simple by Leslie Lamport
We are going for a classic again: Paxos Made Simple by Leslie Lamport (2001). Please read the paper (abstract) and thanks to Peter for suggesting it plus leading the discussion.
If you need additional motivation — the abstract already states: The current version is 13 pages long, and contains no formula more complicated than n1 > n2.
And for a change of scenery, we're trying a new venue: CodeFactory Vienna in Herklotzgasse 21, 1150 Wien. It's just around the corner from StockWerk.
See you in May,
Philipp
March: Spanner, TrueTime & The CAP Theorem
For a change we are going back to some current developments in distributed systems. Please read: Spanner, TrueTime & The CAP Theorem.
See you in March,
Philipp
Chains of Reasoning over Entities, Relations, and Text using RNNs
Please read Chains of Reasoning over Entities, Relations, and Text usingRecurrent Neural Networks. To actually try it out, there is an implementation at https://github.com/rajarshd/ChainsOfReasoning. Thanks to Svitlana for suggesting the paper (and leading the discussion ;-) ).
Cheers,
Philipp
Parsing with Derivatives
Hey everybody,
We're taking a break in December, but we have already scheduled our January event: Pivo will present "Parsing with Derivatives", so please read http://matt.might.net/papers/might2011derivatives.pdf
Happy holidays and see you next year,
Philipp
MapReduce
Hey everyone,
We're switching focus a little from Machine Learning to more classic stuff again.
László has suggested MapReduce: Simplified Data Processing on Large Clusters, so please read it :).
See you in November,
Philipp
Neural Photo Editing with Introspective Adversarial Networks
Please read https://arxiv.org/abs/1609.07093:
We present the Neural Photo Editor, an interface for exploring the latent space of generative image models and making large, semantically coherent changes to existing images. Our interface is powered by the Introspective Adversarial Network, a hybridization of the Generative Adversarial Network and the Variational Autoencoder designed for use in the editor. Our model makes use of a novel computational block based on dilated convolutions, and Orthogonal Regularization, a novel weight regularization method. We validate our model on CelebA, SVHN, and ImageNet, and produce samples and reconstructions with high visual fidelity.
See you next week,
Philipp
Learning to Forget: Continual Prediction with LSTM
Please read Learning to Forget: Continual Prediction with LSTM and thanks to Christian for suggesting the paper.
See you in September,
Philipp
Machine Learning with Google Tensorflow
Please read http://download.tensorflow.org/paper/whitepaper2015.pdf
See you all in August!
…Clustering of time series is meaningless
Final event before the summer break.
Please read: http://www.cs.ucr.edu/~eamonn/meaningless.pdf
See you on Monday :)
…Apache Kafka
Hi,
this time we're diving into Apache Kafka: Please read https://engineering.linkedin.com/distributed-systems/log-what-every-software-engineer-should-know-about-real-time-datas-unifying
See you in June :)
…Elm (part 2 of 2)
This time we'll talk about something pretty recent: Elm. Thanks to László for the suggestion!
Please read chapters 4-7 (from page 28 onwards) of "Elm: Concurrent FRP for Functional GUIs"
See you in May,
Philipp
Elm (part 1 of 2)
This time we'll talk about something pretty recent: Elm. Thanks to László for the suggestion!
Please read chapters 1-3 (the first 27 pages) of "Elm: Concurrent FRP for Functional GUIs"
See you in April,
Philipp
Prolog
Continuing our journey of influential programming languages, we're covering Prolog this time.
Please read The birth of Prolog.
See you in March!
…Lisp
In our last meetup, we discovered that a better understanding of LISP would be helpful. So this time we'll dive into LISP.
Please read http://lib.store.yahoo.net/lib/paulgraham/jmc.ps and Igor will show us something hands-on demo: https://gist.github.com/igalic/9fea741e1699dc721708
…
Out of the Tar Pit (part 2)
This time Igor will continue to take us through Out of the Tar Pit.
So please, read http://shaffner.us/cs/papers/tarpit.pdf!
Since the paper is pretty long, we've split it into two parts. Last time we read chapters 1 to 7, this time we're going through the chapters 8+. No worries if you've missed the first part — it shouldn't be a problem to join just for the second one :)
See you there,
Philipp
Out of the Tar Pit (part 1)
This time Igor will take us through Out of the Tar Pit.
So please, read http://shaffner.us/cs/papers/tarpit.pdf!
Since it's pretty long, let's split it up and make use of the paper's structure: "The paper is divided into two halves". So read chapters 1 to 7, 8+ we'll do next time.
See you there,
Philipp
The Ubiquitous B-Tree
Hi fellow paper lovers,
after taking a well deserved summer break, we're starting our regular schedule again.
This time we are talking about a software engineering classic: The Ubiquitous B-Tree. I wanted to dive into this paper for a long time and now is finally the right time!
As always: Please read the paper in advance, so we can have a lively discussion :)
See you in September,
Philipp
PS: If you have a paper you want to discuss, we're happy to schedule it for our October meetup!
…Neural Turing Machines
**Please read Neural Turing Machines (PDF)**
This time we'll talk about neural networks and turing machines. pivo will lead the discussion — thanks a lot!
…
Random Forests
**Please read RANDOM FORESTS**
Hi all,
this time Martin will introduce us to the world of data science with the paper RANDOM FORESTS. As always, please read the paper in advance, so we can have a fruitful discussion. And don't be discouraged by the number of pages, it seems to be typed pretty loosely — let's see how the mathematical formulas come along ;-)
See you in June,
Philipp
Google Spanner
**Please read Google's Spanner paper!**
Dominik will lead the discussion — thanks!
See you all on the 20th :)
…Why Functional Programming Matters
**Please read: Why Functional Programming Matters**
Hi again,
sticking to our schedule, we'll discuss a paper a bit more on the theoretical side this time — John Hughes' "Why Functional Programming Matters" from 1990.
Thanks to Peter for his pick and for leading the discussion!
See you on the 23rd,
Philipp
Dynamo: Amazon’s Highly Available Key-value Store
**Please read the Dynamo: Amazon’s Highly Available Key-value Store paper.**
Since we've already covered Google's Bigtable, we're taking an in-depth look at the second forerunner of the NoSQL movement: Dynamo, which is pretty popular in practise as well.
Again, please read the paper in advance so we can have a lively discussion — led by me this time :)
And please propose the next paper you want to dissect. Ideally, it's something more theoretical since we agreed to alternate between theoretical and practical papers.
See you there,
Philipp
Being Classless
**Please read: Organizing Programs Without Classes**
Since we had a tie when we voted on interesting papers, we are covering the second winner this time. Peter will guide us through the discussion — again remember: This is not a presentation, but an interactive discussion. So please read the paper!
See you there,
Philipp
First (Paper) Love
**Please read the <a>Google Bigtable paper</a>.**
Dominik will kick off our first meetup with the Bigtable paper. Please remember, this is not a presentation, but an interactive discussion. Everyone should read the paper in advance and ideally have an opinion on it or its use.
We will meet in the kitchen to have the right setting :-)
See you there,
Philipp