default search action

combined dblp search
author search
venue search
publication search

ask others

Oktay Sh. Mukhtarov

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2020 – today

see FAQ

What is the meaning of the colors in the publication lists?

2021
[j3]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/mma/MukhtarovA21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mma/MukhtarovA21
Oktay Sh. Mukhtarov, Kadriye Aydemir:
Oscillation Properties for non-Classical Sturm-Liouville Problems with additional Transmission conditions. Math. Model. Anal. 26(3): 432-443 (2021)
2020
[j2]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/complexity/MukhtarovYA20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/complexity/MukhtarovYA20
Oktay Sh. Mukhtarov, Merve Yücel, Kadriye Aydemir:
Treatment a New Approximation Method and Its Justification for Sturm-Liouville Problems. Complex. 2020: 8019460:1-8019460:8 (2020)

2000 – 2009

see FAQ

What is the meaning of the colors in the publication lists?

2007
[j1]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/cma/KadakalM07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cma/KadakalM07
M. Kadakal, Oktay Sh. Mukhtarov:
Sturm-Liouville problems with discontinuities at two points. Comput. Math. Appl. 54(11-12): 1367-1379 (2007)

Coauthor Index

see FAQ

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.