Ilia Krasikov

47 papers Journal 45Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
The APS approach for undiscounted quitting games.
Int. J. Game Theory
Galit Ashkenazi-Golan, Ilia Krasikov, Catherine Rainer, Eilon Solan
2024 J jnl
Absorption paths and equilibria in quitting games.
Math. Program.
Galit Ashkenazi-Golan, Ilia Krasikov, Catherine Rainer, Eilon Solan
2021 J jnl
A theory of dynamic contracting with financial constraints.
J. Econ. Theory
Ilia Krasikov, Rohit Lamba
2017 J jnl
On approximation of ultraspherical polynomials in the oscillatory region.
J. Approx. Theory
Ilia Krasikov
2014 J jnl
Approximations for the Bessel and Airy functions with an explicit error term.
LMS J. Comput. Math.
Ilia Krasikov
2014 J jnl
On the Bessel function in the transition region.
LMS J. Comput. Math.
Ilia Krasikov
2011 J jnl
Turán inequalities for three-term recurrences with monotonic coefficients.
J. Approx. Theory
Ilia Krasikov
2010 J jnl
Equioscillatory property of the Laguerre polynomials.
J. Approx. Theory
Ilia Krasikov, Alexander Zarkh
2009 J jnl
On zeros of discrete orthogonal polynomials.
J. Approx. Theory
Ilia Krasikov, Alexander Zarkh
2007 J jnl
An upper bound on Jacobi polynomials.
J. Approx. Theory
Ilia Krasikov
2007 J jnl
Inequalities for orthonormal Laguerre polynomials.
J. Approx. Theory
Ilia Krasikov
2005 J jnl
On the maximum value of Jacobi polynomials.
J. Approx. Theory
Ilia Krasikov
2004 J jnl
Finding next-to-shortest paths in a graph.
Inf. Process. Lett.
Ilia Krasikov, Steven D. Noble
2003 J jnl
Bounds for zeros of the Laguerre polynomials.
J. Approx. Theory
Ilia Krasikov
2002 J jnl
Inequalities for real-root polynomials and entire functions.
Adv. Appl. Math.
William H. Foster, Ilia Krasikov
2002 J jnl
Upper bounds on the automorphism group of a graph0.
Discret. Math.
Ilia Krasikov, Arieh Lev, Bhalchandra D. Thatte
2001 J jnl
Nonnegative Quadratic Forms and Bounds on Orthogonal Polynomials.
J. Approx. Theory
Ilia Krasikov
2001 J jnl
On the Distance Distributions of BCH Codes and Their Duals.
Des. Codes Cryptogr.
Ilia Krasikov, Simon Litsyn
2000 J jnl
An improved upper bound on the minimum distance of doubly-even self-dual codes.
IEEE Trans. Inf. Theory
Ilia Krasikov, Simon Litsyn
2000 J jnl
Explicit Bounds for Hermite Polynomials in the Oscillatory Region.
LMS J. Comput. Math.
William H. Foster, Ilia Krasikov
1999 — conf
Bounds for the Christoffel-Darboux kernel of the binary Krawtchouk polynomials.
Codes and Association Schemes
Ilia Krasikov
1999 J jnl
On the Distance Distribution of Duals of BCH Codes.
IEEE Trans. Inf. Theory
Ilia Krasikov, Simon Litsyn
1999 — conf
Survey of binary Krawtchouk polynomials.
Codes and Association Schemes
Ilia Krasikov, Simon Litsyn
1998 J jnl
Bounds on Spectra of Codes with Known Dual Distance.
Des. Codes Cryptogr.
Ilia Krasikov, Simon Litsyn
1997 J jnl
Estimates for the range of binomiality in codes' spectra.
IEEE Trans. Inf. Theory
Ilia Krasikov, Simon Litsyn
1997 J jnl
Linear Programming Bounds for Codes of Small Size.
Eur. J. Comb.
Ilia Krasikov, Simon Litsyn
1997 J jnl
Linear programming bounds for doubly-even self-dual codes.
IEEE Trans. Inf. Theory
Ilia Krasikov, Simon Litsyn
1997 J jnl
On a Reconstruction Problem for Sequences, .
J. Comb. Theory A
Ilia Krasikov, Yehuda Roditty
1996 J jnl
Degree conditions for vertex switching reconstruction.
Discret. Math.
Ilia Krasikov
1996 J jnl
On Integral Zeros of Krawtchouk Polynomials.
J. Comb. Theory A
Ilia Krasikov, Simon Litsyn
1995 J jnl
On spectra of BCH codes.
IEEE Trans. Inf. Theory
Ilia Krasikov, Simon Litsyn
1995 J jnl
On the accuracy of the binomial approximation to the distance distribution of codes.
IEEE Trans. Inf. Theory
Ilia Krasikov, Simon Litsyn
1994 J jnl
Applications of balance equations to vertex switching reconstruction.
J. Graph Theory
Ilia Krasikov
1994 J jnl
Bounds for the harmonious chromatic number of a graph.
J. Graph Theory
Ilia Krasikov, Yehuda Roditty
1994 J jnl
More on Vertex-Switching Reconstruction.
J. Comb. Theory B
Ilia Krasikov, Yehuda Roditty
1994 J jnl
On induced subgraphs of trees, with restricted degrees.
Discret. Math.
Yair Caro, Ilia Krasikov, Yehuda Roditty
1994 J jnl
On near subgroups.
Discret. Math.
Ilia Krasikov, Johanan Schönheim
1993 J jnl
Bisection of trees and sequences.
Discret. Math.
Noga Alon, Yair Caro, Ilia Krasikov
1992 J jnl
Switching reconstruction and diophantine equations.
J. Comb. Theory B
Ilia Krasikov, Yehuda Roditty
1991 J jnl
Interchanging branches and similarity in a tree.
Graphs Comb.
Ilia Krasikov
1991 J jnl
On a tree-cutting problem of P. Ash.
Discret. Math.
Ilia Krasikov
1991 J jnl
On the largest tree of given maximum degree in a connected graph.
J. Graph Theory
Yair Caro, Ilia Krasikov, Yehuda Roditty
1990 J jnl
A note on the edge-reconstruction of
J. Comb. Theory B
Ilia Krasikov
1990 J jnl
Some applications of the nash-williams lemma to the edge-reconstruction conjecture.
Graphs Comb.
Ilia Krasikov, Yehuda Roditty
1989 J jnl
Combinatorial reconstruction problems.
J. Comb. Theory B
Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty
1987 J jnl
Reconstructing graphs from their
J. Comb. Theory B
Chris D. Godsil, Ilia Krasikov, Yehuda Roditty
1985 J jnl
The reconstruction of a tree from its number deck.
Discret. Math.
Ilia Krasikov, Johanan Schönheim