Pat Morin

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Meng He 0001

> Home > Persons > Pat Morin

Publications

2012
[j53]
- view
  authority control:
- export record
  dblp key:
  - journals/talg/BoseCHMM12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/BoseCHMM12
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct geometric indexes supporting point location queries. ACM Trans. Algorithms 8(2): 10:1-10:26 (2012)
2009
[c40]
- view
  authority control:
- export record
  dblp key:
  - conf/soda/BoseCHMM09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/BoseCHMM09
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct geometric indexes supporting point location queries. SODA 2009: 635-644
[c39]
- view
  authority control:
- export record
  dblp key:
  - conf/wads/BoseHMM09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wads/BoseHMM09
Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin:
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. WADS 2009: 98-109
2008
[i8]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-0805-4147
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0805-4147
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct Geometric Indexes Supporting Point Location Queries. CoRR abs/0805.4147 (2008)

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.