LATIN '92 [electronic resource] : 1st Latin American Symposium on Theoretical Informatics São Paulo, Brazil, April 6–10, 1992 Proceedings / edited by Imre Simon.

By: Simon, Imre [editor.]Contributor(s): SpringerLink (Online service)Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science: 583Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1992Description: XIII, 547 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540470120Subject(s): Computer science | Computer software | Algebra -- Data processing | Combinatorics | Computer Science | Computation by Abstract Devices | Algorithm Analysis and Problem Complexity | Mathematical Logic and Formal Languages | Combinatorics | Symbolic and Algebraic ManipulationAdditional physical formats: Printed edition:: No titleDDC classification: 004.0151 LOC classification: QA75.5-76.95Online resources: Click here to access online
Contents:
Linear time algorithms for liveness and boundedness in conflict-free Petri nets -- q-Regular sequences and other generalizations of q-automatic sequences -- Complex polynomials and circuit lower bounds for modular counting -- A decidability result about convex polyominoes -- Edge insertion for optimal triangulations -- Simulating permutation networks on hypercubes -- Universal statistical tests -- Automata and pattern matching in planar directed acyclic graphs -- Regular expressions into finite automata -- Automata and codes with bounded deciphering delay -- Parallel complexity of heaps and min-max heaps -- On the complexity of some problems for the Blum, Shub & Smale model -- Average case analysis of a greedy algorithm for the minimum hitting set problem -- Achieving optimality for gate matrix layout and PLA folding: A graph theoretic approach -- How to write integers in non-integer base -- A simple randomized parallel algorithm for maximal f-matchings -- On the number of components of a recursive graph -- Factoring in skew-polynomial rings -- Leaders election without conflict resolution rule -- Dynamics of sand-piles games on graphs -- Rational function decomposition and Gröbner bases in the parameterization of plane curves -- The double reconstruction conjectures about colored hypergraphs and colored directed graphs -- Locally definable acceptance types — The three-valued case -- On the computation of the Hilbert series -- A distributed algorithm for finding all maximal cliques in a network graph -- Polynomial factorization 1987–1991 -- Properties of recognizable $$\mathcal{M}$$ -subsets of a free monoid -- On the Burnside semigroups x n = x n+m -- Massively parallel computing and factoring -- Some regularity conditions based on well quasi-orders -- Approximate matching of network expressions with spacers -- Unambiguous simulations of auxiliary pushdown automata and circuits -- On reversible automata -- Even induced cycles in planar graphs -- Arithmetic + logic + geometry = concurrency -- On the density and core of the complexity classes -- The “last” decision problem for rational trace languages -- Improved bounds for mixing rates of Markov chains and multicommodity flow -- Data structures and terminating Petri nets -- Circuits constructed with MOD q gates cannot compute AND in sublinear size -- Decomposing a k-valued transducer into k unambiguous ones -- An efficient algorithm for edge-coloring series parallel multigraphs -- Complexity issues in neural network computations.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

Linear time algorithms for liveness and boundedness in conflict-free Petri nets -- q-Regular sequences and other generalizations of q-automatic sequences -- Complex polynomials and circuit lower bounds for modular counting -- A decidability result about convex polyominoes -- Edge insertion for optimal triangulations -- Simulating permutation networks on hypercubes -- Universal statistical tests -- Automata and pattern matching in planar directed acyclic graphs -- Regular expressions into finite automata -- Automata and codes with bounded deciphering delay -- Parallel complexity of heaps and min-max heaps -- On the complexity of some problems for the Blum, Shub & Smale model -- Average case analysis of a greedy algorithm for the minimum hitting set problem -- Achieving optimality for gate matrix layout and PLA folding: A graph theoretic approach -- How to write integers in non-integer base -- A simple randomized parallel algorithm for maximal f-matchings -- On the number of components of a recursive graph -- Factoring in skew-polynomial rings -- Leaders election without conflict resolution rule -- Dynamics of sand-piles games on graphs -- Rational function decomposition and Gröbner bases in the parameterization of plane curves -- The double reconstruction conjectures about colored hypergraphs and colored directed graphs -- Locally definable acceptance types — The three-valued case -- On the computation of the Hilbert series -- A distributed algorithm for finding all maximal cliques in a network graph -- Polynomial factorization 1987–1991 -- Properties of recognizable $$\mathcal{M}$$ -subsets of a free monoid -- On the Burnside semigroups x n = x n+m -- Massively parallel computing and factoring -- Some regularity conditions based on well quasi-orders -- Approximate matching of network expressions with spacers -- Unambiguous simulations of auxiliary pushdown automata and circuits -- On reversible automata -- Even induced cycles in planar graphs -- Arithmetic + logic + geometry = concurrency -- On the density and core of the complexity classes -- The “last” decision problem for rational trace languages -- Improved bounds for mixing rates of Markov chains and multicommodity flow -- Data structures and terminating Petri nets -- Circuits constructed with MOD q gates cannot compute AND in sublinear size -- Decomposing a k-valued transducer into k unambiguous ones -- An efficient algorithm for edge-coloring series parallel multigraphs -- Complexity issues in neural network computations.

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.

There are no comments on this title.

to post a comment.

Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha