Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Qi, Xuanrui"'
Succinct data structures give space-efficient representations of large amounts of data without sacrificing performance. They rely one cleverly designed data representations and algorithms. We present here the formalization in Coq/SSReflect of two dif
Externí odkaz:
http://arxiv.org/abs/1904.02809
