Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 45 matches
- 2011
- Farid M. Ablayev, Alexander Vasiliev:
Classical and Quantum Parallelism in the Quantum Fingerprinting Method. PaCT 2011: 1-12 - Panagiotis Adamidis, Irina Fast, Thomas Ludwig:
Performance Characteristics of Global High-Resolution Ocean (MPIOM) and Atmosphere (ECHAM6) Models on Large-Scale Multicore Cluster. PaCT 2011: 390-403 - Giancarlo Alfonsi, Stefania A. Ciliberti, Marco Mancini, Leonardo Primavera:
Performances of Navier-Stokes Solver on a Hybrid CPU/GPU Computing System. PaCT 2011: 404-416 - Stefania Bandini, Federico Rubagotti, Giuseppe Vizzari, Kenichiro Shimura:
A Cellular Automata Based Model for Pedestrian and Group Dynamics: Motivations and First Experiments. PaCT 2011: 125-139 - Olga L. Bandman:
Using Multi Core Computers for Implementing Cellular Automata Systems. PaCT 2011: 140-151 - Oleg Bessonov:
OpenMP Parallelization of a CFD Code for Multicore Computers: Analysis and Comparison. PaCT 2011: 13-22 - Andrey Borisenko, Philipp Kegel, Sergei Gorlatch:
Optimal Design of Multi-product Batch Plants Using a Parallel Branch-and-Bound Method. PaCT 2011: 417-430 - Carmen Bratosin, Natalia Sidorova, Wil M. P. van der Aalst:
Distributed Genetic Process Mining Using Sampling. PaCT 2011: 224-237 - Jerzy Brzezinski, Dariusz Dwornikowski, Jacek Kobusinski:
FaDe: RESTful Service for Failure Detection in SOA Environment. PaCT 2011: 238-243 - Bartosz Chojnacki, Tomasz Maka, Piotr Dziurzanski:
Virtual Path Implementation of Multi-stream Routing in Network on Chip. PaCT 2011: 431-436 - Arkadiusz Danilecki, Mateusz Holenko, Anna Kobusinska, Michal Szychowiak, Piotr Zierhoffer:
ReServE Service: An Approach to Increase Reliability in Service Oriented Systems. PaCT 2011: 244-256 - Pierpaolo Degano, Gian-Luigi Ferrari, Gianluca Mezzetti:
On Quantitative Security Policies. PaCT 2011: 23-39 - Zuohua Ding, Hui Shen, Jianwen Cao:
Hypergraph Partitioning for the Parallel Computation of Continuous Petri Nets. PaCT 2011: 257-271 - Alexey Dordopulo, Igor Kaliaev, Ilya I. Levin, Liubov Slasten:
High-Performance Reconfigurable Computer Systems. PaCT 2011: 272-283 - Dmitry Evtyushkin, Peter Panfilov, Dmitry Ponomarev:
CacheVisor: A Toolset for Visualizing Shared Caches in Multicore and Multithreaded Processors. PaCT 2011: 284-289 - Rolf Hoffmann, Dominique Désérable:
Efficient Minimal Routing in the Triangular Grid with Six Channels. PaCT 2011: 152-165 - Evgeny Ivashko, Natalia Nikitina:
Web Service of Access to Computing Resources of BOINC Based Desktop Grid. PaCT 2011: 437-443 - Noman Javed, Frédéric Loulergue:
A Formal Programming Model of Orléans Skeleton Library. PaCT 2011: 40-52 - Konstantin Kalgin:
Domain Specific Language and Translator for Cellular Automata Models of Physico-Chemical Processes. PaCT 2011: 166-174 - Evgeniya Karepova, Ekaterina Dementyeva:
Solution of Assimilation Observation Data Problem for Shallow Water Equations for SMP-Nodes Cluster. PaCT 2011: 444-451 - Sergey Kireev, Victor Malyshkin, Hamido Fujita:
The LuNA Library of Parallel Numerical Fragmented Subroutines. PaCT 2011: 290-301 - Alexander A. Lazarev, Anton Salnikov, Anton Baranov:
Graphical Algorithm for the Knapsack Problems. PaCT 2011: 459-466 - Victor E. Malyshkin, Vladislav Perepelkin:
LuNA Fragmented Programming System, Main Functions and Peculiarities of Run-Time Subsystem. PaCT 2011: 53-61 - Mikhail Marchenko:
PARMONC - A Software Library for Massively Parallel Stochastic Simulation. PaCT 2011: 302-316 - Ami Marowka:
On Performance Analysis of a Multithreaded Application Parallelized by Different Programming Models Using Intel VTune. PaCT 2011: 317-331 - Yuri Medvedev:
Dynamic Load Balancing for Lattice Gas Simulations on a Cluster. PaCT 2011: 175-181 - Ivan Merelli, Dario Pescini, Ettore Mosca, Paolo Cazzaniga, Carlo Maj, Giancarlo Mauri, Luciano Milanesi:
Grid Computing for Sensitivity Analysis of Stochastic Biological Models. PaCT 2011: 62-73 - Benjamin Milde, Michael Schneider:
A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices. PaCT 2011: 452-458 - Achour Mostéfaoui, Michel Raynal:
Looking for Efficient Implementations of Concurrent Objects. PaCT 2011: 74-87 - Thomas Müller, Carsten Trinitis, Jasmin Smajic:
Cache Efficiency and Scalability on Multi-core Architectures. PaCT 2011: 88-97
skipping 15 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-28 15:00 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint