Search the dblp DataBase
David Gamarnik :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
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 ] 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 ] David Gamarnik Efficient Learning of Monotone Concepts via Quadratic Optimization. [Citation Graph (0, 0)][DBLP ] COLT, 1998, pp:134-143 [Conf ] David Gamarnik Extension of the PAC Framework to Finite and Countable Markov Chains. [Citation Graph (0, 0)][DBLP ] COLT, 1999, pp:308-317 [Conf ] David Gamarnik Linear Phase Transition in Random Linear Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] DRW, 2003, pp:113-126 [Conf ] David Gamarnik Stability of Adversarial Queues via Fluid Models. [Citation Graph (0, 0)][DBLP ] FOCS, 1998, pp:60-70 [Conf ] Abraham Flaxman , David Gamarnik , Gregory B. Sorkin Embracing the Giant Component. [Citation Graph (0, 0)][DBLP ] LATIN, 2004, pp:69-79 [Conf ] 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 ] 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 ] 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 ] David Gamarnik On deciding stability of scheduling policies in queueing systems. [Citation Graph (0, 0)][DBLP ] SODA, 2000, pp:467-476 [Conf ] David Gamarnik Linear phase transition in random linear constraint satisfaction problems. [Citation Graph (0, 0)][DBLP ] SODA, 2004, pp:111-120 [Conf ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Sequential cavity method for computing limits of the log-partition function for lattice models. [Citation Graph (, )][DBLP ] Belief Propagation for Min-cost Network Flow: Convergence & Correctness. [Citation Graph (, )][DBLP ] PTAS for Maximum Weight Independent Set Problem with Random Weights in Bounded Degree Graphs. [Citation Graph (, )][DBLP ] Combinatorial approach to the interpolation method and scaling limits in sparse random graphs. [Citation Graph (, )][DBLP ] Randomized greedy algorithms for independent sets and matchings in regular graphs: Exact results and finite girth corrections [Citation Graph (, )][DBLP ] Correlation Decay in Random Decision Networks [Citation Graph (, )][DBLP ] Belief Propagation for Min-cost Network Flow: Convergence and Correctness [Citation Graph (, )][DBLP ] Stability of Skorokhod problem is undecidable [Citation Graph (, )][DBLP ] Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.304secs