Jeffrey Scott Vitter

IEEE Trans. Knowl. Data Eng., March, 2023

Ranked Document Retrieval in External Memory.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, January, 2023

2022

CIndex: compressed indexes for fast retrieval of FASTQ files.

[BibT_eX]

[DOI]

Bioinform., 2022

2021

MSQ-Index: A Succinct Index for Fast Graph Similarity Search.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2021

Efficient Compression and Indexing for Highly Repetitive DNA Sequence Collections.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2021

2020

Feature reduction based on semantic similarity for graph classification.

[BibT_eX]

[DOI]

Neurocomputing, 2020

2019

An efficient algorithm for graph edit distance computation.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2019

2018

A non-intrusive approach for classifying residential water events using coincident electricity data.

[BibT_eX]

[DOI]

Michael E. Webber

Environ. Model. Softw., 2018

Practical Succinct Text Indexes in External Memory.

[BibT_eX]

[DOI]

Proceedings of the 2018 Data Compression Conference, 2018

2017

Fast Computation of Graph Edit Distance.

[BibT_eX]

[DOI]

CoRR, 2017

Efficient Graph Similarity Search in External Memory.

[BibT_eX]

[DOI]

IEEE Access, 2017

2016

External Sorting and Permuting.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Arithmetic Coding for Data Compression.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Fast construction of wavelet trees.

[BibT_eX]

[DOI]

J. Ian Munro

Theor. Comput. Sci., 2016

MSQ-Index: A Succinct Index for Fast Graph Similarity Search.

[BibT_eX]

[DOI]

CoRR, 2016

RefSelect: a reference sequence selection algorithm for planted (l, d) motif search.

[BibT_eX]

[DOI]

BMC Bioinform., 2016

CS2A: A Compressed Suffix Array-Based Method for Short Read Alignment.

[BibT_eX]

[DOI]

Proceedings of the 2016 Data Compression Conference, 2016

2015

An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2015

Compressing Dictionary Matching Index via Sparsification Technique.

[BibT_eX]

[DOI]

Algorithmica, 2015

Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching.

[BibT_eX]

[DOI]

Algorithmica, 2015

Dynamic Data Structures for Document Collections and Graphs.

[BibT_eX]

[DOI]

J. Ian Munro

Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

Reference sequence selection for motif searches.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Conference on Bioinformatics and Biomedicine, 2015

A Data-Aware FM-index.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014

Space-Efficient Frameworks for Top-k String Retrieval.

[BibT_eX]

[DOI]

J. ACM, 2014

Space-Efficient String Indexing for Wildcard Pattern Matching.

[BibT_eX]

[DOI]

Moshe Lewenstein

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Categorical range maxima queries.

[BibT_eX]

[DOI]

Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

A Practical Implementation of Compressed Suffix Arrays with Applications to Self-Indexing.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2014

An efficient motif finding algorithm for large DNA data sets.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014

2013

Faster compressed dictionary matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Compressed text indexing with wildcards.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2013

Top-k Document Retrieval in External Memory.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

Optimal Color Range Reporting in One Dimension.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

Faster Compressed Top-k Document Retrieval.

[BibT_eX]

[DOI]

Proceedings of the 2013 Data Compression Conference, 2013

Indexes for Document Retrieval with Relevance.

[BibT_eX]

[DOI]

Proceedings of the Space-Efficient Data Structures, 2013

StemFinder: An efficient algorithm for searching motif stems over large alphabets.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Conference on Bioinformatics and Biomedicine, 2013

2012

Efficient Maximal Repeat Finding Using the Burrows-Wheeler Transform and Wavelet Tree.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2012

On position restricted substring searching in succinct space.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

On Optimal Top-K String Retrieval

[BibT_eX]

[DOI]

CoRR, 2012

Fast Pattern-Matching via k-bit Filtering Based Text Decomposition.

[BibT_eX]

[DOI]

Comput. J., 2012

