Shimon was a great computer scientist who inspired generations of Israeli
stutents and young researchers, including many future leaders of theoretical
computer science.
He was a master at creating combinatorial algorithms, constructions, and
proofs. He always sought the simplest and most lucid solutions. Because...
This Festschrift volume, pubished in honor of Ugo Montanari on the occasion of his 65th birthday, contains 43 papers, written by friends and colleagues, all leading scientists in their own right, who congregated at a celebratory symposium held on June 12, 2008, in Pisa.
This text provides a detailed introduction to SAS/GRAPH, complete information about each SAS/GRAPH statement and procedure, as well as information about the DATA step graphics interface, complete with example programs.
SAS/GRAPH software extends the power of SAS' data management and analytical tools, giving you the ability to turn data...
Deformable objects are ubiquitous in the world surrounding us, on all levels from micro to macro. The need to study such shapes and model their behavior arises in a wide spectrum of applications, ranging from medicine to security. In recent years, non-rigid shapes have attracted growing interest, which has led to rapid development of the field,...
Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate themselves...
An introduction to biological networks and methods for their analysis
Analysis of Biological Networks is the first book of its kind to provide readers with a comprehensive introduction to the structural analysis of biological networks at the interface of biology and computer science. The book begins with a brief overview of biological networks...
The practice of compiler construction changes continually, in part because the designs of
processors and systems change. For example, when we began to write Engineering a Compiler
(eac) in 1998, some of our colleagues questioned the wisdom of including a chapter on
instruction scheduling because out-of-order execution threatened to make...
A decision procedure is an algorithm that, given a decision problem, terminates with a correct yes/no answer. Here, the authors focus on theories that are expressive enough to model real problems, but are still decidable. Specifically, the book concentrates on decision procedures for first-order theories that are commonly used in automated...
When selecting a technical book for myself I tend to choose one where there are lots of examples and sample code snippets that I can use and adapt for my own development projects. I wanted to write a book that I could use for reference myself, so I have tried to make sure there are code snippets wherever possible.
This monograph aims to provide an accessible and fairly comprehensive treatment of recent developments on generalised dualities for graphs on surfaces and their applications. Duality arises in many areas, particularly topological and algebraic graph theory, topology, and physics. The importance of duality derives not only from its inherent...
Quickly find solutions to common programming problems encountered while processing big data. Content is presented in the popular problem-solution format. Look up the programming problem that you want to solve. Read the solution. Apply the solution directly in your own code. Problem solved!
The 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011) took place in Tepl´a Monastery, Czech Republic, during June 21–24, 2011. It was attended by 80 participants who came from all over the world not only to deliver or listen to interesting talks, but also to celebrate the 65th birthday of Ludek...
