Experiences Implementing a Parallel ATMS on a Shared-Memory Multiprocessor. - Edward Rothberg; Anoop Gupta (IJCAI, 1989)

Techniques for improving the performance of sparse matrix factorization on multiprocessor workstations. - Edward Rothberg; Anoop Gupta (SC, 1990)

Efficient sparse matrix factorization on high performance workstations - exploiting the memory hierarchy. - Edward Rothberg; Anoop Gupta (ACM Trans. Math. Softw., 1991)

Parallel ICCG on a hierarchical memory multiprocessor - Addressing the triangular solve bottleneck. - Edward Rothberg; Anoop Gupta (Parallel Comput., 1992)

Exploiting the memory hierarchy in sequential and parallel sparse Cholesky factorization. - Edward Rothberg (1992)

Working Sets, Cache Sizes, and Node Granularity Issues for Large-Scale Multiprocessors. - Edward Rothberg; Jaswinder Pal Singh; Anoop Gupta (ISCA, 1993)

An Evaluation of Left-Looking, Right-Looking and Multifrontal Approaches to Sparse Cholesky Factorization on Hierarchical-Memory Machines. - Edward Rothberg; Anoop Gupta (Int. J. High Speed Comput., 1993)

Improved load distribution in parallel sparse Cholesky factorization. - Edward Rothberg; Robert Schreiber (SC, 1994)

Modeling Communication in Parallel Algorithms: A Fruitful Interaction Between Theory and Systems? - Jaswinder Pal Singh; Edward Rothberg; Anoop Gupta (SPAA, 1994)

An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization. - Edward Rothberg; Anoop Gupta (SIAM J. Sci. Comput., 1994)

Efficient Parallel Sparse Cholesky Factorization. - Edward Rothberg; Robert Schreiber (PP, 1995)

Alternatives for Solving Sparse Triangular Systems on Distributed-Memory Multiprocessors. - Edward Rothberg (Parallel Comput., 1995)

Gigaflops in linear programming. - Irvin J. Lustig; Edward Rothberg (Oper. Res. Lett., 1996)

Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers. - Edward Rothberg (SIAM J. Sci. Comput., 1996)

Effective Sparse Matrix Ordering: Just Around the BEND. - Bruce Hendrickson; Edward Rothberg (PP, 1997)

Sparse Matrix Ordering Methods for Interior Point Linear Programming. - Edward Rothberg; Bruce Hendrickson (INFORMS J. Comput., 1998)

Improving the Run Time and Quality of Nested Dissection Ordering. - Bruce Hendrickson; Edward Rothberg (SIAM J. Sci. Comput., 1998)

Node Selection Strategies for Bottom-Up Sparse Matrix Ordering. - Edward Rothberg; Stanley C. Eisenstat (SIAM J. Matrix Anal. Appl., 1998)

MIP: Theory and Practice - Closing the Gap. - Robert E. Bixby; Mary Fenelon; Zonghao Gu; Edward Rothberg; Roland Wunderling (System Modelling and Optimization, 1999)

Efficient Methods for Out-of-Core Sparse Cholesky Factorization. - Edward Rothberg; Robert Schreiber (SIAM J. Sci. Comput., 1999)

Latency, Occupancy, and Bandwidth in DSM Multiprocessors: A Performance Evaluation. - Mainak Chaudhuri; Mark A. Heinrich; Chris Holt; Jaswinder Pal Singh; Edward Rothberg; John L. Hennessy (IEEE Trans. Computers, 2003)

Mixed-Integer Programming: A Progress Report. - Robert E. Bixby; Mary Fenelon; Zonghao Gu; Edward Rothberg; Roland Wunderling (The Sharpest Cut, 2004)

Exploring relaxation induced neighborhoods to improve MIP solutions. - Emilie Danna; Edward Rothberg; Claude Le Pape (Math. Program., 2005)

Progress in computational mixed integer programming - A look back from the other side of the tipping point. - Robert E. Bixby; Edward Rothberg (Ann. Oper. Res., 2007)

An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions. - Edward Rothberg (INFORMS J. Comput., 2007)

Presolve Reductions in Mixed Integer Programming. - Tobias Achterberg; Robert E. Bixby; Zonghao Gu; Edward Rothberg; Dieter Weninger (INFORMS J. Comput., 2020)