Alistair Moffat

From MaRDI portal
Person:293391

Available identifiers

zbMath Open moffat.alistairWikidataQ58612394 ScholiaQ58612394MaRDI QIDQ293391

List of research outcomes





PublicationDate of PublicationType
A fast and space-economical algorithm for length-limited coding2023-03-21Paper
In-place calculation of minimum-redundancy codes2022-12-16Paper
A framework for adaptive sorting2022-12-09Paper
CSA++: Fast Pattern Search for Large Alphabets2019-09-12Paper
String search experimentation using massive data2017-01-13Paper
Comment on ``Efficient Huffman decoding and ``An efficient finite-state machine implementation of Huffman decoders2016-06-09Paper
Binary codes for locally homogeneous sequences2010-01-29Paper
Word-based text compression using the Burrows-Wheeler transform2005-08-03Paper
https://portal.mardi4nfdi.de/entity/Q47376862004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q45520462002-11-11Paper
On-line adaptive canonical prefix coding with bounded compression loss2002-08-04Paper
Housekeeping for prefix coding2001-12-02Paper
https://portal.mardi4nfdi.de/entity/Q27298582001-10-04Paper
Efficient construction of minimum-redundancy codes for large alphabets1999-11-21Paper
https://portal.mardi4nfdi.de/entity/Q42507191999-06-17Paper
A tree-based mergesort1999-04-26Paper
A probability-ratio approach to approximate binary arithmetic coding1998-06-21Paper
A framework for adaptive sorting1995-06-06Paper
https://portal.mardi4nfdi.de/entity/Q48336591995-05-21Paper
HISTORICAL SEARCHING1994-01-13Paper
Supporting random access in files of variable length records1993-09-21Paper
https://portal.mardi4nfdi.de/entity/Q40289071993-03-28Paper
Linear time adaptive arithmetic coding1990-01-01Paper
An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$1987-01-01Paper
A priority queue for the all pairs shortest path problem1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38933291980-01-01Paper

Research outcomes over time

This page was built for person: Alistair Moffat