|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-642-13122-6 |
| 003 |
DE-He213 |
| 005 |
20230220221826.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100528s2010 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642131226
|9 978-3-642-13122-6
|
| 024 |
7 |
|
|a 10.1007/978-3-642-13122-6
|2 doi
|
| 050 |
|
4 |
|a QA76.6-76.66
|
| 072 |
|
7 |
|a UM
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 072 |
|
7 |
|a UM
|2 thema
|
| 082 |
0 |
4 |
|a 005.11
|2 23
|
| 245 |
1 |
0 |
|a Fun with Algorithms
|h [electronic resource] :
|b 5th International Conference, FUN 2010, Ischia, Italy, June 2-4, 2010, Proceedings /
|c edited by Paolo Boldi, Luisa Gargano.
|
| 250 |
|
|
|a 1st ed. 2010.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2010.
|
| 300 |
|
|
|a IX, 382 p. 120 illus.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 6099
|
| 505 |
0 |
|
|a Fun 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 |
|a Computer programming.
|
| 650 |
|
0 |
|a Computer networks .
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
1 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Computer Communication Networks.
|
| 650 |
2 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Artificial Intelligence.
|
| 700 |
1 |
|
|a Boldi, Paolo.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Gargano, Luisa.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642131219
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642131233
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 6099
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-13122-6
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
