top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Computational Thinking : First Algorithms, Then Code / / by Paolo Ferragina, Fabrizio Luccio
Computational Thinking : First Algorithms, Then Code / / by Paolo Ferragina, Fabrizio Luccio
Autore Ferragina Paolo
Edizione [2nd ed. 2024.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2024
Descrizione fisica 1 online resource (204 pages)
Disciplina 005.1
Altri autori (Persone) LuccioFabrizio
Collana Undergraduate Topics in Computer Science
Soggetto topico Algorithms
Computer science
Software engineering
Python (Computer program language)
Mathematics - Data processing
Design and Analysis of Algorithms
Computer Science Logic and Foundations of Programming
Software Engineering
Python
Computational Science and Engineering
ISBN 3-031-59922-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A Brief Historical Outline -- A Problem with Which to Begin -- Algorithms and Coding -- The Tournament -- A Financial Problem -- Secret Messages -- Putting Things in Order -- "Easy" and "Difficult" Problems -- Search Engines -- Data Compression -- Recursion.
Record Nr. UNINA-9910896528103321
Ferragina Paolo  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2024
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computational Thinking : First Algorithms, Then Code / / by Paolo Ferragina, Fabrizio Luccio
Computational Thinking : First Algorithms, Then Code / / by Paolo Ferragina, Fabrizio Luccio
Autore Ferragina Paolo
Edizione [1st ed. 2018.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Descrizione fisica 1 online resource (VIII, 174 p.)
Disciplina 005.1
Soggetto topico Algorithms
Software engineering
Algorithm Analysis and Problem Complexity
Software Engineering/Programming and Operating Systems
ISBN 3-319-97940-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A Brief Historical Outline -- A Problem with Which to Begin -- Algorithms and Coding -- The Tournament -- A Financial Problem -- Secret Messages -- Putting Things in Order -- "Easy" and "Difficult" Problems -- Search Engines -- Data Compression -- Recursion.
Record Nr. UNINA-9910299350503321
Ferragina Paolo  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Fun with Algorithms [[electronic resource] ] : 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014, Proceedings / / edited by Alfredo Ferro, Fabrizio Luccio, Peter Widmayer
Fun with Algorithms [[electronic resource] ] : 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014, Proceedings / / edited by Alfredo Ferro, Fabrizio Luccio, Peter Widmayer
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (XII, 378 p. 141 illus.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Artificial intelligence
Artificial intelligence—Data processing
Discrete Mathematics in Computer Science
Artificial Intelligence
Data Science
ISBN 3-319-07890-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithmic Gems in the Data Miner’s Cave.- Fun with Fonts: Algorithmic Typography.- Happy Edges: Threshold-Coloring of Regular Lattices.- Classic Nintendo Games Are (Computationally) Hard.- On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method.- No Easy Puzzles: A Hardness Result for Jigsaw Puzzles.- Normal, Abby Normal, Prefix Normal.- Nonconvex Cases for Carpenter’s Rulers.-How to Go Viral: Cheaply and Quickly -- Synchronized Dancing of Oblivious Chameleons.- Another Look at the Shoelace TSP: The Case of Very Old Shoes -- Playing Dominoes Is Hard, Except by Yourself.- UNO Gets Easier for a Single Player -- Secure Auctions without Cryptography.- Towards an Algorithmic Guide to Spiral Galaxies -- Competitive Analysis of the Windfall Game.- Excuse Me! or The Courteous Theatregoers’ Problem.- Zombie Swarms: An Investigation on the Behaviour of Your Undead Relatives.-Approximability of Latin Square Completion-Type Puzzles.-Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set.- Quell.- How Even Tiny Influence Can Have a Big Impact.-Optimizing Airspace Closure with Respect to Politicians’ Egos -- Being Negative Makes Life NP-hard (for Product Sellers).- Clearing Connections by Few Agents.- Counting Houses of Pareto Optimal Matchings in the House Allocation Problem -- Practical Card-Based Cryptography.- The Harassed Waitress Problem.- Lemmings Is PSPACE-Complete.- Finding Centers and Medians of a Tree by Distance Queries.- Swapping Labeled Tokens on Graphs.
Record Nr. UNISA-996217777703316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Fun with Algorithms : 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014, Proceedings / / edited by Alfredo Ferro, Fabrizio Luccio, Peter Widmayer
Fun with Algorithms : 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014, Proceedings / / edited by Alfredo Ferro, Fabrizio Luccio, Peter Widmayer
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (XII, 378 p. 141 illus.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Artificial intelligence
Artificial intelligence—Data processing
Discrete Mathematics in Computer Science
Artificial Intelligence
Data Science
ISBN 3-319-07890-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithmic Gems in the Data Miner’s Cave.- Fun with Fonts: Algorithmic Typography.- Happy Edges: Threshold-Coloring of Regular Lattices.- Classic Nintendo Games Are (Computationally) Hard.- On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method.- No Easy Puzzles: A Hardness Result for Jigsaw Puzzles.- Normal, Abby Normal, Prefix Normal.- Nonconvex Cases for Carpenter’s Rulers.-How to Go Viral: Cheaply and Quickly -- Synchronized Dancing of Oblivious Chameleons.- Another Look at the Shoelace TSP: The Case of Very Old Shoes -- Playing Dominoes Is Hard, Except by Yourself.- UNO Gets Easier for a Single Player -- Secure Auctions without Cryptography.- Towards an Algorithmic Guide to Spiral Galaxies -- Competitive Analysis of the Windfall Game.- Excuse Me! or The Courteous Theatregoers’ Problem.- Zombie Swarms: An Investigation on the Behaviour of Your Undead Relatives.-Approximability of Latin Square Completion-Type Puzzles.-Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set.- Quell.- How Even Tiny Influence Can Have a Big Impact.-Optimizing Airspace Closure with Respect to Politicians’ Egos -- Being Negative Makes Life NP-hard (for Product Sellers).- Clearing Connections by Few Agents.- Counting Houses of Pareto Optimal Matchings in the House Allocation Problem -- Practical Card-Based Cryptography.- The Harassed Waitress Problem.- Lemmings Is PSPACE-Complete.- Finding Centers and Medians of a Tree by Distance Queries.- Swapping Labeled Tokens on Graphs.
Record Nr. UNINA-9910483966903321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui