2013 - Fellow of the American Mathematical Society
2011 - SIAM Fellow For pioneering work on random graphs and probabilistic analysis of combinatorial algorithms.
1997 - Fellow of John Simon Guggenheim Memorial Foundation
Alan Frieze mainly focuses on Combinatorics, Discrete mathematics, Random graph, Random regular graph and Random walk. Alan Frieze interconnects Algorithm and Simple in the investigation of issues within Combinatorics. His work in Discrete mathematics is not limited to one particular discipline; it also encompasses Matrix.
His studies in Random graph integrate themes in fields like Indifference graph, Hopcroft–Karp algorithm, Graph product, Constant and struct. His Random regular graph research is multidisciplinary, incorporating perspectives in Expected value, Bound graph and Degree. His study on Random walk also encompasses disciplines like
Alan Frieze mainly investigates Combinatorics, Discrete mathematics, Random graph, Graph and Random regular graph. Vertex, Hamiltonian path, Binary logarithm, Vertex and Hypergraph are the core of his Combinatorics study. His study connects Random walk and Discrete mathematics.
In his research, Matching is intimately related to Bipartite graph, which falls under the overarching field of Random graph. The various areas that Alan Frieze examines in his Random regular graph study include Pancyclic graph and Graph power, Factor-critical graph, Regular graph. The subject of his Time complexity research is within the realm of Algorithm.
Combinatorics, Random graph, Graph, Vertex and Random walk are his primary areas of study. His studies deal with areas such as Discrete mathematics and Constant as well as Combinatorics. In general Random graph study, his work on Giant component often relates to the realm of High probability, thereby connecting several areas of interest.
His research in the fields of Bipartite graph overlaps with other disciplines such as Sigma and Omega. His Vertex study combines topics in areas such as Upper and lower bounds and Cubic graph. His work focuses on many connections between Random walk and other disciplines, such as Hash function, that overlap with his field of interest in Bin.
His main research concerns Combinatorics, Random graph, Hamiltonian path, Graph and Vertex. His work carried out in the field of Combinatorics brings together such families of science as Discrete mathematics and Constant. His research integrates issues of Voter model, Bounded function and Asynchronous communication in his study of Discrete mathematics.
Alan Frieze focuses mostly in the field of Random graph, narrowing it down to matters related to Longest path problem and, in some cases, Polynomial and Polynomial. His Hamiltonian path study incorporates themes from Hypergraph, Embedding, Set and Random regular graph. His work on Giant component as part of general Graph study is frequently connected to Omega, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Min-Wise Independent Permutations
Andrei Z Broder;Moses Charikar;Alan M Frieze;Michael Mitzenmacher.
symposium on the theory of computing (2000)
A random polynomial-time algorithm for approximating the volume of convex bodies
Martin Dyer;Alan Frieze;Ravi Kannan.
Journal of the ACM (1991)
Fast monte-carlo algorithms for finding low-rank approximations
Alan Frieze;Ravi Kannan;Santosh Vempala.
Journal of the ACM (2004)
Clustering Large Graphs via the Singular Value Decomposition
P. Drineas;A. Frieze;R. Kannan;S. Vempala.
Machine Learning (2004)
Quick Approximation to Matrices and Applications
Alan M. Frieze;Ravi Kannan.
A general model of web graphs
Colin Cooper;Alan Frieze.
Random Structures and Algorithms (2003)
Improved approximation algorithms for MAX k-CUT and MAX BISECTION
Alan M. Frieze;Mark Jerrum.
Min-wise independent permutations (extended abstract)
Andrei Z. Broder;Moses Charikar;Alan M. Frieze;Michael Mitzenmacher.
symposium on the theory of computing (1998)
On the complexity of computing the volume of a polyhedron
M. E. Dyer;A. M. Frieze.
SIAM Journal on Computing (1988)
Introduction to Random Graphs
Alan Frieze;Michał Karoński.
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: