![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 23 matches
- 1999
- Micah Adler, Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
Modeling Parallel Bandwidth: Local versus Global Restrictions. Algorithmica 24(3-4): 381-404 (1999) - Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina:
The Complexity of Parallel Multisearch on Coarse-Grained Machines. Algorithmica 24(3-4): 209-242 (1999) - Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci
, Kieran T. Herley, Paul G. Spirakis:
BSP versus LogP. Algorithmica 24(3-4): 405-422 (1999) - Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Miller, Dafna Talmor:
Design and Implementation of a Practical Parallel Delaunay Algorithm. Algorithmica 24(3-4): 243-269 (1999) - Svante Carlsson, Bengt J. Nilsson:
Computing Vision Points in Polygons. Algorithmica 24(1): 50-75 (1999) - Thomas H. Cormen, James C. Clippinger:
Performing BMMC Permutations Efficiently on Distributed-Memory Multiprocessors with MPI. Algorithmica 24(3-4): 349-370 (1999) - Frank K. H. A. Dehne:
Guest Editor's Introduction. Algorithmica 24(3-4): 173-176 (1999) - Xiaotie Deng, Binhai Zhu:
A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors. Algorithmica 24(3-4): 270-286 (1999) - Paolo Ferragina
, Fabrizio Luccio:
String Search in Coarse-Grained Parallel Computers. Algorithmica 24(3-4): 177-194 (1999) - Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin
, Stéphane Ubéda:
d-Dimensional Range Search on Multicomputers. Algorithmica 24(3-4): 195-208 (1999) - Bin Fu, Richard Beigel:
A Comparison of Resource-Bounded Molecular Computation Models. Algorithmica 24(2): 87-95 (1999) - Monika Rauch Henzinger, Valerie King, Tandy J. Warnow:
Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. Algorithmica 24(1): 1-13 (1999) - Erich L. Kaltofen
, Austin Lobo:
Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields. Algorithmica 24(3-4): 331-348 (1999) - Haim Kaplan, Ron Shamir
:
Bounded Degree Interval Sandwich Problems. Algorithmica 24(2): 96-104 (1999) - Ravi Kumar, Alexander Russell
, Ravi Sundaram:
Approximating Latin Square Extensions. Algorithmica 24(2): 128-138 (1999) - Frank Thomson Leighton, Eric J. Schwabe:
Efficient Algorithms for Dynamic Allocation of Distributed Memo. Algorithmica 24(2): 139-171 (1999) - Stefano Leonardi, Alberto Marchetti-Spaccamela:
On-Line Resource Management with Application to Routing and Scheduling. Algorithmica 24(1): 29-49 (1999) - Young Won Lim, Prashanth B. Bhat, Viktor K. Prasanna:
Efficient Algorithms for Block-Cyclic Redistribution of Arrays. Algorithmica 24(3-4): 298-330 (1999) - William F. McColl, Alexandre Tiskin
:
Memory-Efficient Matrix Multiplication in the BSP Model. Algorithmica 24(3-4): 287-297 (1999) - Paul Pritchard:
A Fast Bit-Parallel Algorithm for Computing the Subset Partial Order. Algorithmica 24(1): 76-86 (1999) - E. L. G. Saukas, S. W. Song:
A Note on Parallel Selection on Coarse-Grained Multicomputers. Algorithmica 24(3-4): 371-380 (1999) - Koichi Yamazaki
, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos:
Isomorphism for Graphs of Bounded Distance Width. Algorithmica 24(2): 105-127 (1999) - Yanjun Zhang, A. Ortynski:
Efficiency of Randomized Parallel Backtrack Search. Algorithmica 24(1): 14-28 (1999)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-19 04: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