Skip to main content
Search Button
United States Kobo store Gift Cards Help

Rakuten Kobo

Wishlist

Shopping Cart

You're getting the VIP treatment!

Item(s) unavailable for purchase
Please review your cart. You can remove the unavailable item(s) now or we'll automatically remove it at Checkout.
itemsitem
itemsitem

Recommended For You

Loading...


Showing 1 - 12 of 12 results for “joe ryan”
Skip side bar filters

  • Gary the Time-Travelling Goat

    by Joe Ryan, Craig Phillips ...
    Illustrated by Paul Nash ...
    Go on an adventure with Gary the Time-Travelling Goat and help him find his magic jellybeans! Gary is one unique, kooky goat who has a bright technicolor beard that enables him to travel through time, granting wishes to anyone he meets. He keeps his beard long and wavy by adding his magic jellybeans to his favorite dish...Gary's famous 'Yummy Tum Stew'! There's only one problem; Gary had an ... Read more

    $2.99 USD or Free with Kobo Plus

  • Heavyweight Boxing in the 1970s

    The Great Fighters and Rivalries

    by Joe Ryan ...
    This work covers the individuals and events of what most consider to be the greatest era in boxing history. The first chapter compares the 1970s to all other eras, from the early 1900s and Jack Johnson to the present day and the Klitschko brothers, proving through an established set of criteria that the '70s stand above all other eras. The second chapter focuses on the tumultuous 1960s and the ... Read more

    $19.99 USD

  • Combinatorial Algorithms

    28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers

    Edited by Ljiljana Brankovic, Joe Ryan, William F. Smyth ...
    Series series Springer Nature Proceedings Computer Science
    This book constitutes the refereed post-conference proceedings of the 28th International Workshopon Combinatorial Algorithms, IWOCA 2017, held in Newcastle, NSW, Australia, in July 2017.The 30 regular papers presented in this volume together with 5 invited talks were carefully reviewed and selected from 55 submissions. They were organized in topical sessions named: approximation algorithms and ... Read more

    $49.99 USD

  • Magic and Antimagic Graphs

    Attributes, Observations and Challenges in Graph Labelings

    by Martin Bača, Mirka Miller, Joe Ryan, Andrea Semaničová-Feňovčíková ...
    Series series Mathematics and Statistics (R0)
    Magic and antimagic labelings are among the oldest labeling schemes in graph theory. This book takes readers on a journey through these labelings, from early beginnings with magic squares up to the latest results and beyond.Starting from the very basics, the book offers a detailed account of all magic and antimagic type labelings of undirected graphs. Long-standing problems are surveyed and ... Read more

    $134.99 USD

People who read these also enjoyed

  • Art of Computer Programming, The

    Fundamental Algorithms, Volume 1

    by Donald Knuth ...
    &>The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming.—Byte, September 1995I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the ... Read more

    $68.39 USD

  • Art of Computer Programming, The

    Sorting and Searching, Volume 3

    by Donald Knuth ...
    The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming.–Byte, September 1995I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line ... Read more

    $68.39 USD

  • P, NP, and NP-Completeness

    The Basics of Computational Complexity

    by Oded Goldreich ...
    The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their ... Read more

    $47.59 USD

  • Algorithms for Sparse Linear Systems

    by Jennifer Scott, Miroslav Tůma ...
    Series series Mathematics and Statistics (R0)
    Large sparse linear systems of equations are ubiquitous in science, engineering and beyond. This open access monograph focuses on factorization algorithms for solving such systems. It presents classical techniques for complete factorizations that are used in sparse direct methods and discusses the computation of approximate direct and inverse factorizations that are key to constructing general ... Read more

    Free

  • Handbook of Discrete and Combinatorial Mathematics

    Edited by Kenneth H. Rosen ...
    Series series Discrete Mathematics and Its Applications
    Handbook of Discrete and Combinatorial Mathematics provides a comprehensive reference volume for mathematicians, computer scientists, engineers, as well as students and reference librarians.The material is presented so that key information can be located and used quickly and easily. Each chapter includes a glossary. Individual topics are covered in sections and subsections within chapters, each of ... Read more

    $345.00 USD

  • Computer Science -- Theory and Applications

    10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings

    Edited by Lev D. Beklemishev, Daniil V. Musatov ...
    Series series Springer Nature Proceedings Computer Science
    This book constitutes the proceedings of the 10th International Computer Science Symposium in Russia, CSR 2015, held in Listvyanka, Russia, in July 2015.The 25 full papers presented in this volume were carefully reviewed and selected from 61 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas in theoretical ... Read more

    $49.99 USD

  • Topics in Algorithmic Graph Theory

    Edited by Lowell W. Beineke, Martin Charles Golumbic, Robin J. Wilson ...
    Series Book 178 - Encyclopedia of Mathematics and its Applications
    Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developments on graph algorithms and related concepts that will be of value to both mathematicians and ... Read more

    $109.89 USD

  • Art of Computer Programming, Volume 4B, The

    Combinatorial Algorithms

    by Donald Knuth ...
    The Art of Computer Programming is Knuth's multivolume analysis of algorithms. With the addition of this new volume, it continues to be the definitive description of classical computer science.Volume 4B, the sequel to Volume 4A, extends Knuth's exploration of combinatorial algorithms. These algorithms are of keen interest to software designers because ". . . a single good idea can save years or ... Read more

    $68.39 USD