Calendar

Posts organized

by date.

May 2019

Mon Tue Wed Thu Fri Sat Sun

1

2

3 NP-Completeness: The Cook-Levin Theorem, Polynomial Reductions, and the Hardest Problems in NP

4

5

6

7

8

9

10

11 Parameterized Complexity: FPT, the W-Hierarchy, Kernelization, and Bounded Search Trees

12 Online Algorithms: Competitive Analysis, Ski Rental, Paging, and the Primal-Dual Method

13

14 Building A Distributed File System Inspired By Gfs: Master Architecture, Chunk Replication, And Leases

15

16

17

18

19

20 The Microbenchmarking Of Rpc Frameworks: Grpc, Thrift, And Zeromq In High Latency Environments

21

22

23 Designing A Consistent Hashing With Bounded Loads Using Google’S Consistent Hashing With Sparse Representation

24

25

26

27

28

29

30

31