John Livieratos

Orcid: 0000-0001-6409-4286

According to our database1, John Livieratos authored at least 13 papers between 2018 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Combinatorial constructions of separating codes.
J. Complex., 2025

2024
Frameproof codes, separable codes and B<sub>2</sub> codes: Bounds and constructions.
Cryptogr. Commun., May, 2024

An algorithmic construction of union-intersection-bounded families.
Theor. Comput. Sci., 2024

2023
Bounds and Constructions of Parent Identifying Schemes via the Algorithmic Version of the Lovász Local Lemma.
IEEE Trans. Inf. Theory, November, 2023

2021
On the Computational Complexity of Non-Dictatorial Aggregation.
J. Artif. Intell. Res., 2021

Correction to: Directed Lovász Local Lemma and Shearer's Lemma.
Ann. Math. Artif. Intell., 2021

2020
Constraint satisfaction problems: probabilistic approach and applications to social choice theory
PhD thesis, 2020

Directed Lovász local lemma and Shearer's lemma.
Ann. Math. Artif. Intell., 2020

2019
Aggregation of Votes with Multiple Positions on Each Issue.
ACM Trans. Economics and Comput., 2019

Algorithmic Aspects on the Construction of Separating Codes.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

Algorithmically Efficient Syntactic Characterization of Possibility Domains.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
A Simple Algorithmic Proof of the Symmetric Lopsided Lovász Local Lemma.
Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018

Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma.
Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018


  Loading...