Остановите войну!
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 46 matches
- 1990
- Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen:
Parallel Searching in Generalized Monge Arrays with Applications. SPAA 1990: 259-268 - William Aiello, Frank Thomson Leighton, Bruce M. Maggs, Mark Newman:
Fast Algorithms for Bit-Serial Routing on a Hypercube. SPAA 1990: 55-64 - Richard J. Anderson:
Parallel Algorithms for Generating Random Permutations on a Shared memory Machine. SPAA 1990: 95-102 - Richard J. Anderson, Paul Beame, Erik Brisson:
Parallel Algorithms for Arrangements. SPAA 1990: 298-306 - Richard J. Anderson, Paul Beame, Walter L. Ruzzo:
Low Overhead Parallel Schedules for Task Graphs. SPAA 1990: 66-75 - Fred S. Annexstein, Marc Baumslag:
A Unified Approach to Off-Line Permutation Routing on Parallel Networks. SPAA 1990: 398-406 - James Aspnes, Maurice Herlihy:
Wait-Free Data Structures in the Asynchronous PRAM Model. SPAA 1990: 340-349 - Mikhail J. Atallah, Danny Z. Chen:
Parallel Rectilinear Shortest Paths with Rectangular Obstacles. SPAA 1990: 270-279 - Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich:
P-Complete Geometric Problems. SPAA 1990: 317-326 - Bernd Becker, Joachim Hartmann:
Optimal-Time Multipliers and C-Testability. SPAA 1990: 146-154 - Dario Bini, Fabio Di Benedetto:
A New Preconditioner for the Parallel Solution of Positive Definite Toeplitz Systems. SPAA 1990: 220-223 - Dario Bini, Luca Gemignani:
On the Euclidean Scheme for Polynomials Having Interlaced Real Zeros. SPAA 1990: 254-258 - Martin L. Brady, Donna J. Brown, P. McGuinness:
Disjoint Paths Through a 3-Dimensional Grid. SPAA 1990: 224-233 - Jehoshua Bruck, Robert Cypher, Danny Soroker:
Running Algorithms Efficiently on Faulty Hypercubes. SPAA 1990: 37-44 - Jonathan F. Buss:
Processor Networks and Alternating Machines. SPAA 1990: 103-108 - Richard Cole, Ofer Zajicek:
The Expected Advantage of Asynchrony. SPAA 1990: 85-94 - Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk:
Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes. SPAA 1990: 125-135 - Faith E. Fich, Vijaya Ramachandran:
Lower Bounds for Parallel Computation on Linked Structures. SPAA 1990: 109-116 - Hillel Gazit, John H. Reif:
A Randomized Parallel Algorithm for Planar Graph Isomorphism. SPAA 1990: 210-219 - Michael T. Goodrich, Mujtaba R. Ghouse, J. Bright:
Generalized Sweep Methods for Parallel Computational Geometry. SPAA 1990: 280-289 - Peter Grabienski:
FLIP-FLOP: A Stack-Oriented Multiprocessing System. SPAA 1990: 161-168 - David S. Greenberg, Sandeep N. Bhatt:
Routing Multiple Paths in Hypercubes. SPAA 1990: 45-54 - Torben Hagerup, H. Jung, Emo Welzl:
Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions. SPAA 1990: 290-297 - Torben Hagerup, Tomasz Radzik:
Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM. SPAA 1990: 117-124 - Martin C. Herbordt, Charles C. Weems, James C. Corbett:
Message-Passing Algorithms for a SIMD Torus with Coteries. SPAA 1990: 11-20 - Kieran T. Herley:
Space-Efficient Representations of Shared Data for Parallel Computers. SPAA 1990: 407-416 - Christos Kaklamanis, Danny Krizanc, Thanasis Tsantilas:
Tight Bounds for Oblivious Routing in the Hypercube. SPAA 1990: 31-36 - David G. Kirkpatrick, Teresa M. Przytycka:
Parallel Construction of near Optimal binary Trees. SPAA 1990: 234-243 - Smaragda Konstantinidou, Lawrence Snyder:
The Chaos Router: A Practical Application of Randomization in Network Routing. SPAA 1990: 21-30 - Frank Thomson Leighton:
Average Case Analysis of Greedy Routing algorithms on Arrays. SPAA 1990: 2-10
skipping 16 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-28 12:01 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