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 43 matches
- 1992
- Selim G. Akl, Ivan Stojmenovic:
A Simple Optimal Systolic Algorithm for Generating Permutations. Parallel Process. Lett. 2: 231-239 (1992) - Eliezer A. Albacea:
Computation List Evaluation and Ist Applications. Parallel Process. Lett. 2: 321-329 (1992) - A. T. Ali, Erik L. Dagless:
A Parallel Processing Model for Real-Time Computer Vision-Aided Road Traffic Monitoring. Parallel Process. Lett. 2: 257-264 (1992) - Khaled A. Aly, Patrick W. Dowd:
Reconfigarable Parallel Computer Architecture Based on Wavelenght-Division Multiplexed Optical Interconnection Network. Parallel Process. Lett. 2: 117-127 (1992) - Evripidis Bampis, Jean-Claude König, Denis Trystram:
A Low Overhead Schedule for a 3D-Grid Graph. Parallel Process. Lett. 2: 363-372 (1992) - Michael Barnett, Christian Lengauer:
Unimodularity and the Prallelization of Loops. Parallel Process. Lett. 2: 273-281 (1992) - Jean-Claude Bermond, Pavol Hell, Jean-Jacques Quisquater:
Construction of Large Packet Radio Networks. Parallel Process. Lett. 2: 3-12 (1992) - Pascal Berthomé:
Efficient K-Selection in Hypercube Multiprocessors. Parallel Process. Lett. 2: 221-230 (1992) - Dharmavani Bhagavathi, Stephan Olariu, James L. Schwing, Jingyuan Zhang:
Convex Polygon Problems on Meshes with Multiple Broadcasting. Parallel Process. Lett. 2: 249-256 (1992) - Terry Bossomaier, Natalina Isidoro, Adrian Loeff:
Dara Parallel Computation of Euclidean Distance Transforms. Parallel Process. Lett. 2: 331-339 (1992) - Abdelmadjid Bouabdallah, Jean-Claude König:
An Improvement of Maekawa's Mutual Exclusion Algorithm to Make It Fault-Tolerant. Parallel Process. Lett. 2: 283-290 (1992) - Svante Carlsson, Jingsen Chen:
Parallel Constructions of Heaps and Min-Max Heaps. Parallel Process. Lett. 2: 311-320 (1992) - Bogdan S. Chlebus:
Two Selection Algorithms on a Mesh-Connected Computer. Parallel Process. Lett. 2: 341-346 (1992) - Antonio Corradi, Letizia Leonardi, Franco Zambonelli:
Load Balancing Strategies for Massively Parallel Architectures. Parallel Process. Lett. 2: 139-148 (1992) - Anatoly E. Doroshenko:
On Asynchronous Avoidance of Deadlocks in Parallel Programs. Parallel Process. Lett. 2: 291-297 (1992) - José Duato:
Channel Classes: A New Concept for Deadlock Avoidance in Wormhole Networks. Parallel Process. Lett. 2: 347-354 (1992) - Hassan Elhage, Ivan Stojmenovic:
Systolic Generation of combinations from Arbitrary Elements. Parallel Process. Lett. 2: 241-248 (1992) - Ivan De Falco, Renato Del Balio, Ernesto Tarantino, Roberto Vaccaro:
Simulation of Genetic Algorithms on MIMD Multicomputers. Parallel Process. Lett. 2: 381-389 (1992) - Rainer Feldmann, Walter Unger:
The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network. Parallel Process. Lett. 2: 13-19 (1992) - Mitchell Flatebo, Ajoy Kumar Datta:
Distributed Deadlock Detection Algorithms. Parallel Process. Lett. 2: 21-30 (1992) - Giulia Galbiati, Francesco Maffioli:
Constructing an Exact Parity Base Is in RNC2. Parallel Process. Lett. 2: 301-309 (1992) - Michel Gastaldo, Michel Morvan, John Michael Robson:
Transitive Closure in Parallel on a Linear Network of Processors. Parallel Process. Lett. 2: 195-203 (1992) - Michael Griebel:
The Combination Technique for the Sparse Grid Solution of PDE's on Multiprocessor Machines. Parallel Process. Lett. 2: 61-70 (1992) - David J. Haglin:
Approximating Maximum 2-CNF Satisfiability. Parallel Process. Lett. 2: 181-187 (1992) - Wen-Jing Hsu, Carl V. Page:
Embedding Mesh in a Large Family of Graphs. Parallel Process. Lett. 2: 149-155 (1992) - Theodore Johnson, Timothy A. Davis:
Parallel Buddy Memory Management. Parallel Process. Lett. 2: 391-398 (1992) - Do-Hyung Kim, Kwang-Moo Choe, Taisook Han:
Refined Mark(s)-Set-Based Backtrack Literal Selection for and Parallelism in Logic Programs. Parallel Process. Lett. 2: 71-79 (1992) - Ramesh Krishnamurti, Bhagirath Narahari:
Optimal Subcube Assignment for Partitionable Hypercubes. Parallel Process. Lett. 2: 89-95 (1992) - Miroslaw Kutylowski, Rolf Wanka:
Periodic Sorting on Two-Dimensional Meshes. Parallel Process. Lett. 2: 213-220 (1992) - Patrick M. Lenders:
Multi-Rate Arrays and Affince Recurrence Equations. Parallel Process. Lett. 2: 373-380 (1992)
skipping 13 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-09-27 22:23 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