Latin 2014: Theoretical Informatics: 11th Latin American Symposium, Montevideo, Uruguay, March 31 -- April 4, 2014. Proceedings - Lecture Notes in Computer Science / Theoretical Computer Science and General Issues - Alberto Pardo - Grāmatas - Springer-Verlag Berlin and Heidelberg Gm - 9783642544224 - 2014. gada 3. marts
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

Alberto Pardo
Latin 2014: Theoretical Informatics: 11th Latin American Symposium, Montevideo, Uruguay, March 31 -- April 4, 2014. Proceedings - Lecture Notes in Computer Science / Theoretical Computer Science and General Issues

Cena
€ 53,99

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 24. sept. - . gada 2. okt.
Saņemiet paziņojumus par jauniem Alberto Pardo izdevumiem

Mūsu klienti saka:

14 dienu atgriešanas politika saskaņā ar Eiropas patērētāju tiesību aizsardzības likumu
Top vieta Trustpilot
Pievienot savam iMusic vēlmju sarakstam

Not rated yet

Jacket Description/Back: This book constitutes the refereed proceedings of the 11th Latin American Symposium on Theoretical Informatics, LATIN 2014, held in Montevideo, Uruguay, in March/April 2014. The 65 papers presented together with 5 abstracts were carefully reviewed and selected from 192 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on complexity, computational geometry, graph drawing, automata, computability, algorithms on graphs, algorithms, random structures, complexity on graphs, analytic combinatorics, analytic and enumerative combinatorics, approximation algorithms, analysis of algorithms, computational algebra, applications to bioinformatics, budget problems, and algorithms and data structures. Marc Notes: This text constitutes the refereed proceedings of the 11th Latin American Symposium on Theoretical Informatics, LATIN 2014, held in Montevideo, Uruguay, in March/April 2014. The 65 papers presented together with 5 abstracts were carefully reviewed and selected from 192 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on complexity, computational geometry, graph drawing, automata, computability, algorithms on graphs, algorithms, random structures, complexity on graphs, analytic combinatorics, analytic and enumerative combinatorics, approximation algorithms, analysis of algorithms, computational algebra, applications to bioinformatics, budget problems and algorithms and data structures. Table of Contents: Complexity.- Computational geometry.- Graph drawing.- Automata.- Computability.- Algorithms on graphs.- Algorithms.- Random structures.- Complexity on graphs.- Analytic combinatorics.- Analytic and enumerative combinatorics.- Approximation algorithms.- Analysis of algorithms.- Computational algebra.- Applications to bioinformatics.- Budget problems.-Algorithms and data structures."

Contributor Bio:  Viola, Alfredo Viola, Universdad de la Republica, Montevideo, Uruguay.

767 pages, 137 black & white illustrations, biography

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 2014. gada 3. marts
ISBN13 9783642544224
Izdevēji Springer-Verlag Berlin and Heidelberg Gm
Lapas 767
Izmēri 155 × 235 × 40 mm   ·   1,10 kg
Valoda Franču  
Redaktors Pardo, Alberto
Redaktors Viola, Alfredo

Vairāk no tā paša izdevēja

Skatīt visus Alberto Pardo