Marco Maggesi writes:

> how to merge a certain number of ordered lists in a single orederd
> list.

Patricia trees allow very fast merging.

Theory:

   http://www.cs.columbia.edu/~cdo/papers.html#ml98maps

Released O'Caml implementation:

   http://www.lri.fr/~filliatr/software.en.html

Unreleased O'Caml code for computer algebra:

   ftp://heplix.ikp.physik.tu-darmstadt.de/pub/ohl/lotr/

Unfortunately, I currently have no time to work on it, but comments
are welcome.
-- 
Thorsten Ohl, Physics Department, TU Darmstadt -- ohl@hep.tu-darmstadt.de
http://heplix.ikp.physik.tu-darmstadt.de/~ohl/ [<=== PGP public key here]
-------------------
Bug reports: http://caml.inria.fr/bin/caml-bugs  FAQ: http://caml.inria.fr/FAQ/
To unsubscribe, mail caml-list-request@inria.fr  Archives: http://caml.inria.fr