Alistair Moffat

According to our database1, Alistair Moffat
  • authored at least 223 papers between 1980 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Can machine translation systems be evaluated by the crowd alone.
Natural Language Engineering, 2017

A Cost Model for Long-Term Compressed Data Retention.
Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, 2017

CSA++: Fast Pattern Search for Large Alphabets.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016
Huffman Coding.
Encyclopedia of Algorithms, 2016

Compressing Integer Sequences.
Encyclopedia of Algorithms, 2016

Assessing efficiency-effectiveness tradeoffs in multi-stage retrieval systems without using relevance judgments.
Inf. Retr. Journal, 2016

The effect of pooling and evaluation depth on IR metrics.
Inf. Retr. Journal, 2016

Access Time Tradeoffs in Archive Compression.
CoRR, 2016

CSA++: Fast Pattern Search for Large Alphabets.
CoRR, 2016

CSAM: Compressed SAM format.
Bioinformatics, 2016

Effective Construction of Relative Lempel-Ziv Dictionaries.
Proceedings of the 25th International Conference on World Wide Web, 2016

Load-Balancing in Distributed Selective Search.
Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

UQV100: A Test Collection with Query Variability.
Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

Quit While Ahead: Evaluating Truncated Rankings.
Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

What Would We Like IR Metrics to Measure?
Proceedings of the 12th NTCIR Conference on Evaluation of Information Access Technologies, 2016

Efficient and Effective Higher Order Proximity Modeling.
Proceedings of the 2016 ACM on International Conference on the Theory of Information Retrieval, 2016

Does Selective Search Benefit from WAND Optimization?
Proceedings of the Advances in Information Retrieval, 2016

How Precise Does Document Scoring Need to Be?
Proceedings of the Information Retrieval Technology, 2016

Modeling Relevance as a Function of Retrieval Rank.
Proceedings of the Information Retrieval Technology, 2016

Judgment Pool Effects Caused by Query Variations.
Proceedings of the 21st Australasian Document Computing Symposium, 2016

2015
Assessing Efficiency-Effectiveness Tradeoffs in Multi-Stage Retrieval Systems Without Using Relevance Judgments.
CoRR, 2015

On the Cost of Phrase-Based Ranking.
Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2015

User Variability and IR System Evaluation.
Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2015

On Identifying Phrases Using Collection Statistics.
Proceedings of the Advances in Information Retrieval, 2015

It's Been 1, 000, 000 Years Since Huffman.
Proceedings of the 2015 Data Compression Conference, 2015

Pooled Evaluation Over Query Variations: Users are as Diverse as Systems.
Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

On the Cost of Extracting Proximity Features for Term-Dependency Models.
Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

Towards Nuanced System Evaluation Based on Implicit User Expectations.
Proceedings of the Information Retrieval Technology, 2015

Access Time Tradeoffs in Archive Compression.
Proceedings of the Information Retrieval Technology, 2015

INST: An Adaptive Metric for Information Retrieval Evaluation.
Proceedings of the 20th Australasian Document Computing Symposium, 2015

2014
Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays.
IEEE Trans. Knowl. Data Eng., 2014

Lossy compression of quality scores in genomic data.
Bioinformatics, 2014

From Theory to Practice: Plug and Play with Succinct Data Structures.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Strategic Pattern Search in Factor-Compressed Text.
Proceedings of the String Processing and Information Retrieval, 2014

Score-safe term-dependency processing with hybrid indexes.
Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2014

Modeling decision points in user search behavior.
Proceedings of the Fifth Information Interaction in Context Symposium, 2014

Is Machine Translation Getting Better over Time?
Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, 2014

Graph Representations and Applications of Citation Networks.
Proceedings of the 2014 Australasian Document Computing Symposium, 2014

Assessing the Cognitive Complexity of Information Needs.
Proceedings of the 2014 Australasian Document Computing Symposium, 2014

How Effective are Proximity Scores in Term Dependency Models?
Proceedings of the 2014 Australasian Document Computing Symposium, 2014

Lazy and Eager Approaches for the Set Cover Problem.
Proceedings of the Thirty-Seventh Australasian Computer Science Conference, 2014

2013
Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays
CoRR, 2013

From Theory to Practice: Plug and Play with Succinct Data Structures.
CoRR, 2013

Adding Compression and Blended Search to a Compact Two-Level Suffix Array.
Proceedings of the String Processing and Information Retrieval, 2013

Fading Away: Dilution and User Behaviour.
Proceedings of the 3rd European Workshop on Human-Computer Interaction and Information Retrieval, 2013

Users versus models: what observation tells us about effectiveness metrics.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

What Users Do: The Eyes Have It.
Proceedings of the Information Retrieval Technology, 2013

Seven Numeric Properties of Effectiveness Metrics.
Proceedings of the Information Retrieval Technology, 2013

Choices in batch information retrieval evaluation.
Proceedings of the Australasian Document Computing Symposium, 2013

Exploring the magic of WAND.
Proceedings of the Australasian Document Computing Symposium, 2013

Continuous Measurement Scales in Human Evaluation of Machine Translation.
Proceedings of the 7th Linguistic Annotation Workshop and Interoperability with Discourse, 2013

2012
Efficient Extended Boolean Retrieval.
IEEE Trans. Knowl. Data Eng., 2012

Panel on use of proprietary data.
SIGIR Forum, 2012

Frontiers, challenges, and opportunities for information retrieval: Report from SWIRL 2012 the second strategic workshop on information retrieval in Lorne.
SIGIR Forum, 2012

Models and metrics: IR evaluation as a user process.
Proceedings of the Seventeenth Australasian Document Computing Symposium, 2012

2011
Efficient indexing of repeated n-grams.
Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

2010
A similarity measure for indefinite rankings.
ACM Trans. Inf. Syst., 2010

Efficient set intersection for inverted indexing.
ACM Trans. Inf. Syst., 2010

Index compression using 64-bit words.
Softw., Pract. Exper., 2010

Click-based evidence for decaying weight distributions in search effectiveness metrics.
Inf. Retr., 2010

The Role of Anchor Text in ClueWeb09 Retrieval.
Proceedings of The Nineteenth Text REtrieval Conference, 2010

The Effect of Pooling and Evaluation Depth on Metric Stability.
Proceedings of the 3rd International Workshop on Evaluating Information Access, 2010

Local Modeling for WebGraph Compression.
Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

Score Estimation, Incomplete Judgments, and Significance Testing in IR Evaluation.
Proceedings of the Information Retrieval Technology, 2010

Extended Boolean retrieval for systematic biomedical reviews.
Proceedings of the Computer Science 2010, 2010

2009
Against recall: is it persistence, cardinality, density, coverage, or totality?
SIGIR Forum, 2009

System scoring using partial prior information.
Proceedings of the 32nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2009

EvaluatIR: an online tool for evaluating and comparing IR systems.
Proceedings of the 32nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2009

Has adhoc retrieval improved since 1994?
Proceedings of the 32nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2009

Measurement Techniques and Caching Effects.
Proceedings of the Advances in Information Retrieval, 2009

Reducing Space Requirements for Disk Resident Suffix Arrays.
Proceedings of the Database Systems for Advanced Applications, 2009

Improvements that don't add up: ad-hoc retrieval results since 1998.
Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009

Score Aggregation Techniques in Retrieval Experimentation.
Proceedings of the Database Technologies 2009, 2009

2008
Compressing Integer Sequences and Sets.
Proceedings of the Encyclopedia of Algorithms, 2008

Rank-biased precision for measurement of retrieval effectiveness.
ACM Trans. Inf. Syst., 2008

Efficient online index construction for text databases.
ACM Trans. Database Syst., 2008

An empirical study of the effects of NLP components on Geographic IR performance.
International Journal of Geographical Information Science, 2008

Term Impacts as Normalized Term Frequencies for BM25 Similarity Scoring.
Proceedings of the String Processing and Information Retrieval, 2008

Improving suffix array locality for fast pattern matching on disk.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Precision-at-ten considered redundant.
Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2008

Score standardization for inter-collection comparison of retrieval systems.
Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2008

Exploring evaluation metrics: GMAP versus MAP.
Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2008

Statistical power in retrieval experimentation.
Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

2007
Incremental Calculation of Minimum-Redundancy Length-Restricted Codes.
IEEE Trans. Communications, 2007

Block merging for off-line compression.
JASIST, 2007

A pipelined architecture for distributed text query evaluation.
Inf. Retr., 2007

Compact Set Representation for Information Retrieval.
Proceedings of the String Processing and Information Retrieval, 2007

Strategic system comparisons via targeted relevance judgments.
Proceedings of the SIGIR 2007: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2007

2006
Improved Word-Aligned Binary Compression for Text Indexing.
IEEE Trans. Knowl. Data Eng., 2006

Decoding prefix codes.
Softw., Pract. Exper., 2006

Binary codes for locally homogeneous sequences.
Inf. Process. Lett., 2006

