BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Greece
1 × Iceland
3 × Canada
7 × USA
Collaborated with:
A.Z.Broder E.Upfal C.Cooper E.Shamir A.Gionis C.E.Tsourakakis T.Radzik P.Chebolu P.Melsted S.Vempala J.Vera A.Flaxman J.C.Vera M.E.Dyer R.Kannan B.Bollobás T.I.Fenner M.Charikar M.Mitzenmacher
Talks about:
graph (7) random (6) algorithm (4) find (3) approxim (2) expand (2) walk (2) time (2) path (2) cycl (2)

Person: Alan M. Frieze

DBLP DBLP: Frieze:Alan_M=

Contributed to:

KDD 20132013
ICALP (2) 20092009
ICALP (1) 20082008
STOC 20082008
STOC 20052005
STOC 20022002
STOC 19981998
STOC 19971997
ICALP 19921992
STOC 19921992
STOC 19911991
STOC 19891989
STOC 19851985

Wrote 13 papers:

KDD-2013-FriezeGT #algorithm #graph #mining #modelling #scalability
Algorithmic techniques for modeling and mining large graphs (AMAzING) (AMF, AG, CET), p. 1523.
ICALP-v2-2009-CooperFR #multi #random
Multiple Random Walks and Interacting Particle Systems (CC, AMF, TR), pp. 399–410.
ICALP-A-2008-CheboluFM #graph #random
Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time (PC, AMF, PM), pp. 161–172.
STOC-2008-FriezeVV #graph #random
Logconcave random graphs (AMF, SV, JV), pp. 779–788.
STOC-2005-FlaxmanFV #algorithm #approximate #on the #performance #problem
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem (AF, AMF, JCV), pp. 441–449.
STOC-2002-CooperF #crawling #graph #web
Crawling on web graphs (CC, AMF), pp. 419–427.
STOC-1998-BroderCFM #independence #permutation
Min-Wise Independent Permutations (AZB, MC, AMF, MM), pp. 327–336.
STOC-1997-BroderFU #approach #graph #random
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (AZB, AMF, EU), pp. 531–539.
ICALP-1992-BroderFSU
Near-perfect Token Distribution (AZB, AMF, ES, EU), pp. 308–317.
STOC-1992-BroderFU #graph
Existence and Construction of Edge Disjoint Paths on Expander Graphs (AZB, AMF, EU), pp. 140–149.
STOC-1991-BroderFS
Finding Hidden Hamiltonian Cycles (AZB, AMF, ES), pp. 182–189.
STOC-1989-DyerFK #algorithm #approximate #polynomial #random
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies (MED, AMF, RK), pp. 375–381.
STOC-1985-BollobasFF #algorithm #graph #random
An Algorithm for Finding Hamilton Cycles in a Random Graph (BB, TIF, AMF), pp. 430–439.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.