Jeffrey Scott Vitter

According to our database1, Jeffrey Scott Vitter authored at least 254 papers between 1980 and 2019.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 1993, "For contributions to the theory of sorting and searching and to the design and analysis of computer algorithms.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
An efficient algorithm for graph edit distance computation.
Knowl.-Based Syst., 2019

2018
A non-intrusive approach for classifying residential water events using coincident electricity data.
Environmental Modelling and Software, 2018

Practical Succinct Text Indexes in External Memory.
Proceedings of the 2018 Data Compression Conference, 2018

2017
Efficient Graph Similarity Search in External Memory.
IEEE Access, 2017

2016
External Sorting and Permuting.
Encyclopedia of Algorithms, 2016

Arithmetic Coding for Data Compression.
Encyclopedia of Algorithms, 2016

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

CS2A: A Compressed Suffix Array-Based Method for Short Read Alignment.
Proceedings of the 2016 Data Compression Conference, 2016

2015
An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets.
IEEE/ACM Trans. Comput. Biology Bioinform., 2015

Compressing Dictionary Matching Index via Sparsification Technique.
Algorithmica, 2015

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

Dynamic Data Structures for Document Collections and Graphs.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

Reference sequence selection for motif searches.
Proceedings of the 2015 IEEE International Conference on Bioinformatics and Biomedicine, 2015

A Data-Aware FM-index.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
Space-Efficient Frameworks for Top-k String Retrieval.
J. ACM, 2014

Space-Efficient String Indexing for Wildcard Pattern Matching.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Fast Construction of Wavelet Trees.
Proceedings of the String Processing and Information Retrieval, 2014

Categorical range maxima queries.
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.
Proceedings of the Data Compression Conference, 2014

An efficient motif finding algorithm for large DNA data sets.
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014

2013
Top-k Document Retrieval in External Memory.
Proceedings of the Algorithms - ESA 2013, 2013

Optimal Color Range Reporting in One Dimension.
Proceedings of the Algorithms - ESA 2013, 2013

Faster Compressed Top-k Document Retrieval.
Proceedings of the 2013 Data Compression Conference, 2013

Indexes for Document Retrieval with Relevance.
Proceedings of the Space-Efficient Data Structures, 2013

StemFinder: An efficient algorithm for searching motif stems over large alphabets.
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.
IEEE/ACM Trans. Comput. Biology Bioinform., 2012

On position restricted substring searching in succinct space.
J. Discrete Algorithms, 2012

Fast Pattern-Matching via k-bit Filtering Based Text Decomposition.
Comput. J., 2012

Document Listing for Queries with Excluded Pattern.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Compressed data structures with relevance.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011
Compressed Text Indexing with Wildcards.
Proceedings of the String Processing and Information Retrieval, 2011

Inverted indexes for phrases and strings.
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.
Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

Wavelet Trees: From Theory to Practice.
Proceedings of the First International Conference on Data Compression, 2011

2010
String Retrieval for Multi-pattern Queries.
Proceedings of the String Processing and Information Retrieval, 2010

Faster Compressed Dictionary Matching.
Proceedings of the String Processing and Information Retrieval, 2010

Boosting Pattern Matching Performance via k-bit Filtering.
Proceedings of the Computer and Information Sciences, 2010

I/O-Efficient Compressed Text Indexes: From Theory to Practice.
Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

Compression, Indexing, and Retrieval for Massive String Data.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

PSI-RA: A parallel sparse index for read alignment on genomes.
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.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

2009
On Entropy-Compressed Text Indexing in External Memory.
Proceedings of the String Processing and Information Retrieval, 2009

Succinct Index for Dynamic Dictionary Matching.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Space-Efficient Framework for Top-k String Retrieval Problems.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008
External Sorting and Permuting.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Arithmetic Coding for Data Compression.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Tight competitive ratios for parallel disk prefetching and caching.
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.
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.
Proceedings of the EDBT 2008, 2008

Compressed Index for Dictionary Matching.
Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing.
Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform.
Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, 2008

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

Efficient Update of Indexes for Dynamically Changing Web Documents.
World Wide Web, 2007

