Risultati ricerca pubblicazioni

Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2018

Bonomi Silvia, Del Pozzo Antonella, POTOP BUTUCARU Maria

Approximate Agreement under Mobile Byzantine Faults

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2018

Bonomi Silvia, Del Pozzo Antonella, Potop-Butucaru Maria, Tixeuil Sébastien

Prefix-suffix square reduction

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2017

Bottoni Paolo Gaspare, Labella Anna, Mitrana Victor

Visualizing co-phylogenetic reconciliations

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2020

Calamoneri T., Di Donato V., Mariottini D., Patrignani M.

A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2019

CALAMONERI Tiziana, DELL'OREFICE MATTEO, MONTI Angelo

Some classes of graphs that are not PCGs

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2019

Baiocchi P., Calamoneri T., Monti A., Petreschi R.

On dynamic threshold graphs and related classes

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2018

Calamoneri Tiziana, Monti Angelo, Petreschi Rossella

Step-by-step community detection in volume-regular graphs

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2020

Becchetti L., Cruciani E., Pasquale F., Rizzo S.

Prior-free multi-unit auctions with ordered bidders

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2020

Bhattacharya Sayan, Koutsoupias Elias, Kulkarni Janardhan, Leonardi Stefano, Roughgarden Tim, Xu Xiaoming

Coding by minimal linear grammars

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2020

Carpi A., D'Alessandro F.

Relationships Between Bounded Languages, Counter Machines, Finite-Index Grammars, Ambiguity, and Commutative Equivalence

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2020

D'Alessandro Flavio, Carpi Arturo, Ibarra Oscar, Mcquillan Ian

On Bounded Linear Codes and the Commutative Equivalence

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2020

Carpi Arturo, D'Alessandro Flavio

String factorisations with maximum or minimum dimension

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2020

Monti A., Sinaimeri B.

Computing a metric basis of a 2-connected bipartite distance-hereditary graph

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2020

Moscarini M.

Trainyard is NP-Hard

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2018

Almanza M., Leucci S., Panconesi A.

Subversion-resilient signatures: Definitions, constructions and applications

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2020

Ateniese G., Magri B., Venturi D.

Cryptographic reverse firewalls for interactive proof systems

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2020

Ganesh Chaya, Magri Bernardo, Venturi Daniele

Continuously non-malleable codes with split-state refresh

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2019

Faonio A., Buus Nielsen J., Simkin M., Venturi D.

Fiat–Shamir for highly sound protocols is instantiable

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2018

Mittelbach Arno, Venturi Daniele