default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHassan Masum
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j16]Hassan Masum, Philip E. Bourne:
Ten simple rules for humane data science. PLoS Comput. Biol. 19(12) (2023)
2010 – 2019
- 2018
- [j15]Hassan Masum, Mark Tovey:
Goals for algorithmic genies. First Monday 23(2) (2018) - 2013
- [j14]Hassan Masum, Aarthi Rao, Benjamin M. Good, Matthew H. Todd, Aled M. Edwards
, Leslie Chan, Barry A. Bunin, Andrew I. Su, Zakir Thomas, Philip E. Bourne:
Ten Simple Rules for Cultivating Open Science and Collaborative R&D. PLoS Comput. Biol. 9(9) (2013)
2000 – 2009
- 2006
- [j13]Hassan Masum, Mark Tovey:
Given enough minds...: Bridging the ingenuity gap. First Monday 11(7) (2006) - 2005
- [j12]Hassan Masum, Martin Brooks, John Spence:
MusicGrid: A case study in broadband video collaboration. First Monday 10(5) (2005) - [c2]Lee K. Graham, Hassan Masum, Franz Oppacher:
Statistical analysis of heuristics for evolving sorting networks. GECCO 2005: 1265-1270 - 2004
- [j11]Hassan Masum, Yi-Cheng Zhang:
Manifesto for the Reputation Society. First Monday 9(7) (2004) - 2003
- [j10]Hassan Masum:
Decoding biological systems with evolutionary computation. Complex. 8(3): 42-44 (2003) - [j9]Hassan Masum:
Review of Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics by Juraj Hromkovic. Springer 2001. SIGACT News 34(2): 6-8 (2003) - 2002
- [j8]Hassan Masum:
TOOL: The Open Opinion Layer. First Monday 7(7) (2002) - [j7]Hassan Masum:
Review of a new kind of science. SIGACT News 33(4): 15-21 (2002) - [c1]Hassan Masum, Steffen Christensen, Franz Oppacher:
The Turing Ratio: Metrics For Open-ended Tasks. GECCO 2002: 973-980 - 2001
- [j6]Hassan Masum:
A primer for simulation of concise models. Complex. 7(2): 16-18 (2001) - [j5]Hassan Masum:
Review of Data Structures and Algorithms in Java (2nd ed): Michael T Goodrich and Roberto Tamassia. SIGACT News 32(1): 3-5 (2001) - [j4]Hassan Masum:
Review of How to Solve It: Modern Heuristics: Zbigniew Michalewicz and David B Fogel. SIGACT News 32(1): 8-12 (2001) - 2000
- [j3]Hassan Masum:
Book review: Microsurveys in Discrete Probability edited by David Aldous and James Propp. (AMS 1998). SIGACT News 31(3): 22-24 (2000) - [j2]Hassan Masum:
Review of Computational Geometry: Algorithms and Applications (2nd ed.) by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. SIGACT News 31(4): 10-12 (2000)
1990 – 1999
- 1995
- [j1]B. John Oommen, Hassan Masum:
Switching models for nonstationary random environments. IEEE Trans. Syst. Man Cybern. 25(9): 1334-1339 (1995)
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 22:54 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:
