default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Howroyd
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j8]Yun Zhou, Minlue Wang, Valeriia Haberland
, John Howroyd, Sebastian Danicic, J. Mark Bishop:
Improving Record Linkage Accuracy with Hierarchical Feature Level Information and Parsed Data. New Gener. Comput. 35(1): 87-104 (2017)- [c6]Minlue Wang, Valeriia Haberland, Andrew O. Martin, John Howroyd, John Mark Bishop:
Entity Search/Match in Relational Databases. KDIR 2017: 198-205 - 2016
- [c5]Minlue Wang, Valeriia Haberland, Amos Yeo, Andrew O. Martin, John Howroyd, J. Mark Bishop:
A Probabilistic Address Parser Using Conditional Random Fields and Stochastic Regular Grammar. ICDM Workshops 2016: 225-232 - 2015
- [c4]Yun Zhou, John Howroyd, Sebastian Danicic, J. Mark Bishop:
Extending Naive Bayes Classifier with Hierarchy Feature Level Information for Record Linkage. AMBN@JSAI-isAI 2015: 93-104 - 2011
- [j7]Sebastian Danicic, Richard W. Barraclough, Mark Harman, John Howroyd, Ákos Kiss, Michael R. Laurence:
A unifying theory of control dependence and its application to arbitrary program structures. Theor. Comput. Sci. 412(49): 6809-6842 (2011)
2000 – 2009
- 2007
- [j6]Sebastian Danicic, Mark Harman, John Howroyd, Lahcen Ouarbya:
A non-standard semantics for program slicing and dependence analysis. J. Log. Algebraic Methods Program. 72(2): 191-206 (2007) - [j5]Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd, Michael R. Laurence:
Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time. Theor. Comput. Sci. 373(1-2): 1-18 (2007) - 2006
- [j4]David W. Binkley, Sebastian Danicic, Mark Harman, John Howroyd, Lahcen Ouarbya:
A formal relationship between program slicing and partial evaluation. Formal Aspects Comput. 18(2): 103-119 (2006) - 2005
- [j3]Sebastian Danicic, Chris Fox, Mark Harman, Robert M. Hierons, John Howroyd, Michael R. Laurence:
Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas. Comput. J. 48(6): 737-748 (2005) - [j2]Sebastian Danicic, Mohammed Daoudi, Chris Fox, Mark Harman, Robert M. Hierons, John Howroyd, Lahcen Ouarbya, Martin P. Ward:
ConSUS: a light-weight program conditioner. J. Syst. Softw. 77(3): 241-262 (2005) - 2003
- [j1]Michael R. Laurence, Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd:
Equivalence of conservative, free, linear program schemas is decidable. Theor. Comput. Sci. 290(1): 831-862 (2003) - 2002
- [c3]Mohammed Daoudi, Lahcen Ouarbya, John Howroyd, Sebastian Danicic, Mark Harman, Chris Fox, Martin P. Ward:
ConSUS: A Scalable Approach to Conditioned Slicing. WCRE 2002: 109-118 - 2001
- [c2]Mark Harman, Robert M. Hierons, Chris Fox, Sebastian Danicic, John Howroyd:
Pre/Post Conditioned Slicing. ICSM 2001: 138-147 - [c1]Mark Harman, Robert M. Hierons, Sebastian Danicic, John Howroyd, Michael R. Laurence, Chris Fox:
Node Coarsening Calculi for Program Slicing. WCRE 2001: 25-34
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:09 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:
