Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection Networks. - Philip J. Bernhard; Harry B. Hunt III; Daniel J. Rosenkrantz (ICPP (1), 1989)

Bounds on the performances of message routing heuristics. - Philip J. Bernhard (SPDP, 1991)

Compaction of Message Patterns into Succinct Representations for Multiprocessor Interconnection Networks. - Philip J. Bernhard; Harry B. Hunt III; Daniel J. Rosenkrantz (J. Parallel Distributed Comput., 1991)

An Efficient Method for Representing and Transmitting Message Patterns on Multiprocessor Interconnection Networks. - Philip J. Bernhard; Daniel J. Rosenkrantz (J. Parallel Distributed Comput., 1991)

Using the Dual Path Property of Omega Networks to Obtain Conflict-Free Message Routing. - Philip J. Bernhard; Daniel J. Rosenkrantz (IEEE Trans. Parallel Distributed Syst., 1991)

Efficient Sets in Graphs. - Philip J. Bernhard; Stephen T. Hedetniemi; David Pokrass Jacobs (Discret. Appl. Math., 1993)

Bounds on the Performance of Message Routing Heuristics. - Philip J. Bernhard (IEEE Trans. Computers, 1993)

A Reduced Test Suite for Protocol Conformance Testing. - Philip J. Bernhard (ACM Trans. Softw. Eng. Methodol., 1994)

Partitioning Message Patterns for Bundled Omega Networks. - Philip J. Bernhard; Daniel J. Rosenkrantz (IEEE Trans. Parallel Distributed Syst., 1994)

An Intelligent, Agent-Based Assistant for Database Performance Tuning. - Philip J. Bernhard; Kevin L. Fox (IC-AI, 1999)

Industrial evaluation of a highly-accurate academic IR system. - Tahia Infantes-Morris; Philip J. Bernhard; Kevin L. Fox; Gary J. Faulkner; Kristina Stripling (CIKM, 2003)

A Local Search Optimization Algorithm Based on Natural Principles of Gravitation. - Barry Webster; Philip J. Bernhard (IKE, 2003)

Extracting Data Models from Legacy Database Systems: A Case Study in Reverse Engineering. - Philip J. Bernhard; Eric Wilson; Andre Hebert; Kevin L. Fox (IKE, 2005)