Ilia Krasikov

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 3

Top Topics

Dynamic Constraints

Approximation Methods

Games With Incomplete Information

Pure Nash Equilibria

Top Venues

J. Approx. Theory

J. Econ. Theory

Publications

Galit Ashkenazi-Golan, Ilia Krasikov, Catherine Rainer, Eilon Solan
Absorption paths and equilibria in quitting games. Math. Program. 203 (1) (2024)
Ilia Krasikov, Rohit Lamba
A theory of dynamic contracting with financial constraints. J. Econ. Theory 193 (2021)
Ilia Krasikov
On approximation of ultraspherical polynomials in the oscillatory region. J. Approx. Theory 222 (2017)
Ilia Krasikov
Turán inequalities for three-term recurrences with monotonic coefficients. J. Approx. Theory 163 (9) (2011)
Ilia Krasikov, Alexander Zarkh
Equioscillatory property of the Laguerre polynomials. J. Approx. Theory 162 (11) (2010)
Ilia Krasikov, Alexander Zarkh
On zeros of discrete orthogonal polynomials. J. Approx. Theory 156 (2) (2009)
Ilia Krasikov
Inequalities for orthonormal Laguerre polynomials. J. Approx. Theory 144 (1) (2007)
Ilia Krasikov
An upper bound on Jacobi polynomials. J. Approx. Theory 149 (2) (2007)
Ilia Krasikov
On the maximum value of Jacobi polynomials. J. Approx. Theory 136 (1) (2005)
Ilia Krasikov, Steven D. Noble
Finding next-to-shortest paths in a graph. Inf. Process. Lett. 92 (3) (2004)
Ilia Krasikov
Bounds for zeros of the Laguerre polynomials. J. Approx. Theory 121 (2) (2003)
Ilia Krasikov, Arieh Lev, Bhalchandra D. Thatte
Upper bounds on the automorphism group of a graph0. Discret. Math. 256 (1-2) (2002)
William H. Foster, Ilia Krasikov
Inequalities for real-root polynomials and entire functions. Adv. Appl. Math. 29 (1) (2002)
Ilia Krasikov
Nonnegative Quadratic Forms and Bounds on Orthogonal Polynomials. J. Approx. Theory 111 (1) (2001)
Ilia Krasikov, Simon Litsyn
On the Distance Distributions of BCH Codes and Their Duals. Des. Codes Cryptogr. 23 (2) (2001)
Ilia Krasikov, Simon Litsyn
An improved upper bound on the minimum distance of doubly-even self-dual codes. IEEE Trans. Inf. Theory 46 (1) (2000)
Ilia Krasikov
Bounds for the Christoffel-Darboux kernel of the binary Krawtchouk polynomials. Codes and Association Schemes (1999)
Ilia Krasikov, Simon Litsyn
On the Distance Distribution of Duals of BCH Codes. IEEE Trans. Inf. Theory 45 (1) (1999)
Ilia Krasikov, Simon Litsyn
Survey of binary Krawtchouk polynomials. Codes and Association Schemes (1999)
Ilia Krasikov, Simon Litsyn
Bounds on Spectra of Codes with Known Dual Distance. Des. Codes Cryptogr. 13 (3) (1998)
Ilia Krasikov, Yehuda Roditty
On a Reconstruction Problem for Sequences, . J. Comb. Theory, Ser. A 77 (2) (1997)
Ilia Krasikov, Simon Litsyn
Linear Programming Bounds for Codes of Small Size. Eur. J. Comb. 18 (6) (1997)
Ilia Krasikov, Simon Litsyn
Estimates for the range of binomiality in codes' spectra. IEEE Trans. Inf. Theory 43 (3) (1997)
Ilia Krasikov, Simon Litsyn
Linear programming bounds for doubly-even self-dual codes. IEEE Trans. Inf. Theory 43 (4) (1997)
Ilia Krasikov, Simon Litsyn
On Integral Zeros of Krawtchouk Polynomials. J. Comb. Theory, Ser. A 74 (1) (1996)
Ilia Krasikov
Degree conditions for vertex switching reconstruction. Discret. Math. 160 (1-3) (1996)
Ilia Krasikov, Simon Litsyn
On spectra of BCH codes. IEEE Trans. Inf. Theory 41 (3) (1995)
Ilia Krasikov, Simon Litsyn
On the accuracy of the binomial approximation to the distance distribution of codes. IEEE Trans. Inf. Theory 41 (5) (1995)
Ilia Krasikov, Yehuda Roditty
More on Vertex-Switching Reconstruction. J. Comb. Theory, Ser. B 60 (1) (1994)
Ilia Krasikov
Applications of balance equations to vertex switching reconstruction. J. Graph Theory 18 (3) (1994)
Ilia Krasikov, Johanan Schönheim
On near subgroups. Discret. Math. 124 (1-3) (1994)
Yair Caro, Ilia Krasikov, Yehuda Roditty
On induced subgraphs of trees, with restricted degrees. Discret. Math. 125 (1-3) (1994)
Ilia Krasikov, Yehuda Roditty
Bounds for the harmonious chromatic number of a graph. J. Graph Theory 18 (2) (1994)
Noga Alon, Yair Caro, Ilia Krasikov
Bisection of trees and sequences. Discret. Math. 114 (1-3) (1993)
Ilia Krasikov, Yehuda Roditty
Switching reconstruction and diophantine equations. J. Comb. Theory, Ser. B 54 (2) (1992)
Ilia Krasikov
On a tree-cutting problem of P. Ash. Discret. Math. 93 (1) (1991)
Yair Caro, Ilia Krasikov, Yehuda Roditty
On the largest tree of given maximum degree in a connected graph. J. Graph Theory 15 (1) (1991)
Ilia Krasikov
Interchanging branches and similarity in a tree. Graphs Comb. 7 (2) (1991)
Ilia Krasikov, Yehuda Roditty
Some applications of the nash-williams lemma to the edge-reconstruction conjecture. Graphs Comb. 6 (1) (1990)
Ilia Krasikov
-free graphs. J. Comb. Theory, Ser. B 49 (2) (1990)
Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty
Combinatorial reconstruction problems. J. Comb. Theory, Ser. B 47 (2) (1989)
Chris D. Godsil, Ilia Krasikov, Yehuda Roditty
-edge deleted subgraphs. J. Comb. Theory, Ser. B 43 (3) (1987)
Ilia Krasikov, Johanan Schönheim
The reconstruction of a tree from its number deck. Discret. Math. 53 (1985)