Michael Krivelevich
Michael Krivelevich
Professor of Mathematics, Tel Aviv University
Email verificata su post.tau.ac.il - Home page
Titolo
Citata da
Citata da
Anno
Finding a large hidden clique in a random graph
N Alon, M Krivelevich, B Sudakov
Random Structures & Algorithms 13 (3‐4), 457-466, 1998
3981998
Efficient testing of large graphs
N Alon, E Fischer, M Krivelevich, M Szegedy
Combinatorica 20 (4), 451-476, 2000
3862000
Pseudo-random graphs
M Krivelevich, B Sudakov
More sets, graphs and numbers, 199-262, 2006
3202006
The rainbow connection of a graph is (at most) reciprocal to its minimum degree
M Krivelevich, R Yuster
Journal of Graph Theory 63 (3), 185-191, 2010
2152010
Regular languages are testable with a constant number of queries
N Alon, M Krivelevich, I Newman, M Szegedy
SIAM Journal on Computing 30 (6), 1842-1862, 2001
1662001
The largest eigenvalue of sparse random graphs
M Krivelevich, B Sudakov
arXiv preprint math/0106066, 2001
1632001
On the concentration of eigenvalues of random symmetric matrices
N Alon, M Krivelevich, VH Vu
Israel Journal of Mathematics 131 (1), 259-267, 2002
1532002
Testing reed-muller codes
N Alon, T Kaufman, M Krivelevich, S Litsyn, D Ron
IEEE Transactions on Information Theory 51 (11), 4032-4039, 2005
1372005
Testing Low-Degree Polynomials over GF(2)
N Alon, T Kaufman, M Krivelevich, S Litsyn, D Ron
Approximation, Randomization, and Combinatorial Optimization.. Algorithms …, 2003
1212003
Coloring graphs with sparse neighborhoods
N Alon, M Krivelevich, B Sudakov
Journal of Combinatorial Theory, Series B 77 (1), 73-82, 1999
1151999
Random regular graphs of high degree
M Krivelevich, B Sudakov, VH Vu, NC Wormald
Random Structures & Algorithms 18 (4), 346-363, 2001
1092001
Testing k-colorability
N Alon, M Krivelevich
SIAM Journal on Discrete Mathematics 15 (2), 211-227, 2002
1072002
The concentration of the chromatic number of random graphs
N Alon, M Krivelevich
Combinatorica 17 (3), 303-313, 1997
1001997
Sparse pseudo‐random graphs are Hamiltonian
M Krivelevich, B Sudakov
Journal of Graph Theory 42 (1), 17-33, 2003
942003
Tight bounds for testing bipartiteness in general graphs
T Kaufman, M Krivelevich, D Ron
SIAM Journal on computing 33 (6), 1441-1483, 2004
932004
Turán numbers of bipartite graphs and related Ramsey-type questions
N Alon, M Krivelevich, B Sudakov
Combinatorics, Probability & Computing 12 (5+ 6), 477, 2003
922003
The phase transition in random graphs: A simple proof
M Krivelevich, B Sudakov
Random Structures & Algorithms 43 (2), 131-138, 2013
882013
Variations on cops and robbers
A Frieze, M Krivelevich, PS Loh
Journal of Graph Theory 69 (4), 383-402, 2012
842012
Upper bounds on the rate of LDPC codes
D Burshtein, M Krivelevich, S Litsyn, G Miller
IEEE Transactions on Information Theory 48 (9), 2437-2449, 2002
822002
Positional games
D Hefetz, M Krivelevich, M Stojaković, T Szabó
Birkhäuser, 2014
742014
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20