Остановите войну!
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 140 matches
- 1990
- Hussam Y. Abujbara, Sami A. Al-Arian:
Self-testing and self-reconfiguration architecture for 2-D WSI arrays. SPDP 1990: 527-530 - Ajit Agrawal:
Fault-tolerant computing on trees. SPDP 1990: 707-714 - Ishfaq Ahmad, Arif Ghafoor:
A semi distributed load balancing scheme for large multicomputer systems. SPDP 1990: 562-569 - Makoto Amamiya, Rin-Ichiro Taniguchi:
Datarol: a massively parallel architecture for functional languages. SPDP 1990: 726-735 - K. C. Anand, Dharma P. Agrawal, Nita M. Kini:
Efficient routing and conflict resolution in F and IADM networks. SPDP 1990: 556-559 - E. Aposporidis, F. Lohnert, P. Mehring:
Multi-level VLSI simulator for general purpose parallel machines. SPDP 1990: 275-278 - Anish Arora, Mohamed G. Gouda, Ted Herman:
Composite Routing Protocols. SPDP 1990: 70-78 - Rassul Ayani:
LR-algorithm: concurrent operations on priority queues. SPDP 1990: 22-25 - Michael Barnett:
The formal derivation of distributed programs from systolic arrays. SPDP 1990: 363-366 - Azer Bestavros, Thomas E. Cheatham, Dan C. Stefanescu:
Parallel bin packing using first fit and k-delayed best-fit heuristics. SPDP 1990: 501-504 - Riccardo Bettati, Jane W.-S. Liu:
Algorithms for end-to-end scheduling to meet deadlines. SPDP 1990: 62-67 - D. Bhatia:
Restructuring wafers for maximum yield and some applications of WSI. SPDP 1990: 750-753 - David C. Cann, John Feo, Thomas DeBoni:
SISAL 1.2: high-performance applicative computing. SPDP 1990: 612-616 - Mee Yee Chan, Shiang-Jen Lee:
Subcube Recognition, Allocation/Deallocation and Relocation in Hypercubes. SPDP 1990: 87-93 - Si-En Chang, Mark L. Manwaring, Y. Paul Chiang:
Extended restricted AND-parallelism execution model. SPDP 1990: 471-474 - Cheng-Hsi Chen, Ioannis G. Tollis:
Parallel algorithms for slicing floorplan designs. SPDP 1990: 279-282 - Calvin Ching-Yuen Chen, Hee Yong Youn:
A comprehensive modeling for performance evaluation of regular interconnection network. SPDP 1990: 768-775 - Fu-Chiung Cheng, Huei-Huang Chen, Jiin-Hwai Perng:
Parallel execution on production systems. SPDP 1990: 463-470 - S. E. Chern, R. T. Jacob, Ivor P. Page:
Variations on the drinking philosophers algorithm. SPDP 1990: 685-688 - Hyeong-Ah Choi, Bhagirath Narahari:
Scheduling precedence graphs to minimize total system time in partitionable parallel architectures. SPDP 1990: 407-410 - Douglas Comer, Raj Yavatkar:
High-speed propagation of link status routing control information. SPDP 1990: 190-194 - Diane J. Cook, Lawrence B. Holder:
Accelerated learning on the connection machine. SPDP 1990: 448-454 - Galigekere R. Dattatreya, Ramaswamy Venkatesh:
Average response time minimization in star-connected computer networks. SPDP 1990: 591-594 - Frank K. H. A. Dehne, Susanne E. Hambrusch:
Parallel algorithms for determining k-width- connectivity in binary images. SPDP 1990: 488-496 - Xiaotie Deng, Hai-Ning Liu, Bing Xiao:
Deterministic load balancing in computer networks. SPDP 1990: 50-57 - Vinay Deshpande, Per-Åke Larson, T. Patrick Martin:
Parallel join algorithms for nested relations on shared-memory multiprocessors. SPDP 1990: 344-347 - David Eichmann:
Type inference and the Algebra of qualified relations. SPDP 1990: 352-356 - Tzilla Elrad, N. Krishna Kumar, James R. Kenevan:
Modeling distributed termination with pre-defined partial termination ordering. SPDP 1990: 373-376 - Michael Ogbonna Esonu, Asim J. Al-Khalili, Salim Hariri:
Design of optimal systolic arrays: a systematic approach. SPDP 1990: 166-173 - Paraskevas Evripidou, Jean-Luc Gaudiot:
Distributed input/output processing in data-driven multiprocessors. SPDP 1990: 326-333
skipping 110 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-07 07:51 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