default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKonstantin E. Tikhomirov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Konstantin E. Tikhomirov:
On Bounded Degree Graphs with Large Size-Ramsey Numbers. Comb. 44(1): 9-14 (2024)- [j7]Konstantin E. Tikhomirov:
A remark on the Ramsey number of the hypercube. Eur. J. Comb. 120: 103954 (2024) - [i5]Dylan J. Altschuler, Konstantin E. Tikhomirov:
A note on the capacity of the binary perceptron. CoRR abs/2401.15092 (2024) - 2022
- [j6]Jing Hao, Han Huang
, Galyna V. Livshyts, Konstantin E. Tikhomirov:
Distribution of the Minimum Distance of Random Linear Codes. IEEE Trans. Inf. Theory 68(10): 6388-6401 (2022) - [i4]Han Huang, Konstantin E. Tikhomirov:
Average-case analysis of the Gaussian Elimination with Partial Pivoting. CoRR abs/2206.01726 (2022) - 2021
- [j5]Konstantin E. Tikhomirov, Pierre Youssef:
Outliers in spectrum of sparse Wigner matrices. Random Struct. Algorithms 58(3): 517-605 (2021) - [c2]Cheng Mao, Mark Rudelson, Konstantin E. Tikhomirov:
Random Graph Matching with Improved Noise Robustness. COLT 2021: 3296-3329 - [i3]Cheng Mao, Mark Rudelson, Konstantin E. Tikhomirov:
Random Graph Matching with Improved Noise Robustness. CoRR abs/2101.11783 (2021) - [i2]Cheng Mao, Mark Rudelson, Konstantin E. Tikhomirov:
Exact Matching of Random Graphs with Constant Correlation. CoRR abs/2110.05000 (2021) - 2020
- [j4]Galyna V. Livshyts, Konstantin E. Tikhomirov:
Cube is a Strict Local Maximizer for the Illumination Number. Discret. Comput. Geom. 63(1): 209-228 (2020) - [j3]Konstantin E. Tikhomirov:
Invertibility via distance for noncentered random matrices with continuous distributions. Random Struct. Algorithms 57(2): 526-562 (2020) - [c1]Jing Hao, Han Huang, Galyna V. Livshyts, Konstantin E. Tikhomirov:
Distribution of the Minimum Distance of Random Linear Codes. ISIT 2020: 114-119
2010 – 2019
- 2019
- [i1]Jing Hao, Han Huang, Galyna V. Livshyts, Konstantin E. Tikhomirov:
Distribution of the minimal distance of random linear codes. CoRR abs/1912.12833 (2019) - 2018
- [j2]Alexander E. Litvak, Anna Lytova, Konstantin E. Tikhomirov, Nicole Tomczak-Jaegermann, Pierre Youssef:
The rank of random regular digraphs of constant degree. J. Complex. 48: 103-110 (2018) - 2015
- [j1]Konstantin E. Tikhomirov:
On the Distance of Polytopes with Few Vertices to the Euclidean Ball. Discret. Comput. Geom. 53(1): 173-181 (2015)
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-08-03 20:14 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:
