|
Search the dblp DataBase
Marty J. Wolf:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Alexandros Stamatakis, Thomas Ludwig 0002, Harald Meier, Marty J. Wolf
AxML: A Fast Program for Sequential and Parallel Phylogenetic Tree Calculations Based on the Maximum Likelihood Method. [Citation Graph (0, 0)][DBLP] CSB, 2002, pp:21-0 [Conf]
- Marty J. Wolf, Frances S. Grodzinsky
Good/fast/cheap: contexts, relationships and professional responsibility during software development. [Citation Graph (0, 0)][DBLP] SAC, 2006, pp:261-266 [Conf]
- Alexandros Stamatakis, Thomas Ludwig 0002, Harald Meier, Marty J. Wolf
Accelerating parallel maximum likelihood-based phylogenetic tree calculations using subtree equality vectors. [Citation Graph (0, 0)][DBLP] SC, 2002, pp:1-16 [Conf]
- Don Goelman, Roberta Evans Sabin, Marty J. Wolf, Peter J. Knoke, Mike Murphy
The terminal Master's degree (panel): does it need to be cured? [Citation Graph (0, 0)][DBLP] SIGCSE, 1998, pp:355-356 [Conf]
- Marty J. Wolf, Kevin W. Bowyer, Donald Gotterbarn, Keith W. Miller
Open source software: intellectual challenges to the status quo. [Citation Graph (0, 0)][DBLP] SIGCSE, 2002, pp:317-318 [Conf]
- Marty J. Wolf, David J. Haglin
An Optimal Algorithm for Finding All Convex Subsets in Tournaments. [Citation Graph (0, 0)][DBLP] Ars Comb., 1999, v:52, n:, pp:- [Journal]
- Marty J. Wolf, Simon Easteal, Margaret Kahn, Brendan D. McKay, Lars S. Jermiin
TrExML: a maximum-likelihood approach for extensive tree-space exploration. [Citation Graph (0, 0)][DBLP] Bioinformatics, 2000, v:16, n:4, pp:383-394 [Journal]
- David J. Haglin, Marty J. Wolf
On Convex Subsets in Tournaments. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1996, v:9, n:1, pp:63-70 [Journal]
- Marty J. Wolf
Nondeterministic Circuits, Space Complexity and Quasigroups. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:125, n:2, pp:295-313 [Journal]
On two-path convexity in multipartite tournaments. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
|