Остановите войну!
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 34 matches
- 1991
- William Aiello, Frank Thomson Leighton:
Coding Theory, Hypercube Embeddings, and Fault Tolerance. SPAA 1991: 125-136 - Mikhail J. Atallah, Frank K. H. A. Dehne, Russ Miller, Andrew Rau-Chaplin, Jyh-Jong Tsay:
Multisearch Techniques for Implementing Data Structures on a Mesh-Connected Computer (Preliminary Version). SPAA 1991: 204-214 - Hagit Attiya, Jennifer L. Welch:
Sequential Consistency Versus Linearizability (Extended Abstract). SPAA 1991: 304-315 - Hannah Bast, Torben Hagerup:
Fast and Reliable Parallel Hashing. SPAA 1991: 50-61 - Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha:
A Comparison of Sorting Algorithms for the Connection Machine CM-2. SPAA 1991: 3-16 - Shiva Chaudhuri:
Tight Bounds for the Chaining Problem. SPAA 1991: 62-70 - Richard N. Draper:
An Overview of Supertoroidal Networks. SPAA 1991: 95-102 - Shimon Even, Ami Litman:
On the Capabilities of Systolic Systems (Extended Abstract). SPAA 1991: 357-367 - Kourosh Gharachorloo, Phillip B. Gibbons:
Detecting Violations of Sequential Consistency. SPAA 1991: 316-326 - Mujtaba R. Ghouse, Michael T. Goodrich:
In-Place Techniques for Parallel Convex Hull Algorithms (Preliminary Version). SPAA 1991: 192-203 - Phillip B. Gibbons, Michael Merritt, Kourosh Gharachorloo:
Proving Sequential Consistency of High-Performance Shared Memories (Extended Abstract). SPAA 1991: 292-303 - Michael T. Goodrich:
Constructing Arrangements Optimally in Parallel (Preliminary Version). SPAA 1991: 169-179 - Maurice Herlihy:
Impossibility Results for Asynchronous PRAM (Extended Abstract). SPAA 1991: 327-336 - Maurice Herlihy, J. Eliot B. Moss:
Lock-Free garbage Collection for Multiprocessors. SPAA 1991: 229-236 - Christos Kaklamanis, Danny Krizanc, Lata Narayanan, Thanasis Tsantilas:
Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version). SPAA 1991: 17-28 - Erich L. Kaltofen, Victor Y. Pan:
Processor Efficient Parallel Solution of Linear Systems over an Abstract Field. SPAA 1991: 180-191 - Manfred Kunde:
Balanced Routing: Towards the Distance Bound on Grids. SPAA 1991: 260-271 - Lawrence L. Larmore, Teresa M. Przytycka:
Parallel Construction of Trees with Optimal Weighted Path Length. SPAA 1991: 71-80 - Fung F. Lee, Michael J. Flynn:
Architectural Mechanisms to Support Three-Dimensional Lattice Gas Simulations. SPAA 1991: 115-122 - Joonwon Lee, Umakishore Ramachandran:
Architectural Primitives for a Scalable Shared Memory Multiprocessor. SPAA 1991: 103-114 - Geng Lin, Nicholas Pippenger:
Parallel Algorithms for Routing in Non-Blocking Networks. SPAA 1991: 272-277 - Burkhard Monien:
Simulating Binary Trees on X-Trees (Extended Abstract). SPAA 1991: 147-158 - Mark H. Nodine, Jeffrey Scott Vitter:
Large-Scale Sorting in Parallel Memories (Extended Abstract). SPAA 1991: 29-39 - Bojana Obrenic:
Embedding de Bruijn and Shuffle-Exchange Graphs in Five Pages (Preliminary Version). SPAA 1991: 137-146 - Bojana Obrenic:
An Approach to Emulating Separable Graphs (preliminary Version). SPAA 1991: 159-167 - Marios C. Papaefthymiou:
Understanding Retiming Through Maximum Average-Weight Cycles. SPAA 1991: 338-348 - Gustavo D. Pifarré, Luis Gravano, Sergio A. Felperin, Jorge L. C. Sanz:
Fully-Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and Other Networks. SPAA 1991: 278-290 - G. N. Srinivasa Prasanna, Bruce R. Musicus:
Generalised Multiprocessor Scheduling Using Optimal Control. SPAA 1991: 216-228 - Abhiram G. Ranade:
Optimal Speedup for Backtrack Search on a butterfly Network. SPAA 1991: 40-48 - Larry Rudolph, Miriam Slivkin-Allalouf, Eli Upfal:
A Simple Load Balancing Scheme for Task Allocation in Parallel Machines. SPAA 1991: 237-245
skipping 4 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-25 17:07 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