Philip J. Bernhard

According to our database, Philip J. Bernhard authored at least 13 papers between 1989 and 2005.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2005

Extracting Data Models from Legacy Database Systems: A Case Study in Reverse Engineering.

Philip J. Bernhard, Eric Wilson, Andre Hebert, Kevin L. Fox

Proceedings of The 2005 International Conference on Information and Knowledge Engineering, 2005

2003

A Local Search Optimization Algorithm Based on Natural Principles of Gravitation.

Barry Webster, Philip J. Bernhard

Proceedings of the International Conference on Information and Knowledge Engineering. IKE'03, June 23, 2003

Industrial evaluation of a highly-accurate academic IR system.

Tahia Infantes-Morris, Philip J. Bernhard, Kevin L. Fox, Gary J. Faulkner, Kristina Stripling

Proceedings of the 2003 ACM CIKM International Conference on Information and Knowledge Management, 2003

1999

An Intelligent, Agent-Based Assistant for Database Performance Tuning.

Philip J. Bernhard, Kevin L. Fox

Proceedings of the International Conference on Artificial Intelligence, 1999

1994

Partitioning Message Patterns for Bundled Omega Networks.

Philip J. Bernhard, Daniel J. Rosenkrantz

IEEE Trans. Parallel Distributed Syst., 1994

A Reduced Test Suite for Protocol Conformance Testing.

Philip J. Bernhard

ACM Trans. Softw. Eng. Methodol., 1994

1993

Bounds on the Performance of Message Routing Heuristics.

Philip J. Bernhard

IEEE Trans. Computers, 1993

Efficient Sets in Graphs.

Philip J. Bernhard, Stephen T. Hedetniemi, David Pokrass Jacobs

Discret. Appl. Math., 1993

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

An Efficient Method for Representing and Transmitting Message Patterns on Multiprocessor Interconnection Networks.

Philip J. Bernhard, Daniel J. Rosenkrantz

J. Parallel Distributed Comput., 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

Bounds on the performances of message routing heuristics.

Philip J. Bernhard

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

1989

Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection Networks.

Philip J. Bernhard, Harry B. Hunt III, Daniel J. Rosenkrantz

Proceedings of the International Conference on Parallel Processing, 1989