Search all the public and authenticated articles in CiteULike.
Enter a search phrase. You can also specify

a CiteULike article id (123456),

a DOI (doi:10.1234/12345678)

or a PubMed Id (pmid:12345678).

Click Help for advanced usage.

abie's Krivelevich:M [2 articles] Export

Recent papers posted to abie's library by the author Krivelevich:M. You can also see everyone's Krivelevich:M.

Note: You may cite this page as: http://www.citeulike.org/user/abie/author/Krivelevich:M

CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.

bibtex-import	20
random	10
graph	5
algorithm	5
graphs	5
diameter	4
analysis	4
preferential	3
randomly	3
streaming	3
geometric	3
attachment	3
ad-hoc	2
dust	2
stochastic	2
case	2
spectral	2
coloring	2
csp	2
percolation	2
optimization	2
threshold	2
average	2
digraphs	2
power	2
degree	2
satisfiability	2
scale	2
law	2
log	2
perturbed	2
free	2
smoothed	2
communication	2
space	2
online	2
structures	1
critical	1
maximum	1
process	1
path	1
substrings	1
network	1
adversarial	1
sum	1
facility	1
algorithms	1
spanning	1
vcg	1
first-passage	1
string	1
smart	1
np-hard	1
location	1
auction	1
gradient	1
barabasi	1
albert	1
programming	1
tree	1
bound	1
instances	1
deletion	1
k-sat	1
descent	1
component	1
networks	1
factors	1
achlioptas	1
subsequence	1
minimum	1
approximation	1
pertubed	1
stage	1
and	1
major-breakthrough	1
sensor	1
semi-streaming	1
subset	1
simultaneous	1
two	1
sequences	1
3	1
substring	1
eigenvalue	1
distribution	1
distinct	1
sat	1
model	1
exploit	1
convex	1
giant	1
drawing	1
lower	1
explore	1
perturbation	1
decompositions	1

	On the random 2-stage minimum spanning tree [My Copy] Random Structures and Algorithms, Vol. 28, No. 1. (2006), pp. 24-36. by Abraham D. Flaxman, Alan Frieze, Michael Krivelevich posted to minimum programming random spanning stage stochastic tree two by abie on 2007-05-17 15:30:11 as
	Finding a large hidden clique in a random graph [My Copy] Random Structures Algorithms In Proceedings of the Eighth International Conference ``Random Structures and Algorithms'' (Poznan, 1997), Vol. 13, No. 3-4. (1998), pp. 457-466. by Noga Alon, Michael Krivelevich, Benny Sudakov posted to bibtex-import by abie on 2007-05-09 22:48:07 as along with 1 person Jingbo

abie's Krivelevich:M [2 articles] Export

abie's tags