#### Filter Results:

- Full text PDF available (152)

#### Publication Year

1965

2017

- This year (4)
- Last 5 years (53)
- Last 10 years (70)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

Where you can find the introduction to automata theory languages and computation easily? Is it in the book store? On-line book store? are you sure? Keep in mind that you will find the book in this site. This book is very referred for you because it gives not only the experience but also lesson. The lessons are very valuable to serve for you, that's not… (More)

- Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman
- Addison-Wesley series in computer science / World…
- 1986

Addison-Wesley Pub. Co., 1974, , 470 pages. With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into… (More)

- Jeffrey D. Ullman
- Principles of computer science series
- 1988

- Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman
- SIGMOD Conference
- 1996

Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like total sales. The values of many of these cells are dependent on… (More)

- Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, Shalom Tsur
- SIGMOD Conference
- 1997

We consider the problem of analyzing market-basket data and present several important contributions. First, we present a new algorithm for finding large itemsets which uses fewer passes over the data than classic algorithms, and yet uses fewer candidate itemsets than methods based on sampling. We investigate the idea of item reordering, which can improve… (More)

- Michael A. Harrison, Walter L. Ruzzo, Jeffrey D. Ullman
- Commun. ACM
- 1976

A model of protection mechanisms in computing systems is presented and its appropriateness is argued. The “safety” problem for protection systems under this model is to determine in a given situation whether a subject can acquire a particular right to an object. In restricted cases, it can be shown that this problem is decidable, i.e. there is… (More)

The classic text, but it lacks topics in network flows and linear programming, as well as more recent algorithms. Revised and more elementary version of the first six chapters of The Design and Analysis of Computer Algorithms. Good examples and problems. Focus on methods rather than specific problems. Reference book devoted to NP-completeness. The second… (More)