dblp.uni-trier.dewww.uni-trier.de

John N. Tsitsiklis Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
79EEJulien M. Hendrickx, Alexander Olshevsky, John N. Tsitsiklis: Distributed anonymous function computation in information fusion and multiagent systems CoRR abs/0907.2949: (2009)
78EERamesh Johari, John N. Tsitsiklis: Efficiency of Scalar-Parameterized Mechanisms. Operations Research 57(4): 823-839 (2009)
2008
77EEAngelia Nedic, Alexander Olshevsky, Asuman E. Ozdaglar, John N. Tsitsiklis: Distributed subgradient methods and quantization effects. CDC 2008: 4177-4184
76EEAngelia Nedic, Alexander Olshevsky, Asuman E. Ozdaglar, John N. Tsitsiklis: On distributed averaging algorithms and quantization effects. CDC 2008: 4825-4830
75EEAdam J. Mersereau, Paat Rusmevichientong, John N. Tsitsiklis: A structured multiarmed bandit problem and the greedy policy. CDC 2008: 4945-4950
74EEWee-Peng Tay, John N. Tsitsiklis, Moe Z. Win: Data Fusion Trees for Detection: Does Architecture Matter? CoRR abs/0803.2337: (2008)
73EEVincent D. Blondel, Julien M. Hendrickx, John N. Tsitsiklis: On Krause's consensus formation model with state-dependent connectivity CoRR abs/0807.2028: (2008)
72EEPaat Rusmevichientong, John N. Tsitsiklis: Linearly Parameterized Bandits CoRR abs/0812.3465: (2008)
71EEWee-Peng Tay, John N. Tsitsiklis, Moe Z. Win: On the Subexponential Decay of Detection Error Probabilities in Long Tandems. IEEE Transactions on Information Theory 54(10): 4767-4771 (2008)
70EEWee-Peng Tay, John N. Tsitsiklis, Moe Z. Win: Data Fusion Trees for Detection: Does Architecture Matter? IEEE Transactions on Information Theory 54(9): 4155-4168 (2008)
69EEWee-Peng Tay, John N. Tsitsiklis, Moe Z. Win: On the Impact of Node Failures and Unreliable Communications in Dense Sensor Networks. IEEE Transactions on Signal Processing 56(6): 2535-2546 (2008)
68EEAlp Muharremoglu, John N. Tsitsiklis: A Single-Unit Decomposition Approach to Multiechelon Inventory Systems. Operations Research 56(5): 1089-1103 (2008)
67EEThomas Bortfeld, Timothy C. Y. Chan, Alexei Trofimov, John N. Tsitsiklis: Robust Management of Motion Uncertainty in Intensity-Modulated Radiation Therapy. Operations Research 56(6): 1461-1473 (2008)
2007
66EEWee-Peng Tay, John N. Tsitsiklis, Moe Z. Win: Bayesian Detection in Bounded Height Tree Networks. DCC 2007: 243-252
65EEWee-Peng Tay, John N. Tsitsiklis, Moe Z. Win: Asymptotic Performance of a Censoring Sensor Network. IEEE Transactions on Information Theory 53(11): 4191-4209 (2007)
64EEAnand Ganti, Eytan Modiano, John N. Tsitsiklis: Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity. IEEE Transactions on Information Theory 53(3): 998-1008 (2007)
63EEJay Sethuraman, John N. Tsitsiklis: Stochastic Search in a Forest Revisited. Math. Oper. Res. 32(3): 589-593 (2007)
62EEJohn N. Tsitsiklis: NP-Hardness of checking the unichain condition in average cost MDPs. Oper. Res. Lett. 35(3): 319-323 (2007)
2006
61EEShie Mannor, John N. Tsitsiklis: Online Learning with Constraints. COLT 2006: 529-543
60EERamesh Johari, John N. Tsitsiklis: A scalable network resource allocation mechanism with bounded efficiency loss. IEEE Journal on Selected Areas in Communications 24(5): 992-999 (2006)
59EEAlvin Fu, Eytan Modiano, John N. Tsitsiklis: Optimal transmission scheduling over a fading channel with energy and deadline constraints. IEEE Transactions on Wireless Communications 5(3): 630-641 (2006)
2005
58EERamesh Johari, Shie Mannor, John N. Tsitsiklis: Efficiency Loss in a Network Resource Allocation Game: The Case of Elastic Supply CoRR abs/cs/0506054: (2005)
57EEShie Mannor, John N. Tsitsiklis: On the Empirical State-Action Frequencies in Markov Decision Processes Under General Policies. Math. Oper. Res. 30(3): 545-561 (2005)
2004
56EEShie Mannor, Duncan Simester, Peng Sun, John N. Tsitsiklis: Bias and variance in value function estimation. ICML 2004
55EEShie Mannor, John N. Tsitsiklis: The Sample Complexity of Exploration in the Multi-Armed Bandit Problem. Journal of Machine Learning Research 5: 623-648 (2004)
54EERamesh Johari, John N. Tsitsiklis: Efficiency Loss in a Network Resource Allocation Game. Math. Oper. Res. 29(3): 407-435 (2004)
2003
53EEShie Mannor, John N. Tsitsiklis: Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem. COLT 2003: 418-432
52EEAlvin Fu, Eytan Modiano, John N. Tsitsiklis: Optimal Energy Allocation for Delay-Constrained Data Transmission over a Time-Varying Channel. INFOCOM 2003
51EEPeter Marbach, John N. Tsitsiklis: Approximate Gradient Methods in Policy-Space Optimization of Markov Reward Processes. Discrete Event Dynamic Systems 13(1-2): 111-148 (2003)
50EEAlvin Fu, Eytan Modiano, John N. Tsitsiklis: Optimal energy allocation and admission control for communications satellites. IEEE/ACM Trans. Netw. 11(3): 488-500 (2003)
2002
49EEAlvin Fu, Eytan Modiano, John N. Tsitsiklis: Optimal Energy Allocation and Admission Control for Communications Satellites. INFOCOM 2002
48EEJohn N. Tsitsiklis: On the Convergence of Optimistic Policy Iteration. Journal of Machine Learning Research 3: 59-72 (2002)
47 John N. Tsitsiklis, Benjamin Van Roy: On Average Versus Discounted Reward Temporal-Difference Learning. Machine Learning 49(2-3): 179-191 (2002)
2001
46 Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis: The Stability of Saturated Linear Dynamical Systems Is Undecidable. J. Comput. Syst. Sci. 62(3): 442-462 (2001)
45EEVincent D. Blondel, Olivier Bournez, Pascal Koiran, Christos H. Papadimitriou, John N. Tsitsiklis: Deciding stability and mortality of piecewise affine dynamical systems. Theor. Comput. Sci. 255(1-2): 687-696 (2001)
2000
44EEVincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis: The Stability of Saturated Linear Dynamical Systems Is Undecidable. STACS 2000: 479-490
43EEIoannis Ch. Paschalidis, John N. Tsitsiklis: Congestion-dependent pricing of network services. IEEE/ACM Trans. Netw. 8(2): 171-184 (2000)
1999
42EEVijay R. Konda, John N. Tsitsiklis: Actor-Critic Algorithms. NIPS 1999: 1008-1014
41 Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis: Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach. Machine Learning 35(3): 225-245 (1999)
40 Dimitris Bertsimas, Ioannis Ch. Paschalidis, John N. Tsitsiklis: Large deviations analysis of the generalized processor sharing policy. Queueing Syst. 32(4): 319-349 (1999)
39EEDimitris Bertsimas, David Gamarnik, John N. Tsitsiklis: Performance analysis of multiclass queueing networks. SIGMETRICS Performance Evaluation Review 27(3): 11-14 (1999)
1997
38EEDimitris Bertsimas, David Gamarnik, John N. Tsitsiklis: Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach. COLT 1997: 314-324
37 Peter Marbach, Oliver Mihatsch, Miriam Schulte, John N. Tsitsiklis: Reinforcement Learning for Call Admission Control and Routing in Integrated Service Networks. NIPS 1997
36EEVincent D. Blondel, John N. Tsitsiklis: When is a Pair of Matrices Mortal? Inf. Process. Lett. 63(5): 283-286 (1997)
35 Dimitri P. Bertsekas, John N. Tsitsiklis, Cynara Wu: Rollout Algorithms for Combinatorial Optimization. J. Heuristics 3(3): 245-262 (1997)
1996
34EEJohn N. Tsitsiklis, Benjamin Van Roy: Analysis of Temporal-Diffference Learning with Function Approximation. NIPS 1996: 1075-1081
33EEJohn N. Tsitsiklis, Benjamin Van Roy: Approximate Solutions to Optimal Stopping Problems. NIPS 1996: 1082-1088
32 John N. Tsitsiklis, Benjamin Van Roy: Feature-Based Methods for Large Scale Dynamic Programming. Machine Learning 22(1-3): 59-94 (1996)
31EEGeorge H. Polychronopoulos, John N. Tsitsiklis: Stochastic shortest path problems with recourse. Networks 27(2): 133-143 (1996)
1995
30EEBenjamin Van Roy, John N. Tsitsiklis: Stable LInear Approximations to Dynamic Programming for Stochastic Control Problems with Local Transitions. NIPS 1995: 1045-1051
29 David N. C. Tse, Robert G. Gallager, John N. Tsitsiklis: Statistical Multiplexing of Multiple Time-Scale Markov Streams. IEEE Journal on Selected Areas in Communications 13(6): 1028-1038 (1995)
28EEJohn N. Tsitsiklis, George D. Stamoulis: On the Average Communication Complexity of Asynchronous Distributed Algorithms. J. ACM 42(2): 382-400 (1995)
1994
27 Christos H. Papadimitriou, John N. Tsitsiklis: The Complexity of Optimal Queueing Network Control. Structure in Complexity Theory Conference 1994: 318-322
26EESanjeev R. Kulkarni, Sanjoy K. Mitter, T. J. Richardson, John N. Tsitsiklis: Local Versus Nonlocal Computation of Length of Digitized Curves. IEEE Trans. Pattern Anal. Mach. Intell. 16(7): 711-718 (1994)
25 Zhi-Quan Luo, John N. Tsitsiklis: Data fusion with minimal communication. IEEE Transactions on Information Theory 40(5): 1551-1563 (1994)
24 John N. Tsitsiklis: Asynchronous Stochastic Approximation and Q-Learning. Machine Learning 16(3): 185-202 (1994)
1993
23EESanjeev R. Kulkarni, Sanjoy K. Mitter, T. J. Richardson, John N. Tsitsiklis: Local Versus Non-local Computation of Length of Digitized Curves. FSTTCS 1993: 94-103
22EEGeorge D. Stamoulis, John N. Tsitsiklis: Efficient Routing Schemes for Multiple Broadcasts in Hypercubes. IEEE Trans. Parallel Distrib. Syst. 4(7): 725-739 (1993)
21EESanjeev R. Kulkarni, Sanjoy K. Mitter, John N. Tsitsiklis, Ofer Zeitouni: PAC Learning with Generalized Samples and an Applicaiton to Stochastic Geometry. IEEE Trans. Pattern Anal. Mach. Intell. 15(9): 933-942 (1993)
20 George D. Stamoulis, John N. Tsitsiklis: An Efficient Algorithm for Multiple Simultaneous Broadcasts in the Hypercube. Inf. Process. Lett. 46(5): 219-224 (1993)
19EEZhi-Quan Luo, John N. Tsitsiklis: On the Communication Complexity of Distributed Algebraic Computation. J. ACM 40(5): 1019-1047 (1993)
18 Sanjeev R. Kulkarni, Sanjoy K. Mitter, John N. Tsitsiklis: Active Learning Using Arbitrary Binary Valued Queries. Machine Learning 11: 23-35 (1993)
1992
17EESanjeev R. Kulkarni, John N. Tsitsiklis, Sanjoy K. Mitter, Ofer Zeitouni: PAC Learning With Generalized Samples and an Application to Stochastic Geometry. COLT 1992: 172-179
1991
16EEGeorge D. Stamoulis, John N. Tsitsiklis: The Efficiency of Greedy Routing in Hypercubes and Butterflies. SPAA 1991: 248-259
15 Nicholas Pippenger, George D. Stamoulis, John N. Tsitsiklis: On a lower bound for the redundancy of reliable networks with noisy gates. IEEE Transactions on Information Theory 37(3): 639- (1991)
14 Dimitri P. Bertsekas, C. Özveren, George D. Stamoulis, Paul Tseng, John N. Tsitsiklis: Optimal Communication Algorithms for Hypercubes. J. Parallel Distrib. Comput. 11(4): 263-275 (1991)
13 Zhi-Quan Luo, John N. Tsitsiklis: On the Communication Complexity of Solving a Polynomial Equation. SIAM J. Comput. 20(5): 936-950 (1991)
1990
12 Zhi-Quan Luo, John N. Tsitsiklis: Communication Complexity of Algebraic Computation (Extended Abstract) FOCS 1990: 758-765
11 Samuel R. Buss, Christos H. Papadimitriou, John N. Tsitsiklis: On the Predictability of Coupled Automata: An Allegory about Chaos FOCS 1990: 788-793
1989
10EEDimitri P. Bertsekas, John N. Tsitsiklis: Convergence rate and termination of asynchronous iterative algorithms. ICS 1989: 461-470
9 John N. Tsitsiklis: On the Use of Random Numbers in Asynchronous Simulation via Rollback. Inf. Process. Lett. 31(3): 139-144 (1989)
8EEJohn N. Tsitsiklis: On the use of random numbers in asynchronous simulation via rollback. Inf. Process. Lett. 32(3): 139-144 (1989)
7EEChef-Seng Chow, John N. Tsitsiklis: The complexity of dynamic programming. J. Complexity 5(4): 466-488 (1989)
1987
6EEJohn N. Tsitsiklis, Zhi-Quan Luo: Communication complexity of convex optimization. J. Complexity 3(3): 231-243 (1987)
5 John N. Tsitsiklis: On the Stability of Asynchronous Iterative Processes. Mathematical Systems Theory 20(2-3): 137-153 (1987)
4 Christos H. Papadimitriou, John N. Tsitsiklis: On Stochastic Scheduling with In-Tree Precedence Constraints. SIAM J. Comput. 16(1): 1-6 (1987)
1986
3EEJohn N. Tsitsiklis, Christos H. Papadimitriou, Pierre A. Humblet: The performance of a precedence-based queuing discipline. J. ACM 33(3): 593-602 (1986)
1985
2 Bernard C. Levy, John N. Tsitsiklis: A fast algorithm for linear estimation of two- dimensional isotropic random fields. IEEE Transactions on Information Theory 31(5): 635-644 (1985)
1982
1 Christos H. Papadimitriou, John N. Tsitsiklis: On the Complexity of Designing Distributed Protocols Information and Control 53(3): 211-218 (1982)

