Pages that link to "Item:Q5901654"
From MaRDI portal
The following pages link to LATIN 2004: Theoretical Informatics (Q5901654):
Displaying 14 items.
- Unified parallel encoding and decoding algorithms for Dandelion-like codes (Q666249) (← links)
- Linear time tree codes (Q799118) (← links)
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- Encodings of cladograms and labeled trees (Q976699) (← links)
- Developing new locality results for the Prüfer code using a remarkable linear-time decoding algorithm (Q1010611) (← links)
- Efficient Prüfer-like coding and counting labelled hypertrees (Q1022347) (← links)
- Tree-structured multiple description coding (Q1405491) (← links)
- Computing Prüfer codes efficiently in parallel (Q1566573) (← links)
- Efficient coding of labeled directed acyclic graphs (Q1762604) (← links)
- An efficient algorithm for generating Prüfer codes from labelled trees (Q1969439) (← links)
- On coding labeled trees (Q2381521) (← links)
- A uniform paradigm to succinctly encode various families of trees (Q2441590) (← links)
- (Q3575003) (← links)
- Forest Learning From Data and its Universal Coding (Q4562324) (← links)