![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Andrew T. Phillips
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [r2]Andrew T. Phillips:
Molecular Structure Determination: Convex Global Underestimation. Encyclopedia of Optimization 2009: 2311-2316 - [r1]Andrew T. Phillips:
Quadratic Fractional Programming: Dinkelbach Method. Encyclopedia of Optimization 2009: 3149-3153 - 2006
- [j13]Paul J. Wagner, Andrew T. Phillips:
A portable computer security workshop. ACM J. Educ. Resour. Comput. 6(4): 3 (2006) - 2004
- [c10]Andrew T. Phillips:
Highlighting programming language issues using mixed language programming nn Maple and C. SIGCSE 2004: 85-89 - [c9]Michael R. Wick, Daniel E. Stevenson, Andrew T. Phillips:
Seven design rules for teaching students sound encapsulation and abstraction of object properties and member data. SIGCSE 2004: 100-104 - 2003
- [j12]Andrew T. Phillips, C. Alex Buerkle:
A computational science case study: classification of hybrids using genetic markers and maximum-likelihood estimates. ACM SIGCSE Bull. 35(2): 94-98 (2003) - [c8]Andrew T. Phillips, Jack S. Eddy Tan:
Exploring security vulnerabilities by exploiting buffer overflow using the MIPS ISA. SIGCSE 2003: 172-176 - [c7]Andrew T. Phillips, Daniel E. Stevenson, Michael R. Wick:
Implementing CC2001: a breadth-first introductory course for a just-in-time curriculum design. SIGCSE 2003: 238-242 - [c6]Daniel E. Stevenson, Andrew T. Phillips:
Implementing object equivalence in Java using the template method design pattern. SIGCSE 2003: 278-282 - 2002
- [j11]Michael R. Wick, Andrew T. Phillips:
Comparing the template method and strategy design patterns in a genetic algorithm application. ACM SIGCSE Bull. 34(4): 76-80 (2002) - [c5]Peter R. Turner, Angela B. Shiflet, Steve Cunningham, Kris Stewart, Andrew T. Phillips, Ignatios Vakalis:
Undergraduate computational science and engineering programs and courses. SIGCSE 2002: 96-97 - [c4]Michael R. Wick, Daniel E. Stevenson, Andrew T. Phillips:
Using an environment chain model to teach inheritance in C++. SIGCSE 2002: 297-301
1990 – 1999
- 1999
- [j10]M. S. Hingst, Andrew T. Phillips:
A Performance Analysis of Appel's Algorithm for Performing Pairwise Calculations in a Many Particle System. Comput. Optim. Appl. 14(2): 231-240 (1999) - [j9]K. W. Foreman, Andrew T. Phillips, J. Ben Rosen, Ken A. Dill:
Comparing search strategies for finding global optima on energy landscapes. J. Comput. Chem. 20(14): 1527-1532 (1999) - [c3]Julie C. Mitchell, J. Ben Rosen, Andrew T. Phillips, Lynn F. Ten Eyck:
Coupled optimization in protein docking. RECOMB 1999: 280-284 - 1997
- [j8]Ken A. Dill, Andrew T. Phillips, J. Ben Rosen:
Protein Structure and Energy Landscape Dependence on Sequence Using a Continuous Energy Function. J. Comput. Biol. 4(3): 227-239 (1997) - [c2]Ken A. Dill, Andrew T. Phillips, J. Ben Rosen:
Protein structure prediction and potential energy landscape analysis using continuous global minimization. RECOMB 1997: 109-117 - 1995
- [c1]Andrew T. Phillips, J. Ben Rosen, Vann Howard Walke:
Molecular structure determination by convex, global underestimation of local energy minima. Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding 1995: 181-198 - 1994
- [j7]Andrew T. Phillips, J. Ben Rosen:
A quadratic assignment formulation of the molecular conformation problem. J. Glob. Optim. 4(2): 229-241 (1994) - [j6]Andrew T. Phillips, J. Ben Rosen:
Computational comparison of two methods for constrained global optimization. J. Glob. Optim. 5(4): 325-332 (1994) - 1993
- [j5]Andrew T. Phillips, J. Ben Rosen:
Sufficient conditions for solving linearly constrained separable concave global minimization problems. J. Glob. Optim. 3(1): 79-94 (1993) - 1992
- [b1]Panos M. Pardalos, Andrew T. Phillips, J. Ben Rosen:
Topics in parallel computing in mathematical programming. Applied discrete mathematics and theoretical computer science 2, Science Press 1992, ISBN 978-1-880132-11-1, pp. I-VII, 1-114 - [j4]Andrew T. Phillips, J. Ben Rosen, M. Vliet:
A parallel stochastic method for solving linearly constrained concave global minimization problems. J. Glob. Optim. 2(3): 243-258 (1992) - 1991
- [j3]Panos M. Pardalos, Andrew T. Phillips:
Global optimization of fractional programs. J. Glob. Optim. 1(2): 173-182 (1991)
1980 – 1989
- 1989
- [j2]Andrew T. Phillips, J. Ben Rosen:
Anomalous Acceleration in Parallel Multiple-Cost-Row Linear Programming. INFORMS J. Comput. 1(4): 247-251 (1989) - 1988
- [j1]Andrew T. Phillips, J. Ben Rosen:
A parallel algorithm for constrained concave quadratic global minimization. Math. Program. 42(1-3): 421-448 (1988)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint