Proving tree algorithms for succinct data structures

Succinct data structures give space-efficient representations of large amounts of data without sacrificing performance. They rely on cleverly designed data representations and algorithms.

Source : https://www.inria.fr/centre/paris/agenda/seminaire-gallium92

Date : September 18, 2019 at 05:56PM

Tag(s) : #EVENEMENTS