Остановите войну!
for scientists:
default search action
Vance Faber
- > Home > Persons > Vance Faber
Publications
- 1996
- [j14]Vance Faber, Wayne Joubert, Emanuel Knill, Thomas A. Manteuffel:
Minimal Residual Method Stronger than Polynomial Preconditioning. SIAM J. Matrix Anal. Appl. 17(4): 707-729 (1996) - 1995
- [j13]Tony L. Brewster, Michael J. Dinneen, Vance Faber:
A computational attack on the conjectures of Graffiti: New counterexamples and proofs. Discret. Math. 147(1-3): 35-55 (1995) - 1994
- [j10]Fan R. K. Chung, Vance Faber, Thomas A. Manteuffel:
An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian. SIAM J. Discret. Math. 7(3): 443-457 (1994) - [c3]William Y. C. Chen, Vance Faber, Emanuel Knill:
Restricted routing and wide diameter of the cycle prefix network. Interconnection Networks and Mapping and Scheduling Parallel Computations 1994: 31-46 - 1993
- [j9]Vance Faber, James W. Moore, William Y. C. Chen:
Cycle prefix digraphs for symmetric interconnection networks. Networks 23(7): 641-649 (1993) - 1992
- [j8]Lowell Campbell, Gunnar E. Carlsson, Michael J. Dinneen, Vance Faber, Michael R. Fellows, Michael A. Langston, James W. Moore, Andrew P. Mullhaupt, Harlan B. Sexton:
Small Diameter Symmetric Networks from Linear Groups. IEEE Trans. Computers 41(2): 218-220 (1992) - 1991
- [c2]Michael J. Dinneen, Michael R. Fellows, Vance Faber:
Algebraic Constructions of Efficient Broadcast Networks. AAECC 1991: 152-158 - 1988
- [j7]Olaf M. Lubeck, Vance Faber:
Modeling the performance of hypercubes: a case study using the particle-in-cell application. Parallel Comput. 9(1): 37-52 (1988) - 1987
- [j6]Vance Faber, Olaf M. Lubeck, Andrew B. White Jr.:
Comments on the paper "parallel efficiency can be greater than unity" . Parallel Comput. 4(2): 209-210 (1987) - 1986
- [j5]Vance Faber, Olaf M. Lubeck, Andrew B. White Jr.:
Superlinear speedup of an efficient sequential algorithm is not possible. Parallel Comput. 3(3): 259-260 (1986) - 1984
- [j4]Andrzej Ehrenfeucht, Vance Faber, Hal A. Kierstead:
A new method of proving theorems on chromatic index. Discret. Math. 52(2-3): 159-164 (1984) - 1973
- [j1]Vance Faber, Jan Mycielski:
Graphs with valency k, edge connectivity k, chromatic index k + 1 and arbitrary girth. Discret. Math. 4(4): 339-345 (1973)
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 2023-10-22 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint