Fun with Algorithms [[electronic resource] ] : 6th International Conference, FUN 2012, Venice, Italy, June 4-6, 2012, Proceedings / / edited by Evangelos Kranakis, DANNY KRIZANC, Flaminia Luccio

• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012
• Edizione: 1st ed. 2012.
• Descrizione fisica: 1 online resource (XI, 397 p. 148 illus.)
• Disciplina: 005.1
• Soggetto topico: Algorithms; Computer science—Mathematics; Discrete mathematics; Computer networks; Artificial intelligence; Artificial intelligence—Data processing; Computer science; Discrete Mathematics in Computer Science; Computer Communication Networks; Artificial Intelligence; Data Science; Theory of Computation
• Persona (resp. second.): KranakisEvangelos; KRIZANCDANNY; LuccioFlaminia
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: Distributed Algorithms by Forgetful Mobile Robots / Paola Flocchini -- Stability and Metastability of the Logit Dynamics of Strategic Games / Giuseppe Persiano -- Art Galleries, k-modems, and k-convexity / Jorge Urrutia -- The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs / Terry Anderson and Therese Biedl -- Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box / Esther M. Arkin, Alon Efrat, George Hart, Irina Kostitsyna and Alexander Kröller, et al. -- The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye / Michael A. Bender, Ritwik Bose, Rezaul Chowdhury and Samuel McCauley -- Mad at Edge Crossings? Break the Edges! / Till Bruckdorfer and Michael Kaufmann -- Train Marshalling Is Fixed Parameter Tractable / Leo Brueggeman, Michael Fellows, Rudolf Fleischer, Martin Lackner and Christian Komusiewicz, et al. -- Conflict-Free Graph Orientations with Parity Constraints / Sarah Cannon, Mashhood Ishaque and Csaba D. Tóth -- The Multi-interval Ulam-Rényi Game / Ferdinando Cicalese -- Picture-Hanging Puzzles / Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell and Ronald L. Rivest, et al. ; Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors / Stefan Dobrev, Lata Narayanan and Jaroslav Opatrny -- The Byzantine Brides Problem / Swan Dubois, Sébastien Tixeuil and Nini Zhu -- Lean Programs, Branch Mispredictions, and Sorting / Amr Elmasry and Jyrki Katajainen -- On Computer Integrated Rationalized Crossword Puzzle Manufacturing / Jakob Engel, Markus Holzer, Oliver Ruepp and Frank Sehnke -- Solving Single-Digit Sudoku Subproblems / David Eppstein -- Finding Good Coffee in Paris / Paola Flocchini, Matthew Kellett, Peter C. Mason and Nicola Santoro -- To Satisfy Impatient Web Surfers Is Hard / Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric and Nicolas Nisse -- Making Life Easier for Firefighters / Fedor V. Fomin, Pinar Heggernes and Erik Jan van Leeuwen -- Counting Perfect Matchings in Graphs of Degree 3 / Martin Fürer -- M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns / Ellen Gethner, David G. Kirkpatrick and Nicholas J. Pippenger -- On the Complexity of Rolling Block and Alice Mazes / Markus Holzer and Sebastian Jakobi -- Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes / Markus Holzer and Sebastian Jakobi.
• Sommario/riassunto: This book constitutes the refereed proceedings of the 6th International Conference, FUN 2012, held in June 2012 in Venice, Italy. The 34 revised full papers were carefully reviewed and selected from 56 submissions. They feature a large variety of topics in the field of the use, design, and analysis of algorithms and data structures, focusing on results that provide amusing, witty but nonetheless original and scientifically profound contributions to the area.
• Titolo autorizzato: Fun with Algorithms
• ISBN: 3-642-30347-1
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996465382303316
• Lo trovi qui: Univ. di Salerno
• Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 7288