![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.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 24 matches
- 1987
- Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata:
Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. Parallel Algorithms and Architectures 1987: 11-15 - Alberto Apostolico, Costas S. Iliopoulos, Robert Paige:
On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem. Parallel Algorithms and Architectures 1987: 70-76 - Tetsuo Asano, Hiroshi Umeo:
Systolic Algorithms for Computing the Visibility Polygon and Triangulation of A Polygonal Region. Parallel Algorithms and Architectures 1987: 77-85 - D. De Baer, Jan Paredaens:
A Formal Definition for Systolic Systems. Parallel Algorithms and Architectures 1987: 97-104 - Lothar Budach, Ernst-Günter Giessmann, Hubert Grassmann, Bernd Graw, Christoph Meinel:
RELACS - A Recursive Layout Computing System. Parallel Algorithms and Architectures 1987: 86-88 - Reiner Creutzburg
:
Parallel Linear Conflict-Free Subtree Access. Parallel Algorithms and Architectures 1987: 89-96 - Krzysztof Diks:
Parallel Recognition of Outerplanar Graphs. Parallel Algorithms and Architectures 1987: 105-113 - Rex A. Dwyer, Ravi Kannan:
Convex Hull of Randomly Chosen Points from A Polytope. Parallel Algorithms and Architectures 1987: 16-24 - Didier Ferment, Brigitte Rozoy:
Solutions for the Distributed Termination Problem. Parallel Algorithms and Architectures 1987: 114-121 - Michael Gössel, R. Rebel:
Memories for Parallel Subtree-Access. Parallel Algorithms and Architectures 1987: 122-130 - Jayantha A. Herath, Toshitsugu Yuba, Nobuo Saito:
Dataflow Computing. Parallel Algorithms and Architectures 1987: 25-36 - Edgar Körner, T. Tsuda, H. Shimizu:
Parallel in Sequence - Towards the Architecture of an Elementary Cortical Processor. Parallel Algorithms and Architectures 1987: 37-47 - Akihiko Konagaya, Ryosei Nakazaki, Mamoru Umemura:
A Co-Operative Programming Environment for a Back-End Type Sequential Inference Machine CHI. Parallel Algorithms and Architectures 1987: 196-205 - Shogo Matsui, Yoshinobu Kato, Shinsuke Teramura, Tomoyuki Tanaka, Nobuyuki Mohri, Atsushi Maeda, Masakazu Nakanishi:
SYNAPSE: A Multi-Microprocessor Lisp Machine with Parallel Garbage Collector. Parallel Algorithms and Architectures 1987: 131-137 - Nikolay N. Mirenkov:
Parallel Algorithms and Static Analysis of Parallel Programs. Parallel Algorithms and Architectures 1987: 48-59 - Burkhard Monien, Oliver Vornberger:
Parallel Processing of Combinatorial Search. Parallel Algorithms and Architectures 1987: 60-69 - Wojciech Rytter:
A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata. Parallel Algorithms and Architectures 1987: 138-145 - Wojciech Rytter, Raffaele Giancarlo:
Optimal Parallel Parsing of Bracket Languages. Parallel Algorithms and Architectures 1987: 146-154 - Clark D. Thomborson
, Linda L. Deneen, Gary M. Shute:
Computing a Rectilinear Steiner Minimal Tree in nO(sqrt(n)) Time. Parallel Algorithms and Architectures 1987: 176-183 - Dietmar Uhlig:
On Reliable Networks from Unreliable Gates. Parallel Algorithms and Architectures 1987: 155-162 - Imrich Vrto:
Area-time Tradeoffs for Selection. Parallel Algorithms and Architectures 1987: 163-168 - Friedmar Wächter:
Optimization of Special Permutation Networks Using Simple Algebraic Relations. Parallel Algorithms and Architectures 1987: 169-174 - Chee-Keng Yap:
What Can be Parallelized in Computational Geometry?. Parallel Algorithms and Architectures 1987: 184-195 - Andreas Alexander Albrecht, Hermann Jung, Kurt Mehlhorn:
Parallel Algorithms and Architectures, International Workshop, Suhl, GDR, May 25-30, 1987, Proceedings. Lecture Notes in Computer Science 269, Springer 1987, ISBN 3-540-18099-0 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.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-08-15 01:13 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