default search action
Ilia Krasikov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j44]Galit Ashkenazi-Golan
, Ilia Krasikov, Catherine Rainer, Eilon Solan
Absorption paths and equilibria in quitting games. Math. Program. 203(1): 735-762 (2024) - 2021
- [j43]Ilia Krasikov, Rohit Lamba:
A theory of dynamic contracting with financial constraints. J. Econ. Theory 193: 105196 (2021)
2010 – 2019
- 2017
- [j42]Ilia Krasikov:
On approximation of ultraspherical polynomials in the oscillatory region. J. Approx. Theory 222: 143-156 (2017) - 2014
- [j41]Ilia Krasikov:
Approximations for the Bessel and Airy functions with an explicit error term. LMS J. Comput. Math. 17(1): 209-225 (2014) - [j40]Ilia Krasikov:
On the Bessel function in the transition region. LMS J. Comput. Math. 17(1): 273-281 (2014) - 2011
- [j39]Ilia Krasikov:
Turán inequalities for three-term recurrences with monotonic coefficients. J. Approx. Theory 163(9): 1269-1299 (2011) - 2010
- [j38]Ilia Krasikov, Alexander Zarkh:
Equioscillatory property of the Laguerre polynomials. J. Approx. Theory 162(11): 2021-2047 (2010)
2000 – 2009
- 2009
- [j37]Ilia Krasikov, Alexander Zarkh:
On zeros of discrete orthogonal polynomials. J. Approx. Theory 156(2): 121-141 (2009) - 2007
- [j36]Ilia Krasikov:
Inequalities for orthonormal Laguerre polynomials. J. Approx. Theory 144(1): 1-26 (2007) - [j35]Ilia Krasikov:
An upper bound on Jacobi polynomials. J. Approx. Theory 149(2): 116-130 (2007) - 2005
- [j34]Ilia Krasikov:
On the maximum value of Jacobi polynomials. J. Approx. Theory 136(1): 1-20 (2005) - 2004
- [j33]Ilia Krasikov, Steven D. Noble
Finding next-to-shortest paths in a graph. Inf. Process. Lett. 92(3): 117-119 (2004) - 2003
- [j32]Ilia Krasikov:
Bounds for zeros of the Laguerre polynomials. J. Approx. Theory 121(2): 287-291 (2003) - 2002
- [j31]William H. Foster, Ilia Krasikov:
Inequalities for real-root polynomials and entire functions. Adv. Appl. Math. 29(1): 102-114 (2002) - [j30]Ilia Krasikov, Arieh Lev, Bhalchandra D. Thatte:
Upper bounds on the automorphism group of a graph0. Discret. Math. 256(1-2): 489-493 (2002) - 2001
- [j29]Ilia Krasikov, Simon Litsyn:
On the Distance Distributions of BCH Codes and Their Duals. Des. Codes Cryptogr. 23(2): 223-232 (2001) - [j28]Ilia Krasikov:
Nonnegative Quadratic Forms and Bounds on Orthogonal Polynomials. J. Approx. Theory 111(1): 31-49 (2001) - 2000
- [j27]William H. Foster, Ilia Krasikov:
Explicit Bounds for Hermite Polynomials in the Oscillatory Region. LMS J. Comput. Math. 3: 307-314 (2000) - [j26]Ilia Krasikov, Simon Litsyn:
An improved upper bound on the minimum distance of doubly-even self-dual codes. IEEE Trans. Inf. Theory 46(1): 274-278 (2000)
1990 – 1999
- 1999
- [j25]Ilia Krasikov, Simon Litsyn:
On the Distance Distribution of Duals of BCH Codes. IEEE Trans. Inf. Theory 45(1): 247-250 (1999) - [c2]Ilia Krasikov:
Bounds for the Christoffel-Darboux kernel of the binary Krawtchouk polynomials. Codes and Association Schemes 1999: 193-198 - [c1]Ilia Krasikov, Simon Litsyn:
Survey of binary Krawtchouk polynomials. Codes and Association Schemes 1999: 199-211 - 1998
- [j24]Ilia Krasikov, Simon Litsyn:
Bounds on Spectra of Codes with Known Dual Distance. Des. Codes Cryptogr. 13(3): 285-297 (1998) - 1997
- [j23]Ilia Krasikov, Simon Litsyn:
Linear Programming Bounds for Codes of Small Size. Eur. J. Comb. 18(6): 647-656 (1997) - [j22]Ilia Krasikov, Yehuda Roditty:
On a Reconstruction Problem for Sequences, . J. Comb. Theory A 77(2): 344-348 (1997) - [j21]Ilia Krasikov, Simon Litsyn:
Estimates for the range of binomiality in codes' spectra. IEEE Trans. Inf. Theory 43(3): 987-991 (1997) - [j20]Ilia Krasikov, Simon Litsyn:
Linear programming bounds for doubly-even self-dual codes. IEEE Trans. Inf. Theory 43(4): 1238-1244 (1997) - 1996
- [j19]Ilia Krasikov:
Degree conditions for vertex switching reconstruction. Discret. Math. 160(1-3): 273-278 (1996) - [j18]Ilia Krasikov, Simon Litsyn:
On Integral Zeros of Krawtchouk Polynomials. J. Comb. Theory A 74(1): 71-99 (1996) - 1995
- [j17]Ilia Krasikov, Simon Litsyn:
On spectra of BCH codes. IEEE Trans. Inf. Theory 41(3): 786-788 (1995) - [j16]Ilia Krasikov, Simon Litsyn:
On the accuracy of the binomial approximation to the distance distribution of codes. IEEE Trans. Inf. Theory 41(5): 1472-1474 (1995) - 1994
- [j15]Ilia Krasikov, Johanan Schönheim:
On near subgroups. Discret. Math. 124(1-3): 133-136 (1994) - [j14]Yair Caro, Ilia Krasikov, Yehuda Roditty:
On induced subgraphs of trees, with restricted degrees. Discret. Math. 125(1-3): 101-106 (1994) - [j13]Ilia Krasikov, Yehuda Roditty:
More on Vertex-Switching Reconstruction. J. Comb. Theory B 60(1): 40-55 (1994) - [j12]Ilia Krasikov, Yehuda Roditty:
Bounds for the harmonious chromatic number of a graph. J. Graph Theory 18(2): 205-209 (1994) - [j11]Ilia Krasikov:
Applications of balance equations to vertex switching reconstruction. J. Graph Theory 18(3): 217-225 (1994) - 1993
- [j10]Noga Alon, Yair Caro, Ilia Krasikov:
Bisection of trees and sequences. Discret. Math. 114(1-3): 3-7 (1993) - 1992
- [j9]Ilia Krasikov, Yehuda Roditty:
Switching reconstruction and diophantine equations. J. Comb. Theory B 54(2): 189-195 (1992) - 1991
- [j8]Ilia Krasikov:
On a tree-cutting problem of P. Ash. Discret. Math. 93(1): 55-61 (1991) - [j7]Ilia Krasikov:
Interchanging branches and similarity in a tree. Graphs Comb. 7(2): 165-175 (1991) - [j6]Yair Caro, Ilia Krasikov, Yehuda Roditty:
On the largest tree of given maximum degree in a connected graph. J. Graph Theory 15(1): 7-13 (1991) - 1990
- [j5]Ilia Krasikov, Yehuda Roditty:
Some applications of the nash-williams lemma to the edge-reconstruction conjecture. Graphs Comb. 6(1): 37-39 (1990) - [j4]Ilia Krasikov:
A note on the edge-reconstruction of K1, m-free graphs. J. Comb. Theory B 49(2): 295-298 (1990)
1980 – 1989
- 1989
- [j3]Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty:
Combinatorial reconstruction problems. J. Comb. Theory B 47(2): 153-161 (1989) - 1987
- [j2]Chris D. Godsil
Reconstructing graphs from their k-edge deleted subgraphs. J. Comb. Theory B 43(3): 360-363 (1987) - 1985
- [j1]Ilia Krasikov, Johanan Schönheim:
The reconstruction of a tree from its number deck. Discret. Math. 53: 137-145 (1985)
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-06-10 21:20 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: