LATIN'98: Theoretical Informatics Third Latin American Symposium, Campinas, Brazil, April 20-24, 1998, Proceedings / edited by Claudio L. Lucchesi, Arnaldo V. Moura.

Sparad:

Bibliografiska uppgifter
Institutionell upphovsman:	SpringerLink (Online service)
Övriga upphovsmän:	Lucchesi, Claudio L. (Utgivare, redaktör, sammanställare), Moura, Arnaldo V. (Utgivare, redaktör, sammanställare)
Materialtyp:	E-bok
Språk:	English
Publicerad:	Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
Upplaga:	1st ed. 1998.
Serie:	Lecture Notes in Computer Science, 1380 Springer eBook Collection.
Ämnen:	Computers. Data encryption (Computer science). Computer science—Mathematics. Numerical analysis. Electronic resources (E-books)
Länkar:	Click to view e-book
Holy Cross Note:	Loaded electronically. Electronic access restricted to members of the Holy Cross Community.

Innehållsförteckning:

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.

LATIN'98: Theoretical Informatics Third Latin American Symposium, Campinas, Brazil, April 20-24, 1998, Proceedings / edited by Claudio L. Lucchesi, Arnaldo V. Moura.

Liknande verk