Остановите войну!
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 97 matches
- 1995
- Jie Wu:
Extended Fibonacci cubes. SPDP 1995: 248-251 - Xiaodong Zhang, Yong Yan:
Modeling and characterizing parallel computing performance on heterogeneous networks of workstations. SPDP 1995: 25-34 - Marwan H. Abu-Amara:
Asynchronous failure location algorithm for fiber-optic networks. SPDP 1995: 690-693 - David H. Albonesi, Israel Koren:
Architecture and technology tradeoffs in the design of next-generation multiprocessor servers. SPDP 1995: 174-181 - Prakash Arunachalam, Craig M. Chase, Jacob A. Abraham:
A memory distribution mechanism for object oriented applications. SPDP 1995: 354-357 - James E. Beck, Daniel P. Siewiorek:
Automated processor specification and task allocation for embedded multicomputer systems: The packing-based approaches. SPDP 1995: 44-51 - Yosi Ben-Asher, Ilan Newman:
Geometric approach for optimal routing on mesh with buses. SPDP 1995: 145-152 - Azer Bestavros:
Demand-based document dissemination to reduce traffic and balance load in distributed information systems. SPDP 1995: 338-345 - Philip Bohannon, Daniel F. Lieuwen, Abraham Silberschatz, S. Sudarshan, Jaques Gava:
Recoverable user-level mutual exclusion. SPDP 1995: 293-301 - Nicholas S. Bowen, Christos A. Polyzois, Richard D. Regan:
Restart services for highly available systems. SPDP 1995: 596-601 - Tim Brecht, Xiaotie Deng, Nian Gu:
Competitive dynamic multiprocessor allocation for parallel applications. SPDP 1995: 448-455 - Ciarán Bryce, Gilles Muller:
Matching micro-kernels to modern applications using fine-grained memory protection. SPDP 1995: 272-279 - Navin Budhiraja, Keith Marzullo:
Tradeoffs in implementing primary-backup protocols. SPDP 1995: 280-288 - Christophe Calvin, Stéphane Pérennes, Denis Trystram:
All-to-all broadcast in torus with wormhole-like routing. SPDP 1995: 130-137 - Prasad R. Chalasani, Krishnaiyan Thulasiraman:
Parallel computing for network optimization: a cluster-based approach for the dual transshipment problem. SPDP 1995: 66-73 - Ye-In Chang, Yao-Jen Chang:
A fault-tolerant triangular mesh protocol for distributed mutual exclusion. SPDP 1995: 694-701 - Shigang Chen, Yi Deng, Wei Sun, Naphtali Rishe:
Efficient algorithms for detection and resolution of distributed deadlocks. SPDP 1995: 10-16 - Danny Z. Chen, Ajay K. Gupta:
Weighted selection on coarse-grain hypercubes. SPDP 1995: 544-552 - Yi-Long Chen, Ying Zhang, Jyh-Charn Liu:
Dynamic processor sharing in torus multicomputers. SPDP 1995: 204-207 - Chi-Ming Chiang, Lionel M. Ni:
Efficient software multicast in wormhole-routed unidirectional multistage networks. SPDP 1995: 106-113 - George Chochia, Murray Cole, Todd Heywood:
Implementing the hierarchical PRAM on the 2D mesh: analyses and experiments. SPDP 1995: 587-594 - Hongin Choi, Kenneth E. Batcher:
Fault detection in bitonic sorting networks. SPDP 1995: 266-270 - Robert Cypher:
Minimal, deadlock-free routing in hypercubic and arbitrary networks. SPDP 1995: 122-129 - Robert Cypher, Eric Leu:
Efficient race detection for message-passing programs with nonblocking sends and receives. SPDP 1995: 534-541 - Andrzej Czygrinow, Michal Karonski, Vaidy S. Sunderam:
The polling primitive for hypercube networks. SPDP 1995: 138-144 - Sekhar Darbha, Dharma P. Agrawal:
A fast and scalable scheduling algorithm for distributed memory systems. SPDP 1995: 60-63 - Alain Darte, Michèle Dion, Yves Robert:
A characterization of one-to-one modular mappings. SPDP 1995: 382-389 - Thomas Decker, Ralf Diekmann, Reinhard Lüling, Burkhard Monien:
Towards developing universal dynamic mapping algorithms. SPDP 1995: 456-459 - Jack B. Dennis, Guang R. Gao:
On memory models and cache management for shared-memory multiprocessors. SPDP 1995: 190-193 - Murthy V. Devarakonda, Ananda Rao Ladi, Andy Zlotek, Ajay Mohindra:
Disk space guarantees as a distributed resource management problem: A case study. SPDP 1995: 289-292
skipping 67 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-06-06 00:48 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