000 | 02906nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-642-25591-5 | ||
003 | DE-He213 | ||
005 | 20140220083817.0 | ||
007 | cr nn 008mamaa | ||
008 | 111201s2011 gw | s |||| 0|eng d | ||
020 |
_a9783642255915 _9978-3-642-25591-5 |
||
024 | 7 |
_a10.1007/978-3-642-25591-5 _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
100 | 1 |
_aAsano, Takao. _eeditor. |
|
245 | 1 | 0 |
_aAlgorithms and Computation _h[electronic resource] : _b22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings / _cedited by Takao Asano, Shin-ichi Nakano, Yoshio Okamoto, Osamu Watanabe. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2011. |
|
300 |
_aXVIII, 775 p. _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 ; _v7074 |
|
520 | _aThis book constitutes the refereed proceedings of the 22nd International Symposium on Algorithms and Computation, ISAAC 2011, held in Yokohama, Japan in December 2011. The 76 revised full papers presented together with two invited talks were carefully reviewed and selected from 187 submissions for inclusion in the book. This volume contains topics such as approximation algorithms; computational geometry; computational biology; computational complexity; data structures; distributed systems; graph algorithms; graph drawing and information visualization; optimization; online and streaming algorithms; parallel and external memory algorithms; parameterized algorithms; game theory and internet algorithms; randomized algorithms; and string algorithms. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer Communication Networks. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aComputer software. | |
650 | 0 | _aElectronic data processing. | |
650 | 0 | _aComputational complexity. | |
650 | 0 | _aComputer graphics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aComputer Graphics. |
650 | 2 | 4 | _aData Structures. |
650 | 2 | 4 | _aNumeric Computing. |
700 | 1 |
_aNakano, Shin-ichi. _eeditor. |
|
700 | 1 |
_aOkamoto, Yoshio. _eeditor. |
|
700 | 1 |
_aWatanabe, Osamu. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783642255908 |
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v7074 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-25591-5 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-LNC | ||
999 |
_c108613 _d108613 |