![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Philip J. Bernhard Tahia Infantes-Morris , Philip J. Bernhard, Kevin L. Fox , Gary J. Faulkner , Kristina Stripling : Industrial evaluation of a highly-accurate academic IR system. CIKM 2003 : 500-503 Barry Webster , Philip J. Bernhard: A Local Search Optimization Algorithm Based on Natural Principles of Gravitation. IKE 2003 : 255-261 Philip J. Bernhard, Kevin L. Fox : An Intelligent, Agent-Based Assistant for Database Performance Tuning. IC-AI 1999 : 331-335 Philip J. Bernhard: A Reduced Test Suite for Protocol Conformance Testing. ACM Trans. Softw. Eng. Methodol. 3 (3): 201-220 (1994) Philip J. Bernhard, Daniel J. Rosenkrantz : Partitioning Message Patterns for Bundled Omega Networks. IEEE Trans. Parallel Distrib. Syst. 5 (4): 353-363 (1994) Philip J. Bernhard, Stephen T. Hedetniemi , David Pokrass Jacobs : Efficient Sets in Graphs. Discrete Applied Mathematics 44 (1-3): 99-108 (1993) Philip J. Bernhard: Bounds on the Performance of Message Routing Heuristics. IEEE Trans. Computers 42 (10): 1253-1256 (1993) Philip J. Bernhard, Daniel J. Rosenkrantz : Using the Dual Path Property of Omega Networks to Obtain Conflict-Free Message Routing. IEEE Trans. Parallel Distrib. Syst. 2 (4): 503-507 (1991) Philip J. Bernhard, Daniel J. Rosenkrantz : An Efficient Method for Representing and Transmitting Message Patterns on Multiprocessor Interconnection Networks. J. Parallel Distrib. Comput. 11 (1): 72-85 (1991) Philip J. Bernhard, Harry B. Hunt III , Daniel J. Rosenkrantz : Compaction of Message Patterns into Succinct Representations for Multiprocessor Interconnection Networks. J. Parallel Distrib. Comput. 12 (1): 39-49 (1991) Philip J. Bernhard, Harry B. Hunt III , Daniel J. Rosenkrantz : Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection Networks. ICPP (1) 1989 : 111-115 1 [ 11 ] 2 [ 9 ] [ 11 ] 3 [ 6 ] 4 [ 1 ] [ 2 ] 5 [ 11 ] 6 [ 6 ] 7 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 7 ] 8 [ 11 ] 9 [ 10 ] ![]() ©2004 Association for Computing Machinery |