Alistair Moffat

Available identifiers

zbMath Open moffat.alistairWikidataQ58612394 ScholiaQ58612394MaRDI QIDQ293391

List of research outcomes

Publication	Date of Publication	Type
A fast and space-economical algorithm for length-limited coding	2023-03-21	Paper
In-place calculation of minimum-redundancy codes	2022-12-16	Paper
A framework for adaptive sorting	2022-12-09	Paper
CSA++: Fast Pattern Search for Large Alphabets	2019-09-12	Paper
String search experimentation using massive data	2017-01-13	Paper
Comment on ``Efficient Huffman decoding and ``An efficient finite-state machine implementation of Huffman decoders	2016-06-09	Paper
Binary codes for locally homogeneous sequences	2010-01-29	Paper
Word-based text compression using the Burrows-Wheeler transform	2005-08-03	Paper
https://portal.mardi4nfdi.de/entity/Q4737686	2004-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4552046	2002-11-11	Paper
On-line adaptive canonical prefix coding with bounded compression loss	2002-08-04	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
https://portal.mardi4nfdi.de/entity/Q4250719	1999-06-17	Paper
A tree-based mergesort	1999-04-26	Paper
A probability-ratio approach to approximate binary arithmetic coding	1998-06-21	Paper
A framework for adaptive sorting	1995-06-06	Paper
https://portal.mardi4nfdi.de/entity/Q4833659	1995-05-21	Paper
HISTORICAL SEARCHING	1994-01-13	Paper
Supporting random access in files of variable length records	1993-09-21	Paper
https://portal.mardi4nfdi.de/entity/Q4028907	1993-03-28	Paper
Linear time adaptive arithmetic coding	1990-01-01	Paper
An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$	1987-01-01	Paper
A priority queue for the all pairs shortest path problem	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3893329	1980-01-01	Paper

Research outcomes over time

This page was built for person: Alistair Moffat