default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Gamarnik
Person information
- affiliation: MIT Sloan School of Management
SPARQL queries 
🛈 Please note that only 67% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j54]David Gamarnik, Aukosh Jagannath, Alexander S. Wein:
Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics. SIAM J. Comput. 53(1): 1-46 (2024)- [j53]David Gamarnik, Mihyun Kang, Pawel Pralat:
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process. SIAM J. Discret. Math. 38(3): 2312-2334 (2024) - [i38]David Gamarnik, Devin Smedira:
Integrating High-Dimensional Functions Deterministically. CoRR abs/2402.08232 (2024) - [i37]Ahmed El Alaoui, David Gamarnik:
Hardness of sampling solutions from the Symmetric Binary Perceptron. CoRR abs/2407.16627 (2024) - 2023
- [j52]David Gamarnik:
Correlation decay and the absence of zeros property of partition functions. Random Struct. Algorithms 62(1): 155-180 (2023) - [c40]David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu:
Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization. COLT 2023: 3231-3263 - [i36]David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu:
Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization. CoRR abs/2302.06485 (2023) - [i35]David Gamarnik, Mihyun Kang
, Pawel Pralat:
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process. CoRR abs/2303.13443 (2023) - [i34]David Gamarnik:
Barriers for the performance of graph neural networks (GNN) in discrete random structures. A comment on~\cite{schuetz2022combinatorial}, \cite{angelini2023modern}, \cite{schuetz2023reply}. CoRR abs/2306.02555 (2023) - [i33]David Gamarnik, Elchanan Mossel, Ilias Zadik:
Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique. CoRR abs/2311.04204 (2023) - [i32]David Gamarnik, Devin Smedira:
Computing the Volume of a Restricted Independent Set Polytope Deterministically. CoRR abs/2312.03906 (2023) - 2022
- [j51]David Gamarnik, John N. Tsitsiklis, Martin Zubeldia:
Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems. Math. Oper. Res. 47(3): 1862-1874 (2022) - [j50]David Gamarnik, Eren C. Kizildag, Ilias Zadik:
Self-Regularity of Non-Negative Output Weights for Overparameterized Two-Layer Neural Networks. IEEE Trans. Signal Process. 70: 1310-1319 (2022) - [c39]Joao Basso, David Gamarnik, Song Mei, Leo Zhou:
Performance and limitations of the QAOA at constant levels on large sparse hypergraphs and spin glass models. FOCS 2022: 335-343 - [c38]David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu:
Algorithms and Barriers in the Symmetric Binary Perceptron Model. FOCS 2022: 576-587 - [c37]David Gamarnik, Eren C. Kizildag:
The Random Number Partitioning Problem: Overlap Gap Property and Algorithmic Barriers. ISIT 2022: 778-783 - [i31]David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu:
Algorithms and Barriers in the Symmetric Binary Perceptron Model. CoRR abs/2203.15667 (2022) - [i30]Joao Basso, David Gamarnik, Song Mei, Leo Zhou:
Performance and limitations of the QAOA at constant levels on large sparse hypergraphs and spin glass models. CoRR abs/2204.10306 (2022) - [i29]David Gamarnik, Cristopher Moore, Lenka Zdeborová:
Disordered Systems Insights on Computational Hardness. CoRR abs/2210.08312 (2022) - 2021
- [j49]David Gamarnik, Eren C. Kizildag, Ilias Zadik:
Inference in High-Dimensional Linear Regression via Lattice Basis Reduction and Integer Relation Detection. IEEE Trans. Inf. Theory 67(12): 8109-8139 (2021) - [c36]David Gamarnik, Eren C. Kizildag, Ilias Zadik:
Self-Regularity of Output Weights for Overparameterized Two-Layer Neural Networks. ISIT 2021: 819-824 - [i28]David Gamarnik, Eren C. Kizildag, Ilias Zadik:
Self-Regularity of Non-Negative Output Weights for Overparameterized Two-Layer Neural Networks. CoRR abs/2103.01887 (2021) - [i27]David Gamarnik, Aukosh Jagannath, Alexander S. Wein:
Circuit Lower Bounds for the p-Spin Optimization Problem. CoRR abs/2109.01342 (2021) - [i26]David Gamarnik:
The Overlap Gap Property: a Geometric Barrier to Optimizing over Random Structures. CoRR abs/2109.14409 (2021) - 2020
- [j48]Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz, Prasad Tetali:
Finding cliques using few probes. Random Struct. Algorithms 56(1): 142-153 (2020) - [c35]David Gamarnik, Aukosh Jagannath, Alexander S. Wein:
Low-Degree Hardness of Random Optimization Problems. FOCS 2020: 131-140 - [c34]David Gamarnik, Eren C. Kizildag:
Computing the Partition Function of the Sherrington-Kirkpatrick Model is Hard on Average. ISIT 2020: 2837-2842 - [i25]Matt Emschwiller, David Gamarnik, Eren C. Kizildag, Ilias Zadik:
Neural Networks and Polynomial Regression. Demystifying the Overparametrization Phenomena. CoRR abs/2003.10523 (2020) - [i24]Edward Farhi, David Gamarnik, Sam Gutmann:
The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case. CoRR abs/2004.09002 (2020) - [i23]David Gamarnik, Aukosh Jagannath, Alexander S. Wein:
Low-Degree Hardness of Random Optimization Problems. CoRR abs/2004.12063 (2020) - [i22]David Gamarnik, John N. Tsitsiklis, Martin Zubeldia:
Stability, memory, and messaging tradeoffs in heterogeneous service systems. CoRR abs/2007.07219 (2020) - [i21]David Gamarnik:
Correlation Decay and the Absence of Zeros Property of Partition Functions. CoRR abs/2011.04915 (2020)
2010 – 2019
- 2019
- [c33]David Gamarnik, Eren C. Kizildag:
High-Dimensional Linear Regression and Phase Retrieval via PSLQ Integer Relation Algorithm. ISIT 2019: 1437-1441 - [c32]David Gamarnik, Julia Gaudio:
Sparse High-Dimensional Isotonic Regression. NeurIPS 2019: 12852-12862 - [i20]David Gamarnik, Ilias Zadik:
The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property. CoRR abs/1904.07174 (2019) - [i19]David Gamarnik, Aukosh Jagannath, Subhabrata Sen:
The Overlap Gap Property in Principal Submatrix Recovery. CoRR abs/1908.09959 (2019) - [i18]David Gamarnik, Eren C. Kizildag, Ilias Zadik:
Stationary Points of Shallow Neural Networks with Quadratic Activation Function. CoRR abs/1912.01599 (2019) - 2018
- [j47]Patrick Eschenfeldt, David Gamarnik:
Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics. Math. Oper. Res. 43(3): 867-886 (2018) - [j46]David Gamarnik, Quan Li:
On the max-cut of sparse random graphs. Random Struct. Algorithms 52(2): 219-262 (2018) - [j45]Guy Bresler, David Gamarnik, Devavrat Shah:
Learning Graphical Models From the Glauber Dynamics. IEEE Trans. Inf. Theory 64(6): 4072-4080 (2018) - [c31]Ilias Zadik, David Gamarnik:
High Dimensional Linear Regression using Lattice Basis Reduction. NeurIPS 2018: 1847-1857 - [i17]David Gamarnik:
Explicit construction of RIP matrices is Ramsey-hard. CoRR abs/1805.11238 (2018) - [i16]Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz, Prasad Tetali:
Finding cliques using few probes. CoRR abs/1809.06950 (2018) - [i15]David Gamarnik:
Computing the partition function of the Sherrington-Kirkpatrick model is hard on average. CoRR abs/1810.05907 (2018) - 2017
- [j44]Ross Anderson, Itai Ashlagi, David Gamarnik, Yash Kanoria:
Efficient Dynamic Barter Exchange. Oper. Res. 65(6): 1446-1459 (2017) - [j43]Christian Borgs, Jennifer T. Chayes, David Gamarnik:
Convergent sequences of sparse graphs: A large deviations approach. Random Struct. Algorithms 51(1): 52-89 (2017) - [j42]David Gamarnik, Madhu Sudan:
Performance of Sequential Local Algorithms for the Random NAE-K-SAT Problem. SIAM J. Comput. 46(2): 590-619 (2017) - [c30]David Gamarnik, Quan Li, Hongyi Zhang:
Matrix Completion from $O(n)$ Samples in Linear Time. COLT 2017: 940-947 - [c29]David Gamarnik, Ilias Zadik:
High Dimensional Regression with Binary Coefficients. Estimating Squared Error and a Phase Transtition. COLT 2017: 948-953 - [i14]David Gamarnik, Quan Li, Hongyi Zhang:
Matrix Completion from O(n) Samples in Linear Time. CoRR abs/1702.02267 (2017) - 2016
- [j41]Edward J. Anderson, David Gamarnik, Anton J. Kleywegt, Asuman E. Ozdaglar:
Preface to the Special Issue on Information and Decisions in Social and Economic Networks. Oper. Res. 64(3): 561-563 (2016) - [j40]David Gamarnik, Sidhant Misra:
A Note on Alternating Minimization Algorithm for the Matrix Completion Problem. IEEE Signal Process. Lett. 23(10): 1340-1343 (2016) - [c28]David Gamarnik, John N. Tsitsiklis, Martin Zubeldia:
Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems. SIGMETRICS 2016: 1-12 - [i13]David Gamarnik, Sidhant Misra:
A Note on Alternating Minimization Algorithm for the Matrix Completion Problem. CoRR abs/1602.02164 (2016) - [i12]Patrick Eschenfeldt, David Gamarnik:
A Message Passing Algorithm for the Problem of Path Packing in Graphs. CoRR abs/1603.06002 (2016) - 2015
- [j39]Ross Anderson, Itai Ashlagi, David Gamarnik, Michael Rees, Alvin E. Roth, Tayfun Sönmez, M. Utku Ünver:
Kidney Exchange and the Alliance for Paired Donation: Operations Research Changes the Way Kidneys Are Transplanted. Interfaces 45(1): 26-42 (2015) - [j38]David Gamarnik, Dmitriy Katz:
The stability of the deterministic Skorokhod problem is undecidable. Queueing Syst. Theory Appl. 79(3-4): 221-249 (2015) - [j37]David Gamarnik, Dmitriy Katz, Sidhant Misra:
Strong spatial mixing of list coloring of graphs. Random Struct. Algorithms 46(4): 599-613 (2015) - [c27]Ross Anderson, Itai Ashlagi, David Gamarnik, Yash Kanoria:
A dynamic model of barter exchange. SODA 2015: 1925-1933 - 2014
- [j36]David Gamarnik, David A. Goldberg, Theophane Weber:
Correlation Decay in Random Decision Networks. Math. Oper. Res. 39(2): 229-261 (2014) - [c26]Guy Bresler, David Gamarnik, Devavrat Shah:
Learning graphical models from the Glauber dynamics. Allerton 2014: 1148-1155 - [c25]David Gamarnik, Madhu Sudan:
Limits of local algorithms over sparse random graphs. ITCS 2014: 369-376 - [c24]Guy Bresler, David Gamarnik, Devavrat Shah:
Hardness of parameter estimation in graphical models. NIPS 2014: 1062-1070 - [c23]Guy Bresler, David Gamarnik, Devavrat Shah:
Structure learning of antiferromagnetic Ising models. NIPS 2014: 2852-2860 - [i11]David Gamarnik, Madhu Sudan:
Performance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem. CoRR abs/1402.0052 (2014) - [i10]Guy Bresler, David Gamarnik, Devavrat Shah:
Hardness of parameter estimation in graphical models. CoRR abs/1409.3836 (2014) - [i9]David Gamarnik, Mathieu Hemery, Samuel Hetterich:
Local Algorithms for Graphs. CoRR abs/1409.5214 (2014) - [i8]Guy Bresler, David Gamarnik, Devavrat Shah:
Learning graphical models from the Glauber dynamics. CoRR abs/1410.7659 (2014) - [i7]Guy Bresler, David Gamarnik, Devavrat Shah:
Structure learning of antiferromagnetic Ising models. CoRR abs/1412.1443 (2014) - 2013
- [i6]David Gamarnik, Madhu Sudan:
Limits of local algorithms over sparse random graphs. CoRR abs/1304.1831 (2013) - [i5]David Gamarnik, Madhu Sudan:
Limits of local algorithms over sparse random graphs. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j35]David Gamarnik, Devavrat Shah, Yehua Wei:
Belief Propagation for Min-Cost Network Flow: Convergence and Correctness. Oper. Res. 60(2): 410-428 (2012) - [j34]David Gamarnik, Dmitriy Katz:
Correlation decay and deterministic FPTAS for counting colorings of a graph. J. Discrete Algorithms 12: 29-47 (2012) - [j33]David Gamarnik, Alexander L. Stolyar:
Multiclass multiserver queueing system in the Halfin-Whitt heavy traffic regime: asymptotics of the stationary distribution. Queueing Syst. Theory Appl. 71(1-2): 25-51 (2012) - [i4]David Gamarnik, Dmitriy Katz, Sidhant Misra:
Strong spatial mixing for list coloring of graphs. CoRR abs/1207.1223 (2012) - 2011
- [j32]Dimitris Bertsimas, David Gamarnik, Alexander Anatoliy Rikun:
Performance Analysis of Queueing Networks via Robust Optimization. Oper. Res. 59(2): 455-466 (2011) - [j31]Abraham Flaxman, David Gamarnik, Gregory B. Sorkin:
First-passage percolation on a ladder graph, and the path cost in a VCG auction. Random Struct. Algorithms 38(3): 350-364 (2011) - [j30]Venkat Chandrasekaran, Misha Chertkov, David Gamarnik, Devavrat Shah, Jinwoo Shin:
Counting Independent Sets Using the Bethe Approximation. SIAM J. Discret. Math. 25(2): 1012-1034 (2011) - 2010
- [j29]David Gamarnik, David A. Goldberg:
Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections. Comb. Probab. Comput. 19(1): 61-85 (2010) - [j28]David Gamarnik, Dmitriy Katz:
A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix. J. Comput. Syst. Sci. 76(8): 879-883 (2010) - [j27]David Gamarnik, Sean P. Meyn:
On exponential ergodicity of multiclass queueing networks. Queueing Syst. Theory Appl. 65(2): 109-133 (2010) - [c22]David Gamarnik, David A. Goldberg, Theophane Weber:
PTAS for Maximum Weight Independent Set Problem with Random Weights in Bounded Degree Graphs. SODA 2010: 268-278 - [c21]David Gamarnik, Devavrat Shah, Yehua Wei:
Belief Propagation for Min-cost Network Flow: Convergence & Correctness. SODA 2010: 279-292 - [c20]Mohsen Bayati, David Gamarnik, Prasad Tetali:
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs. STOC 2010: 105-114 - [i3]David Gamarnik, Dmitriy Katz:
Stability of Skorokhod problem is undecidable. CoRR abs/1007.1694 (2010)
2000 – 2009
- 2009
- [c19]David Gamarnik, Dmitriy Katz:
Sequential cavity method for computing limits of the log-partition function for lattice models. SODA 2009: 596-605 - [i2]David Gamarnik, David A. Goldberg, Theophane Weber:
Correlation Decay in Random Decision Networks. CoRR abs/0912.0338 (2009) - 2008
- [j26]Antar Bandyopadhyay, David Gamarnik:
Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models. Random Struct. Algorithms 33(4): 452-479 (2008) - [i1]David Gamarnik, David A. Goldberg:
Randomized greedy algorithms for independent sets and matchings in regular graphs: Exact results and finite girth corrections. CoRR abs/0807.1277 (2008) - 2007
- [j25]David Gamarnik:
On the Undecidability of Computing Stationary Distributions and Large Deviation Rates for Constrained Random Walks. Math. Oper. Res. 32(2): 257-265 (2007) - [c18]David Gamarnik, Dmitriy Katz:
Correlation decay and deterministic FPTAS for counting list-colorings of a graph. SODA 2007: 1245-1254 - [c17]Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, Chandra Nair, Prasad Tetali:
Simple deterministic approximation algorithms for counting matchings. STOC 2007: 122-127 - 2006
- [j24]Nikhil Bansal, David Gamarnik:
Handling load with less stress. Queueing Syst. Theory Appl. 54(1): 45-54 (2006) - [j23]David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz:
Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method. Random Struct. Algorithms 28(1): 76-106 (2006) - [c16]Antar Bandyopadhyay, David Gamarnik:
Counting without sampling: new algorithms for enumeration problems using statistical physics. SODA 2006: 890-899 - [c15]Abraham Flaxman, David Gamarnik, Gregory B. Sorkin:
First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction. WINE 2006: 99-111 - 2005
- [j22]David Gamarnik, Maxim Sviridenko:
Hamiltonian completions of sparse random graphs. Discret. Appl. Math. 152(1-3): 139-158 (2005) - [j21]David Gamarnik, Moshe Lewenstein, Maxim Sviridenko:
An improved upper bound for the TSP in cubic 3-edge-connected graphs. Oper. Res. Lett. 33(5): 467-474 (2005) - [j20]Abraham D. Flaxman, David Gamarnik, Gregory B. Sorkin:
Embracing the giant component. Random Struct. Algorithms 27(3): 277-289 (2005) - [c14]David Gamarnik:
The expected value of random minimal length spanning tree of a complete graph. SODA 2005: 700-704 - 2004
- [j19]Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov:
On the Value of a Random Minimum Weight Steiner Tree. Comb. 24(2): 187-207 (2004) - [j18]David Gamarnik:
Stochastic Bandwidth Packing Process: Stability Conditions via Lyapunov Function Technique. Queueing Syst. Theory Appl. 48(3-4): 339-363 (2004) - [j17]Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin:
Random MAX SAT, random MAX CUT, and their phase transitions. Random Struct. Algorithms 24(4): 502-545 (2004) - [j16]David Gamarnik, Petar Momcilovic:
An asymptotic optimality of the transposition rule for linear lists. SIGMETRICS Perform. Evaluation Rev. 32(2): 33-34 (2004) - [c13]David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz:
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method. APPROX-RANDOM 2004: 357-368 - [c12]Abraham Flaxman, David Gamarnik, Gregory B. Sorkin:
Embracing the Giant Component. LATIN 2004: 69-79 - [c11]David Gamarnik:
Linear phase transition in random linear constraint satisfaction problems. SODA 2004: 111-120 - 2003
- [j15]Dimitris Bertsimas, David Gamarnik, Jay Sethuraman:
From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective. Oper. Res. 51(5): 798-813 (2003) - [j14]David Gamarnik:
Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks. SIAM J. Comput. 32(2): 371-385 (2003) - [j13]David Gamarnik, John J. Hasenbein:
Weak instability in stochastic and fluid queueing networks. SIGMETRICS Perform. Evaluation Rev. 31(2): 9-10 (2003) - [j12]David Gamarnik:
Extension of the PAC framework to finite and countable Markov chains. IEEE Trans. Inf. Theory 49(1): 338-345 (2003) - [c10]David Gamarnik:
Linear Phase Transition in Random Linear Constraint Satisfaction Problems. DRW 2003: 113-126 - [c9]Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin:
Random MAX SAT, random MAX CUT, and their phase transitions. SODA 2003: 364-373 - 2002
- [j11]David Gamarnik:
On Deciding Stability of Constrained Homogeneous Random Walks and Queueing Systems. Math. Oper. Res. 27(2): 272-293 (2002) - [j10]Don Coppersmith, David Gamarnik, Maxim Sviridenko:
The diameter of a long-range percolation graph. Random Struct. Algorithms 21(1): 1-13 (2002) - [j9]David Gamarnik:
Computing stationary probability distributions and large deviation rates for constrained random walks.: the undecidability results. SIGMETRICS Perform. Evaluation Rev. 30(3): 38-40 (2002) - [c8]Don Coppersmith, David Gamarnik, Maxim Sviridenko:
The diameter of a long range percolation graph. SODA 2002: 329-337 - 2001
- [j8]David Gamarnik:
On deciding stability of constrained random walks and queueing systems. SIGMETRICS Perform. Evaluation Rev. 28(4): 39-40 (2001) - [j7]David Gamarnik:
Stochastic online binpacking problem: exact conditions for bounded expected queue lengths under the best fit packing heuristic. SIGMETRICS Perform. Evaluation Rev. 29(3): 30-31 (2001) - 2000
- [j6]David Gamarnik:
Using fluid models to prove stability of adversarial queueing networks. IEEE Trans. Autom. Control. 45(4): 741-746 (2000) - [c7]Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis:
Performance of multiclass Markovian queueing networks. CDC 2000: 534-539 - [c6]David Gamarnik:
On deciding stability of scheduling policies in queueing systems. SODA 2000: 467-476
1990 – 1999
- 1999
- [j5]Dimitris Bertsimas, David Gamarnik:
Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing. J. Algorithms 33(2): 296-318 (1999) - [j4]Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis:
Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach. Mach. Learn. 35(3): 225-245 (1999) - [j3]Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis:
Performance analysis of multiclass queueing networks. SIGMETRICS Perform. Evaluation Rev. 27(3): 11-14 (1999) - [c5]David Gamarnik:
Extension of the PAC Framework to Finite and Countable Markov Chains. COLT 1999: 308-317 - [c4]David Gamarnik:
Stability of Adaptive and Non-Adaptive Packet Routing Policies in Adversarial Queueing Networks. STOC 1999: 206-214 - 1998
- [c3]David Gamarnik:
Efficient Learning of Monotone Concepts via Quadratic Optimization. COLT 1998: 134-143 - [c2]David Gamarnik:
Stability of Adversarial Queues via Fluid Models. FOCS 1998: 60-70 - 1997
- [j2]Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis:
Correction to "Stability Conditions for Multiclass Fluid Queueing Networks". IEEE Trans. Autom. Control. 42(1): 128 (1997) - [c1]Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis:
Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach. COLT 1997: 314-324 - 1996
- [j1]Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis:
Stability conditions for multiclass fluid queueing networks. IEEE Trans. Autom. Control. 41(11): 1618-1631 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
