LATIN '92

1st Latin American Symposium on Theoretical Informatics, Sao Paulo, Brazil, April 6-10, 1992. Proceedings

AvImre Simon

Häftad, Engelska, 1992

Del i serien Lecture Notes in Computer Science

552 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This volume contains the proceedings of LATIN '92, atheoretical computer science symposium (Latin AmericanTheoretical Informatics) held in S o Paulo, Brazil in April1992. LATIN is intended to be a comprehensive symposium inthe theory of computing, but for this first meeting thefollowing areas were chosen for preferential coverage:algorithms and data structures, automata and formallanguages, computability and complexity theory,computational geometry, cryptography, parallel anddistributed computation, symbolic and algebraic computation,and combinatorial and algebraic aspects of computer science. The volume includesfull versions of the invited papers by11 distinguished guest lecturers as well as 32 contributedpapers selected from 66 submissions from authors withaffiliations in 26 countries.

Produktinformation

Utgivningsdatum:1992-03-11
Mått:155 x 235 x 31 mm
Vikt:844 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:547
Upplaga:1992
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540552840

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

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 networkexpressions 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.