LAUR Repository

Lebanese American University Repository (LAUR)

LAUR is an Open-Access digital archive for the scholarly output of the Lebanese American University community. Its mission is to preserve, showcase, and provide open access and international exposure to scholarship and research of LAU faculty, staff and graduate students. It also serves as an archive of historical and other materials that support the University's academic mission. LAUR objectives are to collect selected materials in a centralized, searchable, and highly visible location in order to maximize their access and visibility.

Depositing materials in LAUR is voluntary for faculty which are encouraged to make their work openly accessible to LAU community and the rest of the world while graduate students are required to deposit one print and one digital copy of their final master's thesis .

The repository currently includes all graduate students theses, and will include LAU's research reports, journal articles, book chapters, digital images, and any data which can be easily harvested by search engines such as Google. All theses published after 2003 are Open Access, while those published before 2003 are accessible via student authentication.



Communities in LAUR

Recently Added

  • MAX-Sense 
    Khazen, G.; Mouawad, M.; Riachi, I.; Abou-Naccoul, N.; Artail, H. (IEEE, )
    In this paper we are proposing a new distributed system architecture to address the problem of very large scale sensor network monitoring. By dynamically aggregating and processing data from sensor networks, databases and ...
  • Hashwa, Fuad; Mhanna, Elias (Springer, )
    Olive oil mill wastewater (OMW), known in Lebanon as Zibar, is one of the two by-products obtained during olive oil extraction. OMW represents a serious environmental pollution problem especially for underground and surface ...
  • Abu-Khzam, Faisal N.; Makarian, Chrisitne; Li, Shouwei; Podlipyan, Pavel (Springer, )
    We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) with n gates and an underlying graph of bounded genus k. Our algorithm generalizes a recent result by Limaye et al. who showed ...
  • Abu-Khzam, F.N.; Langston, M.A. (IEEE, )
  • Abu-Khzam, Faisal N.; Lehrter, Jeanne M.; Bouldin, Donald W.; Langston, Micheal A.; Peterson, Gregory D.
    Lehrter, J. M., Abu-Khzam, F. N., Bouldin, D. W., Langston, M. A., & Peterson, G. D. (2002, November). On Special-purpose Hardware Clusters for High-performance Computational Grids. In IASTED PDCS (pp. 1-5).

View more