The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael Krivelevich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael Krivelevich, Benny Sudakov
    Approximate Coloring of Uniform Hypergraphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:477-489 [Conf]
  2. Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy
    Efficient Testing of Large Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:656-666 [Conf]
  3. Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy
    Regular Languages Are Testable with a Constant Number of Queries. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:645-655 [Conf]
  4. Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern
    Scalable Secure Storage when Half the System Is Faulty. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:576-587 [Conf]
  5. Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali
    Two-coloring Random Hypergraphs. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:85-96 [Conf]
  6. Michael Krivelevich, Van H. Vu
    Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:13-24 [Conf]
  7. Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
    Testing Low-Degree Polynomials over GF(2(. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:188-199 [Conf]
  8. Tali Kaufman, Michael Krivelevich, Dana Ron
    Tight Bounds for Testing Bipartiteness in General Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:341-353 [Conf]
  9. Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron
    Testing triangle-freeness in general graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:279-288 [Conf]
  10. Noga Alon, Michael Krivelevich, Benny Sudakov
    Finding a Large Hidden Clique in a Random Graph. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:594-598 [Conf]
  11. Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich
    On the random 2-stage minimum spanning tree. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:919-926 [Conf]
  12. Michael Krivelevich, Zeev Nutov, Raphael Yuster
    Approximation algorithms for cycle packing problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:556-561 [Conf]
  13. Michael Krivelevich, Ram Nathaniel, Benny Sudakov
    Approximating coloring and maximum independent sets in 3-uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:327-328 [Conf]
  14. Michael Krivelevich, Dan Vilenchik
    Solving random satisfiable 3CNF formulas in expected polynomial time. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:454-463 [Conf]
  15. Andreas Goerdt, Michael Krivelevich
    Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:294-304 [Conf]
  16. Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik
    Why Almost All k -Colorable Graphs Are Easy. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:121-132 [Conf]
  17. Ron Aharoni, Ron Holzman, Michael Krivelevich
    On a Theorem of Lovász on Covers in tau-Partite Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:2, pp:149-174 [Journal]
  18. Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy
    Efficient Testing of Large Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:4, pp:451-476 [Journal]
  19. Noga Alon, Michael Krivelevich
    The Concentration of the Chromatic Number of Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:3, pp:303-313 [Journal]
  20. Noga Alon, Michael Krivelevich, Benny Sudakov
    List Coloring of Random and Pseudo-Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:4, pp:453-472 [Journal]
  21. Michael Krivelevich
    On the Minimal Number of Edges in Color-Critical Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:3, pp:401-426 [Journal]
  22. Michael Krivelevich, Benny Sudakov, Tibor Szabó
    Triangle Factors In Sparse Pseudo-Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:3, pp:403-426 [Journal]
  23. Michael Krivelevich
    An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  24. Michael Krivelevich
    Sparse Graphs Usually Have Exponentially Many Optimal Colorings. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  25. Noga Alon, Michael Krivelevich, Benny Sudakov
    Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:5-6, pp:477-494 [Journal]
  26. Michael Krivelevich
    The Choice Number Of Dense Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:1, pp:- [Journal]
  27. Michael Krivelevich
    Ks-Free Graphs Without Large Kr-Free Subgraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:349-354 [Journal]
  28. Michael Krivelevich
    Triangle Factors in Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:3, pp:337-347 [Journal]
  29. Michael Krivelevich, Benny Sudakov
    The Largest Eigenvalue Of Sparse Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:1, pp:- [Journal]
  30. Michael Krivelevich, Benny Sudakov, Van H. Vu
    A Sharp Threshold For Network Reliability. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:5, pp:- [Journal]
  31. Ron Aharoni, Ron Holzman, Michael Krivelevich, Roy Meshulam
    Fractional Planks. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:27, n:4, pp:585-602 [Journal]
  32. Alan M. Frieze, Michael Krivelevich
    Hamilton cycles in random subgraphs of pseudo-random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:137-150 [Journal]
  33. Michael Krivelevich, Asaf Nachmias
    Colouring powers of cycles from random lists. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:7, pp:961-968 [Journal]
  34. Michael Krivelevich, Benny Sudakov
    Preface. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:8, pp:1225-1226 [Journal]
  35. Dan Hefetz, Michael Krivelevich, Tibor Szabó
    Bart-Moe games, JumbleG and discrepancy. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:4, pp:1131-1143 [Journal]
  36. Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern
    Scalable Secure Storage When Half the System Is Faulty. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:174, n:2, pp:203-213 [Journal]
  37. Michael Krivelevich
    Deciding k-colorability in expected polynomial time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:1, pp:1-6 [Journal]
  38. Michael Krivelevich, Benny Sudakov
    Coloring Random Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:2, pp:71-74 [Journal]
  39. Noga Alon, Gregory Gutin, Michael Krivelevich
    Algorithms with large domination ratio. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:50, n:1, pp:118-131 [Journal]
  40. Michael Krivelevich
    Approximate Set Covering in Uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:25, n:1, pp:118-143 [Journal]
  41. Michael Krivelevich, Ram Nathaniel, Benny Sudakov
    Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:1, pp:99-113 [Journal]
  42. Michael Krivelevich, Benny Sudakov
    Approximate coloring of uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:49, n:1, pp:2-12 [Journal]
  43. Michael Krivelevich, Van H. Vu
    Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2002, v:6, n:2, pp:143-155 [Journal]
  44. Noga Alon, Béla Bollobás, Michael Krivelevich, Benny Sudakov
    Maximum cuts and judicious partitions in graphs without short cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:329-346 [Journal]
  45. Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
    Generalized hashing and parent-identifying codes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:104, n:1, pp:207-215 [Journal]
  46. Noga Alon, Michael Krivelevich, Benny Sudakov
    Coloring Graphs with Sparse Neighborhoods. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:77, n:1, pp:73-82 [Journal]
  47. Alan M. Frieze, Michael Krivelevich
    On packing Hamilton cycles in ?-regular graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:94, n:1, pp:159-172 [Journal]
  48. Michael Krivelevich
    On the Edge Distribution in Triangle-free Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:63, n:2, pp:245-260 [Journal]
  49. Michael Krivelevich, Van H. Vu
    Choosability in Random Hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:241-257 [Journal]
  50. Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali
    Two-coloring random hypergraphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:2, pp:249-259 [Journal]
  51. Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan Martin
    Adding random edges to dense graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:2, pp:105-117 [Journal]
  52. Noga Alon, Michael Krivelevich, Benny Sudakov
    Finding a large hidden clique in a random graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:457-466 [Journal]
  53. Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich
    On the random 2-stage minimum spanning tree. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:28, n:1, pp:24-36 [Journal]
  54. Ehud Friedgut, Michael Krivelevich
    Sharp thresholds for certain Ramsey properties of random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:17, n:1, pp:1-19 [Journal]
  55. Alan M. Frieze, Michael Krivelevich
    Almost universal graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:28, n:4, pp:499-510 [Journal]
  56. Alan M. Frieze, Michael Krivelevich, Ryan Martin
    The emergence of a giant component in random subgraphs of pseudo-random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:1, pp:42-50 [Journal]
  57. Michael Krivelevich
    Bounding Ramsey Numbers through Large Deviation Inequalities. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:7, n:2, pp:145-156 [Journal]
  58. Michael Krivelevich
    Perfect fractional matchings in random hypergraphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:3, pp:317-334 [Journal]
  59. Michael Krivelevich, Asaf Nachmias
    Coloring complete bipartite graphs from random lists. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:29, n:4, pp:436-449 [Journal]
  60. Michael Krivelevich, Benny Sudakov
    The chromatic numbers of random hypergraphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:12, n:4, pp:381-403 [Journal]
  61. Michael Krivelevich, Benny Sudakov, Prasad Tetali
    On smoothed analysis in dense graphs and formulas. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:29, n:2, pp:180-193 [Journal]
  62. Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald
    Random regular graphs of high degree. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:18, n:4, pp:346-363 [Journal]
  63. Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald
    On the probability of independent sets in random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:22, n:1, pp:1-14 [Journal]
  64. Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy
    Regular Languages are Testable with a Constant Number of Queries. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:6, pp:1842-1862 [Journal]
  65. Joel Friedman, Andreas Goerdt, Michael Krivelevich
    Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:408-430 [Journal]
  66. Tali Kaufman, Michael Krivelevich, Dana Ron
    Tight Bounds for Testing Bipartiteness in General Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:6, pp:1441-1483 [Journal]
  67. Noga Alon, Michael Krivelevich
    Testing k-colorability. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:2, pp:211-227 [Journal]
  68. Alan M. Frieze, Michael Krivelevich, Benny Sudakov
    The Strong Chromatic Index of Random Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:3, pp:719-727 [Journal]
  69. Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
    Testing Reed-Muller codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:4032-4039 [Journal]
  70. Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
    Bounds on distance distributions in codes of known size. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:250-258 [Journal]
  71. David Burshtein, Michael Krivelevich, Simon Litsyn, Gadi Miller
    Upper bounds on the rate of LDPC Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:9, pp:2437-2449 [Journal]
  72. Michael Krivelevich, Benny Sudakov, Van H. Vu
    Covering codes with improved density. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:7, pp:1812-1815 [Journal]
  73. Nurit Gazit, Michael Krivelevich
    On the asymptotic value of the choice number of complete multi-partite graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:2, pp:123-134 [Journal]
  74. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
    Parameterized Algorithms for Directed Maximum Leaf Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:352-362 [Conf]
  75. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
    Parameterized Algorithms for Directed Maximum Leaf Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  76. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
    Better Algorithms and Bounds for Directed Maximum Leaf Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  77. Michael Krivelevich
    A lower bound for irredundant Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:183, n:1-3, pp:185-192 [Journal]
  78. Michael Krivelevich
    Almost perfect matchings in random uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:259-263 [Journal]
  79. Michael Krivelevich
    On a conjecture of Tuza about packing and covering of triangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:281-286 [Journal]
  80. Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern
    Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213]. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:7, pp:1114-1116 [Journal]
  81. Dan Hefetz, Michael Krivelevich, Tibor Szabó
    Avoider-Enforcer games. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2007, v:114, n:5, pp:840-853 [Journal]

  82. Small Sample Spaces Cannot Fool Low Degree Polynomials. [Citation Graph (, )][DBLP]


  83. Hierarchy Theorems for Property Testing. [Citation Graph (, )][DBLP]


  84. Better Algorithms and Bounds for Directed Maximum Leaf Problems. [Citation Graph (, )][DBLP]


  85. Comparing the strength of query types in property testing: the case of testing k-colorability. [Citation Graph (, )][DBLP]


  86. On smoothed k-CNF formulas and the Walksat algorithm. [Citation Graph (, )][DBLP]


  87. Embedding nearly-spanning bounded degree trees. [Citation Graph (, )][DBLP]


  88. Discrepancy Games. [Citation Graph (, )][DBLP]


  89. Spanning directed trees with many leaves [Citation Graph (, )][DBLP]


  90. On the random satisfiable process [Citation Graph (, )][DBLP]


  91. A note on regular Ramsey graphs [Citation Graph (, )][DBLP]


  92. Hitting time results for Maker-Breaker games [Citation Graph (, )][DBLP]


  93. On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. [Citation Graph (, )][DBLP]


  94. Winning Fast in Sparse Graph Construction Games. [Citation Graph (, )][DBLP]


  95. On the Random Satisfiable Process. [Citation Graph (, )][DBLP]


  96. Random regular graphs of non-constant degree: Concentration of the chromatic number. [Citation Graph (, )][DBLP]


  97. Hierarchy Theorems for Property Testing. [Citation Graph (, )][DBLP]


  98. Vertex percolation on expander graphs. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002