Sethi–Ullman algorithm

Known as: Sethi-Ullman algorithm, Sethi-Ullman numbering, Ullman 
In computer science, the Sethi–Ullman algorithm is an algorithm named after Ravi Sethi and Jeffrey D. Ullman, its inventors, for translating abstract… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Packet content scanning at high speed has become extremely important due to its applications in network security, network… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
  • BERNHARD NEBELGerman
  • 1992
 
Is this relevant?
Highly Cited
1989
Highly Cited
1989
problems To understand the class of polynomial-time solvable proble ms, we must first have a formal notion of what a “problem” is… (More)
Is this relevant?
1987
1987
The Sethi-Ullman algorithm for register allocation finds an optimal ordering of a computation tree. Two simple generalizations of… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Constant propagation is a well-known global flow analysis problem. The goal of constant propagation is to discover values that… (More)
  • figure 1
  • figure 5
  • figure 8
  • figure 12
Is this relevant?
Highly Cited
1980
Highly Cited
1980
A theory of edge detection is presented. The analysis proceeds in two parts. (1) Intensity changes, which occur in a natural… (More)
  • figure 11
Is this relevant?
Highly Cited
1979
Highly Cited
1979
In this paper we explore the number of tree search operations required to solve binary constraint satisfaction problems. We show… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1977
Highly Cited
1977
Many processes, including evolution, derivation of a sentence in a grammar, hierarchical clustering and game playing, may be… (More)
Is this relevant?
Highly Cited
1976
Highly Cited
1976
A new algorithm is presented for constructing auxiliary digital search trees to aid in exact-match substring searching. This… (More)
  • figure 2
  • figure 5
Is this relevant?