The SCEAS System
| |||||||

## Search the dblp DataBase
Vance Faber:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Michael J. Dinneen, Michael R. Fellows, Vance Faber
**Algebraic Constructions of Efficient Broadcast Networks.**[Citation Graph (0, 0)][DBLP] AAECC, 1991, pp:152-158 [Conf] - Doug Cook, Vance Faber, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann
**Low-Bandwidth Routing and Electrical Power Networks.**[Citation Graph (0, 0)][DBLP] ICALP, 1998, pp:604-615 [Conf] - Artem Mikheev, Luc Vincent, Vance Faber
**High-Quality Polygonal Contour Approximation Based on Relaxation.**[Citation Graph (0, 0)][DBLP] ICDAR, 2001, pp:361-0 [Conf] - Vance Faber
**Graph Theory Plus Group Theory Equals Answers to Communication Problems-Invited Talk.**[Citation Graph (0, 0)][DBLP] PPSC, 1987, pp:412- [Conf] - 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.**[Citation Graph (0, 0)][DBLP] Algorithm Engineering, 2001, pp:172-184 [Conf] - Randall Dougherty, Vance Faber, Michael Murphy
**Unflippable Tetrahedral Complexes.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2004, v:32, n:3, pp:309-315 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] J. Graph Algorithms Appl., 2003, v:7, n:1, pp:3-31 [Journal] - Vance Faber, Olaf M. Lubeck, Andrew B. White Jr.
**Superlinear speedup of an efficient sequential algorithm is not possible.**[Citation Graph (0, 0)][DBLP] Parallel Computing, 1986, v:3, n:3, pp:259-260 [Journal] - Vance Faber, Olaf M. Lubeck, Andrew B. White Jr.
**Comments on the paper "parallel efficiency can be greater than unity" .**[Citation Graph (0, 0)][DBLP] Parallel Computing, 1987, v:4, n:2, pp:209-210 [Journal] - Olaf M. Lubeck, Vance Faber
**Modeling the performance of hypercubes: a case study using the particle-in-cell application.**[Citation Graph (0, 0)][DBLP] Parallel Computing, 1988, v:9, n:1, pp:37-52 [Journal] - Randall Dougherty, Vance Faber
**The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2004, v:17, n:3, pp:478-519 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1992, v:41, n:2, pp:218-220 [Journal] - Tony L. Brewster, Michael J. Dinneen, Vance Faber
**A computational attack on the conjectures of Graffiti: New counterexamples and proofs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1995, v:147, n:1-3, pp:35-55 [Journal]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |