The following pages link to Michael L. Fredman (Q578910):
Displaying 49 items.
- Refined complexity analysis for heap operations (Q578912) (← links)
- Products of finite state machines with full coverage (Q672858) (← links)
- Query time versus redundancy trade-offs for range queries (Q800105) (← links)
- Algorithms for computing evolutionary similarity measures with length independent gap penalties (Q800252) (← links)
- The number of tests required to search an unordered table (Q1014399) (← links)
- Inherent complexity trade-offs for range query problems (Q1056239) (← links)
- (Q1218861) (redirect page) (← links)
- A symmetric relationship for a class of partitions (Q1218862) (← links)
- Recurrence relations based on minimization (Q1219673) (← links)
- On computing the length of longest increasing subsequences (Q1219686) (← links)
- How good is the information theory bound in sorting? (Q1226391) (← links)
- Lower bounds for fully dynamic connectivity problems in graphs (Q1273940) (← links)
- Surpassing the information theoretic bound with fusion trees (Q1317486) (← links)
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths (Q1329156) (← links)
- Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees (Q2428686) (← links)
- An intuitive and simple bounding argument for Quicksort (Q2445402) (← links)
- Adaptive sorting: an information theoretic perspective (Q2480779) (← links)
- Arithmetical convolution products and generalizations (Q2544991) (← links)
- Congruence formulas obtained by counting irreducibles (Q2547586) (← links)
- On the Size of Separating Systems and Families of Perfect Hash Functions (Q3038628) (← links)
- On the efficiency of pairing heaps and related data structures (Q3158546) (← links)
- Hash functions for priority queues (Q3719870) (← links)
- Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time (Q3766870) (← links)
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms (Q3837390) (← links)
- Lower Bounds on the Complexity of Some Optimal Data Structures (Q3902460) (← links)
- Observations concerning the complexity of a class of on-line algebraic problems (Q3902473) (← links)
- The spanning bound as a measure of range query complexity (Q3906396) (← links)
- A Lower Bound on the Complexity of Orthogonal Range Queries (Q3922168) (← links)
- The Complexity of Maintaining an Array and Computing Its Partial Sums (Q3933742) (← links)
- The complexity of partial match retrieval in a dynamic setting (Q3933804) (← links)
- A Note on Finding a Strict Saddlepoint (Q3983928) (← links)
- Some Arithmetical Packing Problems (Q4088899) (← links)
- New Bounds on the Complexity of the Shortest Path Problem (Q4091447) (← links)
- On the complexity of computing the measure of ∪[a <sub>i</sub> ,b <sub>i</sub> ] (Q4157950) (← links)
- (Q4172927) (← links)
- Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums (Q4210132) (← links)
- New techniques for designing qualitatively independent systems (Q4222168) (← links)
- Three Stacks (Q4304060) (← links)
- (Q4418689) (← links)
- (Q4542550) (← links)
- Products of finite state machines with full coverage (Q4630284) (← links)
- (Q4643832) (← links)
- (Q4728783) (← links)
- Weighted Binary Trees for Concurrent Searching (Q4864435) (← links)
- Lower bounds for dynamic algorithms (Q5056175) (← links)
- (Q5133633) (← links)
- On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations (Q5199262) (← links)
- Fibonacci heaps and their uses in improved network optimization algorithms (Q5225293) (← links)
- The Distribution of Absolutely Irreducible Polynomials in Several Indeterminates (Q5678941) (← links)