A Framework for Dynamizing Succinct Data Structures.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Cache-Oblivious Index for Approximate String Matching.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
Adaptive rank-aware query optimization in relational databases.
ACM Trans. Database Syst., 2006

When indexing equals compression: Experiments with compressing suffix arrays and applications.
ACM Trans. Algorithms, 2006

Distribution sort with randomized cycling.
J. ACM, 2006

Algorithms and Data Structures for External Memory.
Foundations and Trends in Theoretical Computer Science, 2006

Compressed Dictionaries: Space Measures, Data Sets, and Experiments.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

Compressed Data Structures: Dictionaries and Data-Aware Measures.
Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

Efficient join processing over uncertain data.
Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, 2006

2005
Optimal Lexicographic Shaping of Aggregate Streaming Data.
IEEE Trans. Computers, 2005

The Indiana Center for Database Systems at Purdue University.
SIGMOD Record, 2005

Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching.
SIAM J. Comput., 2005

CXHist : An On-line Classification-Based Histogram for XML String Selectivity Estimation.
Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005

On competitive online read-many parallel disks scheduling.
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.
Proceedings of the Handbook of Data Structures and Applications., 2004

Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data.
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.
Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), 2004

Online algorithms for prefetching and caching on parallel disks.
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.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Rank-aware Query Optimization.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004

Bulk Operations for Space-Partitioning Trees.
Proceedings of the 20th International Conference on Data Engineering, 2004

Fast Compression with a Static Model in High-Order Entropy.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003
Optimal External Memory Interval Management.
SIAM J. Comput., 2003

Efficient Flow Computation on Massive Grid Terrain Datasets.
GeoInformatica, 2003

Dynamic maintenance of web indexes using landmarks.
Proceedings of the Twelfth International World Wide Web Conference, 2003

SASH: A Self-Adaptive Histogram Set for Dynamically Changing Workloads.
Proceedings of 29th International Conference on Very Large Data Bases, 2003

Bkd-Tree: A Dznamic Scalable kd-Tree.
Proceedings of the Advances in Spatial and Temporal Databases, 8th International Symposium, 2003

High-order entropy-compressed text indexes.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
Efficient Sorting Using Registers and Caches.
ACM Journal of Experimental Algorithmics, 2002

XPathLearner: An On-line Self-Tuning Markov Histogram for XML Path Selectivity Estimation.
Proceedings of 28th International Conference on Very Large Data Bases, 2002

Lexicographically optimal smoothing for broadband traffic multiplexing.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Compressed Indexes for Fast Search in Sequences.
Proceedings of the 6th Joint Conference on Information Science, 2002

Distributed Computing with Load-Managed Active Storage.
Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing (HPDC-11 2002), 2002

Implementing I/O-efficient Data Structures Using TPIE.
Proceedings of the Algorithms, 2002

Aggregate Predicate Support in DBMS.
Proceedings of the Database Technologies 2002, 2002

2001
I/O-Efficient Algorithms for Problems on Grid-Based Terrains.
ACM Journal of Experimental Algorithmics, 2001

Characterizing Web Document Change.
Proceedings of the Advances in Web-Age Information Management, 2001

Supporting Incremental Join Queries on Ranked Inputs.
Proceedings of the VLDB 2001, 2001

Wavelet-Based Cost Estimation for Spatial Queries.
Proceedings of the Advances in Spatial and Temporal Databases, 7th International Symposium, 2001

Constrained querying of multimedia databases: issues and approaches.
Proceedings of the Storage and Retrieval for Media Databases 2001, 2001

CAMEL: concept annotated image libraries.
Proceedings of the Storage and Retrieval for Media Databases 2001, 2001

The power of duality for prefetching and sorting with parallel disks.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Distribution sort with randomizing cycle.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

A Framework for Index Bulk Loading and Dynamization.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Flow Computation on Massive Grids.
Proceedings of the ACM-GIS 2001, 2001

Duality between Prefetching and Queued Writing with Parallel Disks.
Proceedings of the Algorithms, 2001

2000
ACM SIGACT 1999-2000 annual report.
SIGACT News, 2000

Application-Controlled Paging for a Shared Cache.
SIAM J. Comput., 2000

Binary Space Partitions for Fat Rectangles.
SIAM J. Comput., 2000

A Parallel Algorithm for Planar Orthogonal Grid Drawings.
Parallel Processing Letters, 2000

Efficient Sorting Using Registers and Caches.
Proceedings of the Algorithm Engineering, 2000

Dynamic Maintenance of Wavelet-Based Histograms.
Proceedings of the VLDB 2000, 2000

Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Efficient bundle sorting.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

A Unified Approach for Indexed and Non-Indexed Spatial Joins.
Proceedings of the Advances in Database Technology, 2000

1999
Dictionary Selection Using Partial Matching.
Inf. Sci., 1999

The Object Complexity Model for Hidden-Surface Removal.
Int. J. Comput. Geometry Appl., 1999

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

Online Data Structures in External Memory.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

A Simple and Efficient Parallel Disk Mergesort.
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets.
Proceedings of the SIGMOD 1999, 1999

Modeling and Optimizing I/O Throughput of Multiple Disks on a Bus.
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.
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.
Proceedings of the Sixth Workshop on I/O in Parallel and Distributed Systems, 1999

Online Data Structures in External Memory.
Proceedings of the Automata, 1999

A Theoretical Framework for Memory-Adaptive Algorithms.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Efficient Bulk Operations on Dynamic R-trees.
Proceedings of the Algorithm Engineering and Experimentation, 1999

1998
Efficient cost measures for motion estimation at low bit rates.
IEEE Trans. Circuits Syst. Video Techn., 1998

Scalable Sweeping-Based Spatial Join.
Proceedings of the VLDB'98, 1998

Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract).
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).
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Wavelet-Based Histograms for Selectivity Estimation.
Proceedings of the SIGMOD 1998, 1998

Modeling and Optimizing I/O Throughput of Multiple Disks on a Bus (Summary).
Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, 1998

External Memory Algorithms.
Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1998

Efficient Searching with Linear Constraints.
Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1998

Scalable Mining for Classification Rules in Relational Databases.
Proceedings of the 1998 International Database Engineering and Applications Symposium, 1998

External Memory Algorithms.
Proceedings of the Algorithms, 1998

Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice.
Proceedings of the Algorithms, 1998

External memory algorithms and data structures.
Proceedings of the External Memory Algorithms, 1998

Data Cube Approximation and Histograms via Wavelets.
Proceedings of the 1998 ACM CIKM International Conference on Information and Knowledge Management, 1998

1997
Lexicographic Bit Allocation for MPEG Video.
J. Visual Communication and Image Representation, 1997

On Sorting Strings in External Memory (Extended Abstract).
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Sequence sorting in secondary storage.
Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

Competitive Parallel Disk Prefetching and Buffer Management.
Proceedings of the Fifth Workshop on I/O in Parallel and Distributed Systems, 1997

Lexicographic Bit Allocation for MPEG Video Coding.
Proceedings of the Proceedings 1997 International Conference on Image Processing, 1997

Multiplexing VBR Video Sequences onto a CBR Channel with Lexicographic Optimization.
Proceedings of the Proceedings 1997 International Conference on Image Processing, 1997

Selectivity Estimation in the Presence of Alphanumeric Correlations.
Proceedings of the Thirteenth International Conference on Data Engineering, 1997

Simple randomized Mergesort on parallel disks.
Proceedings of the Randomization Methods in Algorithm Design, 1997

