Остановите войну!
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 101 matches
- 2023
- Aixian Zhang, Xiaoyan Jing, Keqin Feng:
Optimal Combinatorial Neural Codes With Matched Metric δr: Characterization and Constructions. IEEE Trans. Inf. Theory 69(8): 5440-5448 (2023) - Antoine Legat, Julien M. Hendrickx:
Combinatorial Characterization for Global Identifiability of Separable Networks with Partial Excitation and Measurement. CDC 2023: 2471-2476 - Michela Ascolese, Andrea Frosini:
Setting the Path to the Combinatorial Characterization of Prime Double Square Polyominoes. ICTCS 2023: 157-168 - Vinod Raman, Unique Subedi, Ambuj Tewari:
A Combinatorial Characterization of Online Learning Games with Bounded Losses. CoRR abs/2307.03816 (2023) - 2022
- Bart De Bruyn:
A Combinatorial Characterization of Extremal Generalized Hexagons. Electron. J. Comb. 29(4) (2022) - Matthias Köppe, Jiawei Wang:
Dual-feasible functions for integer programming and combinatorial optimization: Algorithms, characterizations, and approximations. Discret. Appl. Math. 308: 84-106 (2022) - Shaan Mathur, Rafail Ostrovsky:
A combinatorial characterization of self-stabilizing population protocols. Inf. Comput. 285(Part): 104829 (2022) - Hiroyuki Miyata, Reiya Nosaka:
Complete combinatorial characterization of greedy-drawable trees. CoRR abs/2203.04664 (2022) - 2021
- Bin Liu, Han Xiao, Qizhi Fang:
A Combinatorial Characterization for Population Monotonic Allocations in Convex Independent Set Games. Asia Pac. J. Oper. Res. 38(5): 2140006:1-2140006:9 (2021) - Steve Hanneke, Roi Livni, Shay Moran:
Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games. COLT 2021: 2289-2314 - Steve Hanneke, Roi Livni, Shay Moran:
Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games. CoRR abs/2102.01646 (2021) - Aixian Zhang, Xiaoyan Jin, Keqin Feng:
Optimal Combinatorial Neural Codes with Matched Metric δr: Characterization and Constructions. CoRR abs/2112.07903 (2021) - 2020
- Amin Fehri, Santiago Velasco-Forero, Fernand Meyer:
Combinatorial space of watershed hierarchies for image characterization. Pattern Recognit. Lett. 129: 41-47 (2020) - Alon Gonen, Shachar Lovett, Michal Moshkovitz:
Towards a Combinatorial Characterization of Bounded-Memory Learning. NeurIPS 2020 - Shaan Mathur, Rafail Ostrovsky:
A Combinatorial Characterization of Self-stabilizing Population Protocols. SSS 2020: 167-182 - Alon Gonen, Shachar Lovett, Michal Moshkovitz:
Towards a combinatorial characterization of bounded memory learning. CoRR abs/2002.03123 (2020) - Shaan Mathur, Rafail Ostrovsky:
A Combinatorial Characterization of Self-Stabilizing Population Protocols. CoRR abs/2010.03869 (2020) - 2019
- Joshua Bonn, Konrad Fögen, Horst Lichter:
A Framework for Automated Combinatorial Test Generation, Execution, and Fault Characterization. ICST Workshops 2019: 224-233 - 2018
- Thibault Rieutord:
Combinatorial characterization of asynchronous distributed computability. (Caractérisation combinatoire de la calculabilité distribuée asynchrone). University of Paris-Saclay, France, 2018 - Charles J. Colbourn, Violet R. Syrotiuk:
On a Combinatorial Framework for Fault Characterization. Math. Comput. Sci. 12(4): 429-451 (2018) - Christopher P. Chambers, Federico Echenique:
A Characterization of Combinatorial Demand. Math. Oper. Res. 43(1): 222-227 (2018) - 2016
- Maura B. Paterson, Douglas R. Stinson:
Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families. Discret. Math. 339(12): 2891-2906 (2016) - Eli Ben-Sasson, Michael Viderman:
A combinatorial characterization of smooth LTCs and applications. Random Struct. Algorithms 49(2): 280-307 (2016) - Christopher P. Chambers, Federico Echenique:
A characterization of combinatorial demand. CoRR abs/1605.09761 (2016) - Sen Hu, Xuexing Lu, Yu Ye:
On combinatorial characterization of planar $st$ graphs. CoRR abs/1604.07276 (2016) - Xuexing Lu, Yu Ye:
Combinatorial characterization of upward planarity. CoRR abs/1608.07255 (2016) - 2015
- Daniel Khoshnoudirad, Hugues Talbot:
A complete characterization of the (m, n)-cubes and combinatorial applications in imaging, vision and discrete geometry. AKCE Int. J. Graphs Comb. 12(Issues): 229-237 (2015) - Martin Balko, Radoslav Fulek, Jan Kyncl:
Crossing Numbers and Combinatorial Characterization of Monotone Drawings of $$K_n$$ K n. Discret. Comput. Geom. 53(1): 107-143 (2015) - Maura B. Paterson, Douglas R. Stinson:
Combinatorial Characterizations of Algebraic Manipulation Detection Codes Involving Generalized Difference Families. CoRR abs/1506.02711 (2015) - 2014
- Omar El-Dakkak, Giovanni Peccati, Igor Prünster:
Exchangeable Hoeffding decompositions over finite sets: A combinatorial characterization and counterexamples. J. Multivar. Anal. 131: 51-64 (2014)
skipping 71 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-11 17:09 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