Automata, Languages and Complexity: 1. Regular languages (a) nite state...  Home/Search
Context
Related
| ucr.edu/~jiang/cse...lannounce01.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucr.edu/~jiang/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: rees and their applications (a) AVL trees (b) red-black trees (c) B-trees (d) splay trees 5. Priority queues, heaps and applications 6. String algorithms (a) Knuth-Morris-Pratt string searching (b) Boyer-Moore string searching (c) Hu man codes 2 7. Union-Find 8. Graph algorithms (a) depth- rst-search, breadth- rst-search, connectivity (b) minimum spanning trees (c) shortest path algorithms (single source, all-pairs) (d) maximum ow (e) bipartite graph matching 9. Number-theoretic problems and... (Update)
Active bibliography (related documents): More All
0.0: Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (2000) (Correct)
0.0: Stable Encoding of Finite-State Machines in.. - Carrasco.. (1998) (Correct)
0.0: Hereditary History Preserving Bisimilarity Is Undecidable - Jurdzinski, Nielsen, Srba (Correct)
Similar documents based on text: More All
0.1: Developing Aquifer Properties from a Multi-Stage Pump.. - Regmi, Deschaine.. (2001) (Correct)
0.1: Grammars with Generalized Contextfree Rules and Their Tree Automata - Volger (1999) (Correct)
0.1: A New Approach to Formal Language Theory by Kolmogorov.. - Li, Vitányi (1995) (Correct)
BibTeX entry: (Update)
@misc{ and-depth,
author = "Automata Languages And",
title = "DEPTH (QUALIFIER) EXAMINATION IN THEORY OF COMPUTATION AND ALGORITHMS Fall,
2001",
url = "citeseer.ist.psu.edu/463642.html" }
Citations (may not include all citations):4212 Computers and Intractability - A Guide to the Theory of NP-C.. (context) - Garey, Johnson - 1979
1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
452 Data Structures and Algorithms (context) - Aho, Hopcroft et al. - 1983
259 Elements of the Theory of Computation (context) - Lewis, Papadimitriou - 1981
108 Introduction to the Theory of Computation (context) - Sipser - 1996
84 The Design and Analysis of Algorithms (context) - Kozen - 1991
51 Computer Algorithms: Introduction to Design and Analysis (context) - Baase, Van Gelder - 2000
16 Fundamentals of Algorithms (context) - Brassard, Bratley - 1996
13 Computation: Finite and Innite Machines (context) - Minsky - 1967
1 nd edition also available (context) - Cormen, Leiserson et al. - 1990
1 Computational Complexity (context) - Papadmimitriou - 1994
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC