When can we sort in o(n log n) time?

Annual Symposium on Foundatons of Computer Science (Proceedings)

Volumn , Issue , 1993, Pages 538-546

  Ben Amram, Amir M ^a   Galil, Zvi ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; MATHEMATICAL MODELS; RANDOM ACCESS STORAGE; THEOREM PROVING;

BOUNDS; RANDOM ACCESS MACHINE;

SORTING;

EID: 0027805153     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)