000 | 04022nam a22006255i 4500 | ||
---|---|---|---|
001 | 978-3-642-13122-6 | ||
003 | DE-He213 | ||
005 | 20240423130031.0 | ||
007 | cr nn 008mamaa | ||
008 | 100528s2010 gw | s |||| 0|eng d | ||
020 |
_a9783642131226 _9978-3-642-13122-6 |
||
024 | 7 |
_a10.1007/978-3-642-13122-6 _2doi |
|
050 | 4 | _aQA76.6-76.66 | |
072 | 7 |
_aUM _2bicssc |
|
072 | 7 |
_aCOM051000 _2bisacsh |
|
072 | 7 |
_aUM _2thema |
|
082 | 0 | 4 |
_a005.11 _223 |
245 | 1 | 0 |
_aFun with Algorithms _h[electronic resource] : _b5th International Conference, FUN 2010, Ischia, Italy, June 2-4, 2010, Proceedings / _cedited by Paolo Boldi, Luisa Gargano. |
250 | _a1st ed. 2010. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010. |
|
300 |
_aIX, 382 p. 120 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6099 |
|
505 | 0 | _aFun with Olympiad in Algorithmics -- The FUNnest Talks That belong to FUN (Abstract) -- Fun with Games -- Do We Need a Stack to Erase a Component in a Binary Image? -- Kaboozle Is NP-complete, Even in a Strip -- A Hat Trick -- Fun at a Department Store: Data Mining Meets Switching Theory -- Using Cell Phone Keyboards Is ( ) Hard -- Urban Hitchhiking -- A Fun Application of Compact Data Structures to Indexing Geographic Data -- On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching -- Cryptographic and Physical Zero-Knowledge Proof: From Sudoku to Nonogram -- A Better Bouncer’s Algorithm -- Tradeoffs in Process Strategy Games with Application in the WDM Reconfiguration Problem -- UNO Is Hard, Even for a Single Player -- Leveling-Up in Heroes of Might and Magic III -- The Magic of a Number System -- Bit-(Parallelism)2: Getting to the Next Level of Parallelism -- An Algorithmic Analysis of the Honey-Bee Game -- Mapping an Unfriendly Subway System -- Cracking Bank PINs by Playing Mastermind -- Computational Complexity of Two-Dimensional Platform Games -- Christmas Gift Exchange Games -- Return of the Boss Problem: Competing Online against a Non-adaptive Adversary -- Managing Change in the Era of the iPhone -- The Computational Complexity of RaceTrack -- Simple Wriggling Is Hard Unless You Are a Fat Hippo -- The Urinal Problem -- Fighting Censorship with Algorithms -- The Complexity of Flood Filling Games -- The Computational Complexity of the Kakuro Puzzle, Revisited -- Symmetric Monotone Venn Diagrams with Seven Curves -- The Feline Josephus Problem -- Scheduling with Bully Selfish Jobs -- O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List. | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aComputer networks . | |
650 | 0 | _aComputer science. | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aArtificial intelligence. | |
650 | 1 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aArtificial Intelligence. |
700 | 1 |
_aBoldi, Paolo. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aGargano, Luisa. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642131219 |
776 | 0 | 8 |
_iPrinted edition: _z9783642131233 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6099 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-13122-6 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c184307 _d184307 |