Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Abstract syntax treeAlgorithmCode generation (compiler)Compiler

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
VISUAL SALIENCY DOES NOT ACCOUNT FOR EYE MOVEMENTS DURING VISUAL SEARCH IN REAL-WORLD SCENES
Highly Cited
2006
Highly Cited
2006
Fast and memory-efficient regular expression matching for deep packet inspection
Packet content scanning at high speed has become extremely important due to its applications in network security, network… 
Highly Cited
2006
Highly Cited
2006
Approximately detecting duplicates for streaming data using stable bloom filters
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely… 
Highly Cited
2003
Highly Cited
2003
Spectral bloom filters
A Bloom Filter is a space-efficient randomized data structure allowing membership queries over sets with certain allowable errors… 
Review
1995
Review
1995
A Survey of Research in Deductive Database Systems
The area of deductive databases has matured in recent years, and it now seems appropriate to reflect upon what has been achieved… 
Highly Cited
1991
Highly Cited
1991
Constant propagation with conditional branches
Constant propagation is a well-known global flow analysis problem. The goal of constant propagation is to discover values that… 
Highly Cited
1989
Highly Cited
1989
On a theory of computation and complexity over the real numbers; np-completeness
. We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain… 
Highly Cited
1980
Highly Cited
1980
J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979
Highly Cited
1980
Highly Cited
1980
Horn clauses and database dependencies (Extended Abstract)
In the last year or so, a number of generalizations of these dependencies have appeared: Nicolas's mutual dependencies [Ni… 
Highly Cited
1979
Highly Cited
1979
Increasing Tree Search Efficiency for Constraint Satisfaction Problems
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)