LATIN '92 (Record no. 35250)

000 -LEADER
fixed length control field 05225nam a22005295i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540470120
-- 978-3-540-47012-0
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.0151
245 10 - TITLE STATEMENT
Title LATIN '92
Sub Title 1st Latin American Symposium on Theoretical Informatics São Paulo, Brazil, April 6–10, 1992 Proceedings /
Statement of responsibility, etc edited by Imre Simon.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 1992.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XIII, 547 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer software.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algebra
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Combinatorics.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computation by Abstract Devices.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Mathematical Logic and Formal Languages.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Combinatorics.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Symbolic and Algebraic Manipulation.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Simon, Imre.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/BFb0023811
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 1992.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK5956 http://dx.doi.org/10.1007/BFb0023811 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha