Τσιτσικλής, Γιάννης Ν
Overview
Works:  117 works in 271 publications in 3 languages and 1,789 library holdings 

Genres:  Textbooks 
Roles:  Author 
Classifications:  QA76.5, 004.35 
Publication Timeline
.
Most widely held works by
Γιάννης Ν Τσιτσικλής
Parallel and distributed computation : numerical methods by
Dimitri P Bertsekas(
Book
)
24 editions published between 1989 and 1997 in English and held by 545 WorldCat member libraries worldwide
Mathematics of Computing  Parallelism
24 editions published between 1989 and 1997 in English and held by 545 WorldCat member libraries worldwide
Mathematics of Computing  Parallelism
Introduction to linear optimization by
Dimitris Bertsimas(
Book
)
10 editions published in 1997 in English and Spanish and held by 348 WorldCat member libraries worldwide
10 editions published in 1997 in English and Spanish and held by 348 WorldCat member libraries worldwide
Introduction to probability by
Dimitri P Bertsekas(
Book
)
21 editions published between 2002 and 2016 in English and Chinese and held by 324 WorldCat member libraries worldwide
21 editions published between 2002 and 2016 in English and Chinese and held by 324 WorldCat member libraries worldwide
Neurodynamic programming by
Dimitri P Bertsekas(
Book
)
10 editions published between 1996 and 1999 in English and held by 293 WorldCat member libraries worldwide
10 editions published between 1996 and 1999 in English and held by 293 WorldCat member libraries worldwide
On the average communication complexity of asynchronous distributed algorithms by
John N Tsitsiklis(
Book
)
4 editions published between 1990 and 1996 in English and held by 6 WorldCat member libraries worldwide
Abstract: "We study the communication complexity of asychronous distributed algorithms, such as the distributed BellmanFord algorithm for the shortest path problem. Such algorithms can generate excessively many messages in the worst case. Nevertheless, we show that under certain probabilistic assumptions, the expected number of messages generated per time unit is bounded by a polynomial function of the number of processors. We conclude that (under our model) any asynchronous algorithm with good time complexity will also have good communication complexity, on the average."
4 editions published between 1990 and 1996 in English and held by 6 WorldCat member libraries worldwide
Abstract: "We study the communication complexity of asychronous distributed algorithms, such as the distributed BellmanFord algorithm for the shortest path problem. Such algorithms can generate excessively many messages in the worst case. Nevertheless, we show that under certain probabilistic assumptions, the expected number of messages generated per time unit is bounded by a polynomial function of the number of processors. We conclude that (under our model) any asynchronous algorithm with good time complexity will also have good communication complexity, on the average."
The throughput of a precedencebased queuing discipline by
John N Tsitsiklis(
Book
)
1 edition published in 1984 in English and held by 6 WorldCat member libraries worldwide
1 edition published in 1984 in English and held by 6 WorldCat member libraries worldwide
On a lower bound for the redundancy of reliable networks with noisy gates by
Nicholas Pippenger(
Book
)
4 editions published in 1990 in English and held by 6 WorldCat member libraries worldwide
4 editions published in 1990 in English and held by 6 WorldCat member libraries worldwide
Data fusion with minimal communication by
ZhiQuan Luo(
Book
)
4 editions published between 1991 and 1993 in English and held by 5 WorldCat member libraries worldwide
4 editions published between 1991 and 1993 in English and held by 5 WorldCat member libraries worldwide
On the large deviations behaviour of acyclic networks of G/G/1 queues by
Dimitris J Bertsimas(
Book
)
3 editions published in 1994 in English and held by 5 WorldCat member libraries worldwide
3 editions published in 1994 in English and held by 5 WorldCat member libraries worldwide
Intractable problems in control theory by
Christos H Papadimitriou(
Book
)
1 edition published in 1984 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1984 in English and held by 5 WorldCat member libraries worldwide
Stability conditions for multiclass fluid queueing networks by
Dimitris J Bertsimas(
Book
)
4 editions published between 1994 and 1996 in English and held by 5 WorldCat member libraries worldwide
4 editions published between 1994 and 1996 in English and held by 5 WorldCat member libraries worldwide
On the settling time of the congested G/G/1 queue by
George D Stamoulis(
Book
)
3 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
Efficient routing schemes for multiple broadcasts in hypercubes by
George D Stamoulis(
Book
)
3 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
An efficient algorithm for multiple simultaneous broadcasts in the hypercube by
George D Stamoulis(
Book
)
2 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
Active learning using arbitrary binary valued queries by
Sanjeev Kulkarni(
Book
)
3 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
The original and most widely studied PAC model for learning assumes a passive learner in the sense that the learner plays no role in obtaining information about the unknown concept. That is, the samples are simply drawn independently from some probability distribution. Some work has been done on studying more powerful oracles and how they affect learnability. To find bounds on the improvement that can be expected from using oracles, we consider active learning in the sense that the learner has complete choice in the information received. Specifically, we allow the learner to ask arbitrary yes/no questions. We consider both active learning under a fixed distribution and distributionfree active learning. In the case of active learning, the underlying probability distribution is used only to measure distance between concepts. For learnability with respect to a fixed distribution, active learning does not enlarge the set of learnable concept classes, but can improve the sample complexity. For distributionfree learning, it is shown that a concept class is actively learnable iff it is finite, so that active learning is in fact less powerful than the usual passive learning model. We also consider a form of distributionfree learning in which the learner knows the distribution being used, so that 'distributionfree' refers only to the requirement that a bound on the number of queries can be obtained uniformly over all distributions. Even with the side information of the distribution being used, a concept class is actively learnable iff it has finite VC dimension, so that active learning with the side information still does not enlarge the set of learnable concept classes
3 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
The original and most widely studied PAC model for learning assumes a passive learner in the sense that the learner plays no role in obtaining information about the unknown concept. That is, the samples are simply drawn independently from some probability distribution. Some work has been done on studying more powerful oracles and how they affect learnability. To find bounds on the improvement that can be expected from using oracles, we consider active learning in the sense that the learner has complete choice in the information received. Specifically, we allow the learner to ask arbitrary yes/no questions. We consider both active learning under a fixed distribution and distributionfree active learning. In the case of active learning, the underlying probability distribution is used only to measure distance between concepts. For learnability with respect to a fixed distribution, active learning does not enlarge the set of learnable concept classes, but can improve the sample complexity. For distributionfree learning, it is shown that a concept class is actively learnable iff it is finite, so that active learning is in fact less powerful than the usual passive learning model. We also consider a form of distributionfree learning in which the learner knows the distribution being used, so that 'distributionfree' refers only to the requirement that a bound on the number of queries can be obtained uniformly over all distributions. Even with the side information of the distribution being used, a concept class is actively learnable iff it has finite VC dimension, so that active learning with the side information still does not enlarge the set of learnable concept classes
On the predictability of coupled automata : an allegory about chaos by
Samuel R Buss(
Book
)
3 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
Partially asychronous, parallel algorithms for network flow and other problems by
Paul Tseng(
Book
)
2 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
Optimization of multiclass queueing networks : polyhedral and nonlinear characterizations of achievable performance by
Dimitris J Bertsimas(
Book
)
3 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
The worst bulk arrival process to a queue by
Daniel C Lee(
Book
)
3 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
A comparison of Jacobi and GaussSeidel parallel iterations by
John N Tsitsiklis(
Book
)
3 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Bertsekas, Dimitri P. Originator Author
 Bertsimas, Dimitris Author
 Center for Intelligent Control Systems (U.S.)
 Massachusetts Institute of Technology Laboratory for Information and Decision Systems Funder
 Stamoulis, G. D. Author
 Bertsimas, Dimitris J. Author
 Paschalidis, Ioannis Ch
 Papadimitriou, Christos H. Author
 Luo, ZhiQuan Author
 Chow, CheeSeng Author
Associated Subjects
Algorithms Artificial intelligence Computational complexity Computer network protocols Computer networks Control theory Dynamic programming Electronic data processingDistributed processing Iterative methods (Mathematics) Learning Linear programming Machine learning Markov processes Mathematical optimization Neural computers Neural networks (Computer science) Operating systems (Computers) Parallel processing (Electronic computers) Probabilities Queuing theory Random variables Signal processingDigital techniques Stochastic processes System analysis Vector processing (Computer science)