Randomized algorithms (Record no. 6652)

MARC details
000 -LEADER
fixed length control field 01911nam a22001937a 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240215154409.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 240215b |||||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780521613903
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Item number MOT
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Motwani, Rajeev
245 ## - TITLE STATEMENT
Title Randomized algorithms
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Name of publisher, distributor, etc. Cambridge University Press
Place of publication, distribution, etc. New Delhi
Date of publication, distribution, etc. 2018
300 ## - PHYSICAL DESCRIPTION
Extent xiv, 476 p.
365 ## - TRADE PRICE
Price type code INR
Price amount 1350.00
520 ## - SUMMARY, ETC.
Summary, etc. DescriptionContentsResourcesCoursesAbout the Authors<br/>For many applications a randomized algorithm is either the simplest algorithm available, or the fastest, or both. This tutorial presents the basic concepts in the design and analysis of randomized algorithms. The first part of the book presents tools from probability theory and probabilistic analysis that are recurrent in algorithmic applications. Algorithmic examples are given to illustrate the use of each tool in a concrete setting. In the second part of the book, each of the seven chapters focuses on one important area of application of randomized algorithms: data structures; geometric algorithms; graph algorithms; number theory; enumeration; parallel algorithms; and on-line algorithms. A comprehensive and representative selection of the algorithms in these areas is also given. This book should prove invaluable as a reference for researchers and professional programmers, as well as for students.<br/><br/>Only book currently published in the growing field of randomized algorithms<br/>Topic has applications in computer science, operations research, mathematics and statistics<br/>Practical and self-contained<br/>Written by two well-known researchers in the field<br/><br/>(https://www.cambridge.org/in/universitypress/subjects/computer-science/algorithmics-complexity-computer-algebra-and-computational-g/randomized-algorithms?format=HB&isbn=9780521474658)
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name Raghavan, Prabhakar
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type Book
Source of classification or shelving scheme Dewey Decimal Classification
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Bill No Bill Date Home library Current library Shelving location Date acquired Source of acquisition Cost, normal purchase price Total Checkouts Full call number Accession Number Date last seen Copy number Cost, replacement price Price effective from Koha item type
    Dewey Decimal Classification     Operations Management & Quantitative Techniques TB3445 24-01-2024 Indian Institute of Management LRC Indian Institute of Management LRC General Stacks 02/15/2024 Technical Bureau India Pvt. Ltd. 938.25   005.1 MOT 005865 02/15/2024 1 1350.00 02/15/2024 Book

©2019-2020 Learning Resource Centre, Indian Institute of Management Bodhgaya

Powered by Koha