Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Sergey A. Zabelok

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 Vladimir Kolobov

> Home > Persons > Sergey A. Zabelok

Publications

2015
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/jcphy/ZabelokAK15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcphy/ZabelokAK15
Sergey A. Zabelok, Robert Arslanbekov, Vladimir Kolobov:
Adaptive kinetic-fluid solvers for heterogeneous computing architectures. J. Comput. Phys. 303: 455-469 (2015)
2007
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/jcphy/KolobovAAFZ07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcphy/KolobovAAFZ07
V. I. Kolobov, R. R. Arslanbekov, Vladimir V. Aristov, A. A. Frolova, Sergey A. Zabelok:
Unified solver for rarefied and continuum flows with adaptive mesh and algorithm refinement. J. Comput. Phys. 223(2): 589-608 (2007)
[c1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/iccS/AristovFZKA07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccS/AristovFZKA07
Vladimir V. Aristov, A. A. Frolova, Sergey A. Zabelok, V. I. Kolobov, R. R. Arslanbekov:
Multi-scale Simulations of Gas Flows with Unified Flow Solver. International Conference on Computational Science (1) 2007: 850-857

a service of

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.