


Остановите войну!
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 22 matches
- 2021
- Johannes Gerster, Marcel Sarstedt, Eric M. S. P. Veith, Sebastian Lehnhoff, Lutz Hofmann:
Pointing out the Convolution Problem of Stochastic Aggregation Methods for the Determination of Flexibility Potentials at Vertical System Interconnections. CoRR abs/2102.03430 (2021) - 2019
- N. F. Khalimon
, Dmytro P. Kucherov
, Igor V. Ogirko
:
Estimation of the Characteristics of the Stochastic Interconnection of Meteorological Elements of an Aerodrome for Solving Problems of Forecasting Flight Conditions. ISAT (2) 2019: 89-100 - 2018
- Paul D. Manuel, Sandi Klavzar:
The Graph Theory General Position Problem on Some Interconnection Networks. Fundam. Informaticae 163(4): 339-350 (2018) - 2017
- S. Maria Jesu Raja, Antony Xavier, Indra Rajasingh:
Induced H-packing k-partition problem in interconnection networks. Int. J. Comput. Math. Comput. Syst. Theory 2(4): 136-146 (2017) - Mukul Agarwal, Sanjoy K. Mitter, Anant Sahai:
Layered black-box, behavioral interconnection perspective and applications to the problem of communication with fidelity criteria, Part I: i.i.d. sources. CoRR abs/1703.05346 (2017) - Mukul Agarwal, Sanjoy K. Mitter, Anant Sahai:
Layered black-box, behavioral interconnection perspective and applications to the problem of communication with fidelity criteria, Part II: stationary sources satisfying ψ-mixing criterion. CoRR abs/1703.05348 (2017) - 2015
- Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý
, Mathias Weller:
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. SIAM J. Discret. Math. 29(1): 1-25 (2015) - 2014
- Yizhou Li, Weiguo Hao, Radia J. Perlman, Jon Hudson, Hongjun Zhai:
Problem Statement and Goals for Active-Active Connection at the Transparent Interconnection of Lots of Links (TRILL) Edge. RFC 7379: 1-13 (2014) - 2013
- Maolin Tang
, Shenchen Pan:
A hybrid genetic algorithm for the minimum interconnection cut problem. IEEE Congress on Evolutionary Computation 2013: 3004-3011 - Jiehua Chen, Christian Komusiewicz
, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller:
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. ISAAC 2013: 361-371 - 2012
- Jehad Al-Sadi:
The Load Balancing Problem in Extended OTIS-n-Cube Interconnection Networks. TrustCom 2012: 1469-1474 - 2008
- Basel A. Mahafzah
, Bashira A. Jaradat
:
The load balancing problem in OTIS-Hypercube interconnection networks. J. Supercomput. 46(3): 276-297 (2008) - 2002
- Michele Favalli
, Cecilia Metra:
Problems Due to Open Faults in the Interconnections of Self-Checking Data-Paths. DATE 2002: 612-617 - 1996
- Faris N. Abuali, Roger L. Wainwright, Dale A. Schoenefeld:
Solving the subset interconnection design problem using genetic algorithms. SAC 1996: 299-304 - 1995
- L. Truffet:
Geometrical bounds of an output stream of a queue in a model of a two-stages interconnection network: application to the dimensioning problem. Modelling and Evaluation of ATM Networks 1995: 215-232 - 1994
- Charles J. Alpert, Jason Cong, Andrew B. Kahng, Gabriel Robins, Majid Sarrafzadeh:
On the Minimum Density Interconnection Tree Problem. VLSI Design 2(2): 157-169 (1994) - Leslie Ann Goldberg:
Routing in Optical networks: The problem of contention. Interconnection Networks and Mapping and Scheduling Parallel Computations 1994: 173-180 - 1993
- Klaus Jansen:
The Interconnection Problem. J. Comput. Syst. Sci. 46(1): 27-38 (1993) - 1992
- Erich Prisner
:
Two algorithms for the subset interconnection design problem. Networks 22(4): 385-395 (1992) - 1974
- David W. Hightower:
The interconnection problem: A tutorial. Computer 7(4): 18-32 (1974) - 1973
- David W. Hightower:
The interconnection problem - a tutorial. DAC 1973: 1-21 - 1965
- D. K. Frayne:
Three levels of the wiring interconnection problem. DAC 1965
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 2023-12-10 22:10 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