1 citations · 4 across the 13 of their papers we have counts for
14 papers
Variational Approach for Uniform Quantum Permutation Generators
Farzam Nosrati, Nicolás Borrajo, Antonio Fernández Anta +1
Uniform permutation generation is a fundamental task in both classical and quantum computation, with applications ranging from cryptography to quantum optimization and quantum erro…
On the Decidability of Distributed Tasks with Output Sets under Asynchrony and Any Number of Crashes
Timothé Albouy, Antonio Fernández Anta, Chryssis Georgiou +2
This paper studies the decidability of task problems, i.e., distributed problems expressed as sets of distributed tasks. Specifically, we introduce a new class of task problems cal…
A mathematical model of vaccine hesitancy: Analysing the impact of political trends and the interaction across age and education groups in the USA
Wajid Ali, Javad Mohamadichamgavi, Juan Ramirez +3
Vaccination against the SARS-CoV-2 disease has significantly reduced its mortality rate and spread. However, despite its availability, a considerable proportion of the public has e…
What Causes COVID-19 Fear? General Drivers of Fear During a Health Crisis
Daniele Baccega, Paolo Castagno, Antonio Fernández Anta +2
The COVID-19 pandemic triggered not only a global health crisis but also an infodemic, where exposure to heterogeneous information sources influenced public emotional responses. In…
Auditing without Leaks Despite Curiosity
Hagit Attiya, Antonio Fernández Anta, Alessia Milani +2
\textit{Auditing} data accesses helps preserve privacy and ensures accountability by allowing one to determine who accessed (potentially sensitive) information. A prior formal defi…
Error Bounds for the Network Scale-Up Method
Sergio Díaz-Aranda, Juan Marcos Ramírez, Mohit Daga +4
Epidemiologists and social scientists have used the Network Scale-Up Method (NSUM) for over thirty years to estimate the size of a hidden sub-population within a social network. Th…
Fast and Secure Decentralized Optimistic Rollups Using Setchain
Margarita Capretto, Martín Ceresa, Antonio Fernández Anta +2
Modern blockchains face a scalability challenge due to the intrinsic throughput limitations of consensus protocols. Layer 2 optimistic rollups (L2) are a faster alternative that of…
Federated Learning with Heterogeneous Data Handling for Robust Vehicular Object Detection
Ahmad Khalil, Tizian Dege, Pegah Golchin +3
In the pursuit of refining precise perception models for fully autonomous driving, continual online model training becomes essential. Federated Learning (FL) within vehicular netwo…
Nowcasting Temporal Trends Using Indirect Surveys
Ajitesh Srivastava, Juan Marcos Ramírez, Sergio Díaz-Aranda +4
Indirect surveys, in which respondents provide information about other people they know, have been proposed for estimating (nowcasting) the size of a \emph{hidden population} where…
Setchain: Improving Blockchain Scalability with Byzantine Distributed Sets and Barriers
Margarita Capretto, Martín Ceresa, Antonio Fernández Anta +2
Blockchain technologies are facing a scalability challenge, which must be overcome to guarantee a wider adoption of the technology. This scalability issue is mostly caused by the u…
Outlier Detection for Functional Data with R Package fdaoutlier
Oluwasegun Ojo, Rosa E. Lillo, Antonio Fernández Anta
Outlier detection is one of the standard exploratory analysis tasks in functional data analysis. We present the R package fdaoutlier which contains implementations of some of the l…
CoVer-ability: Consistent Versioning for Concurrent Objects
Nicolas Nicolaou, Antonio Fernández Anta, Chryssis Georgiou
An object type characterizes the domain space and the operations that can be invoked on an object of that type. In this paper we introduce a new property for concurrent objects, we…
Multi-round Master-Worker Computing: a Repeated Game Approach
Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro +1
We consider a computing system where a master processor assigns tasks for execution to worker processors through the Internet. We model the workers decision of whether to comply (c…
Reducing Search Lengths with Locally Precomputed Partial Random Walks
Víctor López Millán, Vicent Cholvi, Luis López +1
Random walks can be used to search a complex networks for a desired resource. To reduce the number of hops necessary to find the resource, we propose a search mechanism based on bu…