Text Compression Via Alphabet Re-Representation.
Proceedings of the 7th Data Compression Conference (DCC '97), 1997

A Lexicographic Framework for MPEG Rate Control.
Proceedings of the 7th Data Compression Conference (DCC '97), 1997

Practical Techniques for Constructing Binary Space Partitions for Orthogonal Rectangles.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Cylindrical Static and Kinetic Binary Space Partitions.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Optimal Prefetching via Data Compression.
J. ACM, 1996

Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments.
Inf. Comput., 1996

Communication Issues in Large-Scale Geometric Computation.
ACM Comput. Surv., 1996

I/O-Efficient Algorithms and Environments.
ACM Comput. Surv., 1996

Strategic Directions in Storage I/O Issues in Large-Scale Computing.
ACM Comput. Surv., 1996

Efficient 3-D Range Searching in External Memory.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Simple Randomized Mergesort on Parallel Disks.
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Estimating Alphanumeric Selectivity in the Presence of Wildcards.
Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, 1996

Optimal Dynamic Interval Management in External Memory (extended abstract).
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Binary Search Partitions for Fat Rectangles.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Efficient Cost Measures for Motion Compensation at Low Bit Rates (Extended Abstract).
Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996

1995
Greed Sort: Optimal Deterministic Sorting on Parallel Disks.
J. ACM, 1995

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

Online Perfect Matching and Mobile Computing.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Supporting I/O-efficient scientific computation in TPIE.
Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

External-Memory Graph Algorithms.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Learning to Make Rent-to-Buy Decisions with Systems Applications.
Proceedings of the Machine Learning, 1995

Application-Controlled Paging for a Shared Cache (Extended Abstract).
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Load Balancing in the Lp Norm.
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).
Proceedings of the Algorithms, 1995

Multiple-Dictionary Coding Using Partial Matching.
Proceedings of the IEEE Data Compression Conference, 1995

1994
Complexity Models for Incremental Computation.
Theor. Comput. Sci., 1994

Algorithms for Parallel Memory II: Hierarchical Multilevel Memories.
Algorithmica, 1994

Algorithms for Parallel Memory I: Two-Level Memories.
Algorithmica, 1994

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

Approximate Data Structures with Applications.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Optimal Prediction for Prefetching in the Worst Case.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Explicit Bit Minimization for Motion-Compensated Video Coding.
Proceedings of the IEEE Data Compression Conference, 1994

1993
Large-Scale Sorting in Uniform Memory Hierarchies.
J. Parallel Distrib. Comput., 1993

A Complexity Theoretic Approach to Incremental Computation.
Proceedings of the STACS 93, 1993

Deterministic Distribution Sort in Shared and Distributed Memory Multiprocessors.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

Dynamic Generation of Discrete Random Variates.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Practical Prefetching via Data Compression.
Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 1993

Blocking for External Graph Searching.
Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1993

Indexing for Data Models with Constraints and Classes.
Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1993

Dynamic algorithms for optimization problems in bounded tree-width graphs.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

External-Memory Computational Geometry (Preliminary Version)
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

Fast and Efficient Lossless Image Compression.
Proceedings of the IEEE Data Compression Conference, 1993

Design and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding.
Proceedings of the IEEE Data Compression Conference, 1993

Using computational learning theory to analyze the testing complexity of program segments.
Proceedings of the Seventeenth Annual International Computer Software and Applications Conference, 1993

1992
Learning in Parallel
Inf. Comput., February, 1992

Approximation Algorithms for Geometric Median Problems.
Inf. Process. Lett., 1992

epsilon-Approximations with Minimum Packing Constraint Violation (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

A Simplified Technique for Hidden-Line Elimination in Terrains.
Proceedings of the STACS 92, 1992

A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs.
Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

Nearly Optimal Vecot Quantization via Linear Programming.
Proceedings of the IEEE Data Compression Conference, 1992

Parallel Lossless Image Compression Using Huffman and Arithmetic Coding.
Proceedings of the IEEE Data Compression Conference, 1992

Error Modeling for Hierarchical Lossless Image Compression.
Proceedings of the IEEE Data Compression Conference, 1992

A Theory for Memory-Based Learning.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991
Parallel Transitive Closure and Point Location in Planar Structures.
SIAM J. Comput., 1991

The Maximum Size of Dynamic Data Structures.
SIAM J. Comput., 1991

Complexity Results on Learning by Neural Nets.
Machine Learning, 1991

Lower Bounds for Planar Orthogonal Drawings of Graphs.
Inf. Process. Lett., 1991

A Data Dtructure for Arc Insertion and Regular Path Finding.
Ann. Math. Artif. Intell., 1991

Maximum Queue Size and Hashing with Lazy Deletion.
Algorithmica, 1991

Efficient Memory Access in Large-Scale Computation.
Proceedings of the STACS 91, 1991

Lower bounds and parallel algorithms for planar orthogonal grid drawings.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Large-Scale Sorting in Parallel Memories (Extended Abstract).
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

Optimal Prefetching via Data Compression (Extended Abstract)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

New Methods for Lossless Image Compression Using Arithmetic Coding.
Proceedings of the IEEE Data Compression Conference, 1991

Analysis of Arithmetic Coding for Data Compression.
Proceedings of the IEEE Data Compression Conference, 1991

1990
Computation of the axial view of a set of isothetic parallelepipeds.
ACM Trans. Graph., 1990

Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds.
Proceedings of the SWAT 90, 1990

Optimal Disk I/O with Parallel Block Transfer (Extended Abstract)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Optimal Cooperative Search in Fractional Cascaded Data Structures.
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

A Data Structure for Arc Insertion and Regular Path Finding.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

I/O Overhead and Parallel VLSI Architectures for Lattice Computations.
Proceedings of the Advances in Computing and Information, 1990

Average-Case Analysis of Algorithms and Data Structures.
Proceedings of the Handbook of Theoretical Computer Science, 1990

1989
Algorithm 673: Dynamic Huffman coding.
ACM Trans. Math. Softw., 1989

Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures.
Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

Coping With Uncertainty in Map Learning.
Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

Complexity Issues in Learning by Neural Nets.
Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

1988
A Parallel Algorithm for Recognizing Unordered Depth-First Search.
Inf. Process. Lett., 1988

The Input/Output Complexity of Sorting and Related Problems.
Commun. ACM, 1988

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

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

Learning in Parallel.
Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

1987
An efficient algorithm for sequential random sampling.
ACM Trans. Math. Softw., 1987

Design and analysis of dynamic Huffman codes.
J. ACM, 1987

Pairing Heaps: Experiments and Analysis.
Commun. ACM, 1987

The I/O Complexity of Sorting and Related Problems (Extended Abstract).
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.
IEEE Trans. Computers, 1986

Deletion Algorithms for Coalesced Hashing.
Comput. J., 1986

The Complexity of Hashing with Lazy Deletion.
Algorithmica, 1986

Shortest Paths in Euclidean Graphs.
Algorithmica, 1986

1985
Random Sampling with a Reservoir.
ACM Trans. Math. Softw., 1985

An Efficient I/O Interface for Optical Disks.
ACM Trans. Database Syst., 1985

Addendum to "Analysis of Some New Variants of Coalesced Hashing".
ACM Trans. Database Syst., 1985

The Design and Analysis of BucketSort for Bubble Memory Secondary Storage.
IEEE Trans. Computers, 1985

Optimum Algorithms for a Model of Direct Chaining.
SIAM J. Comput., 1985

Design and Analysis of Dynamic Huffman Coding (Extended Abstract)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984
Analysis of New Variants of Coalesced Hashing.
ACM Trans. Database Syst., 1984

US&R: A New Framework for Redoing.
IEEE Software, 1984

Faster Methods for Random Sampling.
Commun. ACM, 1984

USeR: A New Framework for Redoing.
Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, 1984

Computational Complexity of an Optical Disk Interface (Extended Abstract).
Proceedings of the Automata, 1984

Shortest Paths in Euclidean Graphs (Extended Abstract)
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

Parallel algorithms for unification and other complete problems in p.
Proceedings of the 1984 ACM Annual Conference on Computer Science: The fifth generation challenge, 1984

1983
Analysis of the Search Performance of Coalesced Hashing
J. ACM, April, 1983

Analysis of Early-Insertion Standard Coalesced Hashing.
SIAM J. Comput., 1983

Optimum Algorithms for Two Random Sampling Problems (Extended Abstract)
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982
Deletion Algorithms for Hashing That Preserve Randomness.
J. Algorithms, 1982

Implementations for Coalesced Hashing.
Commun. ACM, 1982

1981
A Shared-Memory Scheme for Coalesced Hashing.
Inf. Process. Lett., 1981

Deletion Algorithms for Hashing that Preserve Randomness (detailed abstract)
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980
Tuning the Coalesced Hashing Method to Obtain Optimum Performance (Detailed Abstract)
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980


  Loading...