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.

This book constitutes the proceedings of the 5th International Conference, FUN 2010, held in June 2010 in Ischia, Italy. FUN with algorithms is a three-yearly conference that aims at atractings works which, besides a deep and interesting algorithmic content, also present amusing and fun aspects. The 32 full papers and 3 invited talks are carefully selected from 54 submissions and focus on topics such as distibuted algorithms, graph computations, parallelism, zero-knowledge proof, iphone, pattern matching and strategy games.

This book constitutes the refereed proceedings of the 4th International Conference on Fun with Algorithms, FUN 2007, held in Castiglioncello, Italy in June 2007. It details 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.

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.

I created a lecture-enhancing Algorithm Visualization (AV) tool to be used by Computer Science instructors teaching Algorithms. The main objective of this project was to create an AV tool that instructors will want to use. My target audience is the faculty at CSUN teaching Algorithms. AV’s are most effective when they are interactive, they are more than videos or animations that show the runtime process of an algorithm. Where videos or animations are no more effective than traditional teaching methods AV’s have been shown to be educationally effective across multiple studies. But even the most effective tools are useless if they don’t get used. I based the design of this project around my experience in Comp 496ALG (now relabeled Comp 482), covering three different algorithms taught in that class: Stable Marriage, Interval Scheduling, and Closest Pair of Points. For each algorithm I created an INSTANCE MAKER interface to create and edit instances of the problem, a SOLVER to perform the algorithm step by step, and a DISPLAY to show a visual diagram.

This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic problem-solving. All algorithms are presented in English, in a format compatible with the Pascal programming language. Contains many exercises, with answers at the back of the book (detailed solutions being supplied for difficult problems).

A flexagon is a motion structure that has the appearance of a ring of hinged polygons. It can be flexed to display different pairs of faces, usually in cyclic order. Flexagons can be appreciated as toys or puzzles, as a recreational mathematics topic, and as the subject of serious mathematical study. Workable paper models of flexagons are easy to make and entertaining to manipulate. The mathematics of flexagons is complex, and how a flexagon works is not immediately obvious on examination of a paper model. Recent geometric analysis, included in the book, has improved theoretical understanding of flexagons, especially relationships between different types. This profusely illustrated book is arranged in a logical order appropriate for a textbook on the geometry of flexagons. It is written so that it can be enjoyed at both the recreational mathematics level, and at the serious mathematics level. The only prerequisite is some knowledge of elementary geometry, including properties of polygons. A feature of the book is a compendium of over 100 nets for making paper models of some of the more interesting flexagons, chosen to complement the text. These are accurately drawn and reproduced at half full size. Many of the nets have not previously been published. Instructions for assembling and manipulating the flexagons are included.

You probably use Google everyday, but do you know... the Google Snake Game? Googledromes? Memecodes? Googlesport? The Google Calculator? Googlepark and Google Weddings? Google hacking, fighting and rhyming? In this book, you'll find Google-related games, oddities, cartoons, tips, stories and everything else that's fun. Reading it, you won't be the same searcher as before! No programming skills needed. (From the author of Google Blogoscoped.)