activity
20172022
most citedTowards Secure and Efficient Payment Channels

15 citations · 39 across the 6 of their papers we have counts for

collaborators

8 papers

cs.CR2022

Better Incentives for Proof-of-Work

Jakub Sliwinski, Roger Wattenhofer

This work proposes a novel proof-of-work blockchain incentive scheme such that, barring exogenous motivations, following the protocol is guaranteed to be the optimal strategy for m…

cs.DC2022

Consensus on Demand

Jakub Sliwinski, Yann Vonlanthen, Roger Wattenhofer

Digital money can be implemented efficiently by avoiding consensus. However, no-consensus implementations have drawbacks, as they cannot support smart contracts, and (even more fun…

cs.DC2021

A Limitlessly Scalable Transaction System

Max Mathys, Roland Schmid, Jakub Sliwinski +1

We present Accept, a simple, asynchronous transaction system that achieves perfect horizontal scaling. Usual blockchain-based transaction systems come with a fundamental throughput…

cs.CR2019★ 8 cited

ABC: Proof-of-Stake without Consensus

Jakub Sliwinski, Roger Wattenhofer

We introduce a new permissionless blockchain architecture called ABC. ABC is completely asynchronous, and does rely on neither randomness nor proof-of-work. ABC can be parallelized…

cs.CR2018★ 15 cited

Towards Secure and Efficient Payment Channels

Georgia Avarikioti, Felix Laufenberg, Jakub Sliwinski +2

Micropayment channels are the most prominent solution to the limitation on transaction throughput in current blockchain systems. However, in practice channels are risky because par…

cs.GT2018★ 4 cited

Forming Probably Stable Communities with Limited Interactions

Ayumi Igarashi, Jakub Sliwinski, Yair Zick

A community needs to be partitioned into disjoint groups; each community member has an underlying preference over the groups that they would want to be a member of. We are interest…

cs.AI2017★ 12 cited

The Price of Quota-based Diversity in Assignment Problems

Nawal Benabbou, Mithun Chakraborty, Vinh Ho Xuan +2

We introduce and analyze an extension to the matching problem on a weighted bipartite graph: Assignment with Type Constraints. The two parts of the graph are partitioned into subse…

cs.AI2017

Axiomatic Characterization of Data-Driven Influence Measures for Classification

Jakub Sliwinski, Martin Strobel, Yair Zick

We study the following problem: given a labeled dataset and a specific datapoint x, how did the i-th feature influence the classification for x? We identify a family of numerical i…