Jeffrey D. Ullman
Jump to navigation
Jump to search
Jeffrey D. Ullman is a person.
- See: Databases, Stanford University, Columbia University, Princeton University, Arthur Bernstein, Archie McKellar (Scientist), Surajit Chaudhuri, Kevin Karplus, David Maier, Harry Mairson, Alberto O. Mendelzon, Jeffrey F. Naughton.
References
2016
- (Wikipedia, 2016) ⇒ https://en.wikipedia.org/wiki/Jeffrey_Ullman Retrieved:2016-10-27.
- Jeffrey David "Jeff" Ullman (born November 22, 1942) is a computer scientist and professor at Stanford University. His textbooks on compilers (various editions are popularly known as the Dragon Book), theory of computation (also known as the Cinderella book), data structures, and databases are regarded as standards in their fields.
2001
- (Hopcroft et al., 2001) ⇒ John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. (2001). “Introduction to Automata Theory, Languages, and Computation, (2nd edition)." Addison Wesley. ISBN:0201441241
1997
- (Brin et al., 1997a) ⇒ Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, and Shalom Tsur. (1997). “Dynamic Itemset Counting and Implication Rules for Market Basket Data.” In: Proceedings of the 1997 ACM SIGMOD International Conference on Management of data (SIGMOD 1997). doi:10.1145/253260.253325
- (Brin et al., 1997b) ⇒ Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, and Shalom Tsur. (1997). “Dynamic Itemset Counting and Implication Rules for Market Basket Data.” In: ACM SIGMOD Record, vol. 26, no. 2.
1986
- (Aho et al., 1986) ⇒ Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. (1986). “Compilers, Principles, Techniques.” Addison wesley,
1983
- (Aho et al., 1983) ⇒ Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. (1983). “Data Structures and Algorithms (1st ed.)." Addison-Wesley Longman. ISBN:0201000237
1972
- (Aho & Ullman, 1972) ⇒ Alfred V. Aho, and Jeffrey D. Ullman. (1972). “The Theory of Parsing, Translation, and Compiling.” Prentice-Hall, Inc.,
1969
- (Hopcroft & Ullman, 1969) ⇒ John E. Hopcroft, and Jeffrey D. Ullman. (1969). “Formal Languages and their Relation to Automata.” xxx.