Mohamed Aly

Dept. of Computer Science
210 South Bouquet Street
Sennott Square Building, Room 6406
University of Pittsburgh
Pittsburgh , PA 15260

E-mail: maly (AT)



I received my PhD from the Department of Computer Science at the University of Pittsburgh. My PhD advisers were Prof. Kirk Pruhs and Prof. Panos K. Chrysanthis. My thesis can be found here.

During my PhD, I interned at the research labs of Google Inc from February to July, 2007. Starting February 2008, I joined Yahoo! Inc. as a software engineer in the Yahoo! Open Strategy platform.

I received my bachelor degree from the Computer Science and Automatic Control Department, Alexandria University, Egypt in 2002. After graduation, I worked as a software engineer, then, as a systems administrator in Bibliotheca Alexandrina till July 2004.

Resume: pdf.

Research Interests

I am interested in solving theoretical and applied problems arising in sensor and ad-hoc networks, communication networks, and computer systems. In general, my research style is to try to formalize optimization problems capturing the essence of real-world problems, find policies that are optimal for these problems, and finally use experimentation to validate the performance of the discovered policy in as real of a setting as possible. My current research lies in designing energy-efficient data management protocols for next-generation large-scale sensor networks.



1.    STDCS: Spatio-Temporal Data-Centric Storage for Real-Time Sensor Applications”: (with Anandha Gopalan, Jerry Zhao, and Adel Youssef). In Proc. of the 5th IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON’08), 2008. (Slides)

2.    Video Suggestion and Discovery for Youtube: Taking Random Walks through the View Graph”: (with Shumeet Baluja, Rohan Seth, D. Sivakumar, Yushi Jing, Jay Yagnik, Shankar Kumar and Deepak Ravichandran). In Proc. of the 17th International World Wide Web Conference (WWW’08), 2008.

3.    “Load-Balancing Query Hotspots for Next-Generation Sensornets”:  (with Anandha Gopalan and Adel Youssef).  In Proc. of the 50th IEEE Global Communications conference (GLOBECOM’07), 2007.

4.     TOLB: A Traffic-Oblivious Load-Balancing Protocol for Next-Generation Sensornets": (with Anandha Gopalan). In Proc. of the 6th International Conference on AD-HOC Networks & Wireless (AdHoc-Now’07), 2007.

5.    Online Packet Admission and Oblivious Routing in Sensor Networks”:  (with John Augustine). In Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC’06), 2006.  (Slides)

6.    KDDCS: A Load-Balanced In-Network Data-Centric Storage Scheme in Sensor Network”: (with Panos K. Chrysanthis and Kirk Pruhs).In Proc. of the 15th ACM Conference on Information and Knowledge Management (CIKM’06), 2006 (Acceptance ratio 15%). (Slides)

7.    "Decomposing Data-Centric Storage Query Hot-spots in Sensor Networks":  (with Panos K. Chrysanthis and Kirk Pruhs). In Proc. of the 3rd Annual International Conference on Mobile and Ubiquitous Systems: Networks and Services (MOBIQUITOUS’06), 2006  (Acceptance ratio 17%).  (Slides)

8.    "On the Coverage Problem for Myopic Sensors":  In Proc. of the 1st IEEE International Conference on Wireless Networks, Communications, and Mobile Computing (WIRELESSCOM’05), 2005 (with Kirk Pruhs, Taieb Znati, and Brady Hunsaker). (Slides)


9.    "Zone Sharing: A Hot-Spots Decomposition Scheme for Data-Centric Storage in Sensor Networks": In Proc. of the 2nd International VLDB Workshop on Data Management for Sensor Networks (DMSN’05), (with Nicholas Morsillo, Panos K. Chrysanthis, and Kirk Pruhs).  (Slides).

Working Papers:

10.  “Load-Balanced Data Collection for Next-Generation Sensornets”: In preparation.

11.  “Throughput Competitive Scheduling with Session Guarantees in Packet Networks”: (with Mahmoud Elhaddad). In preparation.


High-Speed WANs, Computer Architecture, Research Topics in Computer Science (I and II), Principles of Database Systems, Design and Analysis of Algorithms, Approximation Algorithms (I and II) (CMU), Advanced Topics in Data Management, Randomness and Computation, Graph Theory (CMU), Networks and Matchings (CMU), Linear Programming (CMU), and Convex Polytopes  (CMU).

TA Work

Previous: CS 1510: Algorithms Design and Analysis (Fall 05), CS 1501: Algorithms Implementation (Spring 06, Fall 06).



Mohamed Aly

Last modified: March 31, 2009