The following pages link to Andrew Turpin (Q293390):
Displaying 14 items.
- Comment on ``Efficient Huffman decoding'' and ``An efficient finite-state machine implementation of Huffman decoders'' (Q293392) (← links)
- Challenging conventional assumptions of automated information retrieval with real users: Boolean searching and batch retrieval evaluations (Q1866365) (← links)
- (Q2729858) (← links)
- Housekeeping for prefix coding (Q2732984) (← links)
- (Q2768559) (← links)
- Machine transliteration survey (Q2875055) (← links)
- Top-k Ranked Document Search in General Text Databases (Q3586396) (← links)
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation (Q3596712) (← links)
- Testing Stream Ciphers by Finding the Longest Substring of a Given Density (Q3634488) (← links)
- On-line adaptive canonical prefix coding with bounded compression loss (Q4544456) (← links)
- Efficient construction of minimum-redundancy codes for large alphabets (Q4701144) (← links)
- (Q4808951) (← links)
- A New Periodicity Lemma (Q5757383) (← links)
- A fast and space-economical algorithm for length-limited coding (Q6487940) (← links)
