Expected Linear Time Sorting for Word Size Ω(log2 n loglogn).

Djamal Belazzougui Gerth Stølting Brodal Jesper Sindahl Nielsen

Published in: SWAT (2014)

Keyphrases

worst case
worst case bounds
computational complexity
co occurrence
database
small size
word recognition
real time
information retrieval
genetic algorithm
case study
np hard
topic models
space complexity