default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitry Panchenko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i4]Jean Barbier, Wei-Kuo Chen, Dmitry Panchenko, Manuel Sáenz:
Performance of Bayesian linear regression in a model with mismatch. CoRR abs/2107.06936 (2021)- 2020
- [i3]Jean Barbier
, Dmitry Panchenko:
Strong replica symmetry in high-dimensional optimal Bayesian inference. CoRR abs/2005.03115 (2020) - [i2]Jean Barbier, Dmitry Panchenko, Manuel Sáenz:
Strong replica symmetry for high-dimensional disordered log-concave Gibbs measures. CoRR abs/2009.12939 (2020)
2010 – 2019
- 2018
- [j4]Dmitry Panchenko:
On the K-sat model with large number of clauses. Random Struct. Algorithms 52(3): 536-542 (2018)
2000 – 2009
- 2009
- [j3]Andrea Conti, Dmitry Panchenko, Sergiy Sidenko, Velio Tralli:
Log-concavity property of the error probability with application to local bounds for wireless communications. IEEE Trans. Inf. Theory 55(6): 2766-2775 (2009) - 2007
- [i1]Andrea Conti, Dmitry Panchenko, Sergiy Sidenko, Velio Tralli:
Local Bounds based on Log-Concavity Property of the Error Probability in Wireless Communication Systems. CoRR abs/0710.1383 (2007) - 2005
- [c5]Polina Golland, Feng Liang, Sayan Mukherjee, Dmitry Panchenko:
Permutation Tests for Classification. COLT 2005: 501-515 - 2004
- [j2]Dmitry Panchenko:
Deviation inequality for monotonic Boolean functions with application to the number of k-cycles in a random graph. Random Struct. Algorithms 24(1): 65-74 (2004) - 2003
- [c4]Vladimir Koltchinskii, Dmitry Panchenko, Savina Andonova:
Generalization Bounds for Voting Classifiers Based on Sparsity and Clustering. COLT 2003: 492-505 - 2002
- [c3]Olivier Bousquet, Vladimir Koltchinskii, Dmitriy Panchenko:
Some Local Measures of Complexity of Convex Hulls and Generalization Bounds. COLT 2002: 59-73 - 2001
- [c2]Vladimir Koltchinskii, Dmitriy Panchenko, Fernando Lozano:
Further Explanation of the Effectiveness of Voting Methods: The Game between Margins and Weights. COLT/EuroCOLT 2001: 241-255 - 2000
- [j1]Vladimir Koltchinskii, Chaouki T. Abdallah, Marco Ariola, Peter Dorato, Dmitry Panchenko:
Improved sample complexity estimates for statistical learning control of uncertain systems. IEEE Trans. Autom. Control. 45(12): 2383-2388 (2000) - [c1]Vladimir Koltchinskii, Dmitriy Panchenko, Fernando Lozano:
Some New Bounds on the Generalization Error of Combined Classifiers. NIPS 2000: 245-251
Coauthor Index
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.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
