************************************************************************************************
Open Directory :: Computer Algorithms
An initiative of attendees of the 1997 Dagstuhl seminar, these pages provide research papers, a bulletin board, and links to researchers and other resources in the field. The focus is on average case and probabilistic analysis.www.ewalkins.com
Click Here To View Full Details
************************************************************************************************
Dictionary of Algorithms and Data Structures
This is a dictionary of algorithms, algorithmic techniques, data structures, archetypical problems, and related definitions. Algorithms include common functions, such as Ackermann's function. Problems include traveling salesman and Byzantine generals. Some entries have links to implementations and more information. Index pages list entries by area and by type.www.ewalkins.com
Click Here To View Full Details
************************************************************************************************
Tree Automata Techniques and Applications
The two first chapters contain the basics on Tree Automata theory for finite ordered ranked trees. Chapter 3 shows connections between Logic and Tree Automata. Chapter 4 presents Automata with Constraints.www.ewalkins.com
Click Here To View Full Details
************************************************************************************************
Analysis of QuickSort
This analysis doesn't really tell us what to expect. In practice, quicksort behaves like a fast algorithm, but our focus on worst-case running time tells us it's n2.www.ewalkins.com
Click Here To View Full Details
************************************************************************************************
Sorting
The DataStructures package, however, includes graphs which are not currently in the Collections framework; and the greater simplicity of the DataStructures package makes it more suitable as a basis for learning about fundamental principles of data structures and algorithms.www.ewalkins.com
Click Here To View Full Details
************************************************************************************************
Data Structures through Java
These notes provide an introduction to some of the most commonly occurring data structures. The language used is Java. The aim is not the greatest generality. The DataStructures package developed here is not as extensive as the Collections framework, first released with Java 1.2. For portable applications, you should use the Collectionswww.ewalkins.com
Click Here To View Full Details
************************************************************************************************
Algorithms
The notes contain the material that I use when preparing the actual lectures; in that sense they are my lecture notes. They also approximate what you as a student may choose to write down from these lectures; in that sense they are your lecture notes. And in each case, they form an approximation: a lecture is a form of communicationwww.ewalkins.com
Click Here To View Full Details
************************************************************************************************
A Catalog of Enumeration Algorithms
Since the given graph is bipartite, the problem for findig another perfect matching is reduced to a problem for finding a directed cycle of a auxiarly directed graph and so it requires O( n + m ) timewww.ewalkins.com
Click Here To View Full Details
************************************************************************************************
Data Structures & Algorithms (A. Cawsey)
To avoid re-inventing the wheel. As you might expect, for many programming problems, someone has already developed a good algorithm to solve that problem. For many of these algorithms, people have formally analysed their properties, so you can be confident in their correctness and efficiency. For example,www.ewalkins.com
Click Here To View Full Details
************************************************************************************************ Handbook of Algorithms and Data Structures
These WWW pages are not a digital version of the book, nor the complete contents of it. Here you will find the preface, table of contents, index and all source code of the handbook. The main goal is to make available through Internet the source code of many algorithms (in C and/or Pascal) that have been already testedwww.ewalkins.com
Click Here To View Full Details
************************************************************************************************ Algorithms from ADUni.org
The study of algorithms concentrates on the high level design of data structures and methods for using them to solve problems. The subject is highly mathematical, but the mathematics can be compartmentalized, allowing a student to concentrate on what rather than whywww.ewalkins.com
Click Here To View Full Details
************************************************************************************************ Applied Algorithms
My goal in teaching this course is help you become better prepared to tackle algorithm design for "real-world" problems. This includes (1) understanding fundamental algorithmic techniques and the tradeoffs involved in designing correct, efficient and implementable algorithms, andwww.ewalkins.com
Click Here To View Full Details
************************************************************************************************
