Bernhard, Philip

Associate Professor
Computer Sciences and Cybersecurity

Educational Background

B.A. State University of New York at Oswego
M.S. State University of New York at Albany
Ph.D. State University of New York at Albany

Current Courses

CSE 1001 - Software Development 1
CSE 4020/5260 - Database Systems
CSE 4285 - Game Design
CSE 4083/5210 - Formal Languages
CSE 5660 - Database Management Systems

Professional Experience

Aug. 1998 to present: Associate Professor, Department of Computer Science, Florida Institute of Technology, Melbourne, FL.

From 1995-1998, Dr. Bernhard worked as a software engineer for Harris Information Systems Division (ISD) in Melbourne, Fla. While there, he worked on a variety of research and development projects involving databases, performance tuning and natural language processing. From 1993-1995 he was a software engineer on the CORE program for NASA at Harris Space Systems Corporation in Rockledge, Fla. From 1992-1993 he was a senior instructor for P.P. Texel of Eatontown, JF. From 1998-1992 he was a faculty member in the Computer Science Department at Clemson University in South Carolina.

Current Research

Primary research area is database systems. Specific interests include spatial databases, NoSQL, big data, database benchmarking, and performance tuning. Additional interests include theory of computation, and computational complexity.

Selected Publications

Bernhard, P.J., Faulkner, G., and Frieder, O., XML Strategies for Legacy Database Search, IEEE IT Professional, March/April 2003.

Bernhard, P.J. and D.J. Rosenkrantz. 1994. Partitioning Message Patterns for Bundled Omega Networks. IEEE Transactions on Parallel and Distributed Systems, Vol. 5, No. 4, pp. 353-363.

Bernhard, P.J. 1994. A Reduced Test Suite for Protocol Conformance Testing. ACM Transactions On Software Engineering and Methodology, Vol. 3, No. 3, pp.201-220.

Bernhard, P.J. 1993. Bounds on the Performance of Message Routing Heuristics. IEEE Transactions On Computers, Vol. 42, No. 10, pp. 1253-1256.

Bernhard, P.J., D.P. Jacobs. and S.T. Hedetniemi. 1993. Efficient Sets in Graphs. Discrete Applied Math, 44, pp. 99-108.

Bernhard, P.J. and D.J. Rosenkrantz. 1991. An Efficient Method for Representing and Transmitting Message Patterns on Multiprocessor Interconnection Networks. Journal of Parallel and Distributed Computing, Vol. 11, No. 1, pp. 72-85.

Bernhard, P.J., H.B. Hunt III and D.J. Rosenkrantz. 1991. Compaction sof Message Patterns into Succinct Representations for Multiprocessor Interconnection Networks. Journal of Parallel and Distributed Computing, Vol. 12, No. 1, pp. 39-49.

Bernhard, P.J. and D.J. Rosenkrantz. 1991. Using the Dual Path Property of Omega Networks to Obtain Conflict-free Message Routing. IEEE Transactions on Parallel and Distributed Systems, Vol. 2, No. 4, pp. 503-507.