Computer Science Bookscomputer algorithm Books

Information Retrieval (C.J. van Rijsgergen)

Advertisement

Information Retrieval (C.J. van Rijsgergen)

Information Retrieval (C.J. van Rijsgergen)

The material of this book is aimed at advanced undergraduate information (or computer) science students, postgraduate library science students, and research workers in the field of IR. Some of the chapters, particular chapter 6, make simple use of a little advanced mathematics.

Author(s):

sNA Pages

Advertisement

Advertisement

Similar Books
Introduction to Algorithms Lecture Notes

Introduction to Algorithms Lecture Notes

This note concentrates on the design of algorithms and the rigorous analysis of their efficiency. Topics covered includes: the basic definitions of algorithmic complexity, basic tools such as dynamic programming, sorting, searching, and selection; advanced data structures and their applications, graph algorithms and searching techniques such as minimum spanning trees, depth-first search, shortest paths, design of online algorithms and competitive analysis.

sNA Pages
Design and Analysis of Algorithms Course Notes

Design and Analysis of Algorithms Course Notes

This note explains core material in data structures and algorithm design, and also helps students prepare for research in the field of algorithms. Topics covered includes: Splay Trees, Amortized Time for Splay Trees, Maintaining Disjoint Sets, Binomial heaps, F-heap, Minimum Spanning Trees, Fredman-Tarjan MST Algorithm, Light Approximate Shortest Path Trees, Matchings, Hopcroft-Karp Matching Algorithm, Two Processor Scheduling, Network Flow - Maximum Flow Problem, The Max Flow Problem and Max-Flow Algorithm.

s161 Pages
Advanced Data Structures

Advanced Data Structures

This note covers the following topics: Self adjusting data structures, amortized analysis, self adjusting lists, Splay trees, their performance and related conjectures, Hashing, FKS perfect hashing, Cuckoo hasing, dynamic perfect hashing, Fusion Trees, Fully dynamic connectivity in polylogarithmic time, Dynamic all pairs shortest paths, Linear time construction of Suffix trees and arrays, Succinct Data Structures, External memory data structures, Geometric data structures, Top trees, Retroactive data structures, Online optimal structure for planar point location.

sNA Pages
Introduction to the Design and Analysis of Algorithms

Introduction to the Design and Analysis of Algorithms

This note introduces a number of important algorithm design techniques as well as basic algorithms that are interesting both from a theoretical and also practical point of view. Topics covered are: Introduction to Algorithms, Asymptotic Analysis, Recurrence Equations, Sorting Algorithms, Search Trees, Randomized Algorithms and Quicksort, Selection Algorithms, Number Theory and Cryptography Algorithms, Graph algorithms, Greedy Algorithms and External Memory Algorithms.

sNA Pages
Data Structures and Algorithm Analysis

Data Structures and Algorithm Analysis

This book is designed as a teaching text that covers most standard data structures, but not all. A few data structures that are not widely adopted are included to illustrate important principles.

sNA Pages
Applied Algorithms Lecture Slides

Applied Algorithms Lecture Slides

This note covers the following topics: Introduction, Stable Matching, Graph Algorithms, Greedy Algorithms, Minimum Spanning Trees, Recurrences, Dynamic programming, Network Flow and Network Flow Applications.

sNA Pages
Lecture Notes for Algorithm Analysis and Design (PDF 124P)

Lecture Notes for Algorithm Analysis and Design (PDF 124P)

This note covers the following topics related to Algorithm Analysis and Design: Model and Analysis, Warm up problems, Brute force and Greedy strategy, Dynamic Programming, Searching, Multidimensional Searching and Geometric algorithms, Fast Fourier Transform and Applictions, String matching and finger printing, Graph Algorithms, NP Completeness and Approximation Algorithms.

s128 Pages
An Introduction to Computational Complexity

An Introduction to Computational Complexity

This note covers the following topics: Computational Models, Complexity measures, Power increasing resourses, Basic relatton amomg the models and measures, Reducibility, completeness and closure under reductions, Deterministics and nondeterministics logarithmic space, Deterministics polynomial time, Polynomial Hierarchy and Polynomial space.

s85 Pages
Handbook of Algorithms and Data Structures (G. Gonnet, R. Baeza Yates)

Handbook of Algorithms and Data Structures (G. Gonnet, R. Baeza Yates)

Currently this section contains no detailed description for the page, will update this page soon.

s Pages
Lecture Notes on Computational Complexity (Luca Trevisan)

Lecture Notes on Computational Complexity (Luca Trevisan)

Currently this section contains no detailed description for the page, will update this page soon.

s Pages