Ilia Krasikov

发表

On a Reconstruction Problem for Sequences,

Ilia Krasikov, Yehuda Roditty, I. Krasikov, 1997, J. Comb. Theory A.

Linear Programming Bounds for Codes of Small Size

Simon Litsyn, Ilia Krasikov, 1997, Eur. J. Comb..

Absorption Paths and Equilibria in Quitting Games

Ilia Krasikov, Eilon Solan, Galit Ashkenazi-Golan, 2020 .

Switching reconstruction and diophantine equations

Ilia Krasikov, Yehuda Roditty, 1992, J. Comb. Theory, Ser. B.

Reconstructing graphs from their k-edge deleted subgraphs

Chris D. Godsil, Ilia Krasikov, Yehuda Roditty, 1987, J. Comb. Theory, Ser. B.

Interchanging branches and similarity in a tree

Ilia Krasikov, 1991, Graphs Comb..

On a tree-cutting problem of P. Ash

Ilia Krasikov, 1991, Discret. Math..

Equioscillatory property of the Laguerre polynomials

Ilia Krasikov, Alexander Zarkh, 2010, J. Approx. Theory.

Estimates for the range of binomiality in codes' spectra

Simon Litsyn, Ilia Krasikov, 1997, IEEE Trans. Inf. Theory.

On Integral Zeros of Krawtchouk Polynomials

Simon Litsyn, Ilia Krasikov, I. Krasikov, 1996, J. Comb. Theory, Ser. A.

On near subgroups

Ilia Krasikov, Johanan Schönheim, 1994, Discret. Math..

Survey of binary Krawtchouk polynomials

Simon Litsyn, Ilia Krasikov, I. Krasikov, 1999, Codes and Association Schemes.

On induced subgraphs of trees, with restricted degrees

Yair Caro, Ilia Krasikov, Yehuda Roditty, 1994, Discret. Math..

Nonnegative Quadratic Forms and Bounds on Orthogonal Polynomials

Ilia Krasikov, I. Krasikov, 2001, J. Approx. Theory.

Bounds for the harmonious chromatic number of a graph

Ilia Krasikov, Yehuda Roditty, I. Krasikov, 1994, J. Graph Theory.

The reconstruction of a tree from its number deck

Ilia Krasikov, J. Schönheim, I. Krasikov, 1985, Discret. Math..

On the Distance Distributions of BCH Codes and Their Duals

Simon Litsyn, Ilia Krasikov, 2001, Des. Codes Cryptogr..

More on Vertex-Switching Reconstruction

Ilia Krasikov, Yehuda Roditty, 1994, J. Comb. Theory, Ser. B.

Bounds for the Christoffel-Darboux kernel of the binary Krawtchouk polynomials

Ilia Krasikov, I. Krasikov, 1999, Codes and Association Schemes.

On zeros of discrete orthogonal polynomials

Ilia Krasikov, Alexander Zarkh, 2009, J. Approx. Theory.

Turán inequalities for three-term recurrences with monotonic coefficients

Ilia Krasikov, 2011, J. Approx. Theory.

On spectra of BCH codes

Simon Litsyn, Ilia Krasikov, 1995, Eighteenth Convention of Electrical and Electronics Engineers in Israel.

On the maximum value of Jacobi polynomials

Ilia Krasikov, 2005, J. Approx. Theory.

An upper bound on Jacobi polynomials

Ilia Krasikov, 2007, J. Approx. Theory.

Inequalities for real-root polynomials and entire functions

Ilia Krasikov, William H. Foster, 2002, Adv. Appl. Math..

Bisection of trees and sequences

Noga Alon, Yair Caro, Ilia Krasikov, 1993, Discret. Math..

Linear programming bounds for doubly-even self-dual codes

Simon Litsyn, Ilia Krasikov, 1997, IEEE Trans. Inf. Theory.

On the Distance Distribution of Duals of BCH Codes

Simon Litsyn, Ilia Krasikov, 1999, IEEE Trans. Inf. Theory.

Bounds on Spectra of Codes with Known Dual Distance

Simon Litsyn, Ilia Krasikov, 1998, Des. Codes Cryptogr..

On the largest tree of given maximum degree in a connected graph

Yair Caro, Ilia Krasikov, Yehuda Roditty, 1991, J. Graph Theory.

Applications of balance equations to vertex switching reconstruction

Ilia Krasikov, 1994, J. Graph Theory.

On the accuracy of the binomial approximation to the distance distribution of codes

Simon Litsyn, Ilia Krasikov, 1995, IEEE Trans. Inf. Theory.

An improved upper bound on the minimum distance of doubly-even self-dual codes

Simon Litsyn, Ilia Krasikov, 2000, IEEE Trans. Inf. Theory.

Finding next-to-shortest paths in a graph

Ilia Krasikov, Steven D. Noble, S. D. Noble, 2004, Inf. Process. Lett..

Upper bounds on the automorphism group of a graph0

Ilia Krasikov, Bhalchandra D. Thatte, Arieh Lev, 2002, Discret. Math..

A note on the edge-reconstruction of K1, m-free graphs

Ilia Krasikov, 1990, J. Comb. Theory, Ser. B.

Bounds for zeros of the Laguerre polynomials

Ilia Krasikov, 2003, J. Approx. Theory.

Combinatorial reconstruction problems

Noga Alon, Yair Caro, Ilia Krasikov, 1989, J. Comb. Theory, Ser. B.

Some applications of the nash-williams lemma to the edge-reconstruction conjecture

Ilia Krasikov, Yehuda Roditty, 1990, Graphs Comb..

Degree conditions for vertex switching reconstruction

Ilia Krasikov, 1996, Discret. Math..

A theory of dynamic contracting with financial constraints

Ilia Krasikov, Rohit Lamba, 2021, J. Econ. Theory.

A ] 1 2 N ov 2 00 2 On zeros of polynomials and allied functions satisfying second order differential equations

Ilia Krasikov, 2002 .

On the binomial approximation to the distance distribution of codes

Simon Litsyn, Ilia Krasikov, 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

Bounds for Zeros of the Charlier Polynomials

Ilia Krasikov, 2002 .

Turan inequalities and zeros of orthogonal polynomials

Ilia Krasikov, 2004 .

On the zeros of polynomials and allied functions satisfying second order differential equations

Ilia Krasikov, 2002 .

EXPLICIT BOUNDS FOR HERMITE POLYNOMIALS IN THE OSCILLATORY REGION

Ilia Krasikov, I. Krasikov, William H. Foster, 2000 .

On a Sturm Liouville periodic boundary values problem

Ilia Krasikov, A. Lucianetti, I. M. Fabbri, 2009 .

DISCRETE ANALOGUES OF THE LAGUERRE INEQUALITY

Ilia Krasikov, 2002 .

Balance equations for reconstruction problems

Ilia Krasikov, Yehuda Roditty, 1987 .

On extreme zeros of classical orthogonal polynomials

Ilia Krasikov, 2003 .

Inequalities of Laguerre polynomials

Ilia Krasikov, 2005 .

Zero-sum partition theorems for graphs

Yair Caro, Ilia Krasikov, Yehuda Roditty, 1994 .

On the Erdelyi-Magnus-Nevai Conjecture for Jacobi Polynomials

Ilia Krasikov, 2008 .