Inverted files for text search engines.
ACM Comput. Surv., 2006

Some Observations on User Search Behaviour.
Austr. J. Intelligent Information Processing Systems, 2006

Melbourne University at the 2006 Terabyte Track.
Proceedings of the Fifteenth Text REtrieval Conference, 2006

Phrase-Based Pattern Matching in Compressed Text.
Proceedings of the String Processing and Information Retrieval, 2006

Structured Index Organizations for High-Throughput Text Querying.
Proceedings of the String Processing and Information Retrieval, 2006

Load balancing for term-distributed parallel retrieval.
Proceedings of the SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2006

Pruned query evaluation using pre-computed impacts.
Proceedings of the SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2006

Exploring Probabilistic Toponym Resolution for Geographical Information Retrieval.
Proceedings of the 3rd ACM Workshop On Geographic Information Retrieval, 2006

NICTA I2D2 Group at GeoCLEF 2006.
Proceedings of the Working Notes for CLEF 2006 Workshop co-located with the 10th European Conference on Digital Libraries (ECDL 2006), 2006

NICTA I2D2 Group at GeoCLEF 2006.
Proceedings of the Evaluation of Multilingual and Multi-modal Information Retrieval, 2006

Pruning strategies for mixed-mode querying.
Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, 2006

2005
Recommended reading for IR research students.
SIGIR Forum, 2005

Inverted Index Compression Using Word-Aligned Binary Codes.
Inf. Retr., 2005

Word-based text compression using the Burrows-Wheeler transform.
Inf. Process. Manage., 2005

Space-Limited Ranked Query Evaluation Using Adaptive Pruning.
Proceedings of the Web Information Systems Engineering, 2005

Melbourne University 2005: Enterprise and Terabyte Tasks.
Proceedings of the Fourteenth Text REtrieval Conference, 2005

Enhanced Byte Codes with Restricted Prefix Properties.
Proceedings of the String Processing and Information Retrieval, 2005

The recap system for identifying information flow.
Proceedings of the SIGIR 2005: Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2005

Simplified similarity scoring using term ranks.
Proceedings of the SIGIR 2005: Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2005

Binary Codes for Non-Uniform Sources.
Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

Similarity measures for tracking information flow.
Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management, Bremen, Germany, October 31, 2005

Fast on-line index construction by geometric partitioning.
Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management, Bremen, Germany, October 31, 2005

Making Connections: First Year Transition for Computer Science and Software Engineering Students.
Proceedings of the Seventh Australasian Computing Education Conference (ACE 2005), 2005

2004
SEFT: a search engine for text.
Softw., Pract. Exper., 2004

What Does It Mean to "Measure Performance"?
Proceedings of the Web Information Systems, 2004

Melbourne University 2004: Terabyte and Web Tracks.
Proceedings of the Thirteenth Text REtrieval Conference, 2004

Collection-Independent Document-Centric Impacts.
Proceedings of the ADCS 2004, 2004

Performance and Cost Tradeoffs in Web Search..
Proceedings of the Database Technologies 2004, 2004

Index Compression Using Fixed Binary Codewords.
Proceedings of the Database Technologies 2004, 2004

Lossless Image Compression Using Pixel Reordering.
Proceedings of the Computer Science 2004, 2004

What Drives Curriculum Change?
Proceedings of the Sixth Australasian Computing Education Conference (ACE 2004), 2004

2003
Robust and Web Retrieval with Document-Centric Integral Impacts.
Proceedings of The Twelfth Text REtrieval Conference, 2003

Hybrid Prefix Codes for Practical Use.
Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

2002
Homepage Finding and Topic Distillation Using a Common Retrieval Strategy.
Proceedings of The Eleventh Text REtrieval Conference, 2002

Impact transformation: effective and efficient web retrieval.
Proceedings of the SIGIR 2002: Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2002

Compression and an IR Approach to XML Retrieval.
Proceedings of the First Workshop of the INitiative for the Evaluation of XML Retrieval (INEX), 2002

Incremental Calculation of Minimum-Redundancy Length-Restricted Codes.
Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

Block Merging for Off-Line Compression.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

Vector Space Ranking: Can We Keep it Simple?
Proceedings of the ADCS 2002, 2002

Improved Retrieval Effectiveness Through Impact Transformation.
Proceedings of the Database Technologies 2002, 2002

Enhanced Word-Based Block-Sorting Text Compression.
Proceedings of the Computer Science 2002, 2002

Compression and Coding Algorithms
Kluwer, ISBN: 0-7923-7668-4, 2002

2001
On-line adaptive canonical prefix coding with bounded compression loss.
IEEE Trans. Information Theory, 2001

Re-Store: A System for Compressing, Browsing, and Searching Large Documents (Invited Paper).
Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

Interactive Phrase Browsing Within Compressed Text.
Proceedings of the SIGIR 2001: Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2001

Vector-Space Ranking with Effective Early Termination.
Proceedings of the SIGIR 2001: Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2001

Can We Do without Ranks in Burrows Wheeler Transform Compression?
Proceedings of the Data Compression Conference, 2001

Length-Restricted Coding in Static and Dynamic Frameworks.
Proceedings of the Data Compression Conference, 2001

Parsing Strategies for BWT Compression.
Proceedings of the Data Compression Conference, 2001

Effective compression for the web: exploiting document linkages.
Proceedings of the Twelfth Australasian Database Conference, 2001

Length-Restricted Coding Using Modified Probability Distributions.
Proceedings of the 24th Australasian Computer Science Conference (ACSC 2001), 29 January, 2001

Word-Based Block-Sorting Text Compression.
Proceedings of the 24th Australasian Computer Science Conference (ACSC 2001), 29 January, 2001

2000
Housekeeping for prefix coding.
IEEE Trans. Communications, 2000

Binary Interpolative Coding for Effective Index Compression.
Inf. Retr., 2000

Needles and Haystacks: A Search Engine for Personal Information Collections.
Proceedings of the 23rd Australasian Computer Science Conference (ACSC 2000), 31 January, 2000

1999
An Improved Data Structure for Cumulative Probability Tables.
Softw., Pract. Exper., 1999

Statistical Phrases for Vector-Space Information Retrieval (poster abstract).
Proceedings of the SIGIR '99: Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1999

Effective Document Presentation with a Locality-Based Similarity Heuristic.
Proceedings of the SIGIR '99: Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1999

Offline Dictionary-Based Compression.
Proceedings of the Data Compression Conference, 1999

Locality-Based Information Retrieval.
Proceedings of the Database Systems 99, 1999

Managing Gigabytes: Compressing and Indexing Documents and Images, Second Edition
Morgan Kaufmann, ISBN: 1-55860-570-3, 1999

1998
Arithmetic Coding Revisited.
ACM Trans. Inf. Syst., 1998

Inverted Files Versus Signature Files for Text Indexing.
ACM Trans. Database Syst., 1998

Efficient Construction of Minimum-Redundancy Codes for Large Alphabets.
IEEE Trans. Information Theory, 1998

Exploring the Similarity Space.
SIGIR Forum, 1998

Comment on "Efficient Huffman Decoding" and "An Efficient Finite-State Machine Implementation of Huffman Decoders".
Inf. Process. Lett., 1998

A Tree-Based Mergesort.
Acta Inf., 1998

Compressed Inverted Files with Reduced Decoding Overheads.
Proceedings of the SIGIR '98: Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1998

Teraphim: An Engine for Distributed Information Retrieval.
Proceedings of the SIGIR '98: Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1998

Methodologies for Distributed Information Retrieval.
Proceedings of the 18th International Conference on Distributed Computing Systems, 1998

Piecewise Integer Mapping for Arithmetic Coding.
Proceedings of the Data Compression Conference, 1998

1997
Text Compression for Dynamic Document Databases.
IEEE Trans. Knowl. Data Eng., 1997

A probability-ratio approach to approximate binary arithmetic coding.
IEEE Trans. Information Theory, 1997

On the implementation of minimum redundancy prefix codes.
IEEE Trans. Communications, 1997

