Selected papers on analysis of algorithms

  • 0 Ratings
  • 3 Want to read
  • 0 Currently reading
  • 0 Have read

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today

  • 0 Ratings
  • 3 Want to read
  • 0 Currently reading
  • 0 Have read

Buy this book

Last edited by MARC Bot
July 11, 2024 | History

Selected papers on analysis of algorithms

  • 0 Ratings
  • 3 Want to read
  • 0 Currently reading
  • 0 Have read

This edition doesn't have a description yet. Can you add one?

Buy this book

Previews available in: English

Edition Availability
Cover of: Selected papers on analysis of algorithms
Selected papers on analysis of algorithms
2000, Center for the Study of Language and Information, Leland Stanford Junior University
in English

Add another edition?

Book Details


Table of Contents

Mathematical analysis of algorithms --
The dangers of computer science theory --
The analysis of algorithms --
Big Omicron and big Omega and big Theta --
Optimal measurement points for program frequency counts --
Estimating the efficiency of backtrack programs --
Ordered hase tables --
Activity in an interleaved memory --
An analysis of Alpha-Beta pruning --
Notes on generalized Dedekind sums --
The distribution of continued fraction approximations --
Evaluation of Porter's constant --
The subtractive algorithm for greatest common divisors --
Length of strings for a merge sort --
The average height of planted plane trees --
The toilet paper problem --
An analysis of optimum caching --
A trivial algorithm whose analysis isn't --
Deletions that preserve randomness --
Analysis of a simple factorization algorithm --
The expected linearity of a simple equivalence algorithm --
Textbook examples of recursion --
An exact analysis of stable allocation --
Stable husbands --
Shellsort with three increments --
The average time for carry propagation --
Linear probing and graphs --
A terminological proposal --
Postscript about NP-hard problems --
An experiment in optimal sorting --
Duality in addition chains --
Complexity results for bandwidth minimization --
The problem of compatible representatives --
The complexity of nonuniform random number generation.

Edition Notes

Includes bibliographical references and index.

Published in
[Stanford, Calif.]

Classifications

Library of Congress
QA9.58 .K65 2000, QA9.58.K65 2000

The Physical Object

Pagination
xvi, 621 p. :
Number of pages
621

ID Numbers

Open Library
OL15495554M
Internet Archive
selectedpaperson0000knut
ISBN 10
1575862115, 1575862123
LCCN
00023847
OCLC/WorldCat
43641140, 42835282
Library Thing
45988
Goodreads
484450

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
July 11, 2024 Edited by MARC Bot import existing book
December 3, 2022 Edited by ImportBot import existing book
February 26, 2022 Edited by ImportBot import existing book
August 4, 2020 Edited by ImportBot import existing book
September 20, 2008 Created by ImportBot Imported from Western Washington University MARC record