LATIN'98: Theoretical Informatics Third Latin American Symposium, Campinas, Brazil, April 20-24, 1998, Proceedings /

This book constitutes the refereed proceedings of the Third Latin American Symposium on Theoretical Informatics, LATIN'98, held in Campinas, Brazil, in April 1998. The 28 revised full papers presented together with five invited surveys were carefully selected from a total of 53 submissions base...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Lucchesi, Claudio L. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Moura, Arnaldo V. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
Έκδοση:1st ed. 1998.
Σειρά:Lecture Notes in Computer Science, 1380
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04937nam a2200589 4500
001 978-3-540-69715-2
003 DE-He213
005 20191030034601.0
007 cr nn 008mamaa
008 121227s1998 gw | s |||| 0|eng d
020 |a 9783540697152  |9 978-3-540-69715-2 
024 7 |a 10.1007/BFb0054304  |2 doi 
040 |d GrThAP 
050 4 |a QA75.5-76.95 
050 4 |a QA76.63 
072 7 |a UY  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UY  |2 thema 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a LATIN'98: Theoretical Informatics  |h [electronic resource] :  |b Third Latin American Symposium, Campinas, Brazil, April 20-24, 1998, Proceedings /  |c edited by Claudio L. Lucchesi, Arnaldo V. Moura. 
250 |a 1st ed. 1998. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 1998. 
300 |a XII, 400 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 1380 
505 0 |a Analysis of Rabin's polynomial irreducibility test -- A chip search problem on binary numbers -- Uniform service systems with k servers -- Faster non-linear parametric search with applications to optimization and dynamic geometry -- Super-state automata and rational trees -- An Eilenberg theorem for words on countable ordinals -- Maximal groups in free Burnside semigroups -- Positive varieties and infinite words -- Unfolding parametric automata -- Fundamental structures in Well-Structured infinite Transition Systems -- Shape reconstruction with Delaunay complex -- Bases for non-homogeneous polynomial C k splines on the sphere -- The splitting number of the 4-cube -- Short and smooth polygonal paths -- Quantum cryptanalysis of hash and claw-free functions -- Batch verification with applications to cryptography and checking -- Strength of two Data Encryption Standard implementations under timing attacks -- Spectral techniques in graph algorithms -- Colouring graphs whose chromatic number is almost their maximum degree -- Circuit covers in series-parallel mixed graphs -- A linear time algorithm to recognize clustered planar graphs and its parallelization -- A new characterization for parity graphs and a coloring problem with costs -- On the clique operator -- Dynamic packet routing on arrays with bounded buffers -- On-Line matching routing on trees -- Analyzing Glauber dynamics by comparison of Markov chains -- The CREW PRAM complexity of modular inversion -- Communication-efficient parallel multiway and approximate minimum cut computation -- The geometry of browsing -- Fast two-dimensional approximate pattern matching -- Improved approximate pattern matching on hypertext -- Solving equations in strings: On Makanin's algorithm -- Spelling approximate repeated or common motifs using a suffix tree. 
520 |a This book constitutes the refereed proceedings of the Third Latin American Symposium on Theoretical Informatics, LATIN'98, held in Campinas, Brazil, in April 1998. The 28 revised full papers presented together with five invited surveys were carefully selected from a total of 53 submissions based on 160 referees' reports. The papers are organized in sections on algorithms and complexity; automata, transition systems and combinatorics on words; computational geometry and graph drawing; cryptography; graph theory and algorithms on graphs; packet routing; parallel algorithms; and pattern matching and browsing. 
650 0 |a Computers. 
650 0 |a Data encryption (Computer science). 
650 0 |a Computer science-Mathematics. 
650 0 |a Numerical analysis. 
650 1 4 |a Theory of Computation.  |0 http://scigraph.springernature.com/things/product-market-codes/I16005 
650 2 4 |a Cryptology.  |0 http://scigraph.springernature.com/things/product-market-codes/I28020 
650 2 4 |a Discrete Mathematics in Computer Science.  |0 http://scigraph.springernature.com/things/product-market-codes/I17028 
650 2 4 |a Symbolic and Algebraic Manipulation.  |0 http://scigraph.springernature.com/things/product-market-codes/I17052 
650 2 4 |a Numeric Computing.  |0 http://scigraph.springernature.com/things/product-market-codes/I1701X 
700 1 |a Lucchesi, Claudio L.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Moura, Arnaldo V.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783662177884 
776 0 8 |i Printed edition:  |z 9783540642756 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 1380 
856 4 0 |u https://doi.org/10.1007/BFb0054304  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)