Vance Faber

2004
13	EE	Randall Dougherty, Vance Faber, Michael Murphy: Unflippable Tetrahedral Complexes. Discrete & Computational Geometry 32(3): 309-315 (2004)
12	EE	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)
2003
11	EE	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)
2001
10	EE	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
9	EE	Artem Mikheev, Luc Vincent, Vance Faber: High-Quality Polygonal Contour Approximation Based on Relaxation. ICDAR 2001: 361-
1998
8	EE	Doug Cook, Vance Faber, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann: Low-Bandwidth Routing and Electrical Power Networks. ICALP 1998: 604-615
1995
7	EE	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)
1992
6		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
5		Michael J. Dinneen, Michael R. Fellows, Vance Faber: Algebraic Constructions of Efficient Broadcast Networks. AAECC 1991: 152-158
1988
4		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)
1987
3		Vance Faber: Graph Theory Plus Group Theory Equals Answers to Communication Problems-Invited Talk. PPSC 1987: 412
2	EE	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)
1986
1	EE	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)

Coauthor Index

1	Christopher L. Barrett	[10] [11]
2	Tony L. Brewster	[7]
3	Lowell Campbell	[6]
4	Gunnar E. Carlsson	[6]
5	Doug Cook	[8] [10] [11]
6	Michael J. Dinneen	[5] [6] [7]
7	Randall Dougherty	[12] [13]
8	Michael R. Fellows (Mike Fellows)	[5] [6]
9	Gregory Hicks	[10] [11]
10	Michael A. Langston	[6]
11	Olaf M. Lubeck	[1] [2] [4]
12	Achla Marathe	[10] [11]
13	Madhav V. Marathe	[8] [10] [11]
14	Artem Mikheev	[9]
15	James W. Moore	[6]
16	Andrew P. Mullhaupt	[6]
17	Michael Murphy	[13]
18	Harlan B. Sexton	[6]
19	Aravind Srinivasan	[8] [10] [11]
20	Yoram J. Sussmann	[8] [10] [11]
21	Heidi Thornquist	[10] [11]
22	Luc Vincent	[9]
23	Andrew B. White Jr.	[1] [2]

Colors in the list of coauthors