The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ilia Krasikov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.002secs, Finished in 0.304secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002