SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Mathematical Analysis of Evolution, Information, and Complexity

Volumn , Issue , 2009, Pages 455-464

QuickSort from an Information Theoretic View

(4) List, Beatrice a Maucher, Markus b Schöning, Uwe b Schuler, Rainer c

a LS Telcom AG (Germany)

b UNIVERSITY OF ULM (Germany)

c LogicLine EDV SystemService GmbH (Germany)

Author keywords

Random source; Lower bound; Mathematical analysis; QuickSort; Upper bound

Indexed keywords

EID: 79955462945 PISSN: None EISSN: None Source Type: Book
DOI: 10.1002/9783527628025.ch17 Document Type: Chapter

Times cited : (1)

References (14)

1
- 0042160356
- Biased coins and randomized algorithms
- in, Advances in Computing Research 5, (eds F.P. Preparata, S. Micali), JAI Press
- Alon, N. and Rabin,M.O. (1989) Biased coins and randomized algorithms, in, Advances in Computing Research 5, (eds F.P. Preparata, S. Micali), JAI Press, 499-507.
- (1989) , pp. 499-507
- Alon, N.¹ Rabin, M.O.²

2
- 0004280469
- Information Theory
- Dover
- Ash, R.B. (1965) Information Theory, Dover.
- (1965)
- Ash, R.B.¹

3
- 0003421261
- An Introduction to Probability Theory and its Applications
- John Wiley
- Feller,W. (1961) An Introduction to Probability Theory and its Applications, John Wiley.
- (1961)
- Feller, W.¹

4
- 0002217386
- Quicksort
- Hoare, C.A.R. (1962) Quicksort. Computer Journal, 5(1), 10-15.
- (1962) Computer Journal , vol.5 , Issue.1 , pp. 10-15
- Hoare, C.A.R.¹

5
- 0027626844
- Randomized algorithms and pseudorandom numbers
- Karloff, H.J. and Raghavan, P. (1993) Randomized algorithms and pseudorandom numbers. Journal of the Association for Computing Machinery, 40, 454-476.
- (1993) Journal of the Association for Computing Machinery , vol.40 , pp. 454-476
- Karloff, H.J.¹ Raghavan, P.²

6
- 0003657590
- The Art of Computer Programming. Vol 3: Sorting and Searching
- Addison-Wesley
- Knuth, D. (1973) The Art of Computer Programming. Vol 3: Sorting and Searching, Addison-Wesley.
- (1973)
- Knuth, D.¹

7
- 0001546568
- Mathematical Methods in Large-scale Computing Units
- Proc. 2nd Symp. on Large-scale Digital Calculating Machinery. Harvard University Press
- Lehmer, D.H. (1951) Mathematical Methods in Large-scale Computing Units. Proc. 2nd Symp. on Large-scale Digital Calculating Machinery. Harvard University Press, 141-146.
- (1951) , pp. 141-146
- Lehmer, D.H.¹

8
- 0003897694
- Computational Complexity
- Addison-Wesley
- Papadimitriou, C.H. (1994) Computational Complexity, Addison-Wesley.
- (1994)
- Papadimitriou, C.H.¹

9
- 26844564368
- Analysis of Algorithms
- Addison-Wesley
- Robert Sedgewick, R. and Flajolet, P. (1994) Analysis of Algorithms, Addison-Wesley.
- (1994)
- Robert Sedgewick, R.¹ Flajolet, P.²

10
- 84889420765
- Generating quasi-random sequences from slightly random sources
- Proceedings of the 25th IEEE
- Santha, M. and Vazirani, U.V. (1984) Generating quasi-random sequences from slightly random sources. Proceedings of the 25th IEEE.
- (1984)
- Santha, M.¹ Vazirani, U.V.²

11
- 84856043672
- A mathematical theory of communication
- 623-656
- Shannon, C. (1948) A mathematical theory of communication. The Bell System Technical Journal, July, October, 27, 379-423, 623-656.
- (1948) The Bell System Technical Journal, July, October , vol.27 , pp. 379-423
- Shannon, C.¹

12
- 26844514135
- Probabilistic Algorithms and Pseudorandom Generators
- Lecture Notes
- Tompa, M. (1991) Probabilistic Algorithms and Pseudorandom Generators. Lecture Notes.
- (1991)
- Tompa, M.¹

13
- 0242402043
- On the probabilistic worst-case time of "FIND"
- Devroye, L. (2001) On the probabilistic worst-case time of "FIND". Algorithmica, 31, 291-303.
- (2001) Algorithmica , vol.31 , pp. 291-303
- Devroye, L.¹

14
- 26844578355
- Probabilistische Algorithmen und schlechte Zufallszahlen
- PhD thesis Universität Ulm
- List, B. (1999) Probabilistische Algorithmen und schlechte Zufallszahlen. PhD thesis, Universität Ulm.
- (1999)
- List, B.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.