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 41 matches
- 2000
- Selim G. Akl:
Parallel Real-Time Computation: Sometimes Quantity Means Quality. ISPAN 2000: 2-11 - Rosa Alcover, Vicente Chirivella, José Duato:
An Accurate Analysis of Reliability Parameters in Meshes with Fault-Tolerant Adaptive Routing. ISPAN 2000: 88-93 - John D. Bansemer, Mohamed Eltoweissy:
On Performance Metrics for IP Multicast Routing. ISPAN 2000: 282-291 - Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough:
Three-Dimensional Embedding of Binary Trees. ISPAN 2000: 140-147 - Jiannong Cao, Y. Liu, Li Xie, Kang Zhang:
Portable Runtime Support for Graph-oriented Parallel and Distributed Programming. ISPAN 2000: 72-77 - Ioannis Caragiannis, Christos Kaklamanis, Ioannis Vergados:
Greedy Dynamic Hot-Potato Routing on Arrays. ISPAN 2000: 178-185 - Jaime D. L. Caro, Luz R. Nochefranca, Polly W. Sy:
On the Diameter of the Generalized De Bruijn Graphs UGB(n, n2+1). ISPAN 2000: 57-63 - Carmen Carrión, José A. Gregorio, Ramón Beivide:
Pipelining Router Design Improves Parallel System Performance. ISPAN 2000: 195-201 - Wei-Mei Chen, Gen-Huey Chen, D. Frank Hsu:
Combinatorial Properties of Mesh of Trees. ISPAN 2000: 134-139 - Jie Chen, William A. Watson III:
User Level Communication on Alpha Linux Systems. ISPAN 2000: 36-43 - H. K. Dai, Shinji Fujino:
On Designing Constrained Local Access Network. ISPAN 2000: 167-177 - Afonso Ferreira, Jérôme Galtier, P. Mahey, G. Mateus, A. Oliveira, M. Pichereau:
An Optimization Model for Routing in Low Earth Orbit Satellite Constellations. ISPAN 2000: 161-166 - Noriyuki Fujimoto, Kenichi Hagihara:
NP-Completeness of the Bulk Synchronous Task Scheduling Problem and Its Approximation Algorithm. ISPAN 2000: 127-133 - Satoshi Fujita, Hui Zhou:
Multiprocessor Scheduling Problem with Probabilistic Execution Costs. ISPAN 2000: 121-126 - Gruia Calinescu, Peng-Jun Wan:
Wavelength Assignment in WDM Rings with Splitable Lightpaths. ISPAN 2000: 216-223 - Aaron Harwood, Hong Shen:
Batched Circuit Switched Routing for Efficient Service of Requests. ISPAN 2000: 30-35 - Susumu Horiguchi, Takayuki Ooki:
Hierarchical 3D-Torus Interconnection Network. ISPAN 2000: 50-56 - Tadayoshi Horita, Itsuo Takanami:
A System for Efficiently Self-Reconstructing E-1½-Track Switch Torus Arrays. ISPAN 2000: 44-49 - Masaki Wakabayashi, Hideharu Amano:
Environment for Multiprocessor Simulator Development. ISPAN 2000: 64-71 - Guofeng Hou, Yulu Yang:
Super Recursive Baselines: A Family of New Interconnection Networks with High Performance/Cost Ratios. ISPAN 2000: 260-265 - Shien-Ching Hwang, Gen-Huey Chen:
The Minimum Spanner Problem on Butterfly Graphs. ISPAN 2000: 210-215 - S.-M. Kim, Sathiamoorthy Manoharan:
A Parallel Processor Architecture for Prefetching. ISPAN 2000: 254-259 - Cheng-Nan Lai, Gen-Huey Chen, Dyi-Rong Duh:
Optimal One-to-Many Disjoint Paths in Folded Hypercubes. ISPAN 2000: 148-155 - Mingfu Li, Hsin-Min Peng, Chia-Shu Liao:
Fast Computation of Time Deviation and Modified Allan Deviation for Telecommunications Clock Stability Characterization. ISPAN 2000: 156-160 - Arthur L. Liestman, Thomas C. Shermer, Matthew J. Suderman:
Broadcasting Multiple Messages in Hypercubes (preliminary version). ISPAN 2000: 274-281 - Jen-Shiuh Liu, Jiun-Yuan Lin, Yeh-Ching Chung:
Efficient Parallel Algorithms for Multi-Dimensional Matrix Operations? ISPAN 2000: 224-231 - Weizhen Mao:
Competitive Analysis of On-line Algorithms for On-demand Data Broadcast Scheduling. ISPAN 2000: 292-296 - Takashi Matsumura, Morikazu Nakamura, Shiro Tamaki:
A Parallel Tabu Search and Its Hybridization with Genetic Algorithms. ISPAN 2000: 18-23 - Xavier Molero, Federico Silla, Vicente Santonja, José Duato:
On the Effect of Link Failures in Fibre Channel Storage Area Networks. ISPAN 2000: 102-113 - Oleg G. Monakhov, Emilia A. Monakhova:
Parametrically Described Regular Semigroup Interconnection Networks for Large-Scale Multicomputers. ISPAN 2000: 202-209
skipping 11 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-12-22 20:12 CET 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