Vance Faber

According to our database, Vance Faber authored at least 40 papers between 1973 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of one.

2022

On the Forsythe conjecture.

Vance Faber, Jörg Liesen, Petr Tichý

CoRR, 2022

Digraph Networks and Groupoids.

Nyumbu Chishwashwa, Vance Faber, Noah Streib

CoRR, 2022

2020

Bounds and algorithms for graph trusses.

Paul Burkhardt, Vance Faber, David G. Harris

J. Graph Algorithms Appl., 2020

2019

Edge-coloring linear hypergraphs with medium-sized edges.

Vance Faber, David G. Harris

Random Struct. Algorithms, 2019

2018

Bounds and algorithms for k-truss.

Paul Burkhardt, Vance Faber, David G. Harris

CoRR, 2018

2014

Transpose on vertex symmetric digraphs.

Vance Faber

CoRR, 2014

2013

Properties of Worst-Case GMRES.

Vance Faber, Jörg Liesen, Petr Tichý

SIAM J. Matrix Anal. Appl., 2013

Global communication algorithms for Cayley graphs

Vance Faber

CoRR, 2013

2012

Livelock free routing schemes

Vance Faber

CoRR, 2012

Global sum on symmetric networks

Vance Faber

CoRR, 2012

2011

Review of chromatic graph theory by Gary Chartrand and Ping Zhang.

Vance Faber

SIGACT News, 2011

Multi-scale correlation structure of gene expression in the brain.

Michael Hawrylycz, Lydia Ng, Damon Page, John Morris, Christopher Lau, Sky Faber, Vance Faber, Susan Sunkin, Vilas Menon, Ed Lein, Allan Jones

Neural Networks, 2011

2010

On Chebyshev Polynomials of Matrices.

Vance Faber, Jörg Liesen, Petr Tichý

SIAM J. Matrix Anal. Appl., 2010

2009

On orthogonal reduction to Hessenberg form with small bandwidth.

Vance Faber, Jörg Liesen, Petr Tichý

Numer. Algorithms, 2009

2008

The Faber-Manteuffel Theorem for Linear Operators.

Vance Faber, Jörg Liesen, Petr Tichý

SIAM J. Numer. Anal., 2008

2004

The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case.

Randall Dougherty, Vance Faber

SIAM J. Discret. Math., 2004

Unflippable Tetrahedral Complexes.

Randall Dougherty, Vance Faber, Michael Murphy

Discret. Comput. Geom., 2004

2003

Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry.

Christopher L. Barrett, Achla Marathe, Madhav V. Marathe, Doug Cook, Gregory Hicks, Vance Faber, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist

J. Graph Algorithms Appl., 2003

2001

Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry.

Christopher L. Barrett, Doug Cook, Gregory Hicks, Vance Faber, Achla Marathe, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist

Proceedings of the Algorithm Engineering, 2001

High-Quality Polygonal Contour Approximation Based on Relaxation.

Artem Mikheev, Luc Vincent, Vance Faber

Proceedings of the 6th International Conference on Document Analysis and Recognition (ICDAR 2001), 2001

1999

Centroidal Voronoi Tessellations: Applications and Algorithms.

Qiang Du, Vance Faber, Max D. Gunzburger

SIAM Rev., 1999

1998

Low-Bandwidth Routing and Electrical Power Networks.

Doug Cook, Vance Faber, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1996

Minimal Residual Method Stronger than Polynomial Preconditioning.

Vance Faber, Wayne Joubert, Emanuel Knill, Thomas A. Manteuffel

SIAM J. Matrix Anal. Appl., 1996

1995

Perfect reconstruction with critically sampled filter banks and linear boundary conditions.

Jonathan N. Bradley, Vance Faber

IEEE Trans. Signal Process., 1995

The Diameter and Average Distance of Supertoroidal Networks.

Richard N. Draper, Vance Faber

J. Parallel Distributed Comput., 1995

A computational attack on the conjectures of Graffiti: New counterexamples and proofs.

Tony L. Brewster, Michael J. Dinneen, Vance Faber

Discret. Math., 1995

1994

An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian.

Fan R. K. Chung, Vance Faber, Thomas A. Manteuffel

SIAM J. Discret. Math., 1994

Restricted routing and wide diameter of the cycle prefix network.

William Y. C. Chen, Vance Faber, Emanuel Knill

Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994

1993

Cycle prefix digraphs for symmetric interconnection networks.

Vance Faber, James W. Moore, William Y. C. Chen

Networks, 1993

1992

Small Diameter Symmetric Networks from Linear Groups.

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

IEEE Trans. Computers, 1992

1991

Algebraic Constructions of Efficient Broadcast Networks.

Michael J. Dinneen, Michael R. Fellows, Vance Faber

Proceedings of the Applied Algebra, 1991

1988

Modeling the performance of hypercubes: a case study using the particle-in-cell application.

Olaf M. Lubeck, Vance Faber

Parallel Comput., 1988

1987

Comments on the paper "parallel efficiency can be greater than unity" .

Vance Faber, Olaf M. Lubeck, Andrew B. White Jr.

Parallel Comput., 1987

Graph Theory Plus Group Theory Equals Answers to Communication Problems-Invited Talk.

Vance Faber

Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing, 1987

1986

Superlinear speedup of an efficient sequential algorithm is not possible.

Vance Faber, Olaf M. Lubeck, Andrew B. White Jr.

Parallel Comput., 1986

1984

A new method of proving theorems on chromatic index.

Andrzej Ehrenfeucht, Vance Faber, Hal A. Kierstead

Discret. Math., 1984

1981

Sets of natural numbers of positive density and cylindric set algebras of dimension 2.

Paul Erdös, Vance Faber, Jean Larson

Algebra Universalis, 1981

1980

Separation of graphs into three components by the removal of edges.

Donald L. Goldsmith, Bennet Manvel, Vance Faber

J. Graph Theory, 1980

1976

Decomposition of the complete directed graph into k-circuits.

Jean-Claude Bermond, Vance Faber

J. Comb. Theory, Ser. B, 1976

1973

Graphs with valency k, edge connectivity k, chromatic index k + 1 and arbitrary girth.

Vance Faber, Jan Mycielski

Discret. Math., 1973