10 citations · 24 across the 4 of their papers we have counts for
4 papers
Highway: Efficient Consensus with Flexible Finality
Daniel Kane, Andreas Fackler, Adam Gągol +1
There has been recently a lot of progress in designing efficient partially synchronous BFT consensus protocols that are meant to serve as core consensus engines for Proof of Stake…
Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine Nodes
Adam Gągol, Damian Leśniak, Damian Straszak +1
The spectacular success of Bitcoin and Blockchain Technology in recent years has provided enough evidence that a widespread adoption of a common cryptocurrency system is not merely…
Pathwidth and nonrepetitive list coloring
Adam Gągol, Gwenaël Joret, Jakub Kozik +1
A vertex coloring of a graph is nonrepetitive if there is no path in the graph whose first half receives the same sequence of colors as the second half. While every tree can be non…
Graph sharing game and the structure of weighted graphs with a forbidden subdivision
Adam Gągol, Piotr Micek, Bartosz Walczak
In the graph sharing game, two players share a connected graph with non-negative weights assigned to the vertices, claiming and collecting the vertices of one by one, while…