Coauthor Index

1Dimitri P. Bertsekas [10] [14] [35]
2Dimitris Bertsimas [38] [39] [40] [41]
3Vincent D. Blondel [36] [44] [45] [46] [73]
4Thomas Bortfeld [67]
5Olivier Bournez [44] [45] [46]
6Samuel R. Buss [11]
7Timothy C. Y. Chan [67]
8Chef-Seng Chow [7]
9Alvin Fu [49] [50] [52] [59]
10Robert G. Gallager [29]
11David Gamarnik [38] [39] [41]
12Anand Ganti [64]
13Julien M. Hendrickx [73] [79]
14Pierre A. Humblet [3]
15Ramesh Johari [54] [58] [60] [78]
16Pascal Koiran [44] [45] [46]
17Vijay R. Konda [42]
18Sanjeev R. Kulkarni [17] [18] [21] [23] [26]
19Bernard C. Levy [2]
20Zhi-Quan Luo [6] [12] [13] [19] [25]
21Shie Mannor [53] [55] [56] [57] [58] [61]
22Peter Marbach [37] [51]
23Adam J. Mersereau [75]
24Oliver Mihatsch [37]
25Sanjoy K. Mitter [17] [18] [21] [23] [26]
26Eytan Modiano [49] [50] [52] [59] [64]
27Alp Muharremoglu [68]
28Angelia Nedic [76] [77]
29Alexander Olshevsky [76] [77] [79]
30Asuman E. Ozdaglar [76] [77]
31C. Özveren [14]
32Christos H. Papadimitriou [1] [3] [4] [11] [27] [45]
33Ioannis Ch. Paschalidis [40] [43]
34Nicholas Pippenger [15]
35George H. Polychronopoulos [31]
36T. J. Richardson [23] [26]
37Benjamin Van Roy [30] [32] [33] [34] [47]
38Paat Rusmevichientong [72] [75]
39Miriam Schulte [37]
40Jay Sethuraman [63]
41Duncan Simester [56]
42George D. Stamoulis [14] [15] [16] [20] [22] [28]
43Peng Sun [56]
44Wee-Peng Tay [65] [66] [69] [70] [71] [74]
45Alexei Trofimov [67]
46David N. C. Tse [29]
47Paul Tseng [14]
48Moe Z. Win [65] [66] [69] [70] [71] [74]
49Cynara Wu [35]
50Ofer Zeitouni [17] [21]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)