default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdward Rothberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1992
[b1]Edward Rothberg:
Exploiting the memory hierarchy in sequential and parallel sparse Cholesky factorization. Stanford University, USA, 1992
Journal Articles
- 2020
- [j16]Tobias Achterberg
, Robert E. Bixby, Zonghao Gu, Edward Rothberg, Dieter Weninger:
Presolve Reductions in Mixed Integer Programming. INFORMS J. Comput. 32(2): 473-506 (2020) - 2007
- [j15]Robert E. Bixby, Edward Rothberg:
Progress in computational mixed integer programming - A look back from the other side of the tipping point. Ann. Oper. Res. 149(1): 37-41 (2007) - [j14]Edward Rothberg:
An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions. INFORMS J. Comput. 19(4): 534-541 (2007) - 2005
- [j13]Emilie Danna, Edward Rothberg, Claude Le Pape:
Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. 102(1): 71-90 (2005) - 2003
- [j12]Mainak Chaudhuri, Mark A. Heinrich, Chris Holt, Jaswinder Pal Singh, Edward Rothberg, John L. Hennessy:
Latency, Occupancy, and Bandwidth in DSM Multiprocessors: A Performance Evaluation. IEEE Trans. Computers 52(7): 862-880 (2003) - 1999
- [j11]Edward Rothberg, Robert Schreiber:
Efficient Methods for Out-of-Core Sparse Cholesky Factorization. SIAM J. Sci. Comput. 21(1): 129-144 (1999) - 1998
- [j10]Edward Rothberg, Bruce Hendrickson:
Sparse Matrix Ordering Methods for Interior Point Linear Programming. INFORMS J. Comput. 10(1): 107-113 (1998) - [j9]Edward Rothberg, Stanley C. Eisenstat:
Node Selection Strategies for Bottom-Up Sparse Matrix Ordering. SIAM J. Matrix Anal. Appl. 19(3): 682-695 (1998) - [j8]Bruce Hendrickson, Edward Rothberg:
Improving the Run Time and Quality of Nested Dissection Ordering. SIAM J. Sci. Comput. 20(2): 468-489 (1998) - 1996
- [j7]Irvin J. Lustig, Edward Rothberg:
Gigaflops in linear programming. Oper. Res. Lett. 18(4): 157-165 (1996) - [j6]Edward Rothberg:
Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers. SIAM J. Sci. Comput. 17(3): 699-713 (1996) - 1995
- [j5]Edward Rothberg:
Alternatives for Solving Sparse Triangular Systems on Distributed-Memory Multiprocessors. Parallel Comput. 21(7): 1121-1136 (1995) - 1994
- [j4]Edward Rothberg, Anoop Gupta:
An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization. SIAM J. Sci. Comput. 15(6): 1413-1439 (1994) - 1993
- [j3]Edward Rothberg, Anoop Gupta:
An Evaluation of Left-Looking, Right-Looking and Multifrontal Approaches to Sparse Cholesky Factorization on Hierarchical-Memory Machines. Int. J. High Speed Comput. 5(4): 537-593 (1993) - 1992
- [j2]Edward Rothberg, Anoop Gupta:
Parallel ICCG on a hierarchical memory multiprocessor - Addressing the triangular solve bottleneck. Parallel Comput. 18(7): 719-741 (1992) - 1991
- [j1]Edward Rothberg, Anoop Gupta:
Efficient sparse matrix factorization on high performance workstations - exploiting the memory hierarchy. ACM Trans. Math. Softw. 17(3): 313-334 (1991)
Conference and Workshop Papers
- 1999
- [c9]Robert E. Bixby, Mary Fenelon, Zonghao Gu, Edward Rothberg, Roland Wunderling:
MIP: Theory and Practice - Closing the Gap. System Modelling and Optimization 1999: 19-50 - 1997
- [c8]Bruce Hendrickson, Edward Rothberg:
Effective Sparse Matrix Ordering: Just Around the BEND. PP 1997 - 1995
- [c7]Edward Rothberg, Robert Schreiber:
Efficient Parallel Sparse Cholesky Factorization. PP 1995: 407-412 - 1994
- [c6]Edward Rothberg, Robert Schreiber:
Improved load distribution in parallel sparse Cholesky factorization. SC 1994: 783-792 - [c5]Jaswinder Pal Singh, Edward Rothberg, Anoop Gupta:
Modeling Communication in Parallel Algorithms: A Fruitful Interaction Between Theory and Systems? SPAA 1994: 189-199 - 1993
- [c4]Edward Rothberg, Jaswinder Pal Singh, Anoop Gupta:
Working Sets, Cache Sizes, and Node Granularity Issues for Large-Scale Multiprocessors. ISCA 1993: 14-25 - [c3]Edward Rothberg, Anoop Gupta:
An efficient block-oriented approach to parallel sparse Cholesky factorization. SC 1993: 503-512 - 1990
- [c2]Edward Rothberg, Anoop Gupta:
Techniques for improving the performance of sparse matrix factorization on multiprocessor workstations. SC 1990: 232-241 - 1989
- [c1]Edward Rothberg, Anoop Gupta:
Experiences Implementing a Parallel ATMS on a Shared-Memory Multiprocessor. IJCAI 1989: 199-205
Parts in Books or Collections
- 2004
- [p1]Robert E. Bixby, Mary Fenelon, Zonghao Gu, Edward Rothberg, Roland Wunderling:
Mixed-Integer Programming: A Progress Report. The Sharpest Cut 2004: 309-325
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