Document Listing for Queries with Excluded Pattern.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Compressed data structures with relevance.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011

Cache-oblivious index for approximate string matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Inverted indexes for phrases and strings.

[BibT_eX]

[DOI]

Sabrina Chandrasekaran

Proceedings of the Proceeding of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2011

Compressed Dictionary Matching with One Error.

[BibT_eX]

[DOI]

Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

Wavelet Trees: From Theory to Practice.

[BibT_eX]

[DOI]

Proceedings of the First International Conference on Data Compression, 2011

2010

String Retrieval for Multi-pattern Queries.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2010

Boosting Pattern Matching Performance via k-bit Filtering.

[BibT_eX]

[DOI]

Proceedings of the Computer and Information Sciences, 2010

I/O-Efficient Compressed Text Indexes: From Theory to Practice.

[BibT_eX]

[DOI]

Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

Compression, Indexing, and Retrieval for Massive String Data.

[BibT_eX]

[DOI]

Wing-Kai Hon

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

PSI-RA: A parallel sparse index for read alignment on genomes.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

Time- and space-efficient maximal repeat finding using the burrows-wheeler transform and wavelet trees.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

2009

On Entropy-Compressed Text Indexing in External Memory.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2009

Succinct Index for Dynamic Dictionary Matching.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Space-Efficient Framework for Top-k String Retrieval Problems.

[BibT_eX]

[DOI]

Wing-Kai Hon

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008

External Sorting and Permuting.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Arithmetic Coding for Data Compression.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Tight competitive ratios for parallel disk prefetching and caching.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

On searching compressed string collections cache-obliviously.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

The SBC-tree: an index for run-length compressed sequences.

[BibT_eX]

[DOI]

Proceedings of the EDBT 2008, 2008

Compressed Index for Dictionary Matching.

[BibT_eX]

[DOI]

Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing.

[BibT_eX]

[DOI]

Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Ankur Gupta

Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, 2008

2007

Compressed data structures: Dictionaries and data-aware measures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

External-Memory Algorithms for Processing Line Segments in Geographic Information Systems.

[BibT_eX]

[DOI]

Algorithmica, 2007

Efficient Update of Indexes for Dynamically Changing Web Documents.

[BibT_eX]

[DOI]

World Wide Web, 2007

A Framework for Dynamizing Succinct Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Adaptive rank-aware query optimization in relational databases.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2006

When indexing equals compression: Experiments with compressing suffix arrays and applications.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

Efficient Bundle Sorting.

[BibT_eX]

[DOI]

Eran Segal

SIAM J. Comput., 2006

Distribution sort with randomized cycling.

[BibT_eX]

[DOI]

J. ACM, 2006

Algorithms and Data Structures for External Memory.

[BibT_eX]

[DOI]

Found. Trends Theor. Comput. Sci., 2006

Compressed Dictionaries: Space Measures, Data Sets, and Experiments.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

Efficient join processing over uncertain data.

[BibT_eX]

[DOI]

Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, 2006

2005

Optimal Lexicographic Shaping of Aggregate Streaming Data.

[BibT_eX]

[DOI]

Stergios V. Anastasiadis

Ke Yi

IEEE Trans. Computers, 2005

The Indiana Center for Database Systems at Purdue University.

[BibT_eX]

[DOI]

Christopher W. Clifton

SIGMOD Rec., 2005

Duality Between Prefetching and Queued Writing with Parallel Disks.

[BibT_eX]

[DOI]

Peter Sanders

SIAM J. Comput., 2005

Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

CXHist : An On-line Classification-Based Histogram for XML String Selectivity Estimation.

[BibT_eX]

[DOI]

Lipyeow Lim

Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005

On competitive online read-many parallel disks scheduling.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

2004

Geometric and Spatial Data Structures in External Memory.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Data Structures and Applications., 2004

Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data.

[BibT_eX]

[DOI]

Proceedings of the (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, Toronto, Canada, August 31, 2004

Mining Deviants in Time Series Data Streams.

[BibT_eX]

[DOI]

S. Muthukrishnan

Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), 2004

