Search results for "Algorithm"
Items we need to order for you

Algorithms -- ESA 2004
This volume contains the 70 contributed papers and abstracts of two invited l- tures presented at the 12th Annual European Symposium on Algorithms (ESA 2004), held in Bergen, Norway, September 14-17, 2004. The papers in each s- tion of the proceedings are arranged alphabetically. The three distinguished - vited speakers were David Eppstein, Michael Fellows and Monika Henzinger. As in the last two years, ESA had two tracks, with separate program c- mittees, which dealt respectively with: - the design and mathematical analysis of algorithms (the "Design and A- lysis" track); - real-world applications, engineering and experimental analysis of algorithms (the "Engineering and Applications" track). Previous ESAs were held at Bad Honnef, Germany (1993); Utrecht, The Netherlands (1994); Corfu, Greece (1995); Barcelona, Spain (1996); Graz, A- tria (1997); Venice, Italy (1998); Prague, Czech Republic (1999); Saarbruc .. ken, ? Germany (2000); Arhus, Denmark (2001); Rome, Italy (2002); and Budapest, Hungary (2003). The predecessor to the Engineering and Applications track of ESA was the annual Workshop on Algorithm Engineering (WAE).Previous WAEs were held in Venice, Italy (1997); Saarbruc .. ken, Germany (1998); London, ? UK (1999); Saarbruc .. ken, Germany (2000); and Arhus, Denmark (2001). The proceedings of the previous ESAs were published as Springer-Verlag's LNCS volumes 726, 855, 979, 1284, 1461, 1643, 1879, 2161, 2461, and 2832. The proceedingsoftheWAEsfrom1999onwardswerepublishedasSpringer-Verlag's LNCS volumes 1668, 1982, and 2141.
R 3,128.43

Algorithmic Game Theory
In recent years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. Algorithmic Game Theory, first published in 2007, develops the central ideas and results of this exciting area in a clear and succinct manner. More than 40 of the top researchers in this field have written chapters that go from the foundations to the state of the art. Basic chapters on algorithmic methods for equilibria, mechanism design and combinatorial auctions are followed by chapters on important game theory applications such as incentives and pricing, cost sharing, information markets and cryptography and security. This definitive work will set the tone of research for the next few years and beyond. Students, researchers, and practitioners alike need to learn more about these fascinating theoretical developments and their widespread practical application.
R 3,357.53

Algorithms and Complexity
The two-volume set LNCS 15679 and 15680 constitutes the refereed proceedings of the 14th International Conference on Algorithms and Complexity, CIAC 2025, held in Rome, Italy, during June 10–12, 2025.The 44 full papers included in these proceedings were carefully reviewed and selected from 110 submissions. They focus on all aspects of important venue for researchers working on computational complexity and the design, analysis, experimentation, and application of efficient algorithms and data structures.
R 3,663.00

R 435.00

Algorithm Engineering
Algorithms are essential building blocks of computer applications. However, advancements in computer hardware, which render traditional computer models more and more unrealistic, and an ever increasing demand for efficient solution to actual real world problems have led to arising gap between classical algorithm theory and algorithmics in practice.The emerging discipline of Algorithm Engineering aims at bridging this gap. Driven by concrete applications, Algorithm Engineering complements theory by the benefits of experimentation and puts equal emphasis on all aspects arising during a cyclic solution process ranging from realistic modeling, design, analysis, robust and efficient implementations to careful experiments.This tutorial - outcome of a GI-Dagstuhl Seminar held in Dagstuhl Castle in September 2006 - covers the essential aspects of this process in ten chapters on basic ideas, modeling and design issues, analysis of algorithms, realistic computer models, implementation aspects andalgorithmic software libraries, selected case studies, as well as challenges in Algorithm Engineering. Both researchers and practitioners in the field will find it useful as a state-of-the-art survey.
R 2,805.85

