Authors

Mr Lluís Alemany-Puig is a Ph. D. student at Universitat Politècnica de Catalunya (UPC), under the supervision of Professor Ferrer-i-Cancho. Mr Alemany-Puig started developing the library during his Master’s Thesis by contributing algorithms to efficiently calculate the number of edge crossings and their statistical properties in random linear arrangements. He is the main developer and contributor to the library.

  • Research Gate profile
  • Email address:

Prof. Juan Luis Esteban is a member of the Computer Science Department at Universitat Politècnica de Catalunya (UPC). His main field of research is Proof Complexity and, recently, Boolean Satisfiability. However, Prof. Esteban has made magnificent contributions to this project by implementing algorithms to calculate minimum linear arrangements of trees.

  • Research Gate profile
  • Email address:

Prof. Ramon Ferrer-i-Cancho is the principal investigator of the LAL project. He pioneered research on Quantitative Dependency Syntax and has devoted his entire career to this field; the code of many of his past publications (with other members of the LAL team) is now available in LAL. Like his peers, he is also a member of the Computer Science Department at Universitat Politècnica de Catalunya (UPC). Besides his contribution to the understanding of languages, he leads and supervises the development of LAL while contributing with invaluable ideas for its design and implementation.

  • Research Gate profile
  • Email address: