Time-Space Tradeoffs for Finding a Long Common Substring. - Stav Ben-Nun; Shay Golan 001; Tomasz Kociumaka; Matan Kraus (CPM, 2020)

An O(log3/2 n) Parallel Time Population Protocol for Majority with O(log n) States. - Stav Ben-Nun; Tsvi Kopelowitz; Matan Kraus; Ely Porat (PODC, 2020)

An O(log3/2n) Parallel Time Population Protocol for Majority with O(log n) States. - Stav Ben-Nun; Tsvi Kopelowitz; Matan Kraus; Ely Porat (CoRR, 2020)