Vance Faber

Publication Activity (10 Years)

Years Active: 1973-2022
Publications (10 Years): 5

Top Topics

Gradient Magnitude

Rendezvous Search

Subpixel Accuracy

Top Venues

SIAM J. Matrix Anal. Appl.

Random Struct. Algorithms

J. Graph Algorithms Appl.

Publications

Nyumbu Chishwashwa, Vance Faber, Noah Streib
Digraph Networks and Groupoids. CoRR (2022)
Vance Faber, Jörg Liesen, Petr Tichý
On the Forsythe conjecture. CoRR (2022)
Paul Burkhardt, Vance Faber, David G. Harris
Bounds and algorithms for graph trusses. J. Graph Algorithms Appl. 24 (3) (2020)
Vance Faber, David G. Harris
Edge-coloring linear hypergraphs with medium-sized edges. Random Struct. Algorithms 55 (1) (2019)
Paul Burkhardt, Vance Faber, David G. Harris
Bounds and algorithms for k-truss. CoRR (2018)
Vance Faber
Transpose on vertex symmetric digraphs. CoRR (2014)
Vance Faber, Jörg Liesen, Petr Tichý
Properties of Worst-Case GMRES. SIAM J. Matrix Anal. Appl. 34 (4) (2013)
Vance Faber
Global communication algorithms for Cayley graphs CoRR (2013)
Vance Faber
Global sum on symmetric networks CoRR (2012)
Vance Faber
Livelock free routing schemes CoRR (2012)
Vance Faber
Review of chromatic graph theory by Gary Chartrand and Ping Zhang. SIGACT News 42 (3) (2011)
Michael Hawrylycz, Lydia Ng, Damon Page, John Morris, Christopher Lau, Sky Faber, Vance Faber, Susan Sunkin, Vilas Menon, Ed Lein, Allan Jones
Multi-scale correlation structure of gene expression in the brain. Neural Networks 24 (9) (2011)
Vance Faber, Jörg Liesen, Petr Tichý
On Chebyshev Polynomials of Matrices. SIAM J. Matrix Anal. Appl. 31 (4) (2010)
Vance Faber, Jörg Liesen, Petr Tichý
On orthogonal reduction to Hessenberg form with small bandwidth. Numer. Algorithms 51 (2) (2009)
Vance Faber, Jörg Liesen, Petr Tichý
The Faber-Manteuffel Theorem for Linear Operators. SIAM J. Numer. Anal. 46 (3) (2008)
Randall Dougherty, Vance Faber, Michael Murphy
Unflippable Tetrahedral Complexes. Discret. Comput. Geom. 32 (3) (2004)
Randall Dougherty, Vance Faber
The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case. SIAM J. Discret. Math. 17 (3) (2004)
Christopher L. Barrett, Achla Marathe, Madhav V. Marathe, Doug Cook, Gregory Hicks, Vance Faber, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist
Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry. J. Graph Algorithms Appl. 7 (1) (2003)
Artem Mikheev, Luc Vincent, Vance Faber
High-Quality Polygonal Contour Approximation Based on Relaxation. ICDAR (2001)
Christopher L. Barrett, Doug Cook, Gregory Hicks, Vance Faber, Achla Marathe, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist
Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry. WAE (2001)
Qiang Du, Vance Faber, Max D. Gunzburger
Centroidal Voronoi Tessellations: Applications and Algorithms. SIAM Rev. 41 (4) (1999)
Doug Cook, Vance Faber, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann
Low-Bandwidth Routing and Electrical Power Networks. ICALP (1998)
Vance Faber, Wayne Joubert, Emanuel Knill, Thomas A. Manteuffel
Minimal Residual Method Stronger than Polynomial Preconditioning. SIAM J. Matrix Anal. Appl. 17 (4) (1996)
Jonathan N. Bradley, Vance Faber
Perfect reconstruction with critically sampled filter banks and linear boundary conditions. IEEE Trans. Signal Process. 43 (4) (1995)
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) (1995)
Richard N. Draper, Vance Faber
The Diameter and Average Distance of Supertoroidal Networks. J. Parallel Distributed Comput. 31 (1) (1995)
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)
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) (1994)
Vance Faber, James W. Moore, William Y. C. Chen
Cycle prefix digraphs for symmetric interconnection networks. Networks 23 (7) (1993)
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) (1992)
Michael J. Dinneen, Michael R. Fellows, Vance Faber
Algebraic Constructions of Efficient Broadcast Networks. AAECC (1991)
Olaf M. Lubeck, Vance Faber
Modeling the performance of hypercubes: a case study using the particle-in-cell application. Parallel Comput. 9 (1) (1988)
Vance Faber, Olaf M. Lubeck, Andrew B. White Jr.
Comments on the paper "parallel efficiency can be greater than unity" . Parallel Comput. 4 (2) (1987)
Vance Faber
Graph Theory Plus Group Theory Equals Answers to Communication Problems-Invited Talk. PPSC (1987)
Vance Faber, Olaf M. Lubeck, Andrew B. White Jr.
Superlinear speedup of an efficient sequential algorithm is not possible. Parallel Comput. 3 (3) (1986)
Andrzej Ehrenfeucht, Vance Faber, Hal A. Kierstead
A new method of proving theorems on chromatic index. Discret. Math. 52 (2-3) (1984)
Donald L. Goldsmith, Bennet Manvel, Vance Faber
Separation of graphs into three components by the removal of edges. J. Graph Theory 4 (2) (1980)
Jean-Claude Bermond, Vance Faber
Decomposition of the complete directed graph into k-circuits. J. Comb. Theory, Ser. B 21 (2) (1976)
Vance Faber, Jan Mycielski
Graphs with valency k, edge connectivity k, chromatic index k + 1 and arbitrary girth. Discret. Math. 4 (4) (1973)