Approximation and Online Algorithms
The Fifth Workshop on Approximation and Online Algorithms (WAOA 2007) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications from a variety of ?elds. WAOA 2007 took place in Eilat, Israel, during October 11–12, 2007. The workshop was part of the ALGO 2007 event that also hosted ESA 2007, and PEGG 2007. The previous WAOA workshops were held in Budapest (2003), Rome (2004), Palma de Mallorca (2005) and Zurich (2006). The proceedings of these previous WAOA workshops have appeared as LNCS volumes 2909, 3351, 3879 and 4368, respectively. Topics of interest for WAOA 2007 were: algorithmic game theory, appro- mation classes, coloring and partitioning, competitive analysis, computational ?nance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems. In response to the call for - pers, we received 56 submissions. Each submission was reviewed by at least three referees, and the vast majority by at least four referees. The submissions were mainly judged on originality, technical quality, and relevance to the topics of the conference. Based on the reviews, the Program Committee selected 22 papers. We are grateful to Andrei Voronkov for providing the EasyChair conference system which was used to manage the electronic submissions, the review process, and the electronic PC meeting. It made our task much easier.
R 1,557.09

WALCOM: Algorithms and Computation
This book constitutes the thoroughly refereed conference proceedings of the 9th International Workshop on Algorithms and Computation, WALCOM 2015, held in Dhaka, Bangladesh, in February 2015. The 26 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 85 submissions. The papers are organized in topical sections on approximation algorithms, data structures and algorithms, computational geometry, combinatorial algorithms, distributed and online algorithms, graph drawing and algorithms, combinatorial problems and complexity, and graph enumeration and algorithms.
R 2,183.44

Visibility Algorithms in the Plane
A human observer can effortlessly identify visible portions of geometric objects present in the environment. However, computations of visible portions of objects from a viewpoint involving thousands of objects is a time consuming task even for high speed computers. To solve such visibility problems, efficient algorithms have been designed. This book presents some of these visibility algorithms in two dimensions. Specifically, basic algorithms for point visibility, weak visibility, shortest paths, visibility graphs, link paths and visibility queries are all discussed. Several geometric properties are also established through lemmas and theorems. With over 300 figures and hundreds of exercises, this book is ideal for graduate students and researchers in the field of computational geometry. It will also be useful as a reference for researchers working in algorithms, robotics, computer graphics and geometric graph theory, and some algorithms from the book can be used in a first course in computational geometry.
R 5,761.34

Frontiers in Algorithmics
This book constitutes the proceedings of the 9th International Workshop on Frontiers in Algorithmics, FAW 2015, held in Guilin, China, in July 2015. The 28 papers presented in this volume were carefully reviewed and selected from 65 submissions. They deal with graph algorithms, approximation algorithms, combinatorial optimization, parameterized algorithms, and online algorithms.
R 2,181.53

Algorithms and Data Structures
This book constitutes the refereed proceedings of the 15th Algorithms and Data Structures Symposium, WADS 2017, held in St. John's, NL, Canada, in July/August 2017. The 49 full papers presented together with 3 abstracts of invited talks were carefully reviewed and selected from 109 submissions. They present original research on the theory and application of algorithms and data structures in many areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.The WADS Symposium, which alternates with the Scandinavian Symposium and Workshops on Algorithm Theory, SWAT, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. Papers presenting original research on the theory and application of algorithms and data structures
R 2,224.60

Nature-Inspired Optimization Algorithms
Nature-Inspired Optimization Algorithms, a comprehensive work on the most popular optimization algorithms based on nature, starts with an overview of optimization going from the classical to the latest swarm intelligence algorithm. Nature has a rich abundance of flora and fauna that inspired the development of optimization techniques, providing us with simple solutions to complex problems in an effective and adaptive manner. The study of the intelligent survival strategies of animals, birds, and insects in a hostile and ever-changing environment has led to the development of techniques emulating their behavior. This book is a lucid description of fifteen important existing optimization algorithms based on swarm intelligence and superior in performance. It is a valuable resource for engineers, researchers, faculty, and students who are devising optimum solutions to any type of problem ranging from computer science to economics and covering diverse areas that require maximizing output and minimizing resources. This is the crux of all optimization algorithms. Features: Detailed description of the algorithms along with pseudocode and flowchart Easy translation to program code that is also readily available in Mathworks website for some of the algorithms Simple examples demonstrating the optimization strategies are provided to enhance understanding Standard applications and benchmark datasets for testing and validating the algorithms are includedThis book is a reference for undergraduate and post-graduate students. It will be useful to faculty members teaching optimization. It is also a comprehensive guide for researchers who are looking for optimizing resources in attaining the best solution to a problem. The nature-inspired optimization algorithms are unconventional, and this makes them more efficient than their traditional counterparts.
R 7,610.55

