Vance Faber

Noah Streib

J. Sched., December, 2024

2022

On the Forsythe conjecture.

[BibT_eX]

[DOI]

CoRR, 2022

Digraph Networks and Groupoids.

[BibT_eX]

[DOI]

Nyumbu Chishwashwa

Noah Streib

CoRR, 2022

2020

Bounds and algorithms for graph trusses.

[BibT_eX]

[DOI]

Paul Burkhardt

David G. Harris

J. Graph Algorithms Appl., 2020

2019

Edge-coloring linear hypergraphs with medium-sized edges.

[BibT_eX]

[DOI]

David G. Harris

Random Struct. Algorithms, 2019

2018

Bounds and algorithms for k-truss.

[BibT_eX]

[DOI]

Paul Burkhardt

David G. Harris

CoRR, 2018

2014

Transpose on vertex symmetric digraphs.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Properties of Worst-Case GMRES.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2013

Global communication algorithms for Cayley graphs

[BibT_eX]

[DOI]

CoRR, 2013

2012

Livelock free routing schemes

[BibT_eX]

[DOI]

CoRR, 2012

Global sum on symmetric networks

[BibT_eX]

[DOI]

CoRR, 2012

2011

Review of chromatic graph theory by Gary Chartrand and Ping Zhang.

[BibT_eX]

[DOI]

SIGACT News, 2011

Multi-scale correlation structure of gene expression in the brain.

[BibT_eX]

[DOI]

Neural Networks, 2011

2010

On Chebyshev Polynomials of Matrices.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2010

2009

On orthogonal reduction to Hessenberg form with small bandwidth.

[BibT_eX]

[DOI]

Numer. Algorithms, 2009

2008

The Faber-Manteuffel Theorem for Linear Operators.

[BibT_eX]

[DOI]

SIAM J. Numer. Anal., 2008

2004

The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case.

[BibT_eX]

[DOI]

Randall Dougherty

SIAM J. Discret. Math., 2004

Unflippable Tetrahedral Complexes.

[BibT_eX]

[DOI]

Randall Dougherty

Michael Murphy

Discret. Comput. Geom., 2004

2003

Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry.

[BibT_eX]

[DOI]

Christopher L. Barrett

J. Graph Algorithms Appl., 2003

2001

Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry.

[BibT_eX]

[DOI]

Christopher L. Barrett

Proceedings of the Algorithm Engineering, 2001

High-Quality Polygonal Contour Approximation Based on Relaxation.

[BibT_eX]

[DOI]

Artem Mikheev

Luc Vincent

Proceedings of the 6th International Conference on Document Analysis and Recognition (ICDAR 2001), 2001

1999

Centroidal Voronoi Tessellations: Applications and Algorithms.

[BibT_eX]

[DOI]

Qiang Du

Max D. Gunzburger

SIAM Rev., 1999

1998

Low-Bandwidth Routing and Electrical Power Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1996

Minimal Residual Method Stronger than Polynomial Preconditioning.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 1996

1995

Perfect reconstruction with critically sampled filter banks and linear boundary conditions.

[BibT_eX]

[DOI]

Jonathan N. Bradley

IEEE Trans. Signal Process., 1995

The Diameter and Average Distance of Supertoroidal Networks.

[BibT_eX]

[DOI]

Richard N. Draper

J. Parallel Distributed Comput., 1995

A computational attack on the conjectures of Graffiti: New counterexamples and proofs.

[BibT_eX]

[DOI]

Tony L. Brewster

Michael J. Dinneen

Discret. Math., 1995

1994

An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian.

[BibT_eX]

[DOI]

Fan R. K. Chung

Thomas A. Manteuffel

SIAM J. Discret. Math., 1994

Restricted routing and wide diameter of the cycle prefix network.

[BibT_eX]

[DOI]

William Y. C. Chen

Emanuel Knill

Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994

1993

Cycle prefix digraphs for symmetric interconnection networks.

[BibT_eX]

[DOI]

James W. Moore

William Y. C. Chen

Networks, 1993

1992

Small Diameter Symmetric Networks from Linear Groups.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1992

1991

Algebraic Constructions of Efficient Broadcast Networks.

[BibT_eX]

[DOI]

Michael J. Dinneen

Michael R. Fellows

Proceedings of the Applied Algebra, 1991

1988

Modeling the performance of hypercubes: a case study using the particle-in-cell application.

[BibT_eX]

[DOI]

Olaf M. Lubeck

Parallel Comput., 1988

1987

Comments on the paper "parallel efficiency can be greater than unity" .

[BibT_eX]

[DOI]

Olaf M. Lubeck

Andrew B. White Jr.

Parallel Comput., 1987

Graph Theory Plus Group Theory Equals Answers to Communication Problems-Invited Talk.

[BibT_eX]

Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing, 1987

1986

Superlinear speedup of an efficient sequential algorithm is not possible.

[BibT_eX]

[DOI]

Olaf M. Lubeck

Andrew B. White Jr.

Parallel Comput., 1986

1984

A new method of proving theorems on chromatic index.

[BibT_eX]

[DOI]

Andrzej Ehrenfeucht

Hal A. Kierstead

Discret. Math., 1984

1981

Sets of natural numbers of positive density and cylindric set algebras of dimension 2.

[BibT_eX]

[DOI]

Paul Erdös

Jean Larson

Algebra Universalis, 1981

1980

Separation of graphs into three components by the removal of edges.

[BibT_eX]

[DOI]

Donald L. Goldsmith

Bennet Manvel

J. Graph Theory, 1980

1976

Decomposition of the complete directed graph into k-circuits.

[BibT_eX]

[DOI]

Jean-Claude Bermond

J. Comb. Theory B, 1976

1973

Graphs with valency k, edge connectivity k, chromatic index k + 1 and arbitrary girth.

[BibT_eX]

[DOI]