next up previous
Next: About this document

MARK ALLEN WEISS
School of Computing and Information Sciences
Florida International University
Miami, FL 33199
305-348-2036
weiss@fiu.edu
http://www.cis.fiu.edu/~weiss

Overview

Mark Allen Weiss is a Professor in the School of Computing and Information Sciences at Florida International University in Miami Florida. He received his Bachelor's Degree in Electrical Engineering from The Cooper Union in 1983, and his Ph.D. in Computer Science from Princeton University in 1987, working under Bob Sedgewick. He has been at FIU since 1987, and was promoted to Professor in 1996. His interests include data structures, algorithms, and education, and he is most well-known for his highly-acclaimed Data Structures textbooks, which have been used at hundreds of universities worldwide by hundreds of thousands of students. He is the author of numerous publications in top-rated journals. From 1997-2004 he served as a member of the Advanced Placement Computer Science Development Committee, chairing the committee from 2000-2004.

Education

Ph.D. in Computer Science, Princeton University, 1987.

M. A. in Computer Science, Princeton University, 1985.

M. S. in Electrical Engineering and Computer Science, Princeton University, 1984.

B. E. in Electrical Engineering (Summa Cum Laude), The Cooper Union for the Advancement of Science and Art, 1983. GPA: 3.8/4.0.

Professional Experience

2001 Director, Information Technology Program, Florida International University, Miami, FL.

1996 - present Professor, School of Computer Science, Florida International University, Miami, FL.

1992 - 1996 Associate Professor, School of Computer Science, Florida International University, Miami, FL.

1987 - 1992 Assistant Professor, School of Computer Science, Florida International University, Miami, FL.

Grants and Awards

2007 FIU SCIS Excellence in Service Award.

2005 FIU SCIS Excellence in Teaching Award.

1999 National Science Foundation Grant (NSF), An Institutional Infrastructure in Support of Computer and Software Engineering with Special Focus on Human Computer Interface Research Information Processing, (co-PI, with M. Adjouadi, G. Roig, A. Pasztor, A. Barreto, M. Martinez, and R. Coatie), $1,437,770.

1999 FIU Excellence in Teaching Award.

1994 Defense Information Systems Agency Grant (DISA), Data Structures Using Ada9X, $43,075.

1994 FIU Teaching Incentive Program Award.

1994 FIU Excellence in Research Award.

1990 FIU Outstanding Achievement and Performance Award.

1989 FIU Foundation Summer Research Grant, $10,350.

1988 Supercomputer grant awarded by Florida State University. 16 hours of CYBER-205 time. Estimated net worth $16,000.

1983 RCA Fellowship and Merit Prize to Princeton University.

1981 New York City First Place Winner, Putnam Mathematics Contest.

Books

  1. M. A. Weiss, Data Structures and Algorithm Analysis, Benjamin/Cummings Publishing Co., Redwood City, CA., 1992, 455 pgs. Second edition, 1995, 510 pgs. Estructuras de Datos y Algoritmos (Spanish translation), Addison-Wesley Iberoamericano, 1995, 489 pgs.
  2. M. A. Weiss, Data Structures and Algorithm Analysis in C, Addison Wesley, Reading, MA., 1993, 461 pgs. Second edition, 1997, 512 pgs. Taiwanese Translation, 1997.
  3. M. A. Weiss, Data Structures and Algorithm Analysis in Ada, Benjamin/Cummings Publishing Co., Redwood City, CA., 1993, 480 pgs.
  4. M. A. Weiss, Data Structures and Algorithm Analysis in C++, Addison Wesley, Reading, MA., 1994, 498 pgs. Second edition, 1999, 588 pgs. Chinese Translation, 2003. Taiwanese Translation, 2004. Third edition, 2006, 586 pgs.
  5. M. A. Weiss, Data Structures and Algorithm Analysis in Java, Addison Wesley, Reading, MA., 1999, 542 pgs. Chinese Translation, 2003. Taiwanese Translation, 2004. Third edition, 2006, 546 pgs.
  6. M. A. Weiss, Efficient C Programming: A Practical Approach, Prentice-Hall, Englewood Cliffs, NJ., 1995, 528 pgs.
  7. M. A. Weiss, Data Structures, and Problem Solving with C++, Addison Wesley, Reading, MA., 1996, 820 pgs. Second edition, 2000, 944 pgs.
  8. M. A. Weiss, Data Structures and Problem Solving Using Java, Addison Wesley, Reading, MA., 1998, 780 pgs. Spanish Translation, 2000, 740 pgs. Second edition, 2002, 886 pgs. Third edition, 2006, 926 pgs.
  9. M. A. Weiss, C++ for Java Programmers, Prentice-Hall, Upper Saddle River, NJ, 2004, 280 pgs.

