Education:

• BS., Mathematics and Computer Science, UIC.
• MS., Electrical Engineering and Computer Science, UIC.
• PhD., Computer Science, UIC.

Professional Organizations:

• American Mathematical Society (AMS)
• Association for Computing Machinery (ACM)
• Institute for Electrical and Electronic Engineers (IEEE)
• IEEE Computer Society
• Mathematical Association of America (MAA)
• Phi Mu Alpha Sinphonia

Research Interests:

• Applied Graph Theory
• Cryptology and Cryptography
• Fuzzy Logic and Fuzzy Sets
• High Performance Computer Architectures
• Integrated Network Barriers
• Packet Switching and Routing

Other Interests:

• Discrete Device Electronics
• Music
• Recreational Mathematics

Reagan, Bryan B. Efficient Implementation of Partial Integrated Network Barriers. Diss. University of Illinois at Chicago, 2004. Chicago, Illinois.
           http://parsys.cs.uic.edu/~reagan/research/BBRPhDThesis4b.pdf

Reagan, Bryan B. Parallelism and Cost in Tree Algorithms. Thesis University of Illinois at Chicago, 1995. Chicago, Illinois.
           http://parsys.cs.uic.edu/~reagan/research/BBRMSThesis.pdf

Zhang, Weining, Clement Yu, Bryan Reagan, and Hiroshi Nakajima. “Context-dependent Interpretations of Linguistic Terns in Fuzzy Relational Databases.” Proceedings of the Eleventh International Conference on Data Engineering. Taipei, Taiwan: IEEE, 1995. 139-146.

Solworth, Jon A. and Bryan Reagan. “Parallelizing Tree Algorithms: Overhead vs. Parallelism.” Proceedings of the Seventh International Workshop on Languages and Compilers for Parallel Computing. Ithaca, New York: Springer-Verlag, 1995. 438-452.

Solworth, Jon A. and Bryan Reagan. “Arbitrary Order Operations on Trees.” Proceedings of the Sixth International Workshop on Languages and Compilers for Parallel Computing. Portland, Oregon: Springer-Verlag, 1994. 21-36.