Остановите войну!
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 28 matches
- 2004
- Ge Baolai:
On the Performance of Parallel Implementations of an ADI Scheme for Parabolic Equations with Mixed Derivatives Using Multithreads and MPI. HPCS 2004: 45-54 - Ge Baolai:
An Enhanced C/C++ and FORTRAN API to Posix Threads. HPCS 2004: 89-98 - Yangjun Chen, Yibin Chen:
Efficient Top-down Algorithms for Tree Inclusion. HPCS 2004: 183-187 - Amit Chhabra, Parimala Thulasiraman, Mohammad Towhidul Islam, Ruppa K. Thulasiram:
An OpenMP Implementation of FTCS Method for Reduced Black-Sholes Equation. HPCS 2004: 205-207 - Mohamed Dahmani, Benoît Morin, Robert Roy:
Performance Evaluation for Neutron Transport Application Using Message Passing. HPCS 2004: 129-134 - Mario A. R. Dantas, D. P. Cunha:
An Experimental Case Study of Replication on Reconciliation in a Wireless Environment. HPCS 2004: 179-182 - Mario A. R. Dantas, A. Hosken:
The ATHA Environment: Experience with a User Friendly Environment for Opportunistic Computing. HPCS 2004: 85-88 - Shaahin Filizadeh, Ani M. Gole:
Interfacing Gradient-Based Optimization Methods with Simulation Programs: A Novel Tool for the Design of High Performance Systems. HPCS 2004: 121-127 - Jürgen Foag, Thomas Wild:
Queuing Algorithm for Speculative Network Processors. HPCS 2004: 3-8 - Morgan Kan, Danny Ngo, Mark Lee, Paul Lu, Nolan Bard, Michael Closson, Meng Ding, Mark Goldenberg, Nicholas Lamb, Yang Wang, Ron Senda, Edmund Sumbar:
The Trellis Security Infrastructure: A Layered Approach to Overlay Metacomputers . HPCS 2004: 109-117 - Carson Kai-Sang Leung:
Efficient Parallel Mining of Constrained Frequent Patterns. HPCS 2004: 73-82 - F. Chris MacPhee, Virendrakumar C. Bhavsar:
Static Assignment Schemes for the Concurrent Computation of Algebraic Fractals. HPCS 2004: 189-191 - Robert D. McLeod, Sheng Huang, Marek Laskowski, Sajid Hussain:
Communication Issues within HPC Grids. HPCS 2004: 101-107 - Vishnu K. Narayanasami, Peter C. J. Graham:
Design of a User Level Data Staging System for use in High Performance Computing Systems. HPCS 2004: 213-215 - Afrin Naz, Krishna M. Kavi, Philip H. Sweany, Mehran Rezaei:
A Study of Separate Array and Scalar Caches. HPCS 2004: 157-164 - Hossein Pourreza, M. Rasit Eskicioglu, Peter C. J. Graham:
Preliminary Performance Assessment of Four Cluster Interconnects on Identical Hardware. HPCS 2004: 209-212 - Ying Qian, Ahmad Afsahi, Nathan R. Fredrickson, Reza Zamani:
Performance Evaluation of the Sun Fire Link SMP Clusters. HPCS 2004: 145-156 - José M. Rodríguez, F. Chris MacPhee, David J. Bonham, Virendrakumar C. Bhavsar:
Solving the Quadratic Assignment and Dynamic Plant Layout Problems Using a New Hybrid Meta-Heuristic Approach. HPCS 2004: 9-16 - Angela C. Sodan, Xuemin Huang:
Adaptive Time/Space Sharing with SCOJO. HPCS 2004: 165-176 - Angela C. Sodan, Gang Hu:
GAMine - Generalized Intelligent Middleware for Data Access in Parallel Scientific Datamining. HPCS 2004: 199-203 - Robert J. Thacker, Hugh M. P. Couchman:
A New Fast Parallel Statistical Measurement Technique for Computational Cosmology. HPCS 2004: 37-43 - Ruppa K. Thulasiram, Chen Zhen, Abba B. Gumel:
A Second Order L0 Stable Algorithm for Evaluating European Options. HPCS 2004: 17-23 - Mesbah Uddin, Andrew Pollard:
MPI Scalability of a Large Memory LES Code. HPCS 2004: 55-61 - James Wadsley, Gopi Veerevalli, Hugh Couchman:
Numerical Mixing and and Entropy Transport for Compressible CFD Applications. HPCS 2004: 63-71 - Justin W. L. Wan, Kevin Lai, Adam W. Kolkiewicz, Ken Seng Tan:
A Parallel Quasi-Monte Carlo Approach to Pricing American Options. HPCS 2004: 27-35 - Ying Zhou, Angela C. Sodan:
Survey of Zero-Copy Optimization in User-Level Communication and Adaptive Knowledge-Based Solution. HPCS 2004: 193-197 - Brian J. d'Auriol, Maria Beltran:
Optical Bus Communication Modeling and Simulation. HPCS 2004: 135-142 - M. Rasit Eskicioglu:
Proceedings of the 18th Annual Symposium on High Performance Computing Systems and Applications, HPCS 2004, May 16-19, 2004, Winnipeg, Manitoba, Canada. University of Manitoba, Department of Computer Science 2004, ISBN 0-9735472-0-0 [contents]
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-30 17:20 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