Algorithms with Random Input

George S. Lueker
Additional contact information
George S. Lueker: University of California at Irvine

A chapter in Computer Science and Statistics: Proceedings of the 13th Symposium on the Interface, 1981, pp 68-75 from Springer

Abstract: Abstract Randomness arises in connection with algorithms and their analysis in at least two different ways, Some algorithms (sometimes called coin-flipping algorithms) provide their own randomness, perhaps through the use of random number generators, Sometimes, though, it is useful to analyze the performance of a deterministic algorithm under some assumption about the distribution of inputs, We briefly survey some work which gives a perspective on such problems, Next we discuss some of the techniques which are useful when carrying out this type of analysis, Finally, we briefly discuss the problem of choosing an appropriate distribution

Keywords: Probabilistic analysis of algorithms; Boole’s inequality; Chebyshev’s inequality; independence; optimization problems; random graphs; bin packing (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-9464-8_11

Ordering information: This item can be ordered from
http://www.springer.com/9781461394648

DOI: 10.1007/978-1-4613-9464-8_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().