000 | 03696nam a22006255i 4500 | ||
---|---|---|---|
001 | 978-3-319-29516-9 | ||
003 | DE-He213 | ||
005 | 20200421112555.0 | ||
007 | cr nn 008mamaa | ||
008 | 160219s2016 gw | s |||| 0|eng d | ||
020 |
_a9783319295169 _9978-3-319-29516-9 |
||
024 | 7 |
_a10.1007/978-3-319-29516-9 _2doi |
|
050 | 4 | _aQA76.9.M35 | |
072 | 7 |
_aPBD _2bicssc |
|
072 | 7 |
_aUYAM _2bicssc |
|
072 | 7 |
_aCOM018000 _2bisacsh |
|
072 | 7 |
_aMAT008000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aCombinatorial Algorithms _h[electronic resource] : _b26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers / _cedited by Zsuzsanna Lipt�ak, William F. Smyth. |
250 | _a1st ed. 2016. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2016. |
|
300 |
_aXIX, 360 p. 62 illus. in color. _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 ; _v9538 |
|
505 | 0 | _aAlgorithms and data structures (including sequential, parallel, distributed, approximation, probabilistic, randomised, and on-line algorithms) -- Algorithms on strings and graphs -- Applications (bioinformatics, music analysis, networking, and others) -- Combinatorics on words -- Combinatorial enumeration.-Combinatorial optimization -- Complexity theory -- Computational biology.-Compression and information retrieval -- Cryptography and information security.-Decompositions and combinatorial designs -- Discrete and computational geometry.-Graphy drawing and labeling -- Graph theory. | |
520 | _aThis book constitutes the thoroughly refereed post-workshop proceedings for the 26 International Workshop on combinatorial Algorithms, IWOCA 2015, held in Verona, Italy, in October 2015. The 29 revised full papers presented were carefully reviewed and selected from a total of 90 submissions. The topics of the papers include algorithms and data structures (including sequential, parallel, distributed, approximation, probabilistic, randomised, and on-line algorithms), algorithms on strings and graphs; applications (bioinformatics, music analysis, networking, and others); combinatorics on words; combinatorial enumeration; combinatorial optimization; complexity theory; computational biology; compression and information retrieval; cryptography and information security; decompositions and combinatorial designs; discrete and computational geometry; graph drawing and labeling; graph theory. . | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aMathematical logic. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aBioinformatics. | |
650 | 0 | _aCombinatorics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aCombinatorics. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
650 | 2 | 4 | _aData Structures. |
650 | 2 | 4 | _aComputational Biology/Bioinformatics. |
700 | 1 |
_aLipt�ak, Zsuzsanna. _eeditor. |
|
700 | 1 |
_aSmyth, William F. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783319295152 |
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v9538 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-319-29516-9 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-LNC | ||
942 | _cEBK | ||
999 |
_c59087 _d59087 |