Остановите войну!
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 104 matches
- 1991
- Arthur Abnous, Nader Bagherzadeh:
Special Features of a VLIW Architecture. IPPS 1991: 224-227 - Mokhtar Aboelaze:
Multi-level Hypercube Network. IPPS 1991: 475-480 - Selim Akyokus, P. Bruce Berra:
Otpical Content Addressable Memories for Data/Knowledge Base Processing. IPPS 1991: 202-207 - Peter M. Athanas, Harvey F. Silverman:
Amstrong II: A Loosely Coupled Multiprocessor with a Reconfigurable Communications Architecture. IPPS 1991: 385-388 - Alberto Avritzer, Mario Gerla, Jack W. Carlyle:
A Load Sharing Interconnection Network for Hard Real-Time Systems. IPPS 1991: 591-598 - Isik Aybay, Mehmet Baray:
An OR-Parallel and Restricted AND-Parallel Nonbacktracking Prolog Execution Model. IPPS 1991: 642-645 - Anupam Basu, S. Srinivas, Kamlesh G. Kumar, Arogyaswami Paulraj, Lalit M. Patnaik:
Performance Analysis of Algorithms on a Message Passing Multiprocessor. IPPS 1991: 43-50 - Jeffrey C. Becker, Charles U. Martel, Arvin Park:
General Asynchrony Is Not Expensive for PRAMs. IPPS 1991: 70-75 - Krishna P. Belkhale, Prithviraj Banerjee:
A Scheduling Algorithm for Parallelizable Dependent Tasks. IPPS 1991: 500-506 - Abdelghani Bellaachia, Abdou Youssef:
Greedy Partitioning Strategy for Banyan-Hypercube Networks. IPPS 1991: 487-490 - Thomas B. Berg, Howard Jay Siegel:
Instruction Execution Trade-Offs for SIMD vs. MIMD vs. Mixed Mode Parallelism. IPPS 1991: 301-308 - Judith O. Berkey, Pearl Y. Wang:
A Parallel Approximation Algorithm for Solving One-Dimensional Bin Packing Problems. IPPS 1991: 138-143 - Alfred Brenner, Richard F. Freund, R. Stockton Gaines, Rob Kelly, Louis Lome, Richard McAndrew, Alexandru Nicolau, Janak H. Patel, Thomas Probert, John H. Reif, Jorge L. C. Sanz, Howard Jay Siegel, Jon A. Webb:
How Do We Make Parallel Processing a Reality? Bridging the Gap Between Theory and Practice. IPPS 1991: 648-653 - John D. Bruner, Hoichi Cheong, Alexander V. Veidenbaum, Pen-Chung Yew:
Chief: A Parallel Simulation Environment for Parallel Systems. IPPS 1991: 568-575 - Roger D. Chamberlain, Mark A. Franklin:
Analysis of Parallel Mixed-Mode Simulation Algorithms. IPPS 1991: 155-160 - Ghulam M. Chaudhry, J. S. Bedi:
State Variable Model for a Class of Multiprocessor Systems. IPPS 1991: 377-380 - Calvin Ching-Yuen Chen, Sajal K. Das:
A Cost-Optimal Parallel Algorithm for the Parentheses Matching Problem on an EREW PRAM. IPPS 1991: 132-137 - Alok N. Choudhary, Ravi Ponnusamy:
Guided Scheduling Schemes for Image Understanding Tasks for Shared and Distributed Memory Multiprocessors. IPPS 1991: 260-264 - Chih-Ping Chu, Doris L. Carver:
An Analysis of Recurrence Relations in Fortran Do-loops for Vector Processing. IPPS 1991: 619-625 - Soon Myoung Chung:
Optical Database Machine Using Spatial Light Rebroadcasters. IPPS 1991: 265-268 - Kechang Dai, Wolfgang K. Giloi:
Confining Imperative Languages for Parallel Processing. IPPS 1991: 576-581 - Sajal K. Das, Cui-Qing Yang:
Performance of Parallel Spanning Tree Algorithms on Linear Arrays of Transputers and Unix Systems. IPPS 1991: 165-168 - Ronald F. DeMara, Dan I. Moldovan:
Design of a Clustered Multiprocessor for Real-time Natural Language Understanding. IPPS 1991: 270-277 - B. Dehbonei, Christophe Laurent, Nadia Tawbi, R. S. Kulkarni:
PMACS: An Environment for Parallel Programming. IPPS 1991: 638-641 - Adam Dingle, Hassan R. Barada:
Optimum Embeddings of End-Around Meshes into Pyramid Networks. IPPS 1991: 445-451 - Kemal Efe, Kumar Ramaiyer:
Congestion and Fault Tolerance of Binary Tree Embeddings on Hypercube. IPPS 1991: 458-463 - Khaled M. Elleithy, Magdy A. Bayoumi:
From Algorithms to Parallel Architectures: A Formal Approach. IPPS 1991: 358-363 - S. Erlich, K. Yao:
Systolic Array Architecture for Adaptive Eigenstructure Decomposition of Correlation Matrices. IPPS 1991: 371-376 - Michael Ogbonna Esonu, Asim J. Al-Khalili, Salim Hariri:
On the Design of Optimal Fault-Tolerant Systolic Array Architecures. IPPS 1991: 352-357 - Paraskevas Evripidou, Jean-Luc Gaudiot:
Input/Output Operations for Hybrid Data-Flow/Control-Flow Systems. IPPS 1991: 318-323
skipping 74 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-27 18:31 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