computer algorithm Books

# Information Retrieval (C.J. van Rijsgergen)

## 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):

NA Pages
##### Similar Books

Design And Analysis Of Algorithms by Herbert Edelsbrunner

This book focuses on fundamental data structures and graph algorithms. The emphasis will be on algorithm design and on algorithm analysis.

95 Pages

Fundamentals of Algorithms with Applications

This note explains the following topics: Growth of functions, Basic data structures, Sorting and Selection, Fundamental techniques, Dynamic programming and Graphs, Graph algorithms, NP-Completeness and approximation algorithms, Randomized Algorithms.

NA Pages

Approximation Algorithms

The field of approximation algorithms has developed in response to the difficulty in solving a good many optimization problems exactly. This note will present general techniques that underly these algorithms.

NA Pages

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.

NA Pages

Design And Analysis Of Algorithms by Herbert Edelsbrunner

This book focuses on fundamental data structures and graph algorithms. The emphasis will be on algorithm design and on algorithm analysis.

95 Pages

Analysis and Design of Computer Algorithms by Ganesh Kumar

This note covers the following topics: Divide And Conquer Strategy, Greedy Method, Minimum Spanning Trees, Dynamic Programming, Optimal Binary search trees, Backtracking Method, Branch and Bound, Lower bound Theory.

85 Pages

Lecture Notes on Data Structures

This note covers the following topics: Algorithms and Data Structures, Introduction to Java, Software Development, Writing Classes, Writing Classes in Java, Unit Testing, Building Large Java Applications, Inheritance and Polymorphism, Interfaces, A Math Review, Algorithm Analysis, Data Types versus Data Structures, Collections, Stacks ,Queues, Lists, Recursion, Sorting, Trees, Oriented Trees, Ordered Trees, Binary Trees, Sets and Dictionaries, Search Trees, Binary Search Trees, Red-Black Trees.

NA Pages

Information Theory, Inference, and Learning Algorithms (David J.C. MacKay)

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

Pages

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.

NA Pages

Dictionary of Algorithms and Data Structures

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

Pages