default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJason Morrison
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j9]Stephane Durocher
, Robert Fraser, Alexandre Leblanc, Jason Morrison, Matthew Skala:
On Combinatorial Depth Measures. Int. J. Comput. Geom. Appl. 28(4): 381-398 (2018)- 2014
- [j8]Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Mode Query in Arrays. Theory Comput. Syst. 55(4): 719-741 (2014) - [c11]Stephane Durocher, Robert Fraser, Alexandre Leblanc, Jason Morrison, Matthew Skala:
On Combinatorial Depth Measures. CCCG 2014 - 2013
- [j7]Stephane Durocher, Jason Morrison:
Foreword. Comput. Geom. 46(2): 119 (2013) - [j6]Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala:
Robust nonparametric Simplification of Polygonal Chains. Int. J. Comput. Geom. Appl. 23(6): 427-442 (2013) - [c10]Luis Barba, Stephane Durocher, Robert Fraser, Ferran Hurtado, Saeed Mehrabi, Debajyoti Mondal, Jason Morrison, Matthew Skala, Mohammad Abdul Wahid:
On k-Enclosing Objects in a Coloured Point Set. CCCG 2013 - 2012
- [c9]Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala:
Robust Nonparametric Data Approximation of Point Sets via Data Reduction. ISAAC 2012: 319-331 - [c8]Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson:
Linear-Space Data Structures for Range Mode Query in Arrays. STACS 2012: 290-301 - [i2]Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala:
Robust Non-Parametric Data Approximation of Pointsets via Data Reduction. CoRR abs/1205.6717 (2012) - 2011
- [i1]Stephane Durocher, Jason Morrison:
Linear-Space Data Structures for Range Mode Query in Arrays. CoRR abs/1101.4068 (2011)
2000 – 2009
- 2008
- [j5]Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Yihui Tang:
On the false-positive rate of Bloom filters. Inf. Process. Lett. 108(4): 210-213 (2008) - 2007
- [j4]Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold:
Space-efficient geometric divide-and-conquer algorithms. Comput. Geom. 37(3): 209-227 (2007) - [c7]Prosenjit Bose, Jason Morrison:
Optimal Point Set Partitioning using Rigid Motion Star Placement. CCCG 2007: 49-52 - 2006
- [c6]Prosenjit Bose, Jason Morrison:
Optimal Polygon Placement. CCCG 2006 - 2005
- [c5]Prosenjit Bose, Jason Morrison:
Translating a Star over a Point Set. CCCG 2005: 179-182 - 2004
- [j3]Pat Morin, Jason Morrison:
The geometry of carpentry and joinery. Discret. Appl. Math. 144(3): 374-380 (2004) - [j2]Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint:
Space-efficient planar convex hull algorithms. Theor. Comput. Sci. 321(1): 25-40 (2004) - 2003
- [j1]Prosenjit Bose, Marc J. van Kreveld, Anil Maheshwari, Pat Morin, Jason Morrison:
Translating a regular grid over a point set. Comput. Geom. 25(1-2): 21-34 (2003) - 2002
- [c4]Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint:
In-Place Planar Convex Hull Algorithms. LATIN 2002: 494-507 - 2001
- [c3]Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison:
The Grid Placement Problem. WADS 2001: 180-191
1990 – 1999
- 1999
- [c2]Jason Morrison, Franz Oppacher:
A General Model of Co-evolution for Genetic Algorithms. ICANNGA 1999: 262-268 - 1998
- [c1]Jason Morrison, Franz Oppacher:
Maintaining Genetic Diversity in Genetic Algorithms through Co-evolution. Canadian AI 1998: 128-138
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-02 21:49 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:
