default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomasz Tkocz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Yun Cheng, Yixue Liu, Tomasz Tkocz, Albert Xu:
Typical Values of Extremal-Weight Combinatorial Structures with Independent Symmetric Weights. Electron. J. Comb. 30(1) (2023)- 2022
- [j13]Alan M. Frieze
, Tomasz Tkocz:
A Randomly Weighted Minimum Arborescence with a Random Cost Constraint. Math. Oper. Res. 47(2): 1664-1680 (2022) - [j12]Alan M. Frieze, Wesley Pegden, Tomasz Tkocz:
On the Cover Time of the Emerging Giant. SIAM J. Discret. Math. 36(3): 1687-1710 (2022) - [i8]Giorgos Chasapis, Salil Singh, Tomasz Tkocz:
Entropies of sums of independent gamma random variables. CoRR abs/2201.08284 (2022) - 2021
- [j11]Alan M. Frieze, Wesley Pegden, Gregory B. Sorkin, Tomasz Tkocz:
Minimum-Weight Combinatorial Structures Under Random Cost-Constraints. Electron. J. Comb. 28(1): 1 (2021) - [j10]Alan M. Frieze, Tomasz Tkocz:
A Randomly Weighted Minimum Spanning Tree with a Random Cost Constraint. Electron. J. Comb. 28(1): 1 (2021) - [j9]Alan M. Frieze, Tomasz Tkocz:
Shortest paths with a cost constraint: A probabilistic analysis. Discret. Appl. Math. 302: 46-53 (2021) - [j8]Alan M. Frieze, Tomasz Tkocz:
Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects. Oper. Res. Lett. 49(3): 400-404 (2021) - [j7]James Melbourne, Tomasz Tkocz:
Reversal of Rényi Entropy Inequalities Under Log-Concavity. IEEE Trans. Inf. Theory 67(1): 45-51 (2021) - [j6]Mokshay Madiman, Piotr Nayar, Tomasz Tkocz:
Sharp Moment-Entropy Inequalities and Capacity Bounds for Symmetric Log-Concave Distributions. IEEE Trans. Inf. Theory 67(1): 81-94 (2021) - 2020
- [j5]Ruoyuan Liu, Tomasz Tkocz:
A note on the extremal non-central sections of the cross-polytope. Adv. Appl. Math. 118: 102031 (2020) - [j4]Alan M. Frieze, Wesley Pegden, Tomasz Tkocz:
On random multi-dimensional assignment problems. Discret. Appl. Math. 287: 1-9 (2020) - [j3]Alan M. Frieze, Tomasz Tkocz:
Random Graphs with a Fixed Maximum Degree. SIAM J. Discret. Math. 34(1): 53-61 (2020) - [c3]James Melbourne, Tomasz Tkocz:
On the Rényi Entropy of Log-Concave Sequences. ISIT 2020: 2292-2296 - [c2]Alan M. Frieze, Tomasz Tkocz:
A randomly weighted minimum spanning tree with a random cost constraint. SODA 2020: 670-689 - [i7]James Melbourne, Tomasz Tkocz:
Reversals of Rényi Entropy Inequalities under Log-Concavity. CoRR abs/2005.10930 (2020) - [i6]Alan M. Frieze, Tomasz Tkocz:
Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects. CoRR abs/2009.03416 (2020)
2010 – 2019
- 2019
- [j2]Alan M. Frieze, Tomasz Tkocz:
A Note on Log-Concave Random Graphs. Electron. J. Comb. 26(3): 3 (2019) - [c1]Mokshay Madiman, Piotr Nayar, Tomasz Tkocz:
On the question of the best additive noise among symmetric log-concave noises. ISIT 2019: 1837-1841 - [i5]Alan M. Frieze, Wesley Pegden, Tomasz Tkocz:
On random multi-dimensional assignment problems. CoRR abs/1901.07167 (2019) - [i4]Mokshay Madiman, Piotr Nayar, Tomasz Tkocz:
Two remarks on generalized entropy power inequalities. CoRR abs/1904.02314 (2019) - [i3]Alan M. Frieze, Tomasz Tkocz:
A randomly weighted minimum arborescence with a random cost constraint. CoRR abs/1907.03375 (2019) - 2018
- [i2]Mokshay Madiman, Piotr Nayar, Tomasz Tkocz:
Entropy versus variance for symmetric log-concave random variables and related problems. CoRR abs/1811.00345 (2018) - 2016
- [i1]Alexandros Eskenazis, Piotr Nayar, Tomasz Tkocz:
Gaussian mixtures: entropy and geometric inequalities. CoRR abs/1611.04921 (2016) - 2012
- [j1]Tomasz Tkocz:
An Upper Bound for Spherical Caps. Am. Math. Mon. 119(7): 606-607 (2012)
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:57 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:
