Остановите войну!
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 53 matches
- 1993
- Hesham H. Ali, Hesham El-Rewini:
The Time complexity of Scheduling Interval Orders with Communication Is Polynomial. Parallel Process. Lett. 3: 53-58 (1993) - Agustin Arruabarrena, Ramón Beivide, Cruz Izu, José Miguel-Alonso:
A Perfomance Evaluation of Adaptive Routing in Bidimensional Cut-Through Networks. Parallel Process. Lett. 3: 469-484 (1993) - Vincenzo Auletta, Adele Anna Rescigno, Vittorio Scarano:
Fault Tolerant Routing in the Supercube. Parallel Process. Lett. 3: 393-405 (1993) - Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber:
An Optimal Algorithm for computing Census Functions in Message-Passing Systems. Parallel Process. Lett. 3: 19-23 (1993) - Dominique Barth:
Embedding Meshes of d-Ary Trees into de Bruijn Graphs. Parallel Process. Lett. 3: 115-127 (1993) - Abdelmadjid Bouabdallah, Jean-Claude König:
An Improvement of the Maekawa's Mutual Exclusion Algorithm to Make it Fault-Tolerant. Parallel Process. Lett. 3: 305 (1993) - Jehoshua Bruck, Ching-Tien Ho:
Efficient Global Combine Operations in Multi-Port Message-Passing Systems. Parallel Process. Lett. 3: 335-346 (1993) - Edson Cáceres, Narsingh Deo, Shivakumar Sastry, Jayme Luiz Szwarcfiter:
On Finding Euler Tours in Parallel. Parallel Process. Lett. 3: 223-231 (1993) - Leizhen Cai, J. Mark Keil:
Degree-Bounded Spanners. Parallel Process. Lett. 3: 457-468 (1993) - N. Chandrasekharan, Laks V. S. Lakshmanan, Muralidhar Medidi:
Efficient Parallel Algorithms for Finding Chordless Cycles in Graphs. Parallel Process. Lett. 3: 165-170 (1993) - Henri-Pierre Charles, Pierre Fraigniaud:
Scheduling a Scattering-Gathering Sequence on Hypercubes. Parallel Process. Lett. 3: 29-42 (1993) - Steven Cheung, Francis C. M. Lau:
Time Lower Bounds for Permutation Routing on Multi-Dimensional Bused Meshes. Parallel Process. Lett. 3: 129-138 (1993) - Kuo-Liang Chung, Hsun-Wen Chang:
Novel Pipelining and Processor Allocation Strategy for Monoid Computations on Unshuffle-Exchange Networks. Parallel Process. Lett. 3: 189-193 (1993) - Frederic Daniel, Gerard Authié:
Shortest Paths Multiplicity in Generalized de Bruijn and Kautz Networks. Parallel Process. Lett. 3: 363-374 (1993) - Anindya Das, Krishnaiyan Thulasiraman, K. B. Lakshmanan, Vinod K. Agarwal:
Distributed Fault diagnosis of a Ring of Processors. Parallel Process. Lett. 3: 195-204 (1993) - José Duato:
On the Design of Deadlock-Free Adaptive Multicast Routing Algorithms. Parallel Process. Lett. 3: 321-333 (1993) - Arthur M. Farley, Andrzej Proskurowski:
Self-Repairing Networks. Parallel Process. Lett. 3: 381-391 (1993) - Miguel Angel Fiol, Josep Fàbrega, Oriol Serra, J. Luis A. Yebra:
A Unified Approach to the design and Control of Dynamic Memory Networks. Parallel Process. Lett. 3: 445-456 (1993) - Pierre Fiorini:
The Xomega & the Omega Pyramids, a New Family of Competitive Interconnection Networks. Parallel Process. Lett. 3: 495-506 (1993) - Dmitry Fon-Der-Flaass, Ivan Rival:
Collecting Information in Graded Ordered Sets. Parallel Process. Lett. 3: 253-260 (1993) - Paraskevi Fragopoulou:
On the Efficient Summation of N Numbers on an N-Processor Reconfigurable Mesh. Parallel Process. Lett. 3: 71-78 (1993) - Paraskevi Fragopoulou:
On the Comparative Powers of the 2D-Parbs and the CRCW-Pram Models. Parallel Process. Lett. 3: 301-304 (1993) - Pierre Fraigniaud, Arthur L. Liestman, Dominique Sotteau:
Open Problems. Parallel Process. Lett. 3: 507-524 (1993) - Satoshi Fujita, Masafumi Yamashita:
Optimal Gossiping in Mesh-Bus Computers. Parallel Process. Lett. 3: 357-361 (1993) - Paul Gastin, Vincent Villain:
An Efficient Crash-tolerant Sequential Traversal. Parallel Process. Lett. 3: 87-97 (1993) - Ján Glasa:
Bit-Level Systolic Arrays for Digital Contour Smoothing by Abel-Poisson Kernel. Parallel Process. Lett. 3: 43-51 (1993) - Raymond Greenlaw:
Breadth-Depth Search is P-Complete. Parallel Process. Lett. 3: 209-222 (1993) - Lisa Higham, Eric Schenk:
Pram Memory Allocation and Initialization. Parallel Process. Lett. 3: 291-299 (1993) - Lih-Hsing Hsu:
Matching Polynomials of Series-Parallel Graphs. Parallel Process. Lett. 3: 13-18 (1993) - Chris R. Jesshope:
Latency Reduction in VLSI Routers. Parallel Process. Lett. 3: 485-494 (1993)
skipping 23 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-05-29 22:14 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