Algorithm Audit: Why, What, and How?
Seeking to increasing the social awareness of citizens, institutions, and corporations with regard to the risks presented by the acritical use of algorithms in decision-making, this book explains the rationale and the methods of algorithm audit. Interdisciplinary in approach, it provides a systematic overview of the subject, supplying readers with clear definitions and practical tools for the audit of algorithms, while also taking account of the political, business, and vocational obstacles to the development of this new field. As such, it constitutes an essential resource for students and researchers across the social sciences and humanities, as well as for professionals and policymakers, with concerns about the social consequences of algorithmic decision-making.
R 3,597.21

Algorithms and Data Structures
This book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Data Structures, WADS 2021, held in virtually in August 2021. The 47 full papers, presented together with two invited lectures, were carefully reviewed and selected from a total of 123 submissions. They present original research on the theory, design and application of algorithms and data structures.
R 4,335.68

R 1,948.80

Algorithmic Ways for Mathematical Puzzles
Algorithmic Ways for Mathematical Puzzles introduces puzzles from all over the world, past and present, from the perspective of theoretical computer science. Certain types of puzzles have contributed greatly to the development of this field. In fact, the latest puzzles often provide new research themes for computer scientists, whether the puzzle designer intended this outcome or not.This book explores the current landscape, including such unsolved problems that are still extant. The contents of this book can be read by high school students with reasonable mathematical comprehension skills, but from an academic level it is mainly targeted at undergraduate and graduate students with an interest in algorithms and an appetite for puzzles.FeaturesPresents a wonderfully engaging teaching resource for a class on algorithmicsFull of interesting and previously unpublished puzzlesCopiously illustrated in full color.
R 1,942.00

Algorithmic Combinatorics on Partial Words
The discrete mathematics and theoretical computer science communities have recently witnessed explosive growth in the area of algorithmic combinatorics on words. The next generation of research on combinatorics of partial words promises to have a substantial impact on molecular biology, nanotechnology, data communication, and DNA computing. Delving into this emerging research area, Algorithmic Combinatorics on Partial Words presents a mathematical treatment of combinatorics on partial words designed around algorithms and explores up-and-coming techniques for solving partial word problems as well as the future direction of research.This five-part book begins with a section on basics that covers terminology, the compatibility of partial words, and combinatorial properties of words. The book then focuses on three important concepts of periodicity on partial words: period, weak period, and local period. The next part describes a linear time algorithm to test primitivity on partial words and extends the results on unbordered words to unbordered partial words while the following section introduces some important properties of pcodes, details a variety of ways of defining and analyzing pcodes, and shows that the pcode property is decidable using two different techniques. In the final part, the author solves various equations on partial words, presents binary and ternary correlations, and covers unavoidable sets of partial words. Setting the tone for future research in this field, this book lucidly develops the central ideas and results of combinatorics on partial words.
R 3,842.84

R 656.58

R 1,594.28

Neutrosophic Graph Theory and Algorithms
Graph theory is a specific concept that has numerous applications throughout many industries. Despite the advancement of this technique, graph theory can still yield ambiguous and imprecise results. In order to cut down on these indeterminate factors, neutrosophic logic has emerged as an applicable solution that is gaining significant attention in solving many real-life decision-making problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistency, and indeterminacy. However, empirical research on this specific graph set is lacking. Neutrosophic Graph Theory and Algorithms is a collection of innovative research on the methods and applications of neutrosophic sets and logic within various fields including systems analysis, economics, and transportation. While highlighting topics including linear programming, decision-making methods, and homomorphism, this book is ideally designed for programmers, researchers, data scientists, mathematicians, designers, educators, researchers, academicians, and students seeking current research on the various methods and applications of graph theory.
R 7,956.39

