Quantum Field

Home Archives

2017

Feb 1

Why we need n >= 3f + 1 in Byzantine Fault Tolerance

Categories

Distributed System
LeetCode in Rust
TopCoder
USACO

Tags

Tag Cloud

Algorithm BFS BFT Backtrack Base Conversion Big Integer Bipartite Match Bit Manipulation Brutal Force Combination Computation Geometry Consensus Protocol Convex Hull Counting DFS Dijkstra Distributed System Dynamic Programming Enumeration Euler Path Flood Fill Floyd Ford-Fulkerson Gauss Elimination Graph Graph Theory Greedy Hashing Hungarian Algorithm KMP Knapsack LeetCode MEMORIZED SEARCH Math Minimum Spanning Tree Network Flow NewSQL Number Theory Paper Digest Paxos Permutation Prim Rolling Array Rust Search Shortest Path Simulation String String Algorithm String Manipulation Strongly Connected Components TopCoder Topological Sort Tree UnionFind ZooKeeper

Archives

November 2019
October 2019
September 2019
January 2019
October 2018
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016

Recent Posts

LeetCode 1136. Parallel Courses
LeetCode 1213. Intersection of Three Sorted Arrays
LeetCode 895. Maximum Frequency Stack
LeetCode 934. Shortest Bridge
LeetCode 980. Unique Paths III

© 2023 Michael Han
Powered by Hexo

Home Archives