Pages that link to "Item:Q4880008"
From MaRDI portal
The following pages link to New bounds on the expected length of one-to-one codes (Q4880008):
Displaying 7 items.
- Bernstein polynomials and learning theory (Q596812) (← links)
- Assembling approximately optimal binary search trees efficiently using arithmetics (Q989540) (← links)
- New lower bounds on the cost of binary search trees (Q1351808) (← links)
- Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields (Q2190980) (← links)
- (Q3695172) (← links)
- (Q4365399) (← links)
- Optimal binary search trees (Q5906917) (← links)