Mathematics
and Interactions

Shay Moran

zbMATH link

Technion
Israel Institute of technology
IL

• One video
  

  24:27

  published on March 14, 2016

  The information theoretic lower bound for comparison based sorting is (almost) tight, even when there is an arbitrary known distribution on the input array

  By Shay Moran