Result 101 to 108 of 108 total
On the conjecture relating minimax and minimean complexity norms. (English)
Apl. Mat. 24, 321-325 (1979).
101
The complexity of lexicographic sorting and searching. (English)
Mathematical foundations of computer science, Proc. 8th Symp., Olomouc/Czech. 1979, Lect. Notes Comput. Sci. 74, 517-522 (1979).
102
The complexity of lexicographic sorting and searching (English)
MFCS, 517-522 (1979).
103
On the lower bound for minimum comparison selection. (English)
Apl. Mat. 23, 1-8 (1978).
104
How good is the adversary lower bound? (English)
Math. Found. Comput. Sci., Proc. 6th Symp., Tatranska Lomnica 1977, Lect. Notes Comput. Sci. 53, 465-474 (1977).
105
How good is the adversary lower bound? (English)
MFCS, 465-474 (1977).
106
On the lower bound for minimum comparison selection. (English)
Math. Found. Comput. Sci., Proc. 5th MFCS Symp., Gdansk 1976, Lect. Notes Comput. Sci. 45, 495-502 (1976).
107
On the lower bound for minimum comparison selection (English)
MFCS, 495-502 (1976).
108
Result 101 to 108 of 108 total
Start
Contact
Print
General Help
