Остановите войну!
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 49 matches
- 2024
- Giampiero Salvi:
Dynamic Behaviour of Connectionist Speech Recognition with Strong Latency Constraints. CoRR abs/2401.06588 (2024) - 2023
- Yingbin Ma, Xiaoxue Zhang:
Graphs with (strong) proper connection numbers m-3 and m-4. Appl. Math. Comput. 445: 127843 (2023) - Kairui Nie, Yingbin Ma, Elzbieta Sidorowicz:
(Strong) Proper vertex connection of some digraphs. Appl. Math. Comput. 458: 128243 (2023) - Yingbin Ma, Xiaoxue Zhang, Yanfeng Xue:
Graphs with Strong Proper Connection Numbers and Large Cliques. Axioms 12(4): 353 (2023) - Estevão Esmi, Jefferson Silva, Tofigh Allahviranloo, Laécio C. Barros:
Some connections between the generalized Hukuhara derivative and the fuzzy derivative based on strong linear independence. Inf. Sci. 643: 119249 (2023) - Yingbin Ma, Yanfeng Xue, Xiaoxue Zhang:
Proper (Strong) Rainbow Connection and Proper (Strong) Rainbow Vertex Connection of Some Special Graphs. J. Interconnect. Networks 23(3): 2250006:1-2250006:19 (2023) - Kevin Pratt:
A stronger connection between the asymptotic rank conjecture and the set cover conjecture. CoRR abs/2311.02774 (2023) - 2022
- József Dombi, Tamás Jónás:
Remarks on two representations of strong negations and a connection between nilpotent and strict triangular norms. Fuzzy Sets Syst. 448: 173-177 (2022) - Logan A. Smith, David T. Mildebrath, Illya V. Hicks:
An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs. Networks 79(1): 3-19 (2022) - Yuwei Wu:
Creative Design Diffusion Model Under Agglomerate Effect - Transformation of Creative Clusters From Weak Connection to Strong Connection. HCI (48) 2022: 101-109 - Tarek A. Idriss, Alex Gavin, Adrian Gabales, Haytham Idriss, Magdy A. Bayoumi:
XFeed PUF: A Secure and Efficient Delay-based Strong PUF Using Cross-Feed Connections. ISCAS 2022: 461-465 - 2021
- Deepak Sangroya, Rambalak Yadav, Yatish Joshi:
Does gamified interaction build a strong consumer-brand connection? A study of mobile applications. Australas. J. Inf. Syst. 25 (2021) - Meng Ji, Jing Wang:
Some results on strong conflict-free connection number of graphs. Discret. Math. Algorithms Appl. 13(5): 2150066:1-2150066:10 (2021) - Hui Jiang, Wenjing Li, Xueliang Li, Colton Magnant:
On proper (strong) rainbow connection of graphs. Discuss. Math. Graph Theory 41(2): 469-479 (2021) - Yingbin Ma, Kairui Nie:
(Strong) Total proper connection of some digraphs. J. Comb. Optim. 42(1): 24-39 (2021) - 2020
- Meng Ji, Xueliang Li:
Strong conflict-free connection of graphs. Appl. Math. Comput. 364 (2020) - Logan A. Smith, David T. Mildebrath, Illya V. Hicks:
An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs. CoRR abs/2006.02988 (2020) - 2019
- Yingbin Ma, Kairui Nie:
(Strong) Proper Connection in Some Digraphs. IEEE Access 7: 69692-69697 (2019) - Fei Huang, Jinjiang Yuan:
On strong proper connection number of cubic graphs. Discret. Appl. Math. 265: 104-119 (2019) - Lijie Chen, R. Ryan Williams:
Stronger Connections Between Circuit Analysis and Circuit Lower Bounds, via PCPs of Proximity. CCC 2019: 19:1-19:43 - Logan A. Smith, David T. Mildebrath, Illya V. Hicks:
A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti. CoRR abs/1912.11906 (2019) - 2018
- Lin Chen, Xueliang Li, Henry Liu, Jinfeng Liu:
On various (strong) rainbow connection numbers of graphs. Australas. J Comb. 70: 137-156 (2018) - Elzbieta Sidorowicz, Éric Sopena:
Strong rainbow connection in digraphs. Discret. Appl. Math. 238: 133-143 (2018) - Yulong Wei, Min Xu, Kaishun Wang:
Strong rainbow connection numbers of toroidal meshes. Discret. Math. Algorithms Appl. 10(3): 1850039:1-1850039:10 (2018) - 2015
- Jakub Pawlewicz, Ryan B. Hayward, Philip Henderson, Broderick Arneson:
Stronger Virtual Connections in Hex. IEEE Trans. Comput. Intell. AI Games 7(2): 156-166 (2015) - James Geller, Shmuel T. Klein, Yuriy Polyakov:
Identifying Pairs of Terms with Strong Semantic Connections in a Textbook Index. KEOD 2015: 307-315 - Fendy Septyanto, Kiki Ariyanti Sugeng:
On the Rainbow and Strong Rainbow Connection Numbers of the m-Splitting of the Complete Graph Kn. ICGTIS 2015: 155-161 - Juane Li, Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar, William E. Ryan:
An unnoticed strong connection between algebraic-based and protograph-based LDPC codes, Part I: Binary case and interpretation. ITA 2015: 36-45 - 2012
- Emad A. M. Andrews, Anthony J. Bonner:
Finding MAPs using strongly equivalent high order recurrent symmetric connectionist networks. Cogn. Syst. Res. 14(1): 50-59 (2012) - Peter A. Jansen, Scott Watter:
Strong systematicity through sensorimotor conceptual grounding: an unsupervised, developmental approach to connectionist sentence processing. Connect. Sci. 24(1): 25-55 (2012)
skipping 19 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-04-27 04:34 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