Search the dblp DataBase

Publications of Author

1. Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Dimitri P. Bertsekas, Hussein T. Mouftah
   Reservation-Based Session Routing for Broadband Communication Networks with Strict QoS Requirements. [Citation Graph (0, 0)][DBLP]
   ICOIN, 2001, pp:593-0 [Conf]
   
2. Emmanouel A. Varvarigos, Dimitri P. Bertsekas
   Partial Multinode Broadcast Algorithms for D-Dimensional Meshes. [Citation Graph (0, 0)][DBLP]
   ICPP (3), 1992, pp:51-54 [Conf]
   
3. Dimitri P. Bertsekas, John N. Tsitsiklis
   Convergence rate and termination of asynchronous iterative algorithms. [Citation Graph (0, 0)][DBLP]
   ICS, 1989, pp:461-470 [Conf]
   
4. Paul Tseng, Dimitri P. Bertsekas
   A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems. [Citation Graph (0, 0)][DBLP]
   IPCO, 1996, pp:85-93 [Conf]
   
5. Satinder P. Singh, Dimitri P. Bertsekas
   Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems. [Citation Graph (0, 0)][DBLP]
   NIPS, 1996, pp:974-980 [Conf]
   
6. Dimitri P. Bertsekas, David A. Castañon
   Rollout Algorithms for Stochastic Scheduling Problems. [Citation Graph (0, 0)][DBLP]
   J. Heuristics, 1999, v:5, n:1, pp:89-108 [Journal]
   
7. Dimitri P. Bertsekas, John N. Tsitsiklis, Cynara Wu
   Rollout Algorithms for Combinatorial Optimization. [Citation Graph (0, 0)][DBLP]
   J. Heuristics, 1997, v:3, n:3, pp:245-262 [Journal]
   
8. Dimitri P. Bertsekas, C. Özveren, George D. Stamoulis, Paul Tseng, John N. Tsitsiklis
   Optimal Communication Algorithms for Hypercubes. [Citation Graph (0, 0)][DBLP]
   J. Parallel Distrib. Comput., 1991, v:11, n:4, pp:263-275 [Journal]
   
9. Emmanouel A. Varvarigos, Dimitri P. Bertsekas
   Partial Multinode Broadcast and Partial Exchange Algorithms for d-Dimensional Meshes. [Citation Graph (0, 0)][DBLP]
   J. Parallel Distrib. Comput., 1994, v:23, n:2, pp:177-189 [Journal]
   
10. Jonathan Eckstein, Dimitri P. Bertsekas
    On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:55, n:, pp:293-318 [Journal]
    
11. Paul Tseng, Dimitri P. Bertsekas
    Relaxation Methods for Monotropic Programs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:46, n:, pp:127-151 [Journal]
    
12. Paul Tseng, Dimitri P. Bertsekas
    On the convergence of the exponential multiplier method for convex programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:1-19 [Journal]
    
13. Dimitri P. Bertsekas, David A. Castañon
    Parallel synchronous and asynchronous implementations of the auction algorithm. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1991, v:17, n:6-7, pp:707-732 [Journal]
    
14. Lazaros Polymenakos, Dimitri P. Bertsekas
    Parallel Shortest Path Auction Algorithms. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1994, v:20, n:9, pp:1221-1247 [Journal]
    
15. S. A. Savari, Dimitri P. Bertsekas
    Finite Termination of Asynchronous Iterative Algorithms. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1996, v:22, n:1, pp:39-56 [Journal]
    
16. Emmanouel A. Varvarigos, Dimitri P. Bertsekas
    Communication algorithms for isotropic tasks in hypercubes and wraparound meshes. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1992, v:18, n:11, pp:1233-1257 [Journal]
    
17. Emmanouel A. Varvarigos, Dimitri P. Bertsekas
    Transposition of Banded Matrices in Hypercubes: A Nearly Isotropic Task. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1995, v:21, n:2, pp:243-264 [Journal]
    
18. Emmanouel A. Varvarigos, Dimitri P. Bertsekas
    A Conflict Sense Routing Protocol and Its Performance for Hypercubes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:6, pp:693-703 [Journal]
    
19. Eli Gafni, Dimitri P. Bertsekas
    Asymptotic optimality of shortest path routing algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:1, pp:83-90 [Journal]
    
20. Asuman E. Ozdaglar, Dimitri P. Bertsekas
    Routing and wavelength assignment in optical networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2003, v:11, n:2, pp:259-272 [Journal]
    
21. Emmanouel A. Varvarigos, Dimitri P. Bertsekas
    Performance of hypercube routing schemes with or without buffering. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1994, v:2, n:3, pp:299-311 [Journal]
    
22. Emmanouel A. Varvarigos, Dimitri P. Bertsekas
    Multinode Broadcast in Hypercubes and Rings with Randomly Distributed Length of Packets. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1993, v:4, n:2, pp:144-154 [Journal]
    
23. Emmanouel A. Varvarigos, Dimitri P. Bertsekas
    Dynamic Broadcasting in Parallel Computing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1995, v:6, n:2, pp:120-131 [Journal]
    
24. Dimitri P. Bertsekas, M. L. Homer, D. A. Logan, Stephen D. Patek, N. R. Sandell
    Missile defense and interceptor allocation by neuro-dynamic programming. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part A, 2000, v:30, n:1, pp:42-51 [Journal]
    
25. Huizhen Yu, Dimitri P. Bertsekas
    Discretized Approximations for POMDP with Average Cost. [Citation Graph (0, 0)][DBLP]
    UAI, 2004, pp:519- [Conf]
    
26. Dimitri P. Bertsekas, Paul Tseng
    Set Intersection Theorems and Existence of Optimal Solutions. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:2, pp:287-314 [Journal]
    
27. 
    Neuro-Dynamic Programming: An Overview and Recent Results. [Citation Graph (, )][DBLP]
    
    
28. 
    New Error Bounds for Approximations from Projected Linear Equations. [Citation Graph (, )][DBLP]