Vance Faber

Vance Faber: Global sum on symmetric networks. CoRR abs/1201.4153 (2012)

Vance Faber: Livelock free routing schemes. CoRR abs/1201.4524 (2012)

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): 933-942 (2011)

Vance Faber: Review of chromatic graph theory by Gary Chartrand and Ping Zhang. SIGACT News 42(3): 23-28 (2011)

Vance Faber, Jörg Liesen, Petr Tichý: On Chebyshev Polynomials of Matrices. SIAM J. Matrix Analysis Applications 31(4): 2205-2221 (2010)

Vance Faber, Jörg Liesen, Petr Tichý: On orthogonal reduction to Hessenberg form with small bandwidth. Numerical Algorithms 51(2): 133-142 (2009)

Randall Dougherty, Vance Faber, Michael Murphy: Unflippable Tetrahedral Complexes. Discrete & Computational Geometry 32(3): 309-315 (2004)

Randall Dougherty, Vance Faber: The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case. SIAM J. Discrete Math. 17(3): 478-519 (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): 3-31 (2003)

Artem Mikheev, Luc Vincent, Vance Faber: High-Quality Polygonal Contour Approximation Based on Relaxation. ICDAR 2001: 361-

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. Algorithm Engineering 2001: 172-184

Doug Cook, Vance Faber, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann: Low-Bandwidth Routing and Electrical Power Networks. ICALP 1998: 604-615

Tony L. Brewster, Michael J. Dinneen, Vance Faber: A computational attack on the conjectures of Graffiti: New counterexamples and proofs. Discrete Mathematics 147(1-3): 35-55 (1995)

Jonathan N. Bradley, Vance Faber: Perfect reconstruction with critically sampled filter banks and linear boundary conditions. IEEE Transactions on Signal Processing 43(4): 994-997 (1995)

Vance Faber, James W. Moore, William Y. C. Chen: Cycle prefix digraphs for symmetric interconnection networks. Networks 23(7): 641-649 (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): 218-220 (1992)

Michael J. Dinneen, Michael R. Fellows, Vance Faber: Algebraic Constructions of Efficient Broadcast Networks. AAECC 1991: 152-158

Olaf M. Lubeck, Vance Faber: Modeling the performance of hypercubes: a case study using the particle-in-cell application. Parallel Computing 9(1): 37-52 (1988)

Vance Faber, Olaf M. Lubeck, Andrew B. White Jr.: Comments on the paper "parallel efficiency can be greater than unity" . Parallel Computing 4(2): 209-210 (1987)

Vance Faber: Graph Theory Plus Group Theory Equals Answers to Communication Problems-Invited Talk. PPSC 1987: 412

Vance Faber, Olaf M. Lubeck, Andrew B. White Jr.: Superlinear speedup of an efficient sequential algorithm is not possible. Parallel Computing 3(3): 259-260 (1986)