Ilia Krasikov

	2011
34		Ilia Krasikov: Turán inequalities for three-term recurrences with monotonic coefficients. Journal of Approximation Theory 163(9): 1269-1299 (2011)
	2010
33		Ilia Krasikov, Alexander Zarkh: Equioscillatory property of the Laguerre polynomials. Journal of Approximation Theory 162(11): 2021-2047 (2010)
	2009
32		Ilia Krasikov, Alexander Zarkh: On zeros of discrete orthogonal polynomials. Journal of Approximation Theory 156(2): 121-141 (2009)
	2007
31		Ilia Krasikov: Inequalities for orthonormal Laguerre polynomials. Journal of Approximation Theory 144(1): 1-26 (2007)
30		Ilia Krasikov: An upper bound on Jacobi polynomials. Journal of Approximation Theory 149(2): 116-130 (2007)
	2005
29		Ilia Krasikov: On the maximum value of Jacobi polynomials. Journal of Approximation Theory 136(1): 1-20 (2005)
	2004
28		Ilia Krasikov, S. D. Noble: Finding next-to-shortest paths in a graph. Inf. Process. Lett. 92(3): 117-119 (2004)
	2003
27		Ilia Krasikov: Bounds for zeros of the Laguerre polynomials. Journal of Approximation Theory 121(2): 287-291 (2003)
	2002
26		Ilia Krasikov, Arieh Lev, Bhalchandra D. Thatte: Upper bounds on the automorphism group of a graph0. Discrete Mathematics 256(1-2): 489-493 (2002)
	2001
25		Ilia Krasikov, Simon Litsyn: On the Distance Distributions of BCH Codes and Their Duals. Des. Codes Cryptography 23(2): 223-232 (2001)
24		Ilia Krasikov: Nonnegative Quadratic Forms and Bounds on Orthogonal Polynomials. Journal of Approximation Theory 111(1): 31-49 (2001)
	2000
23		Ilia Krasikov, Simon Litsyn: An improved upper bound on the minimum distance of doubly-even self-dual codes. IEEE Transactions on Information Theory 46(1): 274-278 (2000)
	1999
22		Ilia Krasikov, Simon Litsyn: On the Distance Distribution of Duals of BCH Codes. IEEE Transactions on Information Theory 45(1): 247-250 (1999)
	1998
21		Ilia Krasikov, Simon Litsyn: Bounds on Spectra of Codes with Known Dual Distance. Des. Codes Cryptography 13(3): 285-297 (1998)
	1997
20		Ilia Krasikov, Simon Litsyn: Linear Programming Bounds for Codes of Small Size. Eur. J. Comb. 18(6): 647-656 (1997)
19		Ilia Krasikov, Simon Litsyn: Estimates for the range of binomiality in codes' spectra. IEEE Transactions on Information Theory 43(3): 987-991 (1997)
18		Ilia Krasikov, Simon Litsyn: Linear programming bounds for doubly-even self-dual codes. IEEE Transactions on Information Theory 43(4): 1238-1244 (1997)
17		Ilia Krasikov, Yehuda Roditty: On a Reconstruction Problem for Sequences, . J. Comb. Theory, Ser. A 77(2): 344-348 (1997)
	1996
16		Ilia Krasikov: Degree conditions for vertex switching reconstruction. Discrete Mathematics 160(1-3): 273-278 (1996)
15		Ilia Krasikov, Simon Litsyn: On Integral Zeros of Krawtchouk Polynomials. J. Comb. Theory, Ser. A 74(1): 71-99 (1996)
	1995
14		Ilia Krasikov, Simon Litsyn: On spectra of BCH codes. IEEE Transactions on Information Theory 41(3): 786-788 (1995)
13		Ilia Krasikov, Simon Litsyn: On the accuracy of the binomial approximation to the distance distribution of codes. IEEE Transactions on Information Theory 41(5): 1472-1474 (1995)
	1994
12		Ilia Krasikov, J. Schönheim: On near subgroups. Discrete Mathematics 124(1-3): 133-136 (1994)
11		Yair Caro, Ilia Krasikov, Yehuda Roditty: On induced subgraphs of trees, with restricted degrees. Discrete Mathematics 125(1-3): 101-106 (1994)
10		Ilia Krasikov, Yehuda Roditty: More on Vertex-Switching Reconstruction. J. Comb. Theory, Ser. B 60(1): 40-55 (1994)
	1993
9		Noga Alon, Yair Caro, Ilia Krasikov: Bisection of trees and sequences. Discrete Mathematics 114(1-3): 3-7 (1993)
	1992
8		Ilia Krasikov, Yehuda Roditty: Switching reconstruction and diophantine equations. J. Comb. Theory, Ser. B 54(2): 189-195 (1992)
	1991
7		Ilia Krasikov: On a tree-cutting problem of P. Ash. Discrete Mathematics 93(1): 55-61 (1991)
6		Ilia Krasikov: Interchanging branches and similarity in a tree. Graphs and Combinatorics 7(2): 165-175 (1991)
	1990
5		Ilia Krasikov, Yehuda Roditty: Some applications of the nash-williams lemma to the edge-reconstruction conjecture. Graphs and Combinatorics 6(1): 37-39 (1990)
4		Ilia Krasikov: A note on the edge-reconstruction of K1, m-free graphs. J. Comb. Theory, Ser. B 49(2): 295-298 (1990)
	1989
3		Noga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty: Combinatorial reconstruction problems. J. Comb. Theory, Ser. B 47(2): 153-161 (1989)
	1987
2		Chris D. Godsil, Ilia Krasikov, Yehuda Roditty: Reconstructing graphs from their k-edge deleted subgraphs. J. Comb. Theory, Ser. B 43(3): 360-363 (1987)
	1985
1		Ilia Krasikov, J. Schönheim: The reconstruction of a tree from its number deck. Discrete Mathematics 53: 137-145 (1985)

Coauthor Index

1	Noga Alon	[3] [9]
2	Yair Caro	[3] [9] [11]
3	Chris D. Godsil (C. D. Godsil)	[2]
4	Arieh Lev	[26]
5	Simon Litsyn	[13] [14] [15] [18] [19] [20] [21] [22] [23] [25]
6	S. D. Noble	[28]
7	Yehuda Roditty	[2] [3] [5] [8] [10] [11] [17]
8	J. Schönheim	[1] [12]
9	Bhalchandra D. Thatte	[26]
10	Alexander Zarkh	[32] [33]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page