Marcello Mamino

Orcid: 0000-0001-9037-5903

According to our database1, Marcello Mamino authored at least 18 papers between 2008 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Vector spaces with a union of independent subspaces.
Arch. Math. Log., May, 2024

2022
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation.
ACM Trans. Comput. Log., 2022

Asymptotic Analysis of Skolem's exponential Functions.
J. Symb. Log., 2022

2021
Fundamental group in o-minimal structures with definable Skolem functions.
Ann. Pure Appl. Log., 2021

2020
Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables.
CoRR, 2020

2018
Tropically Convex Constraint Satisfaction.
Theory Comput. Syst., 2018

A polynomial-time algorithm for median-closed semilinear constraints.
CoRR, 2018

The Complexity of Disjunctive Linear Diophantine Constraints.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017
Strategy recovery for stochastic mean payoff games.
Theor. Comput. Sci., 2017

Constraint Satisfaction Problems over Numeric Domains.
Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017

2016
Max-Closed Semilinear Constraint Satisfaction.
Proceedings of the Computer Science - Theory and Applications, 2016

Square Formation by Asynchronous Oblivious Robots.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2014
On the computing power of +, -, and ×.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
On the computational complexity of a game of cops and robbers.
Theor. Comput. Sci., 2013

2011
Splitting definably compact groups in o-minimal structures.
J. Symb. Log., 2011

On the homotopy type of definable groups in an o-minimal structure.
J. Lond. Math. Soc., 2011

2008
Arithmetic of Dedekind cuts of ordered Abelian groups.
Ann. Pure Appl. Log., 2008


  Loading...