Journals

  1. M. A. Weiss and R. Sedgewick, ``Bad Cases for Shaker Sort,'' Information Processing Letters 28 (1988), 133-136.
  2. M. A. Weiss, R. Sedgewick, E. Hentschel, and A. Pelin, ``Shellsort and the Frobenius Problem,'' Congressus Numerantium 65 (1988), 253-259.
  3. M. A. Weiss, ``A Good Case for Shellsort,'' Congressus Numerantium 73 (1990), 59-61.
  4. M. A. Weiss and R. Sedgewick, ``Tight Lower Bounds for Shellsort,'' Journal of Algorithms 11 (1990), 242-251.
  5. M. A. Weiss and R. Sedgewick, ``More On Shellsort Increment Sequences,'' Information Processing Letters 34 (1990), 267-270.
  6. M. A. Weiss, ``Empirical Study of the Expected Running Time of Shellsort,'' Computer Journal 34 (1991), 88-91.
  7. Y. Ding and M. A. Weiss, ``Best Case Lower Bounds for Heapsort,'' Computing 49 (1992), 1-9.
  8. M. A. Weiss, ``On Finding the Height of a Binary Search Tree,'' Computer Journal 36 (1993), 280-281.
  9. Y. Ding and M. A. Weiss, ``The Relaxed Min-Max Heap: A Mergeable Double-Ended Priority Queue,'' Acta Informatica 30 (1993) 215-231.
  10. Y. Ding and M. A. Weiss, ``On the Complexity of Building an Interval Heap,'' Information Processing Letters 50 (1994), 143-144.
  11. 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.
  12. 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).
  13. 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.
  14. M. A. Weiss, ``Shellsort with a Constant Number of Increments,'' Algorithmica, 16 (1996), 649-654.
  15. M. A. Weiss, ``Experiences Teaching Data Structures with Java,'' SIGCSE Bulletin (refereed proceedings of the 28th SIGCSE Technical Symposium), (1997), 164-168.
  16. O. Astrachan, G. Chapman, S. Rodger, and M. A. Weiss, ``The Reasoning for The Advanced Placement C++ Subset,'' SIGCSE Bulletin (1997), 62-65.
  17. S-C. 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, 167 (2004), 41-61.

Chapters in Books

  1. B. Feild, G. Fraguio, J. K. Navlakha, and M. A. Weiss, ``Expert Systems and Music: Translating Piano Music into Guitar Chords,'' Advances in Artificial Intelligence Research, Volume II, JAI Press, 1992.
  2. M. A. Weiss, ``STL,'' Handbook of Data Structures and Applications, CRC Press, 2004.

Springer-Verlag Lecture Notes Series

  1. M. A. Weiss and R. Sedgewick, ``Tight Lower Bounds for Shellsort (extended abstract),'' Proceedings of the Scandinavian Workshop on Algorithms and Theory, Halmstad Sweden, July 1988, Springer-Verlag Lecture Notes #318, 255-262.
  2. M. A. Weiss and J. K. Navlakha, ``The Distribution of Keys in a Binary Heap,'' Proceedings of the Workshop on Algorithms and Data Structures, Ottawa Canada, Aug. 1989, Springer-Verlag Lecture Notes #382, 510-516.
  3. 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, Montreal Canada, Aug. 1993, Springer-Verlag Lecture Notes #709, 303-314.
  4. C. Orji, J. Solworth, and M. A. Weiss, ``Improved Traditional Mirrors,'' Proceedings of the Fourth International Conference on Foundations of Data Organization and Algorithms, Chicago Illinois, Oct. 1993, Springer-Verlag Lecture Notes #730, 329-344.

Compact Disk Publications

  1. M. A. Weiss, Data Structures and Algorithm Analysis in C, published as part of the Dr. Dobbs CD on Essential Algorithms.
  2. M. A. Weiss, Operating Systems, article published as part of Microsoft's Encarta Encyclopedia.

Papers in Conference Proceedings

  1. A. Pelin and M. A. Weiss, ``An Expert System for Automatic Generation of Sorting Programs,'' Proceedings of the Twenty-sixth ACM Southeastern Conference, Mobile, Alabama, Apr. 1988.
  2. X. Cui and M. A. Weiss, ``Genetic Algorithm for the Clique Problem,'' Proceedings of the Fourth Annual Florida Artificial Intelligence Research Symposium, Orlando, Florida, Apr. 1991.
  3. W. Sun, N. Prabhakaran, M. A. Weiss, and X. Zhou, ``Automatic Identification of Semantic Integrity Constraints in Object-Oriented Databases,'' 1991 IEEE International Conference on System, Man, and Cybernetics, Charlottesville, Virginia, Oct. 1991.
  4. S. Chen, N. Rishe, X. Wang, and M. A. Weiss, ``A User-Friendly Multimedia System for Querying and Visualizing of Geographic Data,'' Fourth World Conference on Systemics, Cybernetics, and Informatics, Orlando, Florida, Jan. 2000.
  5. S. Chen, X. Wang, N. Rishe, and M. A. Weiss, ``A High-Performance Web-Based System Design for Spatial Data Access,'' Eighth ACM Symposium on Advances in Geographic Information Systems, Washington, D.C., Nov. 2000.

Professional Activities

University Activities




next up previous
Next: About this document

Mark Allen Weiss
Thu Feb 21 22:50:23 EST 2008