Marzio De Biasi

Orcid: 0000-0002-9458-4662

According to our database1, Marzio De Biasi authored at least 9 papers between 2013 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
On the complexity of restoring corrupted colorings.
J. Comb. Optim., 2019

The Power of One-State Turing Machines.
CoRR, 2019

2018
The complexity of snake and undirected NCL variants.
Theor. Comput. Sci., 2018

2016
Verifying Pipelined-RAM Consistency over Read/Write Traces of Data Replicas.
IEEE Trans. Parallel Distributed Syst., 2016

The Complexity of Snake.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2014
Minimal TSP Tour is coNP-Complete.
CoRR, 2014

Permutation Reconstruction from Differences.
Electron. J. Comb., 2014

Unary Languages Recognized by Two-Way One-Counter Automata.
Proceedings of the Implementation and Application of Automata, 2014

2013
Non-trivial unary languages recognized by two-way one-counter machines.
CoRR, 2013


  Loading...