default search action
Philip J. Bernhard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [c7]Philip J. Bernhard
, Daniel J. Rosenkrantz:
An efficient method for representing and transmitting message patterns on multiprocessor interconnection networks. Fundamental Problems in Computing 2013: 133-162
2000 – 2009
- 2005
- [c6]Philip J. Bernhard, Eric Wilson, Andre Hebert, Kevin L. Fox:
Extracting Data Models from Legacy Database Systems: A Case Study in Reverse Engineering. IKE 2005: 158-164 - 2003
- [c5]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 - [c4]Barry Webster, Philip J. Bernhard:
A Local Search Optimization Algorithm Based on Natural Principles of Gravitation. IKE 2003: 255-261
1990 – 1999
- 1999
- [c3]Philip J. Bernhard, Kevin L. Fox:
An Intelligent, Agent-Based Assistant for Database Performance Tuning. IC-AI 1999: 331-335 - 1994
- [j7]Philip J. Bernhard
A Reduced Test Suite for Protocol Conformance Testing. ACM Trans. Softw. Eng. Methodol. 3(3): 201-220 (1994) - [j6]Philip J. Bernhard
Partitioning Message Patterns for Bundled Omega Networks. IEEE Trans. Parallel Distributed Syst. 5(4): 353-363 (1994) - 1993
- [j5]Philip J. Bernhard
Efficient Sets in Graphs. Discret. Appl. Math. 44(1-3): 99-108 (1993) - [j4]Philip J. Bernhard
Bounds on the Performance of Message Routing Heuristics. IEEE Trans. Computers 42(10): 1253-1256 (1993) - 1991
- [j3]Philip J. Bernhard
An Efficient Method for Representing and Transmitting Message Patterns on Multiprocessor Interconnection Networks. J. Parallel Distributed Comput. 11(1): 72-85 (1991) - [j2]Philip J. Bernhard
Compaction of Message Patterns into Succinct Representations for Multiprocessor Interconnection Networks. J. Parallel Distributed Comput. 12(1): 39-49 (1991) - [j1]Philip J. Bernhard
Using the Dual Path Property of Omega Networks to Obtain Conflict-Free Message Routing. IEEE Trans. Parallel Distributed Syst. 2(4): 503-507 (1991) - [c2]Philip J. Bernhard
Bounds on the performances of message routing heuristics. SPDP 1991: 856-863
1980 – 1989
- 1989
- [c1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: