C. Bornstein
Carnegie Mellon University
3 Papers
38 Citations
C. Bornstein is an academic researcher from Carnegie Mellon University. The author has contributed to research in topics: Parallel algorithm & Gaussian elimination. The author has an hindex of 3, co-authored 3 publications.
Chat about Author
Papers
On the bisection width and expansion of butterfly networks
C. Bornstein,Ami Litman,Bruce M. Maggs,Ramesh K. Sitaraman,T. Yatzkar +4 more
- 30 Mar 1998
TL;DR: Tight bounds are proved on the bisection width and expansion of butterfly networks with and without wraparound, and it is shown that every set of k nodes has at least (k/(2 log k))(1-o(1)) neighbors in a butterfly without Wraparound and at least(k/log k)(1- o(1)), if k is $o(\sqrt{n})$ and o(n) , respectively.
On the bisection width and expansion of butterfly networks
C. Bornstein,Ami Litman,Bruce M. Maggs,Ramesh K. Sitaraman,T. Yatzkar +4 more
- 06 Aug 2002
TL;DR: The paper proves tight bounds on the bisection width and expansion of butterfly networks with and without wraparound and shows that for every set A of k nodes in a butterfly with wraparounds there are at least (4+o(1))k/log k edges from A to A, provided that k=o(n).
15
Parallelizing elimination orders with linear fill
C. Bornstein,Bruce M. Maggs,Gary L. Miller,R. Ravi +3 more
- 19 Oct 1997
TL;DR: An algorithm for finding parallel elimination orders for Gaussian elimination that can be applied directly to interval graphs and chordal graphs and for general graphs, the algorithm is applied to the chordal completion that the heuristic generates from the input graph.