default search action

combined dblp search
author search
venue search
publication search

ask others

Oktay M. Kasim-Zade

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2010 – 2019

see FAQ

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

2010
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/fuin/AlbrechtCIKLS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/AlbrechtCIKLS10
Andreas Alexander Albrecht, Alexander V. Chaskin, Costas S. Iliopoulos, Oktay M. Kasim-Zade, Georgios Lappas, Kathleen Steinhöfel:
A Note on a priori Estimations of Classification Circuit Complexity. Fundam. Informaticae 104(3): 201-217 (2010)

2000 – 2009

see FAQ

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

2005
[e1]
- view
  authority control:
- export record
  dblp key:
  - conf/saga/2005
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/saga/2005
Oleg B. Lupanov, Oktay M. Kasim-Zade, Alexander V. Chaskin, Kathleen Steinhöfel:
Stochastic Algorithms: Foundations and Applications, Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005, Proceedings. Lecture Notes in Computer Science 3777, Springer 2005, ISBN 3-540-29498-8 [contents]
2001
[j1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/Kasim-Zade01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Kasim-Zade01
Oktay M. Kasim-Zade:
On minimal coverings of the Boolean cube by centered antichains. Discret. Appl. Math. 114(1-3): 147-153 (2001)

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.