Michael Krivelevich

Citace

	Všechny	Od 2020
Citace	10373	3579
h-index	54	29
i10-index	196	110

840

420

210

630

2000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202532 79 108 136 132 222 206 266 308 304 340 408 460 506 518 459 514 570 456 557 545 643 668 754 839 122

Veřejný přístup

Zobrazit všechny

77 článků

3 články

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

Benjamin SudakovETH, ZurichE-mailová adresa ověřena na: math.ethz.ch
Noga AlonPrinceton University and Tel Aviv UniversityE-mailová adresa ověřena na: tau.ac.il
Dan HefetzAriel UniversityE-mailová adresa ověřena na: ariel.ac.il
Alan FriezeCarnegie Mellon UniversityE-mailová adresa ověřena na: random.math.cmu.edu
Tibor SzabóProfessor of Mathematics, Freie Universität BerlinE-mailová adresa ověřena na: math.fu-berlin.de
asaf ferberAssistant Professor, UCIE-mailová adresa ověřena na: uci.edu
Miloš StojakovićUniversity of Novi SadE-mailová adresa ověřena na: dmi.uns.ac.rs
Simon LitsynProfessor of Electrical Engineering, Tel Aviv UniversityE-mailová adresa ověřena na: eng.tau.ac.il
van vuprofessor, yaleE-mailová adresa ověřena na: yale.edu
Dan VilenchikSchool of Electrical and Computer Engineering, Ben-Gurion UniversityE-mailová adresa ověřena na: bgu.ac.il
Sonny Ben-ShimonGoogleE-mailová adresa ověřena na: cs.tau.ac.il
Sahar DiskinPhD Student, Tel Aviv UniversityE-mailová adresa ověřena na: mail.tau.ac.il
Joshua ErdeTU GrazE-mailová adresa ověřena na: math.tugraz.at
Peleg MichaeliUniversity of OxfordE-mailová adresa ověřena na: maths.ox.ac.uk
Eyal LubetzkyProfessor of Mathematics, Courant Institute of Mathematical Sciences, New York UniversityE-mailová adresa ověřena na: courant.nyu.edu
Nicholas WormaldMonash UniversityE-mailová adresa ověřena na: monash.edu
Amin Coja-OghlanTU DortmundE-mailová adresa ověřena na: tu-dortmund.de
Wojciech SamotijSchool of Mathematical Sciences, Tel Aviv UniversityE-mailová adresa ověřena na: tauex.tau.ac.il
Choongbum LeeMITE-mailová adresa ověřena na: mit.edu
Mario SzegedyProfessor of Computer Science, Rutgers UniversityE-mailová adresa ověřena na: cs.rutgers.edu

Sledovat

Michael Krivelevich

Professor of Mathematics, Tel Aviv University

E-mailová adresa ověřena na: post.tau.ac.il - Domovská stránka

Combinatorics


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
Finding a large hidden clique in a random graph N Alon, M Krivelevich, B Sudakov Random Structures & Algorithms 13 (3‐4), 457-466, 1998	516	1998
Efficient testing of large graphs N Alon, E Fischer, M Krivelevich, M Szegedy Combinatorica 20 (4), 451-476, 2000	473	2000
Pseudo-random graphs M Krivelevich, B Sudakov More sets, graphs and numbers: A Salute to Vera Sos and András Hajnal, 199-262, 2006	463	2006
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	300	2010
The largest eigenvalue of sparse random graphs M Krivelevich, B Sudakov Combinatorics, Probability and Computing 12 (1), 61-72, 2003	236	2003
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	196	2001
Turán numbers of bipartite graphs and related Ramsey-type questions N Alon, M Krivelevich, B Sudakov Combinatorics, Probability and Computing 12 (5-6), 477-494, 2003	171	2003
Testing reed-muller codes N Alon, T Kaufman, M Krivelevich, S Litsyn, D Ron IEEE Transactions on Information Theory 51 (11), 4032-4039, 2005	170	2005
Positional games D Hefetz, M Krivelevich, M Stojaković, T Szabó Birkhäuser, 2014	168	2014
On the concentration of eigenvalues of random symmetric matrices N Alon, M Krivelevich, VH Vu Israel Journal of Mathematics 131, 259-267, 2002	166	2002
Coloring graphs with sparse neighborhoods N Alon, M Krivelevich, B Sudakov Journal of Combinatorial Theory, Series B 77 (1), 73-82, 1999	158	1999
The concentration of the chromatic number of random graphs N Alon, M Krivelevich Combinatorica 17 (3), 303-313, 1997	141	1997
Testing Low-Degree Polynomials over GF(2) N Alon, T Kaufman, M Krivelevich, S Litsyn, D Ron International Workshop on Randomization and Approximation Techniques in …, 2003	140	2003
Random regular graphs of high degree M Krivelevich, B Sudakov, VH Vu, NC Wormald Random Structures & Algorithms 18 (4), 346-363, 2001	136	2001
The phase transition in random graphs: A simple proof M Krivelevich, B Sudakov Random Structures & Algorithms 43 (2), 131-138, 2013	135	2013
Sparse pseudo‐random graphs are Hamiltonian M Krivelevich, B Sudakov Journal of Graph Theory 42 (1), 17-33, 2003	130	2003
Testing k-colorability N Alon, M Krivelevich SIAM Journal on Discrete Mathematics 15 (2), 211-227, 2002	128	2002
Tight bounds for testing bipartiteness in general graphs T Kaufman, M Krivelevich, D Ron SIAM Journal on computing 33 (6), 1441-1483, 2004	125	2004
Variations on cops and robbers A Frieze, M Krivelevich, PS Loh Journal of Graph Theory 69 (4), 383-402, 2012	121	2012
The critical bias for the Hamiltonicity game is (1+ 𝑜 (1)) 𝑛/ln𝑛 M Krivelevich Journal of the American Mathematical Society 24 (1), 125-131, 2011	110	2011

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledovat

Citace

Spoluautoři