Biography:

One of their most recent publications is A note on multikey sorting using modified binary insertion trees. Which was published in journal Computers & Operations Research.

More information about Abid M. Elabdalla research including statistics on their citations can be found on their Copernicus Academic profile page.

Abid M. Elabdalla's Articles: (2)

A note on multikey sorting using modified binary insertion trees

AbstractThis paper considers a modified version of binary insertion trees to sort records on several keys with the possibility of mixing the order of the different keys, i.e. ascending on some keys while descending on others.

An optimal examination scheduler

AbstractA procedure is described to prepare an exam schedule which meets the following goals: (1) No student should have two exams at the same time. (2) No student should take more than two exams in a day. (3) The number of exam days should be a minimum. (4) The total number of students having two exams in a day is minimum. (5) The number of students having two consecutive exams in a day is a minimum.

Advertisement
Join Copernicus Academic and get access to over 12 million papers authored by 7+ million academics.
Join for free!

Contact us