Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Fun with Algorithms - 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July

Fun with Algorithms

7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014, Proceedings

Ferro, Alfredo, Luccio, Fabrizio, Widmayer, Peter (Eds.)

2014, XII, 378 p. 141 illus.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$59.99

(net) price for USA

ISBN 978-3-319-07890-8

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$84.00

(net) price for USA

ISBN 978-3-319-07889-2

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

This book constitutes the refereed proceedings of the 7th International Conference, FUN 2014, held in July 2014 in Lipari Island, Sicily, Italy.

The 29 revised full papers were carefully reviewed and selected from 49 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. In particular, algorithmic questions rooted in biology, cryptography, game theory, graphs, the internet, robotics and mobility, combinatorics, geometry, stringology, as well as space-conscious, randomized, parallel, distributed algorithms and their visualization are addressed.

Content Level » Research

Keywords » algorithms - combinatorics - cryptography - data structures - design and analysis of algorithms - discrete mathematics - game theory - graph theory - mechanism design - puzzles - theory of computation

Related subjects » Artificial Intelligence - Theoretical Computer Science

Table of contents 

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.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algorithm Analysis and Problem Complexity.