Alfredo Viola

Orcid: 0000-0002-9518-7554

According to our database1, Alfredo Viola authored at least 36 papers between 1994 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
1
2
2
1
3
3
1
3
1
1
2
2
1
1
1
1
2
1
1
1
1
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Principled Approach for a New Bias Measure.
CoRR, 2024

2023
Qubo model for the Closest Vector Problem.
CoRR, 2023

Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs.
CoRR, 2023

Unbiased Similarity Estimators Using Samples.
Proceedings of the Similarity Search and Applications - 16th International Conference, 2023

2021
Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020
A technological and innovative approach to COVID-19 in Uruguay.
Commun. ACM, 2020

A perspective on theoretical computer science in Latin America.
Commun. ACM, 2020

2019
Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions.
Comb. Probab. Comput., 2019

Uruguayan Cryptography: Printed Book Covers.
Proceedings of the 2nd International Conference on Historical Cryptology, 2019

2018
Analysis of the Continued Logarithm Algorithm.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Beyond Series-Parallel Concurrent Systems: The Case of Arch Processes.
Proceedings of the 29th International Conference on Probabilistic, 2018

2016
Robin Hood Hashing really has constant average search cost and variance in full tables.
CoRR, 2016

Preface-S.I.: LATIN 2014.
Algorithmica, 2016

A Unified Approach to Linear Probing Hashing with Buckets.
Algorithmica, 2016

2015
Recurrence Function on Sturmian Words: A Probabilistic Study.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014
Beating the Birthday Paradox in Dining Cryptographer Networks.
Proceedings of the Progress in Cryptology - LATINCRYPT 2014, 2014

2013
Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables.
IEEE Trans. Inf. Theory, 2013

Enumerative encoding of correlation-immune Boolean functions.
Theor. Comput. Sci., 2013

Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields.
SIAM J. Discret. Math., 2013

2012
News from Latin America.
Bull. EATCS, 2012

2010
Equivalence classes of Boolean functions for first-order correlation.
IEEE Trans. Inf. Theory, 2010

Adaptive sampling strategies for quickselects.
ACM Trans. Algorithms, 2010

Distributional Analysis of the Parking Problem and Robin Hood Linear Probing Hashing with Buckets.
Discret. Math. Theor. Comput. Sci., 2010

Efficient Algorithms for Constructing Optimal Bi-directional Context Sets.
Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

2006
Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions.
Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

2005
Exact distribution of individual displacements in linear probing hashing.
ACM Trans. Algorithms, 2005

2004
On Worst-Case Robin Hood Hashing.
SIAM J. Comput., 2004

Adaptive sampling for quickselect.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2001
Analysis of Rabin's irreducibility test for polynomials over finite fields.
Random Struct. Algorithms, 2001

The effect of deletions on different insertion disciplines for hash tables (Extended Abstract).
Electron. Notes Discret. Math., 2001

1998
The Analysis of Linear Probing Hashing with Buckets.
Algorithmica, 1998

On the Analysis of Linear Probing Hashing.
Algorithmica, 1998

Analysis of Rabin's Polynomial Irreducability Test.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

1997
The Diagonal Poisson Transform and its application to the analysis of a hashing scheme.
Random Struct. Algorithms, 1997

1996
The Analysis of Linear Probing Hashing with Buckets (Extended Abstract).
Proceedings of the Algorithms, 1996

1994
The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract).
Proceedings of the Algorithms, 1994


  Loading...