default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTiffani L. Williams
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j7]Tiffani L. Williams:
The lives of hidden figures matter in computer science education. Commun. ACM 65(2): 20-22 (2022)- 2020
- [c20]Carla E. Brodley, Megan Barry, Aidan Connell, Catherine Gill, Ian Gorton, Benjamin Hescott, Bryan Lackaye, Cynthia LuBien, Leena Razzaq, Amit Shesh, Tiffani L. Williams, Andrea Pohoreckyj Danyluk:
An MS in CS for non-CS Majors: Moving to Increase Diversity of Thought and Demographics in CS. SIGCSE 2020: 1248-1254
2010 – 2019
- 2017
- [j6]Ralph W. Crosby, Tiffani L. Williams:
Fast algorithms for computing phylogenetic divergence time. BMC Bioinform. 18(1): 514:1-514:13 (2017) - 2016
- [c19]Ralph W. Crosby, Tiffani L. Williams:
Fast algorithms for computing phylogenetic divergence time. ICCABS 2016: 1 - 2012
- [c18]Ralph W. Crosby, Tiffani L. Williams:
A Fast Algorithm for Computing the Quartet Distance for Large Sets of Evolutionary Trees. ISBRA 2012: 60-71 - 2011
- [j5]Suzanne J. Matthews
, Tiffani L. Williams:
An efficient and extensible approach for compressing phylogenetic trees. BMC Bioinform. 12(S-10): S16 (2011) - [j4]Seung-Jin Sul, Tiffani L. Williams:
Big Cat Phylogenies, Consensus Trees, and Computational Thinking. J. Comput. Biol. 18(7): 895-906 (2011) - [c17]Grant R. Brammer, Ralph W. Crosby, Suzanne J. Matthews, Tiffani L. Williams:
Paper Mâché: Creating Dynamic Reproducible Science. ICCS 2011: 658-667 - 2010
- [j3]Suzanne J. Matthews, Tiffani L. Williams:
MrsRF: an efficient MapReduce algorithm for analyzing large collections of evolutionary trees. BMC Bioinform. 11(S-1): 15 (2010) - [c16]Grant R. Brammer, Tiffani L. Williams:
Using decision trees to study the convergence of phylogenetic analyses. CIBCB 2010: 1-8 - [c15]Suzanne J. Matthews, Seung-Jin Sul, Tiffani L. Williams:
TreeZip: A New Algorithm for Compressing Large Collections of Evolutionary Trees. DCC 2010: 544 - [c14]Suzanne J. Matthews, Seung-Jin Sul, Tiffani L. Williams:
A Novel Approach for Compressing Phylogenetic Trees. ISBRA 2010: 113-124
2000 – 2009
- 2009
- [j2]Seung-Jin Sul, Suzanne J. Matthews, Tiffani L. Williams:
Using tree diversity to compare phylogenetic heuristics. BMC Bioinform. 10(S-4) (2009) - [c13]Hyun Jung Park, Tiffani L. Williams:
A Fitness Distance Correlation Measure for Evolutionary Trees. BICoB 2009: 331-342 - [c12]Seung-Jin Sul, Tiffani L. Williams:
An Experimental Analysis of Consensus Tree Algorithms for Large-Scale Tree Collections. ISBRA 2009: 100-111 - 2008
- [c11]Seung-Jin Sul, Suzanne J. Matthews, Tiffani L. Williams:
New Approaches to Compare Phylogenetic Search Heuristics. BIBM 2008: 239-245 - [c10]Seung-Jin Sul, Tiffani L. Williams:
An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms. ESA 2008: 793-804 - [c9]Seung-Jin Sul, Grant R. Brammer, Tiffani L. Williams:
Efficiently Computing Arbitrarily-Sized Robinson-Foulds Distance Matrices. WABI 2008: 123-134 - 2007
- [c8]Seung-Jin Sul, Tiffani L. Williams:
A Randomized Algorithm for Comparing Sets of Phylogenetic Trees. APBC 2007: 121-130 - 2006
- [c7]Tiffani L. Williams, Marc L. Smith:
The role of diverse populations in phylogenetic analysis. GECCO 2006: 287-294 - [c6]Marc L. Smith, Tiffani L. Williams:
Phylospaces: reconstructing evolutionary trees in tuple space. IPDPS 2006 - 2005
- [c5]Tiffani L. Williams, Marc Smith:
Cooperative Rec-I-DCM3: A Population-Based Approach for Reconstructing Phylogenies. CIBCB 2005: 127-134 - 2004
- [c4]Usman Roshan, Bernard M. E. Moret, Tandy J. Warnow, Tiffani L. Williams:
Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees. CSB 2004: 98-109 - 2003
- [c3]Tiffani L. Williams, Bernard M. E. Moret:
An Investigation of Phylogenetic Likelihood Methods. BIBE 2003: 79-86 - 2001
- [j1]Tiffani L. Williams, Rebecca J. Parsons:
Practical Experience Using a Computational Model for the Design of Heterogeneous Distributed Software. J. Res. Pract. Inf. Technol. 33(2): 146-157 (2001) - [c2]Tiffani L. Williams, Rebecca J. Parsons:
Exploiting Hierarchy in Heterogeneous Environments. IPDPS 2001: 140 - 2000
- [c1]Tiffani L. Williams, Rebecca J. Parsons:
The Heterogeneous Bulk Synchronous Parallel Model. IPDPS Workshops 2000: 102-108
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-04-24 23:18 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:
