Gad M. Landau

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 Sung Gwan Park

> Home > Persons > Gad M. Landau

Publications

2020
[j76]
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/ParkBALP20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ParkBALP20
Sung Gwan Park, Magsarjav Bataa, Amihood Amir, Gad M. Landau, Kunsoo Park:
Finding patterns and periods in Cartesian tree matching. Theor. Comput. Sci. 845: 181-197 (2020)
2019
[c75]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/cpm/ParkALP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/ParkALP19
Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
Cartesian Tree Matching and Indexing. CPM 2019: 16:1-16:14
[c73]
- view
  authority control:
- export record
  dblp key:
  - conf/iwoca/BataaPALP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwoca/BataaPALP19
Magsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
Finding Periods in Cartesian Tree Matching. IWOCA 2019: 70-84
[i12]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1905-08974
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1905-08974
Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
Cartesian Tree Matching and Indexing. CoRR abs/1905.08974 (2019)

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.