- Home
- Best Scientists - Mathematics
- David Gamarnik

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Engineering and Technology
D-index
32
Citations
3,335
104
World Ranking
4761
National Ranking
1745

Mathematics
D-index
36
Citations
4,351
146
World Ranking
1821
National Ranking
780

Computer Science
D-index
37
Citations
4,434
145
World Ranking
6916
National Ranking
3265

- Statistics
- Combinatorics
- Algorithm

David Gamarnik spends much of his time researching Combinatorics, Discrete mathematics, Queueing theory, Mathematical optimization and Random regular graph. David Gamarnik has researched Combinatorics in several fields, including Logarithm and Markov chain. His Discrete mathematics research incorporates themes from Degree, Algorithm and Weak convergence.

His study on Layered queueing network is often connected to Case volume as part of broader study in Queueing theory. The Mathematical optimization study which covers Upper and lower bounds that intersects with Regular graph, Job shop, Approximation algorithm, Asymptotically optimal algorithm and Scheduling. His Random regular graph study combines topics from a wide range of disciplines, such as Independent set and Random graph.

- Simple deterministic approximation algorithms for counting matchings (120 citations)
- Performance of Multiclass Markovian Queueing Networks Via Piecewise Linear Lyapunov Functions (87 citations)
- Validity of heavy traffic steady-state approximations in generalized Jackson networks (87 citations)

His main research concerns Combinatorics, Discrete mathematics, Random graph, Queueing theory and Algorithm. His Combinatorics research includes themes of Function and Bounded function. His studies deal with areas such as Upper and lower bounds, Large deviations theory, Markov chain and Exponential distribution as well as Discrete mathematics.

The concepts of his Random graph study are interwoven with issues in Cubic graph, Maximum cut, Dense graph and Weak convergence. His research integrates issues of Queue, Scheduling, Mathematical optimization and Applied mathematics in his study of Queueing theory. His work carried out in the field of Algorithm brings together such families of science as Class, Randomness, Message passing and Cluster analysis.

- Combinatorics (39.34%)
- Discrete mathematics (37.44%)
- Random graph (19.91%)

- Combinatorics (39.34%)
- Discrete mathematics (37.44%)
- Random graph (19.91%)

David Gamarnik mostly deals with Combinatorics, Discrete mathematics, Random graph, Bounded function and Algorithm. He works mostly in the field of Combinatorics, limiting it down to topics relating to Regularization and, in certain cases, White noise. His research in Discrete mathematics intersects with topics in Queueing theory, Uniqueness, Queue, Upper and lower bounds and Polynomial.

David Gamarnik has included themes like Adjacency matrix, Maximum cut, Independent set and Computation in his Random graph study. His research investigates the connection between Bounded function and topics such as Function that intersect with problems in Almost surely, Stationary point and Markov process. His Algorithm study combines topics in areas such as Class, 1-planar graph, Chordal graph and Message passing.

- Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems (24 citations)
- High Dimensional Regression with Binary Coefficients. Estimating Squared Error and a Phase Transtition. (22 citations)
- Suboptimality of local algorithms for a class of max-cut problems (19 citations)

- Statistics
- Algorithm
- Combinatorics

David Gamarnik focuses on Random graph, Algorithm, Combinatorics, Discrete mathematics and Constant. His study on Random graph also encompasses disciplines like

- Maximum cut which is related to area like Cubic graph, Expected value and Upper and lower bounds,
- Indifference graph, Independent set and Maximal independent set most often made with reference to Dense graph. His studies in Algorithm integrate themes in fields like Class and Message passing.

Within one scientific family, David Gamarnik focuses on topics pertaining to Bounded function under Message passing, and may sometimes address concerns connected to Queueing theory. David Gamarnik undertakes interdisciplinary study in the fields of Combinatorics and Second moment method through his research. His studies in Discrete mathematics integrate themes in fields like Fork–join queue, Queue management system and Large deviations theory.

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.

The diameter of a long-range percolation graph

Don Coppersmith;David Gamarnik;Maxim Sviridenko.

Random Structures and Algorithms **(2002)**

248 Citations

The diameter of a long-range percolation graph

Don Coppersmith;David Gamarnik;Maxim Sviridenko.

Random Structures and Algorithms **(2002)**

248 Citations

Validity of heavy traffic steady-state approximations in generalized Jackson networks

David Gamarnik;Assaf Zeevi.

Annals of Applied Probability **(2006)**

199 Citations

Validity of heavy traffic steady-state approximations in generalized Jackson networks

David Gamarnik;Assaf Zeevi.

Annals of Applied Probability **(2006)**

199 Citations

Simple deterministic approximation algorithms for counting matchings

Mohsen Bayati;David Gamarnik;Dimitriy Katz;Chandra Nair.

symposium on the theory of computing **(2007)**

144 Citations

Simple deterministic approximation algorithms for counting matchings

Mohsen Bayati;David Gamarnik;Dimitriy Katz;Chandra Nair.

symposium on the theory of computing **(2007)**

144 Citations

Combinatorial approach to the interpolation method and scaling limits in sparse random graphs

Mohsen Bayati;David Gamarnik;Prasad Tetali.

Annals of Probability **(2013)**

135 Citations

Combinatorial approach to the interpolation method and scaling limits in sparse random graphs

Mohsen Bayati;David Gamarnik;Prasad Tetali.

Annals of Probability **(2013)**

135 Citations

Asymptotically optimal algorithms for job shop scheduling and packet routing

Dimitris Bertsimas;David Gamarnik.

Journal of Algorithms **(1999)**

128 Citations

Asymptotically optimal algorithms for job shop scheduling and packet routing

Dimitris Bertsimas;David Gamarnik.

Journal of Algorithms **(1999)**

128 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

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:

MIT

Harvard University

IBM (United States)

Yahoo (United States)

Carnegie Mellon University

Stanford University

University of Maryland, College Park

IBM (United States)

McGill University

University of Zaragoza

Zhengzhou University

Los Alamos National Laboratory

Plymouth University

National Science Foundation

University of Oxford

University of Bologna

Saarland University

Chinese University of Hong Kong

Goethe University Frankfurt

University of Minnesota

University of Illinois at Urbana-Champaign

University of Pennsylvania

University of Barcelona

Princeton University

Something went wrong. Please try again later.