The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David Gamarnik: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
    Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:357-368 [Conf]
  2. Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis
    Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach. [Citation Graph (0, 0)][DBLP]
    COLT, 1997, pp:314-324 [Conf]
  3. David Gamarnik
    Efficient Learning of Monotone Concepts via Quadratic Optimization. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:134-143 [Conf]
  4. David Gamarnik
    Extension of the PAC Framework to Finite and Countable Markov Chains. [Citation Graph (0, 0)][DBLP]
    COLT, 1999, pp:308-317 [Conf]
  5. David Gamarnik
    Linear Phase Transition in Random Linear Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    DRW, 2003, pp:113-126 [Conf]
  6. David Gamarnik
    Stability of Adversarial Queues via Fluid Models. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:60-70 [Conf]
  7. Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
    Embracing the Giant Component. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:69-79 [Conf]
  8. Antar Bandyopadhyay, David Gamarnik
    Counting without sampling: new algorithms for enumeration problems using statistical physics. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:890-899 [Conf]
  9. Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin
    Random MAX SAT, random MAX CUT, and their phase transitions. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:364-373 [Conf]
  10. Don Coppersmith, David Gamarnik, Maxim Sviridenko
    The diameter of a long range percolation graph. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:329-337 [Conf]
  11. David Gamarnik
    On deciding stability of scheduling policies in queueing systems. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:467-476 [Conf]
  12. David Gamarnik
    Linear phase transition in random linear constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:111-120 [Conf]
  13. David Gamarnik
    The expected value of random minimal length spanning tree of a complete graph. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:700-704 [Conf]
  14. David Gamarnik
    Stability of Adaptive and Non-Adaptive Packet Routing Policies in Adversarial Queueing Networks. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:206-214 [Conf]
  15. Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
    First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:99-111 [Conf]
  16. Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov
    On the Value of a Random Minimum Weight Steiner Tree. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:2, pp:187-207 [Journal]
  17. David Gamarnik, Maxim Sviridenko
    Hamiltonian completions of sparse random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:139-158 [Journal]
  18. Dimitris Bertsimas, David Gamarnik
    Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:33, n:2, pp:296-318 [Journal]
  19. Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis
    Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1999, v:35, n:3, pp:225-245 [Journal]
  20. David Gamarnik
    On Deciding Stability of Constrained Homogeneous Random Walks and Queueing Systems. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2002, v:27, n:2, pp:272-293 [Journal]
  21. David Gamarnik, Moshe Lewenstein, Maxim Sviridenko
    An improved upper bound for the TSP in cubic 3-edge-connected graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:5, pp:467-474 [Journal]
  22. David Gamarnik
    Stochastic Bandwidth Packing Process: Stability Conditions via Lyapunov Function Technique. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2004, v:48, n:3-4, pp:339-363 [Journal]
  23. Nikhil Bansal, David Gamarnik
    Handling load with less stress. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2006, v:54, n:1, pp:45-54 [Journal]
  24. Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin
    Random MAX SAT, random MAX CUT, and their phase transitions. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:4, pp:502-545 [Journal]
  25. Don Coppersmith, David Gamarnik, Maxim Sviridenko
    The diameter of a long-range percolation graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:21, n:1, pp:1-13 [Journal]
  26. Abraham D. Flaxman, David Gamarnik, Gregory B. Sorkin
    Embracing the giant component. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:27, n:3, pp:277-289 [Journal]
  27. David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
    Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:28, n:1, pp:76-106 [Journal]
  28. David Gamarnik
    Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:2, pp:371-385 [Journal]
  29. Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis
    Performance analysis of multiclass queueing networks. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 1999, v:27, n:3, pp:11-14 [Journal]
  30. David Gamarnik
    Stochastic online binpacking problem: exact conditions for bounded expected queue lengths under the best fit packing heuristic. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2001, v:29, n:3, pp:30-31 [Journal]
  31. David Gamarnik
    On deciding stability of constrained random walks and queueing systems. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2001, v:28, n:4, pp:39-40 [Journal]
  32. David Gamarnik
    Computing stationary probability distributions and large deviation rates for constrained random walks.: the undecidability results. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2002, v:30, n:3, pp:38-40 [Journal]
  33. David Gamarnik, John J. Hasenbein
    Weak instability in stochastic and fluid queueing networks. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2003, v:31, n:2, pp:9-10 [Journal]
  34. David Gamarnik, Petar Momcilovic
    An asymptotic optimality of the transposition rule for linear lists. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2004, v:32, n:2, pp:33-34 [Journal]
  35. David Gamarnik
    Extension of the PAC framework to finite and countable Markov chains. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:1, pp:338-345 [Journal]
  36. David Gamarnik, Dmitriy Katz
    Correlation decay and deterministic FPTAS for counting list-colorings of a graph. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1245-1254 [Conf]
  37. Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, Chandra Nair, Prasad Tetali
    Simple deterministic approximation algorithms for counting matchings. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:122-127 [Conf]

  38. Sequential cavity method for computing limits of the log-partition function for lattice models. [Citation Graph (, )][DBLP]


  39. Belief Propagation for Min-cost Network Flow: Convergence & Correctness. [Citation Graph (, )][DBLP]


  40. PTAS for Maximum Weight Independent Set Problem with Random Weights in Bounded Degree Graphs. [Citation Graph (, )][DBLP]


  41. Combinatorial approach to the interpolation method and scaling limits in sparse random graphs. [Citation Graph (, )][DBLP]


  42. Randomized greedy algorithms for independent sets and matchings in regular graphs: Exact results and finite girth corrections [Citation Graph (, )][DBLP]


  43. Correlation Decay in Random Decision Networks [Citation Graph (, )][DBLP]


  44. Belief Propagation for Min-cost Network Flow: Convergence and Correctness [Citation Graph (, )][DBLP]


  45. Stability of Skorokhod problem is undecidable [Citation Graph (, )][DBLP]


  46. Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections. [Citation Graph (, )][DBLP]


Search in 0.022secs, Finished in 0.023secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002