Online algorithms for prefetching and caching on parallel disks.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

When indexing equals compression: experiments with compressing suffix arrays and applications.

[BibT_eX]

[DOI]

Ankur Gupta

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Rank-aware Query Optimization.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004

Bulk Operations for Space-Partitioning Trees.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Data Engineering, 2004

Fast Compression with a Static Model in High-Order Entropy.

[BibT_eX]

[DOI]

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003

Optimal External Memory Interval Management.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

Dynamic Generation of Discrete Random Variates.

[BibT_eX]

[DOI]

Wen-Chun Ni

Theory Comput. Syst., 2003

Efficient Flow Computation on Massive Grid Terrain Datasets.

[BibT_eX]

[DOI]

GeoInformatica, 2003

Dynamic maintenance of web indexes using landmarks.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International World Wide Web Conference, 2003

SASH: A Self-Adaptive Histogram Set for Dynamically Changing Workloads.

[BibT_eX]

[DOI]

Lipyeow Lim

Proceedings of 29th International Conference on Very Large Data Bases, 2003

Bkd-Tree: A Dznamic Scalable kd-Tree.

[BibT_eX]

[DOI]

Proceedings of the Advances in Spatial and Temporal Databases, 8th International Symposium, 2003

High-order entropy-compressed text indexes.

[BibT_eX]

[DOI]

Ankur Gupta

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

A Simple and Efficient Parallel Disk Mergesort.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2002

Efficient Sorting Using Registers and Caches.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2002

Efficient Bulk Operations on Dynamic R-Trees.

[BibT_eX]

[DOI]

Algorithmica, 2002

XPathLearner: An On-line Self-Tuning Markov Histogram for XML Path Selectivity Estimation.

[BibT_eX]

[DOI]

Proceedings of 28th International Conference on Very Large Data Bases, 2002

Lexicographically optimal smoothing for broadband traffic multiplexing.

[BibT_eX]

[DOI]

Stergios V. Anastasiadis

Ke Yi

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Compressed Indexes for Fast Search in Sequences.

[BibT_eX]

Proceedings of the 6th Joint Conference on Information Science, 2002

Distributed Computing with Load-Managed Active Storage.

[BibT_eX]

[DOI]

Rajiv Wickremesinghe

Jeffrey S. Chase

Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing (HPDC-11 2002), 2002

Implementing I/O-efficient Data Structures Using TPIE.

[BibT_eX]

[DOI]

Octavian Procopiuc

Proceedings of the Algorithms, 2002

Aggregate Predicate Support in DBMS.

[BibT_eX]

[DOI]

Proceedings of the Database Technologies 2002, 2002

2001

I/O-Efficient Algorithms for Problems on Grid-Based Terrains.

[BibT_eX]

[DOI]

Laura Toma

ACM J. Exp. Algorithmics, 2001

External memory algorithms and data structures.

[BibT_eX]

[DOI]

ACM Comput. Surv., 2001

Characterizing Web Document Change.

[BibT_eX]

[DOI]

Proceedings of the Advances in Web-Age Information Management, 2001

Supporting Incremental Join Queries on Ranked Inputs.

[BibT_eX]

[DOI]

Proceedings of the VLDB 2001, 2001

Wavelet-Based Cost Estimation for Spatial Queries.

[BibT_eX]

[DOI]

Proceedings of the Advances in Spatial and Temporal Databases, 7th International Symposium, 2001

Constrained querying of multimedia databases: issues and approaches.

[BibT_eX]

[DOI]

Proceedings of the Storage and Retrieval for Media Databases 2001, 2001

CAMEL: concept annotated image libraries.

[BibT_eX]

[DOI]

Proceedings of the Storage and Retrieval for Media Databases 2001, 2001

The power of duality for prefetching and sorting with parallel disks.

[BibT_eX]

[DOI]

Peter Sanders

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Distribution sort with randomizing cycle.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

