LATIN '92 : 1st Latin American Symposium on Theoretical Informatics São Paulo, Brazil, April 6 10, 1992 : proceedings
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 ar...
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
583 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • LATIN '92, 1st Latin American Symposium on Theoretical Informatics, São Paulo, Brazil, April 6-10, 1992, proceedings, I. Simon (ed.), 1992, Berlin, Springer, 1 vol. (IX-544 p.), Lecture notes in computer science, 3-540-55284-7 • LATIN '92, Texte imprimé, 9783662193372 |
Sommario:
- 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