Остановите войну!
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 116 matches
- 1997
- Daniel Andresen, Tao Yang, David Watson, Athanassios S. Poulakidas:
Dynamic Processor Scheduling with Client Resources for Fast Multi-Resolution WWW Image Browsing. IPPS 1997: 167- - Theodore Andronikos, Nectarios Koziris, George K. Papakonstantinou, Panayotis Tsanakas:
Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs. IPPS 1997: 146-151 - Vincenzo Auletta, Amelia De Vivo, Vittorio Scarano:
Multiple Templates Access of Trees in Parallel Memory Systems. IPPS 1997: 694-701 - Dimiter R. Avresky, Vladimir Shurbanov, Robert W. Horst, William J. Watson, L. Young, Doug Jewett:
Maximum Delivery Time and Hot Spots in ServerNet(tm) Topologies. IPPS 1997: 756-762 - Gerardo Bandera, Manuel Ujaldon, María A. Trenas, Emilio L. Zapata:
The Sparse Cyclic Distribution against its Dense Counterparts. IPPS 1997: 638-642 - David M. Beazley, Peter S. Lomdahl:
Extensible Message Passing Application Development and Debugging with Python. IPPS 1997: 650- - Alan A. Bertossi, Andrea Fusiello, Luigi V. Mancini:
Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks. IPPS 1997: 133-138 - Angelos Bilas, Jason Fritts, Jaswinder Pal Singh:
Real-Time Parallel MPEG-2 Decoding in Software. IPPS 1997: 197-203 - Stefan Bock, Friedhelm Meyer auf der Heide, Christian Scheideler:
Optimal Wormhole Routing in the (n, d)-Torus. IPPS 1997: 326-332 - Jürgen Brehm, Patrick H. Worley:
Performance Prediction for Complex Parallel Applications. IPPS 1997: 187-191 - Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis:
A Parallel Priority Data Structure with Applications. IPPS 1997: 689-693 - Adrian Brüngger, Ambros Marzetta, Jens Clausen, Michael Perregaard:
Joining Forces in Solving Large-Scale Quadratic Assignment Problems in Parallel. IPPS 1997: 418- - Radu Calinescu:
A BSP Approach to the Scheduling of Tightly-Nested Loops. IPPS 1997: 549-553 - Yuet-Ning Chan, Sivarama P. Dandamudi, Shikharesh Majumdar:
Performance Comparison of Processor Scheduling Strategies in a Distributed-Memory Multicomputer System. IPPS 1997: 139-145 - Albert Chan, Frank K. H. A. Dehne, Andrew Rau-Chaplin:
Coarse Grained Parallel Next Element Search. IPPS 1997: 320- - Chi-Chang Chen, Jianer Chen:
Nearly Optimal One-To-Many Parallel Routing in Star Networks. IPPS 1997: 728-733 - Hsing-Lung Chen, Shu-Hua Hu:
Distributed Submesh Determination in Faulty Tori and Meshes. IPPS 1997: 65-70 - Yi-Long Chen, Jyh-Charn Liu:
A Hybrid Interconnection Network for Integrated Communication Services. IPPS 1997: 341-345 - J. Choi:
A Fast Scalable Universal Matrix Multiplication Algorithm on Distributed-Memory Concurrent Computers. IPPS 1997: 310-314 - Yungho Choi, Timothy Mark Pinkston:
Crossbar Analysis for Optimal Deadlock Recovery Router Architecture. IPPS 1997: 583-588 - Bruno Ciciani, Claudio Paolucci, Michele Colajanni:
An Accurate Model for the Performance Analysis of Deterministic Wormhole Routing. IPPS 1997: 353- - Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud:
Broadcasting and Multicasting in Cut-through Routed Networks. IPPS 1997: 734-738 - Alan L. Cox, Sandhya Dwarkadas, Honghui Lu, Willy Zwaenepoel:
Evaluating the Performance of Software Distributed Shared Memory as a Target for Parallelizing Compilers. IPPS 1997: 474-482 - Robert Cypher, Ambrose Kofi Laing:
Gracefully Degradable Pipeline Networks. IPPS 1997: 55-64 - Stefanos N. Damianakis, Yuqun Chen, Edward W. Felten:
Reducing Waiting Costs in User-Level Communication. IPPS 1997: 381-387 - Sajal K. Das, Maria Cristina Pinotti:
O(log log N) Time Algorithms for Hamiltonian-Suffix and Min-Max-Pair Heap Operations on Hypercube Multicomputers. IPPS 1997: 507-511 - Amitava Datta:
Geometric Data Structures on a Reconfigurable Mesh, with Applications. IPPS 1997: 708- - Paul Dechering, Leo C. Breebaart, Frits Kuijlman, Kees van Reeuwijk, Henk J. Sips:
Semantics and Implementation of a Generalized forall Statement for Parallel Languages. IPPS 1997: 542-548 - Manuel Díaz, Bartolomé Rubio, José M. Troya:
Logic Channels: A Coordination Approach to Distributed Programming. IPPS 1997: 436-442 - Allen B. Downey:
Predicting Queue Times on Space-Sharing Parallel Computers. IPPS 1997: 209-218
skipping 86 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-06-09 08:20 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