Sleator D.D. / Prentice-Hall / The times / SIAM Journal / SIAM J. Comp / Intel / Lucent Technologies / /
Country
Netherlands / / /
Facility
Princeton University / /
IndustryTerm
partial-match searching algorithm / Partial match search performance / output search array srcharr / search function / mean search cost / present theoretical algorithms / search trie / ternary search tree representing / near neighbor search / binary search trees / search character / neighbor search / Partial match search statement / unsuccessful search / multikey algorithms / ternary search tree implementation / ternary search tree / classical algorithms / hash search / median algorithm / ternary search tree structure / search methods / search algorithms / search string / ternary search trees / search performance / search costs / ternary partitioning algorithm / search trees / search keys / expected-time algorithm / search runs / binary search / recursive search / tree search functions / search tries / ternary algorithm / search cost / digital search tries / search tree / weight-balanced ternary search tree / textbook divide-and-conquer algorithm / partial-match search / binary search tree / sort algorithms / search time / worst-case algorithm / /
Organization
Princeton University / /
Person
Raman / Chris Van Wyk / Jon L. Bentley / Ian Munro / Robert Sedgewick / Raffaele Giancarlo / Raman / V / Min Min Mean Max / Doug McIlroy / Murray Hill / / /
ProgrammingLanguage
C / /
ProvinceOrState
Massachusetts / /
PublishedMedium
Journal of the ACM / SIAM Journal on Computing / Communications of the ACM / /