Sethi–Ullman algorithm
Algorithm for minimising register usage
Press Enter · cited answer in seconds
0 sources
Summary
Sethi–Ullman algorithm is an algorithm[1]. It draws 27 Wikipedia views per month (algorithm category, ranking #127 of 337).[2]
Key Facts
- Sethi–Ullman algorithm's instance of is recorded as algorithm[3].
- Ravi Sethi is named after Sethi–Ullman algorithm[4].
- Jeffrey David Ullman is named after Sethi–Ullman algorithm[5].
- Sethi–Ullman algorithm's Freebase ID is recorded as /m/03y13s[6].
- Sethi–Ullman algorithm's Microsoft Academic ID is recorded as 2778082503[7].
Body
Designation and Status
Sethi–Ullman algorithm's instance of is recorded as algorithm[3].
History and Context
Things named after include Ravi Sethi[4], a computer scientist[8], b. 1947[9], of India[10], awarded the ACM Fellow[11], specialised in informatics[12] and Jeffrey David Ullman[5], a computer scientist[13], b. 1942[14], of United States[15], awarded the Guggenheim Fellowship[16], specialised in informatics[17].
Why It Matters
Sethi–Ullman algorithm draws 27 Wikipedia views per month (algorithm category, ranking #127 of 337).[2] It has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.[18]