What was the last paper within the realm of computing you read? What did it inspire you to build or tinker with? Come share the ideas in an awesome academic/research publication with fellow engineers, programmers, and paper-readers. Lead a session and show off code that you wrote that implements these ideas or just give us the lowdown about the paper. Otherwise, just come, listen, learn, and discuss.
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!
Sign-up: Please RSVP via Meetup.com
Facebook page: fb.com/pwl.kyiv
Facebook group: fb.com/groups/PapersWeLoveKyiv
Second PWL Kyiv meetup this year!
‣ The time: Friday, 27th of July, 6.30 p.m.
‣ The place: Щастя Хаб (Kyiv, Pankivska st. 14А)
‣ The first talk: Paxos, Raft, and PBFT by Ruslan Shevchenko (~ 40 min)
‣ The second talk: CRDTs and their application to JSON by Max Klymyshyn (~30 min)
‣ Paxos, Raft, and PBFT by Ruslan Shevchenko
• https://lamport.azurewebsites.net/pubs/paxos-simple.pdf and many others
• Ruslan will give a talk on the history of Paxos, how it is related to Raft and what similarities it bears to the solution of Practical Byzantine Fault Tolerance.
• Bio: Ruslan worked as a researcher in Institue of Software Systems, then founded an Internet Provider (NBI), and a software development company (GradSoft). After that, he worked in various projects in telecom and advertising industry. He is also a founder of .UA Scala user group, has over 10…
First Papers We Love Kyiv meetup this year!
• The first talk: HyperLogLog by Eugen Kosteev (~ 40 min)
• The second talk: Parsing with derivatives by Artem Mishchenko (~40 min)
• The third talk: Link Grammar by Dmytro Yakymets (~ 20 min)
• The time: 5th of April, 18:00
• The place: Takeoff Technologies Kyiv, Saksahanskoho str. 40/85
We aim for the conference to take approx. 2 hours
• HyperLogLog by Eugen Kosteev
‣ Abstract: HyperLogLog is dedicated to estimating the number of distinct elements (the cardinality) of very large data ensembles. Using an auxiliary memory of m units (typically, "short bytes''), HyperLogLog performs a single pass over the data and produces an estimate of the cardinality such that the relative accuracy (the standard error) is typically about 1…