Algorithmic Modernity
Algorithms have been transforming human society long before the advent of computing. Yet they continue to exist in relative invisibility despite their presence behind many of our modern social interactions. The rhetoric of algorithmic neutrality is more alive than ever, and algorithms are often depicted as obvious and unproblematic—without context and without history. Algorithmic Modernity draws together the history of mathematics and intellectual history to convey the enduring global history of the algorithm as a computational tool, epistemic ideal, and rhetorical figure alongside the ascendance of modernity. Through historical reconstructions of relevant thinkers and cultural phenomena over the last five hundred years, this collection of essays reveals how algorithms became the standard method for solving problems from the early inclusion ofalgorithms in Newton's formation of calculus to their later influence in the New Deal economy. Together, these essays create an informed history for readers interested in the social and cultural implications of today's pervasive digital algorithm. Featuring experts in mathematics, history, and computing, Algorithmic Modernity presents a multi-faceted exploration of the genealogy of algorithmic thinking in modern times.
R 4,254.00

Algorithms and Computation
This book constitutes the refereed proceedings of the 24th International Symposium on Algorithms and Computation, ISAAC 2013, held in Hong Kong, China in December 2013. The 67 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 177 submissions for inclusion in the book. The focus of the volume in on the following topics: computation geometry, pattern matching, computational complexity, internet and social network algorithms, graph theory and algorithms, scheduling algorithms, fixed-parameter tractable algorithms, algorithms and data structures, algorithmic game theory, approximation algorithms and network algorithms.
R 2,249.41

Frontiers in Algorithmics
This book constitutes the refereed proceedings of the First Annual International Frontiers of Algorithmics Workshop, FAW 2007, held in Lanzhou, China in August 2007. Topics covered in the papers include bioinformatics, discrete structures, geometric information processing and communication, games and incentive analysis, graph algorithms, internet algorithms and protocols, and algorithms in medical applications.
R 1,566.81

Nature-Inspired Algorithms for Optimisation
Nature-Inspired Algorithms have been gaining much popularity in recent years due to the fact that many real-world optimisation problems have become increasingly large, complex and dynamic. The size and complexity of the problems nowadays require the development of methods and solutions whose efficiency is measured by their ability to find acceptable results within a reasonable amount of time, rather than an ability to guarantee the optimal solution. This volume 'Nature-Inspired Algorithms for Optimisation' is a collection of the latest state-of-the-art algorithms and important studies for tackling various kinds of optimisation problems. It comprises 18 chapters, including two introductory chapters which address the fundamental issues that have made optimisation problems difficult to solve and explain the rationale for seeking inspiration from nature. The contributions stand out through their novelty and clarity of the algorithmic descriptions and analyses, and lead the way to interesting and varied new applications.
R 6,038.45

Combinatorial Algorithms
This book constitutes the thoroughly refereed post-workshop proceedings of the 25th International Workshop on Combinatorial Algorithms, IWOCA 2014, held in Duluth, MN, USA, in October 2014. The 32 revised full papers presented were carefully reviewed and selected from a total of 69 submissions. The papers focus on topics such as Algorithms and Data Structures, Combinatorial Enumeration, Combinatorial Optimization, Complexity Theory (Structural and Computational), Computational Biology, Databases (Security, Compression and Information Retrieval), Decompositions and Combinatorial Designs, Discrete and Computational Geometry, as well as Graph Drawing and Graph Theory. IWOCA is a yearly forum for researchers in designing algorithms field to advance creativeness of intersection between mathematics and computer science. This is the first time this conference is being held in U.S.
R 2,188.29

Stochastic Algorithms: Foundations and Applications
The second Symposium on Stochastic Algorithms, Foundations and Applications (SAGA 2003),took place on September 22-23,2003, in Hat?eld, England.The present volume comprises 12 contributed papers and 3 invited talks. The contributed papers included in the proceedings present results in the following areas: ant colony optimization; randomized algorithmsfor the intersection problem; - cal search for constraint satisfaction problems; randomized local search methods for combinatorial optimization, in particular, simulated annealing techniques; probabilistic global search algorithms; network communication complexity; open shop scheduling; aircraft routing; traf?c control; randomized straight-line programs; and stochastic - tomata and probabilistic transformations. TheinvitedtalkbyRolandKirschnerprovidesabriefintroductiontoquantuminf- matics. The requirements and the prospects of the physical implementation of a qu- tum computer are addressed. Lucila Ohno-Machado and Winston P.Kuo describe the factors that make the an- ysis of high-throughput gene expression data especially challenging, and indicate why properly evaluated stochastic algorithms can play a particularly important role in this process. John Vaccaro et al. review a fundamental element of quantum information theory, source coding, which entails the compression of quantum data. A recent experiment that demonstrates this fundamental principle is presented and discussed. Our special thanks go to all who supported SAGA 2003, to all authors who subm- ted papers, to the members of the program committee, to the invited speakers, and to the members of the organizing committee. Andreas Albrecht Kathleen Steinhofel .. Organization SAGA2003wasorganizedbytheUniversityofHertfordshire,DepartmentofComputer Science, Hat?eld, Hertfordshire AL10 9AB, United Kingdom.
R 1,537.57

R 715.00

R 1,901.67

Instance-Specific Algorithm Configuration
This book presents a modular and expandable technique in the rapidly emerging research area of automatic configuration and selection of the best algorithm for the instance at hand. The author presents the basic model behind ISAC and then details a number of modifications and practical applications. In particular, he addresses automated feature generation, offline algorithm configuration for portfolio generation, algorithm selection, adaptive solvers, online tuning, and parallelization. The author's related thesis was honorably mentioned (runner-up) for the ACP Dissertation Award in 2014, and this book includes some expanded sections and notes on recent developments. Additionally, the techniques described in this book have been successfully applied to a number of solvers competing in the SAT and MaxSAT International Competitions, winning a total of 18 gold medals between 2011 and 2014. The book will be of interest to researchers and practitioners in artificial intelligence, in particular in the area of machine learning and constraint programming.
R 1,839.84

R 2,166.45

Evolutionary Algorithms
Despite decades of work in evolutionary algorithms, there remains an uncertainty as to the relative benefits and detriments of using recombination or mutation. This book provides a characterization of the roles that recombination and mutation play in evolutionary algorithms. It integrates important prior work and introduces new theoretical techniques for studying evolutionary algorithms. Consequences of the theory are explored and a novel method for comparing search and optimization algorithms is introduced. The focus allows the book to bridge multiple communities, including evolutionary biologists and population geneticists.
R 3,028.07

Algorithms for Parallel Processing
This IMA Volume in Mathematics and its Applications ALGORITHMS FOR PARALLEL PROCESSING is based on the proceedings of a workshop that was an integral part of the 1996-97 IMA program on "MATHEMATICS IN HIGH-PERFORMANCE COMPUTING. " The workshop brought together algorithm developers from theory, combinatorics, and scientific computing. The topics ranged over models, linear algebra, sorting, randomization, and graph algorithms and their analysis. We thank Michael T. Heath of University of lllinois at Urbana (Com puter Science), Abhiram Ranade of the Indian Institute of Technology (Computer Science and Engineering), and Robert S. Schreiber of Hewlett Packard Laboratories for their excellent work in organizing the workshop and editing the proceedings. We also take this opportunity to thank the National Science Founda tion (NSF) and the Army Research Office (ARO), whose financial support made the workshop possible. A vner Friedman Robert Gulliver v PREFACE The Workshop on Algorithms for Parallel Processing was held at the IMA September 16 - 20, 1996; it was the first workshop of the IMA year dedicated to the mathematics of high performance computing. The work shop organizers were Abhiram Ranade of The Indian Institute of Tech nology, Bombay, Michael Heath of the University of Illinois, and Robert Schreiber of Hewlett Packard Laboratories. Our idea was to bring together researchers who do innovative, exciting, parallel algorithms research on a wide range of topics, and by sharing insights, problems, tools, and methods to learn something of value from one another.
R 3,051.42

Algorithms for Computer Algebra
Algorithms for Computer Algebra is the first comprehensive textbook to be published on the topic of computational symbolic mathematics. The book first develops the foundational material from modern algebra that is required for subsequent topics. It then presents a thorough development of modern computational algorithms for such problems as multivariate polynomial arithmetic and greatest common divisor calculations, factorization of multivariate polynomials, symbolic solution of linear and polynomial systems of equations, and analytic integration of elementary functions. Numerous examples are integrated into the text as an aid to understanding the mathematical development. The algorithms developed for each topic are presented in a Pascal-like computer language. An extensive set of exercises is presented at the end of each chapter. Algorithms for Computer Algebra is suitable for use as a textbook for a course on algebraic algorithms at the third-year, fourth-year, or graduate level. Although the mathematical development uses concepts from modern algebra, the book is self-contained in the sense that a one-term undergraduate course introducing students to rings and fields is the only prerequisite assumed. The book also serves well as a supplementary textbook for a traditional modern algebra course, by presenting concrete applications to motivate the understanding of the theory of rings and fields.
R 4,703.38

Approximation and Online Algorithms
This book constitutes the refereed proceedings of the 22nd International Workshop on Approximation and Online Algorithms, WAOA 2024, held in Egham, UK, during September 5–6, 2024. The 15 full papers included in this book were carefully reviewed and selected from 47 submissions. They were organized in topical sections as follows: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, FPT approximation algorithms, geometric problems, graph algorithms, inapproximability results, mechanism design, network design, packing and covering, paradigms for designing and analyzing approximation and online algorithms, resource augmentation, and scheduling problems.
R 2,546.28

Algorithms - ESA 2003
Thisvolumecontainsthe66contributedpapersandabstractsofthethreeinvited lecturespresentedatthe11thAnnualEuropeanSymposiumonAlgorithms(ESA 2003), held in Budapest, September 16-19, 2003. The papers in each section of the proceedings are arranged alphabetically. The three distinguished invited ' speakers were Bernard Chazelle, Roberto Tamassia, and Eva Tardos. Forthesecondtime,ESAhadtwotracks,withseparateprogramcommittees, which dealt respectively with: The design and mathematical analysis of algorithms (the "Design and Analysis" track); Real-world applications, engineering, and experimental analysis of al- rithms (the "Engineering and Applications" track). Previous ESAs were held at Bad Honnef, Germany (1993); Utrecht, The Neth- lands (1994); Corfu, Greece (1995); Barcelona, Spain (1996); Graz, Austria (1997); Venice, Italy (1998); Prague, Czech Republic (1999); Saarbruc .. ken, Ger- ? many (2000); Arhus, Denmark (2001), and Rome, Italy (2002). The predecessor to the Engineering and Applications track of ESA was the annual Workshop on Algorithm Engineering (WAE). Previous WAEs were held in Venice, Italy (1997), Saarbruc .. ken, Germany (1998), London, UK (1999), Saarbruc .. ken, Ger- ?many (2000), Arhus, Denmark (2001), and Rome, Italy (2002) . The proceedings of the previous ESAs were published as Springer-Verlag's LNCS volumes 726, 855, 979, 1284, 1461, 1643, 1879, 2161, and 2461. The p- ceedings of the WAEs from 1999 onwards were published as Springer-Verlag's LNCS volumes 1668, 1982, and 2141.
R 4,030.00

