Vance Faber
According to our database1,
Vance Faber
authored at least 33 papers
between 1973 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
On csauthors.net:
Bibliography
2018
Bounds and algorithms for k-truss.
CoRR, 2018
2014
Transpose on vertex symmetric digraphs.
CoRR, 2014
2013
Properties of Worst-Case GMRES.
SIAM J. Matrix Analysis Applications, 2013
Global communication algorithms for Cayley graphs
CoRR, 2013
2012
Livelock free routing schemes
CoRR, 2012
Global sum on symmetric networks
CoRR, 2012
2011
Review of chromatic graph theory by Gary Chartrand and Ping Zhang.
SIGACT News, 2011
Multi-scale correlation structure of gene expression in the brain.
Neural Networks, 2011
2010
On Chebyshev Polynomials of Matrices.
SIAM J. Matrix Analysis Applications, 2010
2009
On orthogonal reduction to Hessenberg form with small bandwidth.
Numerical Algorithms, 2009
2008
The Faber-Manteuffel Theorem for Linear Operators.
SIAM J. Numerical Analysis, 2008
2004
The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case.
SIAM J. Discrete Math., 2004
Unflippable Tetrahedral Complexes.
Discrete & Computational Geometry, 2004
2003
Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry.
J. Graph Algorithms Appl., 2003
2001
Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry.
Proceedings of the Algorithm Engineering, 2001
High-Quality Polygonal Contour Approximation Based on Relaxation.
Proceedings of the 6th International Conference on Document Analysis and Recognition (ICDAR 2001), 2001
1999
Centroidal Voronoi Tessellations: Applications and Algorithms.
SIAM Review, 1999
1998
Low-Bandwidth Routing and Electrical Power Networks.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998
1996
Minimal Residual Method Stronger than Polynomial Preconditioning.
SIAM J. Matrix Analysis Applications, 1996
1995
Perfect reconstruction with critically sampled filter banks and linear boundary conditions.
IEEE Trans. Signal Processing, 1995
A computational attack on the conjectures of Graffiti: New counterexamples and proofs.
Discrete Mathematics, 1995
1994
An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian.
SIAM J. Discrete Math., 1994
Restricted routing and wide diameter of the cycle prefix network.
Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994
1993
Cycle prefix digraphs for symmetric interconnection networks.
Networks, 1993
1992
Small Diameter Symmetric Networks from Linear Groups.
IEEE Trans. Computers, 1992
1991
Algebraic Constructions of Efficient Broadcast Networks.
Proceedings of the Applied Algebra, 1991
1988
Modeling the performance of hypercubes: a case study using the particle-in-cell application.
Parallel Computing, 1988
1987
Comments on the paper "parallel efficiency can be greater than unity" .
Parallel Computing, 1987
Graph Theory Plus Group Theory Equals Answers to Communication Problems-Invited Talk.
Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing, 1987
1986
Superlinear speedup of an efficient sequential algorithm is not possible.
Parallel Computing, 1986
1981
Sets of natural numbers of positive density and cylindric set algebras of dimension 2
Algebra Universalis, 1981
1980
Separation of graphs into three components by the removal of edges.
Journal of Graph Theory, 1980
1973
Graphs with valency k, edge connectivity k, chromatic index k + 1 and arbitrary girth.
Discrete Mathematics, 1973