Randomization Methods in Algorithm Design

American Mathem

ISBN 10: 0821809164 / ISBN 13: 9780821809167

Published by American Mathematical Society, US, 1998

About this Item

This volume is based on proceedings held during the DIMACS workshop on Randomization Methods in Algorithm Design in December 1997 at Princeton. The workshop was part of the DIMACS Special Year on Discrete Probability. It served as an interdisciplinary research workshop that brought together a mix of leading theorists, algorithmists and practitioners working in the theory and implementation aspects of algorithms involving randomization. Randomization has played an important role in the design of both sequential and parallel algorithms. The last decade has witnessed tremendous growth in the area of randomized algorithms. During this period, randomized algorithms went from being a tool in computational number theory to finding widespread applications in many problem domains.Major topics covered include randomization techniques for linear and integer programming problems, randomization in the design of approximate algorithms for combinatorial problems, randomization in parallel and distributed algorithms, practical implementation of randomized algorithms, de-randomization issues, and pseudo-random generators. This volume focuses on theory and implementation aspects of algorithms involving randomization. It would be suitable as a graduate or advanced graduate text.

Seller Inventory # LU-9780821809167

Bibliographic Details

• Title: Randomization Methods in Algorithm Design
• Publisher: American Mathematical Society, US
• Publication Date: 1998
• Language: English
• ISBN 10: 0821809164
• ISBN 13: 9780821809167
• Binding: Hardback
• Condition: New
• Weight: 776 grams

About this title

Synopsis

A collection of 16 refereed papers from the December 1997 workshop held at Princeton. The volume focuses on theory and implementation aspects of algorithms involving randomization. Major topics covered include randomization techniques for linear and integer programming problems, randomization in the design of approximate algorithms for combinatorial problems, randomization in parallel and distributed algorithms, practical implementation of randomized algorithms, de-randomization issues, and pseudo-random generators. Suitable as a graduate text. No index. Annotation c. by Book News, Inc., Portland, Or.