000 | 03082nam a22005415i 4500 | ||
---|---|---|---|
001 | 978-3-642-54423-1 | ||
003 | DE-He213 | ||
005 | 20200421111207.0 | ||
007 | cr nn 008mamaa | ||
008 | 140324s2014 gw | s |||| 0|eng d | ||
020 |
_a9783642544231 _9978-3-642-54423-1 |
||
024 | 7 |
_a10.1007/978-3-642-54423-1 _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aLATIN 2014: Theoretical Informatics _h[electronic resource] : _b11th Latin American Symposium, Montevideo, Uruguay, March 31-April 4, 2014. Proceedings / _cedited by Alberto Pardo, Alfredo Viola. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2014. |
|
300 |
_aXXX, 767 p. 137 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v8392 |
|
505 | 0 | _aComplexity -- 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. | |
520 | _aThis 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. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aComputers. | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aComputation by Abstract Devices. |
650 | 2 | 4 | _aData Structures. |
700 | 1 |
_aPardo, Alberto. _eeditor. |
|
700 | 1 |
_aViola, Alfredo. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783642544224 |
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v8392 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-54423-1 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-LNC | ||
942 | _cEBK | ||
999 |
_c54237 _d54237 |