Saad Mneimneh, A combinatorial/probabilistic approach to evolution based on counting synonymous and non-synonymous substitutions on trees, in preparation

Saad Mneimneh, An interplay of harmonic numbers and a uniform random walk: the emergence of a power law and applications to the evolution of low complexity sequences, in preparation.

Saad Mneimneh, Online tossing of colored balls in bins with applications load balancing and routing, in preparation.

Saad Mneimneh, Throughput, Reordering, and Starvation in load balanced switches: The impossibility of load balancing, in preparation.

Saad Mneimneh, Crossing over: Markov meets Mendel, to appear in PLoS Computational Biology Education.

Saad Mneimneh, On the approximation of optimal structures for RNA-RNA interaction (extended version), IEEE/ACM Transactions on Computational Biology and Bioinformatics 2009.

Xianfa Xie, Juan Coronado, Saad Mneimneh, Susan L. Epstein, Weigang Qiu, Peter N. Lipke, On the evolution of fungal cell walls, IV international Conference on Molecular Mechanisms of Fungal Cell Wall Biogenesis, Warsaw 2009.

Saad Mneimneh, Matching from the First Iteration: An Iterative Switching Algorithm for an Input Queued Switch, IEEE/ACM Transactions on Networking 16(1), February 2008.

Saad Mneimneh, RNA-RNA interaction algorithms, UNT workshop on Algorithms, Combinatorics, and Geometry, Nov-Dec, 2007.

Juan Coronado, Saad Mneimneh, Susan Epstein, Wei-Gang Qiu, Peter Lipke, Conserved processes and lineage-specific proteins in cell wall evolution, Eukaryotic Cell, December 2007, pp. 2269-2277.

Saad Mneimneh, How to waste 2/3 of the throughput of a switch: a tight characterization of load balancing algorithms that do not split, IEEE HPSR 2007, New York NY.

Saad Mneimneh, On the approximation of optimal structures for RNA-RNA interaction , CSB 2006 poster, Stanford University.

Saad Mneimneh, RNA-RNA interaction is NP-complete and some approximation algorithms, unpublished manuscript.
Based on SMU CSE technical report 04-CSE-03, july 2004.
This research formulates the RNA-RNA interaction problem and proves that it is NP complete and gives some basic approximation algorithms for it.
Talks were given at SMU on Sept. 22, 2004, at AUB (American University of Beirut) on Dec. 23, 2004 and Apr. 7, 2005, and at UNT on Feb. 11, 2005.
Updated talk was given at the Graduate Center of CUNY on Dec. 15, 2005.

Saad Mneimneh, Franck Quessette, Linear complexity algorithms for maximum advance deflection routing in some networks, IEEE workshop on High Performance Switching and Routing HPSR 2006, Poznan, Poland.

Saad Mneimneh, Load balancing in a switch without buffers, IEEE workshop on High Performance Switching and Routing HPSR 2006, Poznan, Poland.

Saad Mneimneh, An iterative switching algorithm with (possibly) one iteration, IEEE international symposium on Network Computing and Applications NCA 2004, Cambridge, MA.

Saad Mneimneh, Kai-Yeung Siu, On achieving throughput in an input queued switch, IEEE/ACM Transactions on Networking 11(5), October 2003.

Saad Mneimneh et al, Switching using parallel input-output queued switches with no Speedup, IEEE/ACM Transactions on Networking 10(5), October 2002.
Preliminary version also appears in IEEE workshop on High Performance Switching and Routing HPSR 2001, Dallas TX, USA.

Saad Mneimneh, Kai-Yeung Siu, Scheduling unsplittable flows using parallel switches, IEEE International Conference on Communications ICC 2002, New York, NY.

Saad Mneimneh, Algorithmic aspects of high speed switching, MIT Thesis 2002.

Rabih Zbib, {Saad Mneimneh} et al, The Trierarch Trigger Architecture}, Proceedings of the Advanced Telecommunication and Information Distribution Research Program ATIRP (DoD/ARL), February 1999.

Judson Harward, Albert Bailey, Issam Bazzi, {Saad Mneimneh} et al, An Improved Hierarchical Caching Architecture for Low Bandwidth Networks, Proceedings of the Advanced Telecommunication and Information Distribution Research Program ATIRP (DoD/ARL), February 1998.