dblp.uni-trier.dewww.uni-trier.de

Ilia Krasikov Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
30EEIlia Krasikov, Alexander Zarkh: On zeros of discrete orthogonal polynomials. Journal of Approximation Theory 156(2): 121-141 (2009)
2007
29EEIlia Krasikov: Inequalities for orthonormal Laguerre polynomials. Journal of Approximation Theory 144(1): 1-26 (2007)
28EEIlia Krasikov: An upper bound on Jacobi polynomials. Journal of Approximation Theory 149(2): 116-130 (2007)
2005
27EEIlia Krasikov: On the maximum value of Jacobi polynomials. Journal of Approximation Theory 136(1): 1-20 (2005)
2004
26EEIlia Krasikov, S. D. Noble: Finding next-to-shortest paths in a graph. Inf. Process. Lett. 92(3): 117-119 (2004)
2003
25EEIlia Krasikov: Bounds for zeros of the Laguerre polynomials. Journal of Approximation Theory 121(2): 287-291 (2003)
2002
24EEIlia Krasikov, Arieh Lev, Bhalchandra D. Thatte: Upper bounds on the automorphism group of a graph0. Discrete Mathematics 256(1-2): 489-493 (2002)
2001
23 Ilia Krasikov, Simon Litsyn: On the Distance Distributions of BCH Codes and Their Duals. Des. Codes Cryptography 23(2): 223-232 (2001)
22EEIlia Krasikov: Nonnegative Quadratic Forms and Bounds on Orthogonal Polynomials. Journal of Approximation Theory 111(1): 31-49 (2001)
2000
21 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
20 Ilia Krasikov, Simon Litsyn: On the Distance Distribution of Duals of BCH Codes. IEEE Transactions on Information Theory 45(1): 247-250 (1999)
1998
19 Ilia Krasikov, Simon Litsyn: Bounds on Spectra of Codes with Known Dual Distance. Des. Codes Cryptography 13(3): 285-297 (1998)
1997
18EEIlia Krasikov, Simon Litsyn: Linear Programming Bounds for Codes of Small Size. Eur. J. Comb. 18(6): 647-656 (1997)
17 Ilia Krasikov, Simon Litsyn: Estimates for the range of binomiality in codes' spectra. IEEE Transactions on Information Theory 43(3): 987-991 (1997)
16 Ilia Krasikov, Simon Litsyn: Linear programming bounds for doubly-even self-dual codes. IEEE Transactions on Information Theory 43(4): 1238-1244 (1997)
15EEIlia Krasikov, Yehuda Roditty: On a Reconstruction Problem for Sequences, . J. Comb. Theory, Ser. A 77(2): 344-348 (1997)
1996
14EEIlia Krasikov: Degree conditions for vertex switching reconstruction. Discrete Mathematics 160(1-3): 273-278 (1996)
13EEIlia Krasikov, Simon Litsyn: On Integral Zeros of Krawtchouk Polynomials. J. Comb. Theory, Ser. A 74(1): 71-99 (1996)
1995
12 Ilia Krasikov, Simon Litsyn: On spectra of BCH codes. IEEE Transactions on Information Theory 41(3): 786-788 (1995)
11 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
10EEIlia Krasikov, J. Schönheim: On near subgroups. Discrete Mathematics 124(1-3): 133-136 (1994)
9EEYair Caro, Ilia Krasikov, Yehuda Roditty: On induced subgraphs of trees, with restricted degrees. Discrete Mathematics 125(1-3): 101-106 (1994)
8EEIlia Krasikov, Yehuda Roditty: More on Vertex-Switching Reconstruction. J. Comb. Theory, Ser. B 60(1): 40-55 (1994)
1993
7EENoga Alon, Yair Caro, Ilia Krasikov: Bisection of trees and sequences. Discrete Mathematics 114(1-3): 3-7 (1993)
1992
6EEIlia Krasikov, Yehuda Roditty: Switching reconstruction and diophantine equations. J. Comb. Theory, Ser. B 54(2): 189-195 (1992)
1991
5EEIlia Krasikov: On a tree-cutting problem of P. Ash. Discrete Mathematics 93(1): 55-61 (1991)
1990
4EEIlia Krasikov: A note on the edge-reconstruction of K1, m-free graphs. J. Comb. Theory, Ser. B 49(2): 295-298 (1990)
1989
3EENoga Alon, Yair Caro, Ilia Krasikov, Yehuda Roditty: Combinatorial reconstruction problems. J. Comb. Theory, Ser. B 47(2): 153-161 (1989)
1987
2EEChris 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
1EEIlia Krasikov, J. Schönheim: The reconstruction of a tree from its number deck. Discrete Mathematics 53: 137-145 (1985)

Coauthor Index

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)