default search action
Benjamin Hescott
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c11]Carla E. Brodley, Benjamin J. Hescott, Jessica Biron, Ali Ressing, Melissa Peiken, Sarah Maravetz, Alan Mislove:
Broadening Participation in Computing via Ubiquitous Combined Majors (CS+X). SIGCSE (1) 2022: 544-550 - 2020
- [c10]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
- 2018
- [j13]Junyuan Lin
, Lenore J. Cowen, Benjamin J. Hescott, Xiaozhe Hu
Computing the diffusion state distance on graphs via algebraic multigrid and random projections. Numer. Linear Algebra Appl. 25(3) (2018) - [c9]Benjamin Hescott, Caleb Malchik, Andrew Winslow:
Non-determinism Reduces Construction Time in Active Self-assembly Using an Insertion Primitive. COCOON 2018: 626-637 - [c8]Mark D. M. Leiserson, Jason Fan, Anthony Cannistra, Inbar Fried, Tim Lim, Thomas Schaffner, Mark Crovella, Benjamin J. Hescott:
A Multi-species Functional Embedding Integrating Sequence and Network Structure. RECOMB 2018: 263-265 - [c7]Christopher Gregg
How Do We Provide Effective Student Advising and Mentoring During Record Growth?: (Abstract Only). SIGCSE 2018: 1069 - 2017
- [j12]Benjamin Hescott, Caleb Malchik, Andrew Winslow:
Tight Bounds for Active Self-Assembly Using an Insertion Primitive. Algorithmica 77(2): 537-554 (2017) - [j11]Jisoo Park
Towards a more molecular taxonomy of disease. J. Biomed. Semant. 8(1): 25:1-25:11 (2017) - [c6]Jisoo Park, Benjamin J. Hescott, Donna K. Slonim:
Building a Molecular Taxonomy of Disease. BCB 2017: 626 - 2016
- [j10]Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Diffuse reflection diameter in simple polygons. Discret. Appl. Math. 210: 123-132 (2016) - [i4]Jeffrey Finkelstein, Benjamin Hescott:
Polynomial-time kernel reductions. CoRR abs/1604.08558 (2016) - 2015
- [j9]Benjamin J. Hescott, Roni Khardon:
The complexity of reasoning with FODD and GFODD. Artif. Intell. 229: 1-32 (2015) - 2014
- [j8]Mengfei Cao, Christopher M. Pietras, Xian Feng, Kathryn J. Doroschak
New directions for diffusion-based network prediction of protein function: incorporating pathways with confidence. Bioinform. 30(12): 219-227 (2014) - [j7]R. Jordan Crouser
Toward Complexity Measures for Systems Involving Human Computation. Hum. Comput. 1(1): 45-65 (2014) - [c5]Benjamin J. Hescott, Roni Khardon:
The Complexity of Reasoning with FODD and GFODD. AAAI 2014: 1056-1062 - [i3]Benjamin J. Hescott, Roni Khardon:
The Complexity of Reasoning with FODD and GFODD. CoRR abs/1407.1408 (2014) - [i2]Benjamin Hescott, Caleb Malchik, Andrew Winslow:
More Tight Bounds for Active Self-Assembly Using an Insertion Primitive. CoRR abs/1411.0973 (2014) - 2013
- [j6]Andrew Gallant, Mark D. M. Leiserson, Maxim Kachalov, Lenore J. Cowen, Benjamin J. Hescott:
Genecentric: a package to uncover graph-theoretic structure in high-throughput epistasis data. BMC Bioinform. 14: 23 (2013) - [j5]Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Diffuse Reflections in Simple Polygons. Electron. Notes Discret. Math. 44: 345-350 (2013) - [i1]Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Diffuse Reflections in Simple Polygons. CoRR abs/1302.2271 (2013) - 2012
- [c4]Andrew Gallant, Mark D. M. Leiserson, Maxim Kachalov, Lenore J. Cowen, Benjamin J. Hescott:
Genecentric: a package to uncover graph-theoretic structure in high-throughput epistasis data. BCB 2012: 576-578 - 2011
- [j4]Andrew D. Fox, Benjamin J. Hescott, Anselm Blumer, Donna K. Slonim
Connectedness of PPI network neighborhoods identifies regulatory hub proteins. Bioinform. 27(8): 1135-1142 (2011) - [j3]Mark D. M. Leiserson, Diana Tatar, Lenore J. Cowen, Benjamin J. Hescott:
Inferring Mechanisms of Compensation from E-MAP and SGA Data Using Local Search Algorithms for Max Cut. J. Comput. Biol. 18(11): 1399-1409 (2011) - [c3]Mark D. M. Leiserson, Diana Tatar, Lenore J. Cowen, Benjamin J. Hescott:
Inferring Mechanisms of Compensation from E-MAP and SGA Data Using Local Search Algorithms for Max Cut. RECOMB 2011: 154-167 - 2010
- [j2]Benjamin J. Hescott, Mark D. M. Leiserson, Lenore J. Cowen, Donna K. Slonim
Evaluating Between-Pathway Models with Expression Data. J. Comput. Biol. 17(3): 477-487 (2010) - [j1]Harry Buhrman, Benjamin J. Hescott, Steven Homer, Leen Torenvliet:
Non-Uniform Reductions. Theory Comput. Syst. 47(2): 317-341 (2010)
2000 – 2009
- 2009
- [c2]Benjamin J. Hescott, Mark D. M. Leiserson, Lenore Cowen, Donna K. Slonim:
Evaluating Between-Pathway Models with Expression Data. RECOMB 2009: 372-385 - [c1]Kelly Moran, Kajal T. Claypool, Benjamin J. Hescott:
CompositeMatch: Detecting N-ary Matches in Ontology Alignment. OM 2009
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-05-08 21:45 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: