Sergey Panitkin

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 Jack C. Wells

> Home > Persons > Sergey Panitkin

Publications

2018
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/eScience/AnanthrajDJKOOM18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eScience/AnanthrajDJKOOM18
V. Ananthraj, Kaushik De, Shantenu Jha, Alexei Klimentov, Danila Oleynik, Sarp H. Oral, André Merzky, Ruslan Mashinistov, Sergey Panitkin, P. Svirin, Matteo Turilli, Jack C. Wells, Sean R. Wilkinson:
Towards Exascale Computing for High Energy Physics: The ATLAS Experience at ORNL. eScience 2018: 341-342
2017
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/eScience/OleynikPTAODKWJ17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eScience/OleynikPTAODKWJ17
Danila Oleynik, Sergey Panitkin, Matteo Turilli, Alessio Angius, Sarp H. Oral, Kaushik De, Alexei Klimentov, Jack C. Wells, Shantenu Jha:
High-Throughput Computing on High-Performance Platforms: A Case Study. eScience 2017: 295-304
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/AngiusOPTDKOWJ17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/AngiusOPTDKOWJ17
Alessio Angius, Danila Oleynik, Sergey Panitkin, Matteo Turilli, Kaushik De, Alexei Klimentov, Sarp H. Oral, Jack C. Wells, Shantenu Jha:
Converging High-Throughput and High-Performance Computing: A Case Study. CoRR abs/1704.00978 (2017)

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.