Attempts for lower bounds often looked at the cell-probe model, where we assume computation is free and are only interested in the number of memory cells accessed. Clearly every lower bound in the cell-probe model also holds in the Word RAM-model. Let N be the size of the inputs to the problems (i.e. the size of the graph or the size of the matrix, in the… (More)