Foundations of Genetic Algorithms
The8thWorkshopontheFoundationsofGeneticAlgorithms,FOGA-8,washeld at the University of Aizu in Aizu-Wakamatsu City, Japan, January 5–9, 2005. This series of workshops was initiated in 1990 to encourage further research on the theoretical aspects of genetic algorithms, and the workshops have been held biennially ever since. The papers presented at these workshops are revised, edited and published as volumes during the year following each workshop. This series of (now eight) volumes provides an outstanding source of reference for the theoretical work in this ?eld. At the same time this series of volumes provides a clear picture of how the theoretical research has grown and matured along with the ?eld to encompass many evolutionary computation paradigms including evolution strategies (ES), evolutionary programming (EP), and genetic programming (GP), as well as the continuing growthininteractionswith other ?elds suchas mathematics,physics, and biology. Atraditionoftheseworkshopsisorganizetheminsuchawayastoencourage lots of interaction and discussion by restricting the number of papers presented and the number of attendees, and by holding the workshop in a relaxed and informal setting. This year’s workshop was no exception. Thirty-two researchers met for 3 days to present and discuss 16 papers. The local organizer was Lothar Schmitt who, together with help and support from his university, provided the workshop facilities. Aftertheworkshopwasover,theauthorsweregiventheopportunitytorevise their papers based on the feedback they received from the other participants.
R 1,561.22

Parallel Algorithms
This book is an introduction to the field of parallel algorithms and the underpinning techniques to realize the parallelization. The emphasis is on designing algorithms within the timeless and abstracted context of a high-level programming language. The focus of the presentation is on practical applications of the algorithm design using different models of parallel computation. Each model is illustrated by providing an adequate number of algorithms to solve some problems that quite often arise in many applications in science and engineering.The book is largely self-contained, presuming no special knowledge of parallel computers or particular mathematics. In addition, the solutions to all exercises are included at the end of each chapter.The book is intended as a text in the field of the design and analysis of parallel algorithms. It includes adequate material for a course in parallel algorithms at both undergraduate and graduate levels.
R 4,670.02

Design and Analysis of Algorithms
These are my lecture notes from CS681: Design and Analysis of Algo rithms, a one-semester graduate course I taught at Cornell for three consec utive fall semesters from '88 to '90. The course serves a dual purpose: to cover core material in algorithms for graduate students in computer science preparing for their PhD qualifying exams, and to introduce theory students to some advanced topics in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At first I meant these notes to supplement and not supplant a textbook, but over the three years they gradually took on a life of their own. In addition to the notes, I depended heavily on the texts • A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975. • M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. w. H. Freeman, 1979. • R. E. Tarjan, Data Structures and Network Algorithms. SIAM Regional Conference Series in Applied Mathematics 44, 1983. and still recommend them as excellent references.
R 3,043.48

Algorithms and Complexity
The papers in this volume were presented at the Fourth Italian Conference on Algorithms and Complexity (CIAC 2000). The conference took place on March 1-3, 2000, in Rome (Italy), at the conference center of the University of Rome \La Sapienza". This conference was born in 1990 as a national meeting to be held every three years for Italian researchers in algorithms, data structures, complexity, and parallel and distributed computing. Due to a signi cant participation of foreign reaserchers, starting from the second conference, CIAC evolved into an international conference. In response to the call for papers for CIAC 2000, there were 41 subm- sions, from which the program committee selected 21 papers for presentation at the conference. Each paper was evaluated by at least three program committee members. In addition to the selected papers, the organizing committee invited Giorgio Ausiello, Narsingh Deo, Walter Ruzzo, and Shmuel Zaks to give plenary lectures at the conference. We wish to express our appreciation to all the authors of the submitted papers, to the program committee members and the referees, to the organizing committee, and to the plenary lecturers who accepted our invitation.
R 1,561.22


R 1,628.00

Topics in Algorithmic Graph Theory
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 computer scientists, at a level suitable for graduate students, researchers and instructors. The fifteen expository chapters, written by acknowledged international experts on their subjects, focus on the application of algorithms to solve particular problems. All chapters were carefully edited to enhance readability and standardize the chapter structure as well as the terminology and notation. The editors provide basic background material in graph theory, and a chapter written by the book's Academic Consultant, Martin Charles Golumbic (University of Haifa, Israel), provides background material on algorithms as connected with graph theory.
R 4,897.92

R 2,290.00

Algorithm Theory - SWAT '94
This volume constitutes the proceedings of SWAT '94, the 4th Scandinavian Workshop on Algorithm Theory, held in Aarhus, Denmark in July 1994. The SWAT events are organized each even year and alternate with the WADS meetings (Workshops on Algorithms and Data Structures) held each odd year in North America.The volume contains 31 papers selected from a total of 100 submissions and 3 invited presentations by Michael Fredman (Rutgers), Johan Hastad (Stockholm), and Ketan Mulmuley (Chicago). The contributions cover algorithms and data structures in all areas of computer science and in discrete mathematics, particularly including graph theory, computational geometry, and databases.
R 1,573.86