Efficient Approximate Adaptive Coding.
Proceedings of the 7th Data Compression Conference (DCC '97), 1997

1996
Self-Indexing Inverted Files for Fast Text Retrieval.
ACM Trans. Inf. Syst., 1996

Splaysort: Fast, Versatile, Practical.
Softw., Pract. Exper., 1996

Guidelines for Presentation and Comparison of Indexing Techniques.
SIGMOD Record, 1996

The Design of a High Performance Information Filtering System.
Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1996

On the Implementation of Minimum-Redundancy Prefix Codes.
Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, March 31, 1996

Exploiting Clustering in Inverted File Compression.
Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, March 31, 1996

Low-contact learning in a first year programming course.
Proceedings of the ACM SIGCSE 1st Australasian Conference on Computer Science Education, 1996

1995
Adding Compression to a Full-text Retrieval System.
Softw., Pract. Exper., 1995

The role of compression in document databases.
SIGWEB Newsletter, 1995

In Situ Generation of Compressed Inverted Files.
JASIS, 1995

Efficient Retrieval of Partial Documents.
Inf. Process. Manage., 1995

A Framework for Adaptive Sorting.
Discrete Applied Mathematics, 1995

Index Organization for Multimedia Database Systems.
ACM Comput. Surv., 1995

Practical Length-limited Coding for Large Alphabets.
Comput. J., 1995

The MG Retrieval System: Compressing for Space and Speed.
Commun. ACM, 1995

In-Place Calculation of Minimum-Redundancy Codes.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

A Fast and Space - Economical Algorithm for Length - Limited Coding.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Space-Efficient Construction of Optimal Prefix Codes.
Proceedings of the IEEE Data Compression Conference, 1995

Arithmetic Coding Revisited.
Proceedings of the IEEE Data Compression Conference, 1995

Improved Inverted File Processing for Large Text Databases.
Proceedings of the Sixth Australasian Database Conference, 1995

1994
Memory Efficient Ranking.
Inf. Process. Manage., 1994

An Empirical Evaluation of Coding Methods for Multi-symbol Alphabets.
Inf. Process. Manage., 1994

Semantic and Generative Models for Lossy Text Compression.
Comput. J., 1994

Compression and Fast Indexing for Multi-Gigabyte Text Databases.
Australian Computer Journal, 1994

Information Retrieval Systems for Large Document Collections.
Proceedings of The Third Text REtrieval Conference, 1994

Fast Ranking in Limited Space.
Proceedings of the Tenth International Conference on Data Engineering, 1994

Compression and Full-Text Indexing for Digital Libraries.
Proceedings of the Digital Libraries: Current Issues, 1994

Static Compression for Dynamic Texts.
Proceedings of the IEEE Data Compression Conference, 1994

Self-Indexing Inverted Files.
Proceedings of the 5th Australasian Database Conference, 1994

Managing Gigabytes: Compressing and Indexing Documents and Images.
Van Nostrand Reinhold, ISBN: 0-442-01863-0, 1994

1993
Data Compression in Full-Text Retrieval Systems.
JASIS, 1993

Supporting Random Access in Files of Variable Length Records.
Inf. Process. Lett., 1993

Historical Searching.
Int. J. Found. Comput. Sci., 1993

Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files.
Proceedings of the 19th International Conference on Very Large Data Bases, 1993

Retrieval of Partial Documents.
Proceedings of The Second Text REtrieval Conference, 1993

An Empirical Evaluation of Coding Techniques for Multi-Symbol Alphabets.
Proceedings of the IEEE Data Compression Conference, 1993

Storage Management for Files of Dynamic Records.
Proceedings of the Advances in Database Research, 1993

1992
Economical Inversion of Large Text Files.
Computing Systems, 1992

An Overview of Adaptive Sorting.
Australian Computer Journal, 1992

An Efficient Indexing Technique for Full Text Databases.
Proceedings of the 18th International Conference on Very Large Data Bases, 1992

Compression, Fast Indexing, and Structured Queries on a Gigabyte of Text.
Proceedings of The First Text REtrieval Conference, 1992

A Framework for Adaptive Sorting.
Proceedings of the Algorithm Theory, 1992

Parameterised Compression for Sparse Bitmaps.
Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Copenhagen, 1992

Sorting and/by Merging Finger Trees.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

Textual Image Compression.
Proceedings of the IEEE Data Compression Conference, 1992

Coding for Compression in Full-Text Retrieval Systems.
Proceedings of the IEEE Data Compression Conference, 1992

1991
Historical Searching and Sorting.
Proceedings of the ISA '91 Algorithms, 1991

Two-Level Context Based Compression of Binary Images.
Proceedings of the IEEE Data Compression Conference, 1991

1990
Linear time adaptive arithmetic coding.
IEEE Trans. Information Theory, 1990

Implementing the PPM data compression scheme.
IEEE Trans. Communications, 1990

1989
Word-based Text Compression.
Softw., Pract. Exper., 1989

A Note on the DMC Data Compression Scheme.
Comput. J., 1989

A Fast Algorithm for Melding Splay Trees.
Proceedings of the Algorithms and Data Structures, 1989

1987
An All Pairs Shortest Path Algorithm with Expected Time O(n² log n).
SIAM J. Comput., 1987

1985
An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984
A Priority Queue for the All Pairs Shortest Path Problem.
Inf. Process. Lett., 1984

1980
An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980


  Loading...