default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcello Mamino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Alessandro Berarducci
, Marcello Mamino, Rosario Mennuni:
Vector spaces with a union of independent subspaces. Arch. Math. Log. 63(3-4): 499-507 (2024)- 2022
- [j9]Alessandro Berarducci, Marcello Mamino:
Asymptotic Analysis of Skolem's exponential Functions. J. Symb. Log. 87(2): 758-782 (2022) - [j8]Manuel Bodirsky, Marcello Mamino, Caterina Viola:
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation. ACM Trans. Comput. Log. 23(1): 7:1-7:35 (2022) - 2021
- [j7]Bruno Dinis, Mário J. Edmundo, Marcello Mamino:
Fundamental group in o-minimal structures with definable Skolem functions. Ann. Pure Appl. Log. 172(8): 102975 (2021) - 2020
- [i10]Manuel Bodirsky, Marcello Mamino, Caterina Viola:
Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables. CoRR abs/2003.00963 (2020)
2010 – 2019
- 2019
- [i9]Manuel Bodirsky, Marcello Mamino, Caterina Viola:
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation. CoRR abs/1912.09298 (2019) - 2018
- [j6]Manuel Bodirsky, Marcello Mamino:
Tropically Convex Constraint Satisfaction. Theory Comput. Syst. 62(3): 481-509 (2018) - [c5]Manuel Bodirsky, Marcello Mamino, Caterina Viola:
Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains. CSL 2018: 12:1-12:22 - [c4]Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet:
The Complexity of Disjunctive Linear Diophantine Constraints. MFCS 2018: 33:1-33:16 - [i8]Manuel Bodirsky, Marcello Mamino, Caterina Viola:
Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains. CoRR abs/1804.01710 (2018) - [i7]Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet:
The complexity of disjunctive linear Diophantine constraints. CoRR abs/1807.00985 (2018) - [i6]Manuel Bodirsky, Marcello Mamino:
A polynomial-time algorithm for median-closed semilinear constraints. CoRR abs/1808.10068 (2018) - 2017
- [j5]Marcello Mamino:
Strategy recovery for stochastic mean payoff games. Theor. Comput. Sci. 675: 101-104 (2017) - [p1]Manuel Bodirsky, Marcello Mamino:
Constraint Satisfaction Problems over Numeric Domains. The Constraint Satisfaction Problem 2017: 79-111 - 2016
- [c3]Marcello Mamino, Giovanni Viglietta:
Square Formation by Asynchronous Oblivious Robots. CCCG 2016: 1-6 - [c2]Manuel Bodirsky, Marcello Mamino:
Max-Closed Semilinear Constraint Satisfaction. CSR 2016: 88-101 - [i5]Marcello Mamino, Giovanni Viglietta:
Square Formation by Asynchronous Oblivious Robots. CoRR abs/1605.06093 (2016) - 2015
- [i4]Manuel Bodirsky, Marcello Mamino:
Max-Closed Semilinear Constraint Satisfaction. CoRR abs/1506.04184 (2015) - [i3]Marcello Mamino:
Strategy Recovery for Stochastic Mean Payoff Games. CoRR abs/1506.04641 (2015) - 2014
- [c1]Marcello Mamino:
On the computing power of +, -, and ×. CSL-LICS 2014: 68:1-68:10 - [i2]Marcello Mamino:
On the Computing Power of +, -, and ˟. CoRR abs/1401.4879 (2014) - 2013
- [j4]Marcello Mamino:
On the computational complexity of a game of cops and robbers. Theor. Comput. Sci. 477: 48-56 (2013) - 2012
- [i1]Marcello Mamino:
On the computational complexity of a game of cops and robbers. CoRR abs/1202.6043 (2012) - 2011
- [j3]Alessandro Berarducci, Marcello Mamino:
On the homotopy type of definable groups in an o-minimal structure. J. Lond. Math. Soc. 83(3): 563-586 (2011) - [j2]Marcello Mamino:
Splitting definably compact groups in o-minimal structures. J. Symb. Log. 76(3): 973-986 (2011)
2000 – 2009
- 2008
- [j1]Antongiulio Fornasiero, Marcello Mamino:
Arithmetic of Dedekind cuts of ordered Abelian groups. Ann. Pure Appl. Log. 156(2-3): 210-244 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
