Libros UCLV { BETA }

Computer Algorithms

This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. It is used as the basic text book in almost all american universities.

Knowledge iS POWER

This book cover a series of programming techniques used in sport programming competitions, such as ACM-ICPC, IOI, etc. It is incredible useful in practice because it contains the solution and the code of the problems.

For those who love Java and Computer Science complicated stuffs. This book contains all basic data structures implemented in Java and "good" algorithms.

Algorithms

This is a draft of a book about selected algorithms. The audience in mind are programmers who are interested in the treated algorithms and actually want to create and understand working and reasonably optimized code.

Donald E. Knuth is famous because of his pioneering work in the field of algorithms and programming techniques, "If you think you are a good programmer ... read Knuth Art of Computer Programming. .. If you read the whole book, send me your CV necessarily "- Bill Gates said this, so if you want to work in Microsoft, you should read the four books of Art of Computer Programming, remark that is no easy task!!!!!!!!!.

Donald E. Knuth is famous because of his pioneering work in the field of algorithms and programming techniques, "If you think you are a good programmer ... read Knuth Art of Computer Programming. .. If you read the whole book, send me your CV necessarily "- Bill Gates said this, so if you want to work in Microsoft, you should read the four books of Art of Computer Programming, remark that is no easy task!!!!!!!!!.

Donald E. Knuth is famous because of his pioneering work in the field of algorithms and programming techniques, "If you think you are a good programmer ... read Knuth Art of Computer Programming. .. If you read the whole book, send me your CV necessarily "- Bill Gates said this, so if you want to work in Microsoft, you should read the four books of Art of Computer Programming, remark that is no easy task!!!!!!!!!.

Donald E. Knuth is famous because of his pioneering work in the field of algorithms and programming techniques, "If you think you are a good programmer ... read Knuth Art of Computer Programming. .. If you read the whole book, send me your CV necessarily "- Bill Gates said this, so if you want to work in Microsoft, you should read the four books of Art of Computer Programming, remark that is no easy task!!!!!!!!!.

Mathematics computer science

This book is intended to survey the most important algorithms in use on computers today and to teach fundamental techniques to the growing number of people who are interested in becoming serious computer users.

This book evolved over the past ten years from a set of lecture notes developed while teaching the undergraduate Algorithms course at Berkeley and U.C. San Diego.

Computational geometry emerged from the field of algorithms design and analysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The success of the field as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains—computer graphics, geographic information systems (GIS), robotics, and others—in which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or difficult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simplified many of the previous approaches. In this textbook we have tried to make these modern algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry, but it can also be used for self-study.

This is classic textbook in Computational Geometry, the author O´Rourke is a pioneer in the subject. The book covers the basic theory and an implementation in C of the algorithms.

This book is concentrated on four major directions in computational geometry the construction of convex hulls proximity problems searching problems and intersection problems

What is Computational Geometry? Computational geometry is a term claimed by a number of different groups. The term was coined perhaps first by Marvin Minsky in his book “Perceptrons”, which was about pattern recognition, and it has also been used often to describe algorithms for manipulating curves and surfaces in solid modeling. Its most widely recognized use, however, is to describe the subfield of algorithm theory that involves the design and analysis of efficient algorithms for problems involving geometric input and output.

This book is an extensive compilation of graph theory, aimed to solve several matching problems. It can be used a general text-book about Combinatorial Optimization, yet its center is matching.

This book grew out of several courses in combinatorics and graph theory given at Appalachian State University and UCLA in recent years. A one-semester course for juniors at Appalachian State University focusing on graph theory coveredmost of Chapter 1 and the first part of Chapter 2. A one-quarter course at UCLA on combinatorics for undergraduates concentrated on the topics in Chapter 2 and included some parts of Chapter 1. Another semester course at Appalachian State for advanced undergraduates and beginning graduate students covered most of the topics from all three chapters.

Network Algorithm are useful in the current days (Internet for example requires it). This book give several algorithm in networks such as Maximum Flow, Maximum Flow with Minimum Cost, etc.

Network flows is an exciting field that brings together what many students, practitioners, and researchers like best about the mathematical and computational sciences. It couples deep intellectual content with a remarkable range of applicability, covering literally thousands of applications in such wide-ranging fields as chemistry and physics, computer networking, most branches of engineering, manufacturing, public policy and social systems, scheduling and routing, telecommunications, and transportation. It is classical, dating from the work of Gustav Kirchhoff and other eminent physical scientists of the last century, and yet vibrant and current, bursting with new results and new approaches. Its heritage is rooted in the traditional fields of mechanics, engineering, and applied mathematics as well as the contemporary fields of computer science and operations research.

The goal of this work is principally educational. It is initially aimed at graduate and undergraduate students, but it can also be used by software designers.

One of the simplest and natural types of information representation is by means of written texts. Data to be processed often does not decompose into independent records. This type of data is characterized by the fact that it can be written down as a long sequence of characters. Such linear sequence is called a text. The texts are central in "word processing" systems, which provide facilities for the manipulation of texts. Such systems usually process objects which are quite large. For example, this book contains probably more than a million characters. Text algorithms occur in many areas of science and information processing. Many text editors and programming languages have facilities for processing texts. In biology, text algorithms arise in the study of molecular sequences. The complexity of text algorithms is also one of the central and most studied problems in theoretical computer science. It could be said that it is the domain where the practice and theory are very close together.