![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 32 matches
- 1995
- Vincenzo Auletta, Alberto Negro, Vittorio Scarano
:
Fast Execution of Irregularly Structured Programs with Low Communication Frequency on the Hypercube. IRREGULAR 1995: 59-73 - Cevdet Aykanat, Ismail Haritaoglu:
An Efficient Mean Field Annealing Formulation for Mapping Unstructured Domains to Hypercubes. IRREGULAR 1995: 115-120 - Abdelhamid Benaini, David Laiymani, Guy-René Perrin:
A Reconfigurable Parallel algorithm for Sparse Cholesky Factorization. IRREGULAR 1995: 261-274 - Cristina Boeres, George Chochia, Peter Thanisch:
On the Scope of Applicability of the ETF Algorithm. IRREGULAR 1995: 159-164 - George Horatiu Botorog, Herbert Kuchen:
Algorithmic Skeletons for Adaptive Multigrid Methods. IRREGULAR 1995: 27-41 - Arie de Bruin, Gerard A. P. Kindervater, Harry W. J. M. Trienekens:
Asynchronous Parallel Branch and Bound and Anomalies. IRREGULAR 1995: 363-377 - Till Bubeck, M. Hiller, Wolfgang Küchlin, Wolfgang Rosenstiel:
Distributed Symbolic Computation with DTS. IRREGULAR 1995: 231-248 - Charles R. Cantor, Takeshi Sano, Natalia E. Broude, Cassandra L. Smith:
Parallel Processing in DNA Analysis. IRREGULAR 1995: 171-185 - Ricardo C. Corrêa
:
A Parallel Formulatiion for General Branch-and-Bound Algorithms. IRREGULAR 1995: 395-409 - Amitabha Das, Louise E. Moser, P. M. Melliar-Smith:
A Parallel Processing Paradigm for Irregular Applications. IRREGULAR 1995: 249-254 - Ralf Diekmann, Derk Meyer, Burkhard Monien:
Parallel Decomposition of Unstructured FEM-Meshes. IRREGULAR 1995: 199-215 - Felipe M. G. França
, Luérbio Faria:
Optimal Mapping of Neighbourhood-Constrained Systems. IRREGULAR 1995: 165-170 - Cong Fu, Tao Yang, Apostolos Gerasoulis:
Integrating Software Pipelining and Graph Scheduling for Iterative Scientific Computations. IRREGULAR 1995: 127-141 - Miguel Ángel García:
Massively Parallel Approximation of Irregular Triangular Meshes with G¹ Parametric Surfaces. IRREGULAR 1995: 217-230 - Thierry Gautier, Jean-Louis Roch, Gilles Villard:
Regular versus Irregular Problems and Algorithms. IRREGULAR 1995: 1-25 - Philip W. Grant, Michael F. Webster, Xiaoming Zhang:
Solving Computational Fluid Dynamics Problems on Unstructured Grids with Distributed Parallel Processing. IRREGULAR 1995: 187-197 - Benjamin Hao, David Pearson:
Instruction Scheduling and Global Register Allocation for SIMD Multiprocessors. IRREGULAR 1995: 81-86 - Wilhelm Hasselbring, Robert B. Fisher:
Using the ProSet-Linda Prototyping Language for Investigating MIMD Algorithms for Model Matching in 3-D Computer Vision. IRREGULAR 1995: 301-315 - Holger Hopp, Peter Sanders:
Parallel Game Tree Search on SIMD Machines. IRREGULAR 1995: 349-361 - Klaus Jansen, Sabine R. Öhring:
Approximation Algorithms for Time Constrained Scheduling. IRREGULAR 1995: 143-157 - V. Prasad Krothapalli, Thulasiraman Jeyaraman, Mark Giesbrecht:
Run-Time Parallelization of Irregular DOACROSS Loops. IRREGULAR 1995: 75-80 - Sathiamoorthy Manoharan
:
General Bounds for the Assignment of Irregular Dependency Graphs. IRREGULAR 1995: 87-98 - Serge Miguet, Jean-Marc Pierson
:
Load Balancing Strategies for a Parallel System of Particles. IRREGULAR 1995: 255-260 - Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D. Mavridou, Mauricio G. C. Resende:
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP. IRREGULAR 1995: 317-331 - Peter Sanders:
Better Algorithms for Parallel Backtracking. IRREGULAR 1995: 333-347 - Peter Sanders:
Fast Priority Queues for Parallel Branch-and-Bound. IRREGULAR 1995: 379-393 - Ranjan K. Sen:
a New Scheme for Dynamic Processor Assignment for Irregular Problems. IRREGULAR 1995: 99-113 - Stefan Tschöke, Norbert Holthöfer:
A New Parallel Approach to the Constrained Two-Dimensional Cutting Stock Problem. IRREGULAR 1995: 285-300 - Andreas Uhl:
Adapted Wavelet Analysis on Moderate Parallel Distributed Memory MIMD Architectures. IRREGULAR 1995: 275-283 - Manuel Ujaldon, Shamik D. Sharma, Joel H. Saltz, Emilio L. Zapata:
Run-Time Techniques for Parallelizing Sparse Matrix Problems. IRREGULAR 1995: 43-57
skipping 2 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-18 22:55 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