"An O(n2log⁡m)-time algorithm for the boxed-mesh permutation pattern ..."

Sukhyeun Cho, Joong Chae Na, Jeong Seop Sim (2018)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2017.02.022

access: closed

type: Journal Article

metadata version: 2018-02-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/ChoNS18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ChoNS18
Sukhyeun Cho, Joong Chae Na, Jeong Seop Sim:
An O(n2log⁡m)-time algorithm for the boxed-mesh permutation pattern matching problem. Theor. Comput. Sci. 710: 35-43 (2018)

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.