The following pages link to Jeanette P. Schmidt (Q1092064):
Displayed 13 items.
- Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number (Q1092065) (← links)
- An implicit data structure for searching a multikey table in logarithmic time (Q1186547) (← links)
- Identifying periodic occurrences of a template with applications to protein structure (Q1209310) (← links)
- Item:Q1092064 (redirect page) (← links)
- A threshold for perfect matchings in random d-pure hypergraphs (Q1839262) (← links)
- (Q3140437) (← links)
- The Spatial Complexity of Oblivious <i>k</i>-Probe Hash Functions (Q3495640) (← links)
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings (Q4210080) (← links)
- Nonoblivious hashing (Q4302788) (← links)
- Incremental String Comparison (Q4388886) (← links)
- On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log <i>n</i>-Block Sequences (Q4507338) (← links)
- Chernoff–Hoeffding Bounds for Applications with Limited Independence (Q4837650) (← links)
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)