Lille.Pod - 11_Spire2021_Maksim_Nikolaev.Mp4

SPIRE 2021

Maksim Nicolaev

All instantiations of the greedy algorithm for the shortest superstring problem are equivalent

Added by: Stephane Janot
Additional owner(s):
- Antoine Limasset
Updated on: Oct. 6, 2021, 9:44 a.m.
Type: Conference
Main language: English

Comment(s)

Take Note

There is no note available for you for this video.

Log in to create a new one.

Disciplines

Types