Honors and Awards

• AAAS Fellow (2012)
• FIU Top Scholar Award (2012)
• ACM Distinguished Educator (2011)
• FIU SCIS Excellence in Service Award (2007)
• FIU SCIS Excellence in Teaching Award (2005)
• FIU University Excellence in Teaching Award (1999)
• FIU University Excellence in Research Award (1994)
• FIU Teaching Incentive Program Award (1994)
• FIU Outstanding Achievement and Performance Award (1990)
• RCA Fellowship and Merit Prize to Princeton University (1983)
• New York City First Place Winner, Putnam Mathematics Contest (1981)
• Member of the Advanced Placement (AP) Computer Science Development Committee; Chairperson of the Committee (1997-2004)
• Member of the AD-Hoc Committee on the Future of the Advanced placement Examination. (1999-2000)
• Member of the Ad-Hoc committee that advised the college Board on how to incorporate C++ in the Advanced Placement Exam (1995-1996)

Professional Activities

• Member (1997-2004) of the Advanced Placement Computer Science Development Committee; Chairperson of the committee (2000-2004).
• Member (1999-2000) of the Ad-Hoc Committee on the Future of the Advanced Placement Examination.
• Member (1995-1996) of the Ad-Hoc Committee that advised the College Board on how to incorporate C++ into the Advanced Placement Exam.
• Columnist (1992-1997) for the ACM SIGACT News. The Journal Backlog Report and Technical Report Column were regularly appearing features.

Professional Experience

Publications

• M. A. Weiss, Data Structures and Algorithm Analysis 1st ed 1992, 2nd ed 1995 in C 1st ed 1993, 2nd ed 1997 in Ada 1994 in C++ 1st ed 1994, 2nd ed 1999, 3rd ed 2006, in Java 1st ed 1999, 2nd ed 2006, 3rd 2011 (in press)
• M. A Weiss, Data Structures and Problem Solving in C++ 1st ed 1996, 2nd ed 2000 in Java 1st ed 1998, 2nd ed 2002, 3rd ed 2006, 4th ed 2010
• M. A. Weiss, C++ for Java Programmers, 2004.
• M. A. Weiss, Efficient C Programming: A Practical Approach, 1995.

• M. A. Weiss, "STL," Handbook of Data Structures and Applications, CRC Press, 2004.
• M. A. Weiss, "Parameter Passing," Encyclopedia of Computer Science and Engineering, Wiley, 2009.

• M. A. Weiss and R. Sedgewick, ``Tight Lower Bounds for Shellsort,''Journal of Algorithms 11 (1990), 242-251.
• M. A. Weiss, ``Empirical Study of the Expected Running Time of Shellsort,'' Computer Journal 34 (1991), 88-91.
• Y. Ding and M. A. Weiss, ``The k-d Heap: An Efficient Multi-dimensional Priority Queue,'' Proceedings of the Third Workshop on Algorithms and Data Structures, Springer-Verlag Lecture Notes #709 (1993), 303-314.
• Y. Ding and M. A. Weiss, ``The Relaxed Min-Max Heap: A Mergeable Double-Ended Priority Queue,'' Acta Informatica 30 (1993) 215-231.
• W. Sun and M. A. Weiss, ``An Improved Algorithm for Implication Testing Involving Arithmetic Inequalities,'' IEEE Transactions on Knowledge and Data Engineering 6 (1994), 997-1001.
• S. Guo, W. Sun, and M. A. Weiss, ``On Solving Satisfiability, Implication, and Equivalence Problems Involving Conjunctive Inequalities in Database Systems,'' IEEE Transactions on Knowledge and Data Engineering 8 (1996), 604-616.
• S. Guo, W. Sun, and M. A. Weiss, ``Solving Satisfiability and Implication Problems in Database Systems,'' ACM Transactions on Database Systems 21 (1996), 270-293.
• M. A. Weiss, ``Experiences Teaching Data Structures with Java,''Proceedings of the Twenty-Eighth Annual SIGCSE Technical Symposium (1997), 164-168.
• O. Astrachan, G. Chapman, S. Rodger, and M. A. Weiss, ``The Reasoning for The Advanced Placement C++ Subset,'' SIGCSE Bulletin 29 (1997).
• S. Chen, X. Wang, N. Rishe, and M. A. Weiss, ``A Web-Based Spatial Data Access System Using Semantic R-Trees," Information Science: An International Journal, (2004), 41-61.