![](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 34 matches
- 1989
- Gottfried Wolf, Tamás Legendi, Udo Schendel:
Parcella '88, Fourth International Workshop on Parallel Processing by Cellular Automata and Arrays, Berlin, GDR, October 17-21, 1988, Proceedings. Lecture Notes in Computer Science 342, Springer 1989, ISBN 3-540-50647-0 [contents] - 1988
- Victor Aladyev, Aida Krasnoproshina, Vladimir Kryschanovskii:
Unsolved theoretical problems in homogeneous structures. Parcella 1988: 33-49 - Andreas Alexander Albrecht:
On simulaneous realizations of Boolean functions, with applications. Parcella 1988: 51-56 - Olga L. Bandman, Sergey Piskunov:
Parallel microprogramming as a tool for multi-microprocessor systems. Parcella 1988: 57-72 - Valeriu Beiu
:
VLSI arrays implementing parallel line-drawing algorithms. Parcella 1988: 241-247 - Reiner Creutzburg
:
Parallel conflict-free optimal access to complete extended q-ary trees. Parcella 1988: 248-255 - Frank K. H. A. Dehne, Jörg-Rüdiger Sack:
A survey of paralle computational geometry algorithms. Parcella 1988: 73-88 - David J. Evans, Graham M. Megson:
Systolic preconditioning algorithms for the Jacobi iterative solution of sparse linear systems. Parcella 1988: 256-265 - Gerhard Fritsch, Jens Volkert:
Multiprocessor systems for large numerical applications. Parcella 1988: 266-273 - Michael A. Frumkin:
Systolic array for eigenvalue of Jacobi matrix. Parcella 1988: 274-284 - Michael Gössel, V. V. Kaversnev, Burghard Rebel:
Parallel memories for straight line and rectangle access. Parcella 1988: 89-109 - Wolfgang Händler:
Multiprocessor arrays: Topology, efficiency and fault-tolerance. Parcella 1988: 15-32 - Chris R. Jesshope, Philip Miller, Jelio Yantchev:
Programming with active data. Parcella 1988: 111-129 - Péter Kacsuk:
Prolog implementations for cellular architectures. Parcella 1988: 131-146 - Endre Katona:
A transitive closure algorithm for a 16-state cellprocessor. Parcella 1988: 285-290 - Edgar Körner, M. Gross, Andreas Richter, H. Shimizu:
Control of sensory processing - a hypothesis on and simulation of the architecture of an elementary cortical prosessor. Parcella 1988: 291-297 - Vadim E. Kotov:
Modular highly-parallel computation and architectures. Parcella 1988: 147-155 - Manfred Kunde:
Bounds for 1-selection and related problem on grids of processors. Parcella 1988: 298-307 - Christoph Meinel, Peter Zienicke:
Recursive design of communication schemes for parallel computation with RELACS. Parcella 1988: 308-310 - Kálmán Palágyi:
Solution of dense systems of linear equations using cellular processors. Parcella 1988: 311-316 - Nikolay Petkov:
Running order statistics on a bit-level systolic array. Parcella 1988: 317-325 - Thorsten Pöschel
, Werner Ebeling, Thorsten Boseniuk:
Simulation of learning networks. Parcella 1988: 332-339 - Reinhard Pöschel, Friedmar Wächter, Ferdinand Börner:
Realization of sets of permutations by permutation networks. Parcella 1988: 326-331 - Udo Schendel:
Parallel computation and supercomputers and applications. Parcella 1988: 157-176 - Hartmut Schmeck
, Andreas Dittrich:
Given's rotation on an instruction systolic array. Parcella 1988: 340-346 - Paul G. Spirakis:
Fast parallel algorithms and the complexity of parallelism (Basic issues and recent advances). Parcella 1988: 177-189 - Thomas Tensi:
Worst case analysis for reducing algorithms on instruction systolic arrays with simple instruction sets. Parcella 1988: 347-352 - Nandor Toth:
Self-checking processing elements in cellular arrays. Parcella 1988: 353-359 - Roman Trobec:
Cellular diagnostic in parallel systems. Parcella 1988: 360-365 - Dietmar Uhlig:
Reliable networks for Boolean functions with small complexity. Parcella 1988: 366-371
skipping 4 more matches
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-08-28 16:44 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