The following pages link to Gaston H. Gonnet (Q876701):
Displaying 50 items.
- Some string matching problems from bioinformatics which still need better solutions (Q876702) (← links)
- An analysis of the Karp-Rabin string matching algorithm (Q911281) (← links)
- On the costs of self-stabilization (Q1098276) (← links)
- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation (Q1124635) (← links)
- Open-addressing hashing with unequal-probability keys (Q1149252) (← links)
- Improved bounds for the expected behaviour of AVL trees (Q1196459) (← links)
- A proof of the two parameter \(q\)-cases of the Macdonald-Morris constant term root system conjecture for \(S(F_ 4)\) and \(S(F_ 4)^ \vee\) via Zeilberger's method (Q1199815) (← links)
- The interpolation-sequential search algorithm (Q1241286) (← links)
- Notes on the derivation of asymptotic expressions from summations (Q1249828) (← links)
- Erratum to ``Notes on the derivation of asymptotic expressions from summations'' (Q1253519) (← links)
- An algorithmic and complexity analysis of interpolation search (Q1257344) (← links)
- (Q1310464) (redirect page) (← links)
- Analytic variations on quadtrees (Q1310465) (← links)
- Fast string matching with mismatches (Q1322483) (← links)
- On Boyer-Moore automata (Q1336957) (← links)
- (Q1815861) (redirect page) (← links)
- On the Lambert \(w\) function (Q1815863) (← links)
- Fringe analysis for extquick: An in situ distributive external sorting algorithm (Q2639632) (← links)
- (Q3042414) (← links)
- (Q3048278) (← links)
- (Q3138910) (← links)
- (Q3138944) (← links)
- (Q3156405) (← links)
- The maple symbolic computation system (Q3332240) (← links)
- Scientific Computation (Q3639650) (← links)
- Height-Ratio-Balanced Trees (Q3657442) (← links)
- The Analysis of an Improved Symmetric Binary B-tree Algorithm (Q3685213) (← links)
- (Q3707405) (← links)
- Direct dynamic structures for some line segment problems (Q3709910) (← links)
- Balancing binary trees by internal path reduction (Q3714475) (← links)
- The analysis of linear probing sort by the use of a new mathematical transform (Q3745295) (← links)
- Heaps on Heaps (Q3756520) (← links)
- (Q3816955) (← links)
- Analysis of Closed Queuing Networks with Periodic Servers (Q3865419) (← links)
- Expected Length of the Longest Probe Sequence in Hash Code Searching (Q3906430) (← links)
- Exegesis of Self-Organizing Linear Search (Q3911408) (← links)
- (Q3945583) (← links)
- Macdonald’s constant term conjectures for exceptional root systems (Q3971808) (← links)
- (Q4002421) (← links)
- (Q4002478) (← links)
- (Q4004141) (← links)
- (Q4016521) (← links)
- (Q4028869) (← links)
- A short note on convergence near a high order zero (Q4104809) (← links)
- On the structure of zero finders (Q4140290) (← links)
- Efficient Ordering of Hash Tables (Q4199544) (← links)
- (Q4234326) (← links)
- (Q4237427) (← links)
- Fast text searching for regular expressions or automaton searching on tries (Q4371691) (← links)
- (Q4407975) (← links)
