Alan Frieze

Cituota

	Visi	Nuo 2020
Šaltiniai	26010	6302
h-rodyklė	77	32
i10-rodyklė	308	155

1300

650

325

975

19871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202573 93 87 116 112 165 165 183 225 223 280 311 323 332 427 473 498 568 622 797 770 768 771 835 843 983 1013 1091 1114 1168 1220 1170 1236 1231 1095 1203 1279 1263 228

Viešas pasiekiamumas

Peržiūrėti viską

80 straipsnių

1 straipsnis

pasiekiami

nepasiekiami

Pagal finansavimo įpareigojimus

Bendraautoriai

Martin DyerUniversity of LeedsPatvirtintas el. paštas leeds.ac.uk
Colin CooperProfessor in Computer Science, King's College LondonPatvirtintas el. paštas kcl.ac.uk
Tom BohmanCarnegie Mellon UniversityPatvirtintas el. paštas math.cmu.edu
Andrei BroderDistinguished Scientist, GooglePatvirtintas el. paštas google.com
Wesley PegdenCarnegie Mellon UniversityPatvirtintas el. paštas math.cmu.edu
Michael KrivelevichProfessor of Mathematics, Tel Aviv UniversityPatvirtintas el. paštas post.tau.ac.il
Eli UpfalComputer Science Professor, Brown UniversityPatvirtintas el. paštas brown.edu
Andrzej DudekWestern Michigan UniversityPatvirtintas el. paštas wmich.edu
Abraham FlaxmanInstitute for Health Metrics and Evaluation, Department of Health Metrics Sciences, University ofPatvirtintas el. paštas alum.mit.edu
Michael MitzenmacherProfessor of Computer Science, Harvard UniversityPatvirtintas el. paštas eecs.harvard.edu
Bruce ReedMcGill UniversityPatvirtintas el. paštas cs.mcgill.ca
Santosh S. VempalaGeorgia TechPatvirtintas el. paštas gatech.edu
Juan C. VeraProfessor Tilburg UniversityPatvirtintas el. paštas uvt.nl
Michael MolloyUniversity of TorontoPatvirtintas el. paštas cs.toronto.edu
Gregory SorkinLondon School of Economics and Political SciencePatvirtintas el. paštas lse.ac.uk
Michał KarońskiPatvirtintas el. paštas amu.edu.pl
Ryan MartinProfessor of Mathematics, Iowa State UniversityPatvirtintas el. paštas iastate.edu
Pawel PralatToronto Metropolitan UniversityPatvirtintas el. paštas torontomu.ca
Michael AnastosInstitute of Science and Technology Austria (ISTA)Patvirtintas el. paštas ist.ac.at
Eric VigodaUniversity of California Santa BarbaraPatvirtintas el. paštas ucsb.edu

Stebėti

Alan Frieze

Carnegie Mellon University

Patvirtintas el. paštas random.math.cmu.edu - Pagrindinis puslapis

Combinatorics Probabilistic Combinatorics Random Graphs Discrete Mathematics Operations Research


Pavadinimas Rūšiuoti pagal šaltinius Rūšiuoti pagal metus Rūšiuoti pagal pavadinimą	Cituota Cituota	Metai
Min-wise independent permutations AZ Broder, M Charikar, AM Frieze, M Mitzenmacher Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998	1526	1998
A random polynomial-time algorithm for approximating the volume of convex bodies M Dyer, A Frieze, R Kannan Journal of the ACM (JACM) 38 (1), 1-17, 1991	970	1991
Fast Monte-Carlo algorithms for finding low-rank approximations A Frieze, R Kannan, S Vempala Journal of the ACM (JACM) 51 (6), 1025-1041, 2004	941	2004
Introduction to random graphs A Frieze, M Karoński Cambridge University Press, 2015	876	2015
Clustering large graphs via the singular value decomposition P Drineas, A Frieze, R Kannan, S Vempala, V Vinay Machine learning 56, 9-33, 2004	716	2004
Quick approximation to matrices and applications A Frieze, R Kannan Combinatorica 19 (2), 175-220, 1999	611	1999
Improved approximation algorithms for max k-cut and max bisection A Frieze, M Jerrum Algorithmica 18 (1), 67-81, 1997	556	1997
A general model of web graphs C Cooper, A Frieze Random Structures & Algorithms 22 (3), 311-335, 2003	532	2003
On the complexity of computing the volume of a polyhedron ME Dyer, AM Frieze SIAM Journal on Computing 17 (5), 967-974, 1988	455	1988
The shortest-path problem for graphs with random arc-lengths AM Frieze, GR Grimmett Discrete Applied Mathematics 10 (1), 57-77, 1985	360	1985
On the worst‐case performance of some algorithms for the asymmetric traveling salesman problem AM Frieze, G Galbiati, F Maffioli Networks 12 (1), 23-39, 1982	343	1982
On the value of a random minimum spanning tree problem AM Frieze Discrete Applied Mathematics 10 (1), 47-56, 1985	312	1985
Analysis of Two Simple Heuristics on a Random Instance of k-sat A Frieze, S Suen Journal of Algorithms 20 (2), 312-355, 1996	287	1996
A simple heuristic for the p-centre problem ME Dyer, AM Frieze Operations Research Letters 3 (6), 285-288, 1985	280	1985
Clustering in Large Graphs and Matrices. P Drineas, AM Frieze, R Kannan, SS Vempala, V Vinay SODA 99, 291-299, 1999	262	1999
The solution of some random NP-hard problems in polynomial expected time ME Dyer, AM Frieze Journal of Algorithms 10 (4), 451-489, 1989	259	1989
The regularity lemma and approximation schemes for dense problems A Frieze, R Kannan Proceedings of 37th conference on foundations of computer science, 12-20, 1996	250	1996
A polynomial-time algorithm for learning noisy linear threshold functions A Blum, A Frieze, R Kannan, S Vempala Algorithmica 22, 35-52, 1998	248	1998
Approximation algorithms for the m-dimensional 0-1 knapsack problem: worst-case and probabilistic analyses AM Frieze, MRB Clarke European Journal of Operational Research 15 (1), 100-109, 1984	240	1984
On the independence number of random graphs AM Frieze Discrete Mathematics 81 (2), 171-175, 1990	239	1990

Sistema negali atlikti operacijos. Bandykite vėliau dar kartą.

Straipsniai 1–20

Šaltinių per metus

Dubliuoti šaltiniai

Sujungti šaltiniai

Pridėti bendraautoriusBendraautoriai

Stebėti

Cituota

Bendraautoriai