A Framework for Index Bulk Loading and Dynamization.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Flow Computation on Massive Grids.

[BibT_eX]

[DOI]

Proceedings of the ACM-GIS 2001, 2001

2000

ACM SIGACT 1999-2000 annual report.

[BibT_eX]

[DOI]

SIGACT News, 2000

Application-Controlled Paging for a Shared Cache.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Binary Space Partitions for Fat Rectangles.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

A Parallel Algorithm for Planar Orthogonal Grid Drawings.

[BibT_eX]

[DOI]

Ioannis G. Tollis

Parallel Process. Lett., 2000

Efficient Searching with Linear Constraints.

[BibT_eX]

[DOI]

Jeff Erickson

Paolo Giulio Franciosa

J. Comput. Syst. Sci., 2000

Competitive Parallel Disk Prefetching and Buffer Management.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Cylindrical static and kinetic binary space partitions.

[BibT_eX]

[DOI]

Comput. Geom., 2000

Dynamic Maintenance of Wavelet-Based Histograms.

[BibT_eX]

[DOI]

Proceedings of the VLDB 2000, 2000

Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

A Unified Approach for Indexed and Non-Indexed Spatial Joins.

[BibT_eX]

[DOI]

Proceedings of the Advances in Database Technology, 2000

1999

Text compression via alphabet re-representation.

[BibT_eX]

[DOI]

Apostol Natsev

Neural Networks, 1999

Dictionary Selection Using Partial Matching.

[BibT_eX]

[DOI]

Inf. Sci., 1999

The Object Complexity Model for Hidden-Surface Removal.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1999

Adaptive Disk Spindown via Optimal Rent-to-Buy in Probabilistic Environments.

[BibT_eX]

[DOI]

Algorithmica, 1999

I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD 1999, 1999

Modeling and Optimizing I/O Throughput of Multiple Disks on a Bus.

[BibT_eX]

[DOI]

Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 1999

On Two-Dimensional Indexability and Optimal Range Search Indexing.

[BibT_eX]

[DOI]

Vasilis Samoladas

Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999

Round-Like Behavior in Multiple Disks on a Bus.

[BibT_eX]

[DOI]

Proceedings of the Sixth Workshop on I/O in Parallel and Distributed Systems, 1999

Online Data Structures in External Memory.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

A Theoretical Framework for Memory-Adaptive Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998

Efficient cost measures for motion estimation at low bit rates.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. Video Technol., 1998

Optimal Prediction for Prefetching in the Worst Case.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Scalable Sweeping-Based Spatial Join.

[BibT_eX]

[DOI]

Proceedings of the VLDB'98, 1998

Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract).

[BibT_eX]

[DOI]

Kasturi R. Varadarajan

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Wavelet-Based Histograms for Selectivity Estimation.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD 1998, 1998

Modeling and Optimizing I/O Throughput of Multiple Disks on a Bus (Summary).

[BibT_eX]

[DOI]

Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, 1998

Scalable Mining for Classification Rules in Relational Databases.

[BibT_eX]

[DOI]

Proceedings of the 1998 International Database Engineering and Applications Symposium, 1998

External Memory Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1998

Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1998

Data Cube Approximation and Histograms via Wavelets.

[BibT_eX]

[DOI]

Proceedings of the 1998 ACM CIKM International Conference on Information and Knowledge Management, 1998

1997

Simple Randomized Mergesort on Parallel Disks.

[BibT_eX]

[DOI]

Parallel Comput., 1997

Coping with Uncertainty in Map Learning.

[BibT_eX]

[DOI]

Kenneth Basye

Thomas L. Dean

Mach. Learn., 1997

Lexicographic Bit Allocation for MPEG Video.

[BibT_eX]

[DOI]

Elliot L. Linzer

J. Vis. Commun. Image Represent., 1997

