| Latin '95: Theoretical Informatics: Second Latin American Symposium, Valparaiso, Chile, April 3 - 7, 1995. Proceedings 1995 Edition Contributor(s): Baeza-Yates, Ricardo (Editor), Goles, Eric (Editor), Poblete, Patricio V. (Editor) |
|
 |
ISBN: 3540591753 ISBN-13: 9783540591757 Publisher: Springer OUR PRICE: $52.24 Product Type: Paperback Published: March 1995 Annotation: This volume constitutes the proceedings of the Second International Symposium, Latin American Theoretical Informatics, LATIN '95, held in Valparaiso, Chile in April 1995. The LATIN symposia are intended to be comprehensive events on the theory of computing; they provide a high-level forum for theoretical computer science research in Latin America and facilitate a strong and healthy interaction with the international community. The 38 papers presented in this volume were carefully selected from 68 submissions. Despite the intended broad coverage there are quite a number of papers devoted to computational graph theory; other topics strongly represented are complexity, automata theory, networks, symbolic computation, formal languages, data structures, and pattern matching. |
| Additional Information |
| BISAC Categories: - Computers | Computer Science - Computers | Logic Design - Mathematics | Discrete Mathematics |
| Dewey: 004 |
| LCCN: 95010547 |
| Series: Lecture Notes in Computer Science |
| Physical Information: 1.11" H x 6.14" W x 9.21" (1.67 lbs) 530 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: This volume constitutes the proceedings of the Second International Symposium, Latin American Theoretical Informatics, LATIN '95, held in Valparaiso, Chile in April 1995. The LATIN symposia are intended to be comprehensive events on the theory of computing; they provide a high-level forum for theoretical computer science research in Latin America and facilitate a strong and healthy interaction with the international community. The 38 papers presented in this volume were carefully selected from 68 submissions. Despite the intended broad coverage there are quite a number of papers devoted to computational graph theory; other topics strongly represented are complexity, automata theory, networks, symbolic computation, formal languages, data structures, and pattern matching. |