Search the dblp DataBase
John N. Tsitsiklis :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
John N. Tsitsiklis , Christos H. Papadimitriou , Pierre A. Humblet The performance of a precedence-based queuing discipline. [Citation Graph (2, 0)][DBLP ] J. ACM, 1986, v:33, n:3, pp:593-602 [Journal ] Samuel R. Buss , Christos H. Papadimitriou , John N. Tsitsiklis On the Predictability of Coupled Automata: An Allegory about Chaos [Citation Graph (1, 0)][DBLP ] FOCS, 1990, pp:788-793 [Conf ] Christos H. Papadimitriou , John N. Tsitsiklis The Complexity of Optimal Queueing Network Control. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1994, pp:318-322 [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 ] Sanjeev R. Kulkarni , John N. Tsitsiklis , Sanjoy K. Mitter , Ofer Zeitouni PAC Learning With Generalized Samples and an Application to Stochastic Geometry. [Citation Graph (0, 0)][DBLP ] COLT, 1992, pp:172-179 [Conf ] Shie Mannor , John N. Tsitsiklis Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem. [Citation Graph (0, 0)][DBLP ] COLT, 2003, pp:418-432 [Conf ] Shie Mannor , John N. Tsitsiklis Online Learning with Constraints. [Citation Graph (0, 0)][DBLP ] COLT, 2006, pp:529-543 [Conf ] Wee-Peng Tay , John N. Tsitsiklis , Moe Z. Win Bayesian Detection in Bounded Height Tree Networks. [Citation Graph (0, 0)][DBLP ] DCC, 2007, pp:243-252 [Conf ] Zhi-Quan Luo , John N. Tsitsiklis Communication Complexity of Algebraic Computation (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1990, pp:758-765 [Conf ] Sanjeev R. Kulkarni , Sanjoy K. Mitter , T. J. Richardson , John N. Tsitsiklis Local Versus Non-local Computation of Length of Digitized Curves. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1993, pp:94-103 [Conf ] Shie Mannor , Duncan Simester , Peng Sun , John N. Tsitsiklis Bias and variance in value function estimation. [Citation Graph (0, 0)][DBLP ] ICML, 2004, pp:- [Conf ] 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 ] Alvin Fu , Eytan Modiano , John N. Tsitsiklis Optimal Energy Allocation and Admission Control for Communications Satellites. [Citation Graph (0, 0)][DBLP ] INFOCOM, 2002, pp:- [Conf ] Alvin Fu , Eytan Modiano , John N. Tsitsiklis Optimal Energy Allocation for Delay-Constrained Data Transmission over a Time-Varying Channel. [Citation Graph (0, 0)][DBLP ] INFOCOM, 2003, pp:- [Conf ] Vijay R. Konda , John N. Tsitsiklis Actor-Critic Algorithms. [Citation Graph (0, 0)][DBLP ] NIPS, 1999, pp:1008-1014 [Conf ] Peter Marbach , Oliver Mihatsch , Miriam Schulte , John N. Tsitsiklis Reinforcement Learning for Call Admission Control and Routing in Integrated Service Networks. [Citation Graph (0, 0)][DBLP ] NIPS, 1997, pp:- [Conf ] Benjamin Van Roy , John N. Tsitsiklis Stable LInear Approximations to Dynamic Programming for Stochastic Control Problems with Local Transitions. [Citation Graph (0, 0)][DBLP ] NIPS, 1995, pp:1045-1051 [Conf ] John N. Tsitsiklis , Benjamin Van Roy Analysis of Temporal-Diffference Learning with Function Approximation. [Citation Graph (0, 0)][DBLP ] NIPS, 1996, pp:1075-1081 [Conf ] John N. Tsitsiklis , Benjamin Van Roy Approximate Solutions to Optimal Stopping Problems. [Citation Graph (0, 0)][DBLP ] NIPS, 1996, pp:1082-1088 [Conf ] George D. Stamoulis , John N. Tsitsiklis The Efficiency of Greedy Routing in Hypercubes and Butterflies. [Citation Graph (0, 0)][DBLP ] SPAA, 1991, pp:248-259 [Conf ] Vincent D. Blondel , Olivier Bournez , Pascal Koiran , John N. Tsitsiklis The Stability of Saturated Linear Dynamical Systems Is Undecidable. [Citation Graph (0, 0)][DBLP ] STACS, 2000, pp:479-490 [Conf ] 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 ] Christos H. Papadimitriou , John N. Tsitsiklis On the Complexity of Designing Distributed Protocols [Citation Graph (0, 0)][DBLP ] Information and Control, 1982, v:53, n:3, pp:211-218 [Journal ] Vincent D. Blondel , John N. Tsitsiklis When is a Pair of Matrices Mortal? [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1997, v:63, n:5, pp:283-286 [Journal ] George D. Stamoulis , John N. Tsitsiklis An Efficient Algorithm for Multiple Simultaneous Broadcasts in the Hypercube. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1993, v:46, n:5, pp:219-224 [Journal ] John N. Tsitsiklis On the Use of Random Numbers in Asynchronous Simulation via Rollback. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:31, n:3, pp:139-144 [Journal ] John N. Tsitsiklis On the use of random numbers in asynchronous simulation via rollback. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:3, pp:139-144 [Journal ] Zhi-Quan Luo , John N. Tsitsiklis On the Communication Complexity of Distributed Algebraic Computation. [Citation Graph (0, 0)][DBLP ] J. ACM, 1993, v:40, n:5, pp:1019-1047 [Journal ] John N. Tsitsiklis , George D. Stamoulis On the Average Communication Complexity of Asynchronous Distributed Algorithms. [Citation Graph (0, 0)][DBLP ] J. ACM, 1995, v:42, n:2, pp:382-400 [Journal ] Chef-Seng Chow , John N. Tsitsiklis The complexity of dynamic programming. [Citation Graph (0, 0)][DBLP ] J. Complexity, 1989, v:5, n:4, pp:466-488 [Journal ] John N. Tsitsiklis , Zhi-Quan Luo Communication complexity of convex optimization. [Citation Graph (0, 0)][DBLP ] J. Complexity, 1987, v:3, n:3, pp:231-243 [Journal ] Vincent D. Blondel , Olivier Bournez , Pascal Koiran , John N. Tsitsiklis The Stability of Saturated Linear Dynamical Systems Is Undecidable. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2001, v:62, n:3, pp:442-462 [Journal ] Shie Mannor , John N. Tsitsiklis The Sample Complexity of Exploration in the Multi-Armed Bandit Problem. [Citation Graph (0, 0)][DBLP ] Journal of Machine Learning Research, 2004, v:5, n:, pp:623-648 [Journal ] John N. Tsitsiklis On the Convergence of Optimistic Policy Iteration. [Citation Graph (0, 0)][DBLP ] Journal of Machine Learning Research, 2002, v:3, n:, pp:59-72 [Journal ] 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 ] David N. C. Tse , Robert G. Gallager , John N. Tsitsiklis Statistical Multiplexing of Multiple Time-Scale Markov Streams. [Citation Graph (0, 0)][DBLP ] IEEE Journal on Selected Areas in Communications, 1995, v:13, n:6, pp:1028-1038 [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 ] Sanjeev R. Kulkarni , Sanjoy K. Mitter , John N. Tsitsiklis Active Learning Using Arbitrary Binary Valued Queries. [Citation Graph (0, 0)][DBLP ] Machine Learning, 1993, v:11, n:, pp:23-35 [Journal ] John N. Tsitsiklis Asynchronous Stochastic Approximation and Q-Learning. [Citation Graph (0, 0)][DBLP ] Machine Learning, 1994, v:16, n:3, pp:185-202 [Journal ] John N. Tsitsiklis , Benjamin Van Roy On Average Versus Discounted Reward Temporal-Difference Learning. [Citation Graph (0, 0)][DBLP ] Machine Learning, 2002, v:49, n:2-3, pp:179-191 [Journal ] John N. Tsitsiklis , Benjamin Van Roy Feature-Based Methods for Large Scale Dynamic Programming. [Citation Graph (0, 0)][DBLP ] Machine Learning, 1996, v:22, n:1-3, pp:59-94 [Journal ] Ramesh Johari , John N. Tsitsiklis Efficiency Loss in a Network Resource Allocation Game. [Citation Graph (0, 0)][DBLP ] Math. Oper. Res., 2004, v:29, n:3, pp:407-435 [Journal ] John N. Tsitsiklis On the Stability of Asynchronous Iterative Processes. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1987, v:20, n:2-3, pp:137-153 [Journal ] George H. Polychronopoulos , John N. Tsitsiklis Stochastic shortest path problems with recourse. [Citation Graph (0, 0)][DBLP ] Networks, 1996, v:27, n:2, pp:133-143 [Journal ] Sanjeev R. Kulkarni , Sanjoy K. Mitter , T. J. Richardson , John N. Tsitsiklis Local Versus Nonlocal Computation of Length of Digitized Curves. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Pattern Anal. Mach. Intell., 1994, v:16, n:7, pp:711-718 [Journal ] Sanjeev R. Kulkarni , Sanjoy K. Mitter , John N. Tsitsiklis , Ofer Zeitouni PAC Learning with Generalized Samples and an Applicaiton to Stochastic Geometry. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Pattern Anal. Mach. Intell., 1993, v:15, n:9, pp:933-942 [Journal ] Dimitris Bertsimas , Ioannis Ch. Paschalidis , John N. Tsitsiklis Large deviations analysis of the generalized processor sharing policy. [Citation Graph (0, 0)][DBLP ] Queueing Syst., 1999, v:32, n:4, pp:319-349 [Journal ] Zhi-Quan Luo , John N. Tsitsiklis On the Communication Complexity of Solving a Polynomial Equation. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1991, v:20, n:5, pp:936-950 [Journal ] Christos H. Papadimitriou , John N. Tsitsiklis On Stochastic Scheduling with In-Tree Precedence Constraints. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1987, v:16, n:1, pp:1-6 [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 ] Vincent D. Blondel , Olivier Bournez , Pascal Koiran , Christos H. Papadimitriou , John N. Tsitsiklis Deciding stability and mortality of piecewise affine dynamical systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2001, v:255, n:1-2, pp:687-696 [Journal ] Bernard C. Levy , John N. Tsitsiklis A fast algorithm for linear estimation of two- dimensional isotropic random fields. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1985, v:31, n:5, pp:635-644 [Journal ] Zhi-Quan Luo , John N. Tsitsiklis Data fusion with minimal communication. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1994, v:40, n:5, pp:1551-1563 [Journal ] Nicholas Pippenger , George D. Stamoulis , John N. Tsitsiklis On a lower bound for the redundancy of reliable networks with noisy gates. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:639-0 [Journal ] Anand Ganti , Eytan Modiano , John N. Tsitsiklis Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2007, v:53, n:3, pp:998-1008 [Journal ] Alvin Fu , Eytan Modiano , John N. Tsitsiklis Optimal energy allocation and admission control for communications satellites. [Citation Graph (0, 0)][DBLP ] IEEE/ACM Trans. Netw., 2003, v:11, n:3, pp:488-500 [Journal ] Ioannis Ch. Paschalidis , John N. Tsitsiklis Congestion-dependent pricing of network services. [Citation Graph (0, 0)][DBLP ] IEEE/ACM Trans. Netw., 2000, v:8, n:2, pp:171-184 [Journal ] George D. Stamoulis , John N. Tsitsiklis Efficient Routing Schemes for Multiple Broadcasts in Hypercubes. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 1993, v:4, n:7, pp:725-739 [Journal ] Qualitative properties of alpha-weighted scheduling policies. [Citation Graph (, )][DBLP ] A structured multiarmed bandit problem and the greedy policy. [Citation Graph (, )][DBLP ] On distributed averaging algorithms and quantization effects. [Citation Graph (, )][DBLP ] Distributed subgradient methods and quantization effects. [Citation Graph (, )][DBLP ] Efficiency Loss in a Network Resource Allocation Game: The Case of Elastic Supply [Citation Graph (, )][DBLP ] Data Fusion Trees for Detection: Does Architecture Matter? [Citation Graph (, )][DBLP ] On Krause's consensus formation model with state-dependent connectivity [Citation Graph (, )][DBLP ] Linearly Parameterized Bandits [Citation Graph (, )][DBLP ] Distributed anonymous function computation in information fusion and multiagent systems [Citation Graph (, )][DBLP ] Qualitative Properties of alpha-Weighted Scheduling Policies [Citation Graph (, )][DBLP ] Distributed anonymous discrete function computation [Citation Graph (, )][DBLP ] Queue Length Asymptotics for Generalized Max-Weight Scheduling in the presence of Heavy-Tailed Traffic [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.156secs