Andrew Turpin

Available identifiers

zbMath Open turpin.andrewMaRDI QIDQ293390

List of research outcomes

Publication	Date of Publication	Type
A fast and space-economical algorithm for length-limited coding	2023-03-21	Paper
Comment on ``Efficient Huffman decoding and ``An efficient finite-state machine implementation of Huffman decoders	2016-06-09	Paper
Machine transliteration survey	2014-08-13	Paper
Top-\(k\) ranked document search in general text databases	2010-09-06	Paper
Testing Stream Ciphers by Finding the Longest Substring of a Given Density	2009-06-25	Paper
Space-Time Tradeoffs for Longest-Common-Prefix Array Computation	2009-01-29	Paper
A New Periodicity Lemma	2007-09-06	Paper
https://portal.mardi4nfdi.de/entity/Q4808951	2004-08-12	Paper
Challenging conventional assumptions of automated information retrieval with real users: Boolean searching and batch retrieval evaluations	2003-04-03	Paper
On-line adaptive canonical prefix coding with bounded compression loss	2002-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q2768559	2002-02-03	Paper
Housekeeping for prefix coding	2001-12-02	Paper
https://portal.mardi4nfdi.de/entity/Q2729858	2001-10-04	Paper
Efficient construction of minimum-redundancy codes for large alphabets	1999-11-21	Paper

Research outcomes over time

This page was built for person: Andrew Turpin