activity
20152020
most citedA verifiably secure and proportional committee election rule

23 citations · 43 across the 4 of their papers we have counts for

collaborators

7 papers

cs.CR2020★ 19 cited

Overview of Polkadot and its Design Considerations

Jeff Burdges, Alfonso Cevallos, Peter Czaban +8

In this paper we describe the design components of the heterogenous multi-chain protocol Polkadot and explain how these components help Polkadot address some of the existing shortc…

cs.DS2020★ 23 cited

A verifiably secure and proportional committee election rule

Alfonso Cevallos, Alistair Stewart

The property of proportional representation in approval-based committee elections has appeared in the social choice literature for over a century, and is typically understood as av…

cs.DM2018

Diversity maximization in doubling metrics

Alfonso Cevallos, Friedrich Eisenbrand, Sarah Morell

Diversity maximization is an important geometric optimization problem with many applications in recommender systems, machine learning or search engines among others. A typical dive…

cs.DM2017

Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting

Alfonso Cevallos, Stefan Weltge, Rico Zenklusen

Mixed-integer mathematical programs are among the most commonly used models for a wide set of problems in Operations Research and related fields. However, there is still very littl…

math.CO2017★ 1 cited

On 2-level polytopes arising in combinatorial settings

Manuel Aprile, Alfonso Cevallos, Yuri Faenza

2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and s…

cs.DS2016

Local Search for Max-Sum Diversification

Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen

We provide simple and fast polynomial time approximation schemes (PTASs) for several variants of the max-sum diversification problem which, in its most basic form, is as follows: G…

cs.DS2015

Max-sum diversity via convex programming

Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen

Diversity maximization is an important concept in information retrieval, computational geometry and operations research. Usually, it is a variant of the following problem: Given a…