The following pages link to Jeffrey Scott Vitter (Q551182):
Displaying 50 items.
- (Q294941) (redirect page) (← links)
- Fast construction of wavelet trees (Q294942) (← links)
- Cache-oblivious index for approximate string matching (Q551183) (← links)
- Parallel lossless image compression using Huffman and arithmetic coding (Q671379) (← links)
- Maximum queue size and hashing with lazy deletion (Q802861) (← links)
- External-memory algorithms for processing line segments in geographic information systems (Q868436) (← links)
- The complexity of hashing with lazy deletion (Q1087334) (← links)
- Shortest paths in Euclidean graphs (Q1087335) (← links)
- A parallel algorithm for recognizing unordered depth-first search (Q1111396) (← links)
- Lower bounds for planar orthogonal drawings of graphs (Q1182115) (← links)
- Learning in parallel (Q1187024) (← links)
- Output-sensitive generation of the perspective view of isothetic parallelepipeds (Q1194332) (← links)
- Approximation algorithms for geometric median problems (Q1209349) (← links)
- Complexity models for incremental computation (Q1331947) (← links)
- Algorithms for parallel memory, I: Two-level memories (Q1333432) (← links)
- Algorithms for parallel memory. II: Hierarchical multilevel memories (Q1333433) (← links)
- A theory for memory-based learning (Q1342731) (← links)
- A data structure for arc insertion and regular path finding (Q1360677) (← links)
- Simple randomized mergesort on parallel disks (Q1391519) (← links)
- Dynamic generation of discrete random variates (Q1405782) (← links)
- Cylindrical static and kinetic binary space partitions (Q1577492) (← links)
- Efficient searching with linear constraints (Q1591152) (← links)
- Efficient bulk operations on dynamic \(R\)-trees (Q1601035) (← links)
- A simple and efficient parallel disk mergesort (Q1601739) (← links)
- Large-scale sorting in uniform memory hierarchies (Q1803300) (← links)
- An efficient parallel algorithm for shortest paths in planar layered digraphs (Q1899220) (← links)
- Optimal cooperative search in fractional cascaded data structures (Q1907234) (← links)
- Blocking for external graph searching (Q1920428) (← links)
- Using Vapnik-Chervonenkis dimension to analyze the testing complexity of program segments (Q1923104) (← links)
- Indexing for data models with constraints and classes (Q1924391) (← links)
- Faster compressed dictionary matching (Q1939285) (← links)
- Geometric BWT: compressed text indexing via sparse suffixes and range searching (Q2346957) (← links)
- Compressing dictionary matching index via sparsification technique (Q2354027) (← links)
- On position restricted substring searching in succinct space (Q2376796) (← links)
- Compressed text indexing with wildcards (Q2434928) (← links)
- Compressed data structures: Dictionaries and data-aware measures (Q2465063) (← links)
- (Q2768275) (← links)
- Indexes for Document Retrieval with Relevance (Q2848984) (← links)
- Optimal Color Range Reporting in One Dimension (Q2849362) (← links)
- Top-k Document Retrieval in External Memory (Q2849367) (← links)
- Algorithms and Data Structures for External Memory (Q2903190) (← links)
- Document Listing for Queries with Excluded Pattern (Q2904491) (← links)
- When indexing equals compression (Q2944533) (← links)
- Space-Efficient String Indexing for Wildcard Pattern Matching. (Q2965512) (← links)
- (Q3024793) (← links)
- Analysis of Early-Insertion Standard Coalesced Hashing (Q3036717) (← links)
- A SIMPLIFIED TECHNIQUE FOR HIDDEN-LINE ELIMINATION IN TERRAINS (Q3136723) (← links)
- (Q3138873) (← links)
- (Q3140440) (← links)
- Space-Efficient Frameworks for Top- <i>k</i> String Retrieval (Q3189644) (← links)