On Sorting Strings in External Memory (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Sequence sorting in secondary storage.

[BibT_eX]

[DOI]

Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

Lexicographic Bit Allocation for MPEG Video Coding.

[BibT_eX]

[DOI]

Elliot L. Linzer

Proceedings of the Proceedings 1997 International Conference on Image Processing, 1997

Multiplexing VBR Video Sequences onto a CBR Channel with Lexicographic Optimization.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1997 International Conference on Image Processing, 1997

Selectivity Estimation in the Presence of Alphanumeric Correlations.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Conference on Data Engineering, 1997

A Lexicographic Framework for MPEG Rate Control.

[BibT_eX]

[DOI]

Elliot L. Linzer

Proceedings of the 7th Data Compression Conference (DCC '97), 1997

Practical Techniques for Constructing Binary Space Partitions for Orthogonal Rectangles.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Indexing for Data Models with Constraints and Classes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1996

Optimal Prefetching via Data Compression.

[BibT_eX]

[DOI]

J. ACM, 1996

Parallel Lossless Image Compression Using Huffman and Arithmetic Coding.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments.

[BibT_eX]

[DOI]

Kathleen Romanik

Inf. Comput., 1996

Communication Issues in Large-Scale Geometric Computation.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1996

I/O-Efficient Algorithms and Environments.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1996

Strategic Directions in Storage I/O Issues in Large-Scale Computing.

[BibT_eX]

[DOI]

Garth A. Gibson

John Wilkes

ACM Comput. Surv., 1996

Optimal Cooperative Search in Fractional Cascaded Data Structures.

[BibT_eX]

[DOI]

Algorithmica, 1996

Blocking for External Graph Searching.

[BibT_eX]

[DOI]

Michael T. Goodrich

Algorithmica, 1996

Efficient 3-D Range Searching in External Memory.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Estimating Alphanumeric Selectivity in the Presence of Wildcards.

[BibT_eX]

[DOI]

Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, 1996

Optimal Dynamic Interval Management in External Memory (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Binary Search Partitions for Fat Rectangles.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Efficient Cost Measures for Motion Compensation at Low Bit Rates (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996

1995

Greed Sort: Optimal Deterministic Sorting on Parallel Disks.

[BibT_eX]

[DOI]

J. ACM, 1995

An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs.

[BibT_eX]

[DOI]

Sairam Subramanian

Algorithmica, 1995

Online Perfect Matching and Mobile Computing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Supporting I/O-efficient scientific computation in TPIE.

[BibT_eX]

[DOI]

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

External-Memory Graph Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Learning to Make Rent-to-Buy Decisions with Systems Applications.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning, 1995

Application-Controlled Paging for a Shared Cache (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Load Balancing in the Lp Norm.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

Multiple-Dictionary Coding Using Partial Matching.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1995

1994

Complexity Models for Incremental Computation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Arithmetic coding for data compression.

[BibT_eX]

[DOI]

Proc. IEEE, 1994

A Theory for Memory-Based Learning.

[BibT_eX]

[DOI]

Mach. Learn., 1994

Design and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding.

[BibT_eX]

[DOI]

Inf. Process. Manag., 1994

Algorithms for Parallel Memory II: Hierarchical Multilevel Memories.

[BibT_eX]

[DOI]

Algorithmica, 1994

Algorithms for Parallel Memory I: Two-Level Memories.

[BibT_eX]

[DOI]

Algorithmica, 1994

Guest Editor's Introduction: Special Issue on Large-Scale Memories.

[BibT_eX]

[DOI]

Algorithmica, 1994

Approximate Data Structures with Applications.

[BibT_eX]

[DOI]

Neal E. Young

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Explicit Bit Minimization for Motion-Compensated Video Coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1994

1993

Large-Scale Sorting in Uniform Memory Hierarchies.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1993

A Simplified Technique for Hidden-Line Elimination in Terrains.

[BibT_eX]

[DOI]

Franco P. Preparata

Int. J. Comput. Geom. Appl., 1993

A Complexity Theoretic Approach to Incremental Computation.

[BibT_eX]

[DOI]

Sairam Sairam

Proceedings of the STACS 93, 1993

Deterministic Distribution Sort in Shared and Distributed Memory Multiprocessors.

[BibT_eX]

[DOI]

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

Practical Prefetching via Data Compression.

[BibT_eX]

[DOI]

Kenneth M. Curewitz

Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 1993

Dynamic algorithms for optimization problems in bounded tree-width graphs.

[BibT_eX]

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

External-Memory Computational Geometry (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

Fast and Efficient Lossless Image Compression.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1993

Using computational learning theory to analyze the testing complexity of program segments.

[BibT_eX]

[DOI]

Kathleen Romanik

Proceedings of the Seventeenth Annual International Computer Software and Applications Conference, 1993

1992

Learning in Parallel

[BibT_eX]

[DOI]

Inf. Comput., February, 1992

New Methods for Lossless Image Compression Using Arithmetic Coding.

[BibT_eX]

[DOI]

Inf. Process. Manag., 1992

Analysis of Arithmetic Coding for Data Compression.

[BibT_eX]

[DOI]

Inf. Process. Manag., 1992

Approximation Algorithms for Geometric Median Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds.

[BibT_eX]

[DOI]

Franco P. Preparata

Mariette Yvinec

Algorithmica, 1992

epsilon-Approximations with Minimum Packing Constraint Violation (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs.

[BibT_eX]

[DOI]

Sairam Sairam

Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

Nearly Optimal Vecot Quantization via Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1992

Error Modeling for Hierarchical Lossless Image Compression.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1992

1991

I/O Overhead and Parallel VLSI Architectures for Lattice Computations.

[BibT_eX]

[DOI]

Daniel P. Lopresti

IEEE Trans. Computers, 1991

Parallel Transitive Closure and Point Location in Planar Structures.

[BibT_eX]

[DOI]

SIAM J. Comput., 1991

The Maximum Size of Dynamic Data Structures.

[BibT_eX]

[DOI]

Claire Kenyon-Mathieu

SIAM J. Comput., 1991

Complexity Results on Learning by Neural Nets.

[BibT_eX]

[DOI]

Mach. Learn., 1991

Lower Bounds for Planar Orthogonal Drawings of Graphs.

[BibT_eX]

[DOI]

Ioannis G. Tollis

Inf. Process. Lett., 1991

A Data Dtructure for Arc Insertion and Regular Path Finding.

[BibT_eX]

[DOI]

Adam L. Buchsbaum

Paris C. Kanellakis

Ann. Math. Artif. Intell., 1991

Maximum Queue Size and Hashing with Lazy Deletion.

[BibT_eX]

[DOI]

Claire Kenyon-Mathieu

Algorithmica, 1991

Efficient Memory Access in Large-Scale Computation.

[BibT_eX]

[DOI]

Proceedings of the STACS 91, 1991

Lower bounds and parallel algorithms for planar orthogonal grid drawings.

[BibT_eX]

[DOI]

Ioannis G. Tollis

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Large-Scale Sorting in Parallel Memories (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

Optimal Prefetching via Data Compression (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Computation of the axial view of a set of isothetic parallelepipeds.

[BibT_eX]

[DOI]

Franco P. Preparata

Mariette Yvinec

ACM Trans. Graph., 1990

Optimal Disk I/O with Parallel Block Transfer (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

A Data Structure for Arc Insertion and Regular Path Finding.

[BibT_eX]

[DOI]

Adam L. Buchsbaum

Paris C. Kanellakis

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

Average-Case Analysis of Algorithms and Data Structures.

[BibT_eX]

Philippe Flajolet

Proceedings of the Handbook of Theoretical Computer Science, 1990

1989

Algorithm 673: Dynamic Huffman coding.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1989

Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (Extended Abstract).

[BibT_eX]

[DOI]

Claire Kenyon-Mathieu

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

Complexity Issues in Learning by Neural Nets.

[BibT_eX]

[DOI]

Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

1988

A Parallel Algorithm for Recognizing Unordered Depth-First Search.

[BibT_eX]

[DOI]

Catherine A. Schevon

Inf. Process. Lett., 1988

The Input/Output Complexity of Sorting and Related Problems.

[BibT_eX]

[DOI]

Alok Aggarwal

Commun. ACM, 1988

Editor's Foreword: Special Issue on Parallel and Distributed Computing, Part II.

[BibT_eX]

[DOI]

Algorithmica, 1988

Editor's Foreword: Special Issue on Parallel and Distributed Computing, Part I.

[BibT_eX]

[DOI]

Algorithmica, 1988

1987

An efficient algorithm for sequential random sampling.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1987

Design and analysis of dynamic Huffman codes.

[BibT_eX]

[DOI]

J. ACM, 1987

Pairing Heaps: Experiments and Analysis.

[BibT_eX]

[DOI]

John T. Stasko

Commun. ACM, 1987

The I/O Complexity of Sorting and Related Problems (Extended Abstract).

[BibT_eX]

[DOI]

Alok Aggarwal

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P.

[BibT_eX]

[DOI]

Roger A. Simons

IEEE Trans. Computers, 1986

Deletion Algorithms for Coalesced Hashing.

[BibT_eX]

[DOI]

Comput. J., 1986

The Complexity of Hashing with Lazy Deletion.

[BibT_eX]

[DOI]

Christopher J. Van Wyk

Algorithmica, 1986

Shortest Paths in Euclidean Graphs.

[BibT_eX]

[DOI]

Robert Sedgewick

Algorithmica, 1986

1985

Random Sampling with a Reservoir.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1985

An Efficient I/O Interface for Optical Disks.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 1985

Addendum to "Analysis of Some New Variants of Coalesced Hashing".

[BibT_eX]

ACM Trans. Database Syst., 1985

The Design and Analysis of BucketSort for Bubble Memory Secondary Storage.

[BibT_eX]

[DOI]

Eugene E. Lindstrom

IEEE Trans. Computers, 1985

Optimum Algorithms for a Model of Direct Chaining.

[BibT_eX]

[DOI]

SIAM J. Comput., 1985

Design and Analysis of Dynamic Huffman Coding (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

Analysis of New Variants of Coalesced Hashing.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 1984

US&R: A New Framework for Redoing.

[BibT_eX]

[DOI]

IEEE Softw., 1984

Faster Methods for Random Sampling.

[BibT_eX]

[DOI]

Commun. ACM, 1984

USeR: A New Framework for Redoing.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, 1984

Computational Complexity of an Optical Disk Interface (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, 1984

Shortest Paths in Euclidean Graphs (Extended Abstract)

[BibT_eX]

[DOI]

Robert Sedgewick

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

Parallel algorithms for unification and other complete problems in p.

[BibT_eX]

[DOI]

Roger A. Simons

Proceedings of the 1984 ACM Annual Conference on Computer Science: The fifth generation challenge, 1984

1983

Analysis of the Search Performance of Coalesced Hashing

[BibT_eX]

[DOI]

J. ACM, April, 1983

Analysis of Early-Insertion Standard Coalesced Hashing.

[BibT_eX]

[DOI]

SIAM J. Comput., 1983

Optimum Algorithms for Two Random Sampling Problems (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982

Deletion Algorithms for Hashing That Preserve Randomness.

[BibT_eX]

[DOI]

J. Algorithms, 1982

Implementations for Coalesced Hashing.

[BibT_eX]

[DOI]

Commun. ACM, 1982

1981

A Shared-Memory Scheme for Coalesced Hashing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

Deletion Algorithms for Hashing that Preserve Randomness (detailed abstract)

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980

Analysis of coalesced hashing.

[BibT_eX]

[DOI]

PhD thesis, 1980

Tuning the Coalesced Hashing Method to Obtain Optimum Performance (Detailed Abstract)

[BibT_eX]

[DOI]