LATIN '92: 1st Latin American Symposium on Theoretical Informatics, Sao Paulo, Brazil, April 6-10, 1992. Proceedings
Springer Science & Business Media, Mar 11, 1992 - Computers - 544 pages
This volume contains the proceedings of LATIN '92, a theoretical computer science symposium (Latin American Theoretical Informatics) held in S o Paulo, Brazil in April 1992. LATIN is intended to be a comprehensive symposium in the theory of computing, but for this first meeting the following areas were chosen for preferential coverage: algorithms and data structures, automata and formal languages, computability and complexity theory, computational geometry, cryptography, parallel and distributed computation, symbolic and algebraic computation, and combinatorial and algebraic aspects of computer science. The volume includesfull versions of the invited papers by 11 distinguished guest lecturers as well as 32 contributed papers selected from 66 submissions from authors with affiliations in 26 countries.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
accepting algebraic algorithm automata AuxPDAs bipartite Boolean circuit coefficients colors columns complexity components Computer Science configuration consider construction Corollary defined definition degree denote deterministic directed graph divisors edges element example exists factor finite fields finite number firable free group gates given graph G hypercube hypergraph idempotent implies infinite input integer irreducible isomorphic iteration Kaltofen language Lemma linear lower bound M-subset machine Markov chain MasPar matching Math matrix maximal cliques minimal monoid multiplication node normal form obtained operations optimal output parallel parameterization path pdag permutation Petri Petri net planar graph polynomial polyomino posets problem Proc processors Proof Proposition prove r-dag random rational functions recognizable recursive graph regular expression result reversible automaton semi-algebraic set semigroup sequence simulation space string subgraph subset Theorem Theory transition triangulation unambiguous vertex vertices word zero zero divisors