Ilia Krasikov

According to our database1, Ilia Krasikov authored at least 46 papers between 1985 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Absorption paths and equilibria in quitting games.
Math. Program., January, 2024

2021
A theory of dynamic contracting with financial constraints.
J. Econ. Theory, 2021

2017
On approximation of ultraspherical polynomials in the oscillatory region.
J. Approx. Theory, 2017

2014
On the Bessel function in the transition region.
LMS J. Comput. Math., 2014

Approximations for the Bessel and Airy functions with an explicit error term.
LMS J. Comput. Math., 2014

2011
Turán inequalities for three-term recurrences with monotonic coefficients.
J. Approx. Theory, 2011

2010
Equioscillatory property of the Laguerre polynomials.
J. Approx. Theory, 2010

2009
On zeros of discrete orthogonal polynomials.
J. Approx. Theory, 2009

2007
An upper bound on Jacobi polynomials.
J. Approx. Theory, 2007

Inequalities for orthonormal Laguerre polynomials.
J. Approx. Theory, 2007

2005
On the maximum value of Jacobi polynomials.
J. Approx. Theory, 2005

2004
Finding next-to-shortest paths in a graph.
Inf. Process. Lett., 2004

2003
Bounds for zeros of the Laguerre polynomials.
J. Approx. Theory, 2003

2002
Upper bounds on the automorphism group of a graph0.
Discret. Math., 2002

Inequalities for real-root polynomials and entire functions.
Adv. Appl. Math., 2002

2001
Nonnegative Quadratic Forms and Bounds on Orthogonal Polynomials.
J. Approx. Theory, 2001

On the Distance Distributions of BCH Codes and Their Duals.
Des. Codes Cryptogr., 2001

2000
An improved upper bound on the minimum distance of doubly-even self-dual codes.
IEEE Trans. Inf. Theory, 2000

Explicit Bounds for Hermite Polynomials in the Oscillatory Region.
LMS J. Comput. Math., 2000

1999
On the Distance Distribution of Duals of BCH Codes.
IEEE Trans. Inf. Theory, 1999

Survey of binary Krawtchouk polynomials.
Proceedings of the Codes and Association Schemes, 1999

Bounds for the Christoffel-Darboux kernel of the binary Krawtchouk polynomials.
Proceedings of the Codes and Association Schemes, 1999

1998
Bounds on Spectra of Codes with Known Dual Distance.
Des. Codes Cryptogr., 1998

1997
Linear programming bounds for doubly-even self-dual codes.
IEEE Trans. Inf. Theory, 1997

Estimates for the range of binomiality in codes' spectra.
IEEE Trans. Inf. Theory, 1997

On a Reconstruction Problem for Sequences, .
J. Comb. Theory A, 1997

Linear Programming Bounds for Codes of Small Size.
Eur. J. Comb., 1997

1996
On Integral Zeros of Krawtchouk Polynomials.
J. Comb. Theory A, 1996

Degree conditions for vertex switching reconstruction.
Discret. Math., 1996

1995
On the accuracy of the binomial approximation to the distance distribution of codes.
IEEE Trans. Inf. Theory, 1995

On spectra of BCH codes.
IEEE Trans. Inf. Theory, 1995

1994
Bounds for the harmonious chromatic number of a graph.
J. Graph Theory, 1994

Applications of balance equations to vertex switching reconstruction.
J. Graph Theory, 1994

More on Vertex-Switching Reconstruction.
J. Comb. Theory B, 1994

On near subgroups.
Discret. Math., 1994

On induced subgraphs of trees, with restricted degrees.
Discret. Math., 1994

1993
Bisection of trees and sequences.
Discret. Math., 1993

1992
Switching reconstruction and diophantine equations.
J. Comb. Theory B, 1992

1991
On the largest tree of given maximum degree in a connected graph.
J. Graph Theory, 1991

Interchanging branches and similarity in a tree.
Graphs Comb., 1991

On a tree-cutting problem of P. Ash.
Discret. Math., 1991

1990
A note on the edge-reconstruction of <i>K</i><sub><i>1, m</i></sub>-free graphs.
J. Comb. Theory B, 1990

Some applications of the nash-williams lemma to the edge-reconstruction conjecture.
Graphs Comb., 1990

1989
Combinatorial reconstruction problems.
J. Comb. Theory B, 1989

1987
Reconstructing graphs from their <i>k</i>-edge deleted subgraphs.
J. Comb. Theory B, 1987

1985
The reconstruction of a tree from its number deck.
Discret. Math., 1985


  Loading...