Остановите войну!
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 75 matches
- 1991
- Donald C. S. Allison, Kashmira M. Irani, Calvin J. Ribbens, Layne T. Watson:
Shared Memory Parallel Algorithms for Homotopy Curve Tracking. ICPP (3) 1991: 17-20 - Cevdet Aykanat, Argun Dervis:
An Overlapped FFT Algorithm for Hypercube Multicomputers. ICPP (3) 1991: 316-317 - Cevdet Aykanat, Tahsin M. Kurç:
Efficient Parallel Maze Routing Algorithms on a Hypercube Multicomputer. ICPP (3) 1991: 224-227 - Shiva Azadegan, Anand R. Tripathi:
Parallel Join Algorithms for SIMD Models. ICPP (3) 1991: 125-133 - Azer Bestavros, Thomas E. Cheatham:
Efficient Execution of Homogeneous Tasks with Unequal Run Times on the Connection Machine. ICPP (3) 1991: 304-305 - Vipin Chaudhary, Jake K. Aggarwal:
On the Complexity of Parallel Image Component Labeling. ICPP (3) 1991: 183-187 - Calvin Ching-Yuen Chen, Sajal K. Das:
Breadth-First Traversal of Trees and Integer Sorting in Parallel. ICPP (3) 1991: 50-57 - C. M. Chen, S.-Y. Lee:
Parallelization of the EM Algorithm for 3D PET Image Reconstruction: Performance Estimation and Analysis. ICPP (3) 1991: 175-182 - Hyung Ah Choi, Moon-Jung Chung:
Parallel Algorithms on Outerplanar Graphs. ICPP (3) 1991: 115-119 - Adrian Colbrook, Eric A. Brewer, Chrysanthos Dellarocas, William E. Weihl:
An Algorithm for Concurrent Search Trees. ICPP (3) 1991: 138-141 - Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin:
Efficient Parallel Construction and Manipulation of Quadtrees. ICPP (3) 1991: 255-262 - Hossam A. ElGindy, Paulina Wegrowicz:
Selection on the Reconfigurable Mesh. ICPP (3) 1991: 26-33 - Kalluri Eswar, P. Sadayappan, V. Visvanathan:
Multifrontal Factorization of Sparse Matrices on Shared-Memory Multiprocessors. ICPP (3) 1991: 159-166 - Paraskevi Fragopoulou, Selim G. Akl:
A Parallel Algorithm For Computing Fourier Transforms On the Star Graph. ICPP (3) 1991: 100-106 - Bernd Freisleben, Matthias Schulte:
A Combined Clustering and Parallel Optimization Approach to the Traveling Salesman Problem. ICPP (3) 1991: 310-311 - Lélio de P. Sá Freitas, Valmir Carneiro Barbosa:
Experiments in Parallel Heuristic Search. ICPP (3) 1991: 62-65 - Jin-Yuan Fu, Ferng-Ching Lin:
Optimal Parallel External Merging under Hardware Constraints. ICPP (3) 1991: 70-74 - Melanie L. Fulgham, Robert Cypher, Jorge L. C. Sanz:
A Comparison of SIMD Hypercube Routing Strategies. ICPP (3) 1991: 236-243 - Thomas E. Gerasch:
A Parallel Approximation Algorithm for 0/1 Knapsack. ICPP (3) 1991: 302-303 - Sumit Ghosh, Tapan Chakrabarty:
An Asynchronous Distributed Approach to Test Vector Generation Based on Circuit Partitioning on Parallel Processors. ICPP (3) 1991: 330-331 - Kaushik Ghosh, Richard Fujimoto:
Parallel Discrete Event Simulation Using Space-Time Memory. ICPP (3) 1991: 201-208 - Israel Gohberg, Israel Koltracht, Amir Averbuch, Barack Shoham:
Timing Analysis of a Parallel Algorithm for Toeplitz Matrices on a MIMD Parallel Machine. ICPP (3) 1991: 312-313 - Albert G. Greenberg, Isi Mitrani:
Massively Parallel Algorithms for Network Partition Functions. ICPP (3) 1991: 134-137 - Yijie Han:
A Parallel Algorithm for the PROFIT/COST Problem. ICPP (3) 1991: 107-114 - Martin C. Herbordt, Charles C. Weems:
Multi-associativity: A Framework for Solving Multiple Non-uniform Problem Instances Simultaneously on SIMD Arrays. ICPP (3) 1991: 219-223 - J. Andrew Holey, Oscar H. Ibarra:
Triangulation Voronoi Diagram and Convex Hull in k-Space on Mesh-Connected Arrays and Hypercubes. ICPP (3) 1991: 147-150 - Tzung-Pei Hong, Shian-Shyong Tseng:
A Parallel Perceptron Learning Algorithm. ICPP (3) 1991: 288-289 - Susumu Horiguchi, Masayuki Katahira, Takeo Nakada:
Parallel Processing of Incremental Ray Tracing on a Multiprocessor Workstation. ICPP (3) 1991: 192-196 - Ming-Yun Horng, Leonard Kleinrock:
On the Performance of a Deadlock-free Routing Algorithm for Boolean n-Cube Interconnection Networks with Finite Buffers. ICPP (3) 1991: 228-235 - Garng M. Huang, Weerakorn Ongsakul:
Parallel Implementation of Gauss-Seidel Type Algorithms for Power Flow Analysis on a SEQUENT Parallel Computer. ICPP (3) 1991: 171-174
skipping 45 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 13:25 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