R 1,601.36

R 849.00

Algorithm Theory - SWAT 2000
The papers in this volume were presented at SWAT 2000, the Seventh Scandi- vian Workshop on Algorithm Theory. The workshop, which is really a conference, has been held biennially since 1988, rotating between the ve Nordic countries (Sweden, Norway, Finland, Denmark, and Iceland). It also has a loose assoc- tion with the WADS (Workshop on Algorithms and Data Structures) conference that is held in odd numbered years. SWAT is intended as a forum for researchers in the area of design and analysis of algorithms. The SWAT conferences are co- dinated by the SWAT steering committee, which consists of B. Aspvall (Bergen), S. Carlsson (Lule a), H. Hafsteinsson (U. Iceland), R. Karlsson (Lund), A. Lingas (Lund), E. Schmidt (Aarhus), and E. Ukkonen (Helsinki). The call for papers sought contributions in all areas of algorithms and data structures, including computational geometry, parallel and distributed comp- ing, graph theory, and computational biology. A total of 105 papers were s- mitted, out of which the program committee selected 43 for presentation. In addition, invited lectures were presented by Uriel Feige (Weizmann), Mikkel Thorup (AT&T Labs-Research), and Esko Ukkonen (Helsinki).SWAT 2000 was held in Bergen, July 5-7, 2000, and was locally organized by a committee consisting of Pinar Heggernes, Petter Kristiansen, Fredrik Manne, and Jan Arne Telle (chair), all from the department of informatics, University of Bergen.
R 4,678.18

Effiziente Algorithmen für grundlegende Funktionen
Der erfolgreiche Einsatz von Rechnern bei der Lösung von Problemen in fast allen Lebensbereichen beruht u.a. auf der technologischen Entwicklung, die zu schnelle ren Rechnern mit größerem Speicher führte, auf der größeren Benutzerfreundlich keit der Rechner und auf effizienteren Algorithmen zur Lösung der betrachteten Probleme. Dieses Buch befaßt sich mit dem Entwurf effizienter Algorithmen für grundlegende Probleme, die häufig als Teilprobleme in komplexeren Problemen auftreten. Während auf der unteren Ebene der Hardware von Rechnern, also in Schaltkreisen, Schaltwerken und VLSI-Chips, schon immer mit einem hohen Grad an Parallelität gearbeitet wurde, konnte auf höherer Ebene lange Zeit nur sequentiell gerechnet werden. Dies ändert sich nun durch die Entwicklung von Rechnern mit immer mehr Prozessoren. Das Buch legt daher einen Schwerpunkt auf Algorithmen, die gleich zeitig bezüglich paralleler Rechenzeit und Hardwaregröße (bei Hardwarelösungen) bzw. bezüglich paralleler Rechenzeit, Zahl der benutzten Prozessoren und Spei cherplatz (bei Softwarelösungen) effizient sind. Es werden effiziente Algorithmen für den Entwurf optimaler P LA's diskutiert. Danach werden die grundlegenden arithmetischen Funktionen Addition, Subtrak tion, Multiplikation und Division, die symmetrischen Funktionen, die auch als Zählfunktionen bezeichnet werden können, und Speicherzugriffsfunktionen behan delt. In diesem Teil des Buches werden vor allem Hardwarelösungen präsentiert. Für das Rechnen mit Matrizen, einfache Probleme auf Graphen, Sortierprobleme und Probleme der Elementaren Zahlentheorie werden effiziente Softwarelösungen vorgestellt. Das Buch enthält außerdem allgemeine Methoden der automatischen Parallelisierung sequentieller Algorithmen, Reduktionskonzepte zum Vergleich der Komplexität der behandelten Probleme und effiziente Simulationen zwischen den benutzten Rechenmodellen.
R 1,686.95















































