Browsing by Author Stamoulis, George D.

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 8 of 8
Issue DateTitleAuthor(s)
1-Jun-2013An efficient algorithm for multiple simultaneous broadcasts in the hypercubeTsitsiklis, John N.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.; Stamoulis, George D.
5-Jun-2013Efficient routing schemes for multiple broadcasts in hypercubesStamoulis, George D.; Tsitsiklis, John N.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013On a lower bound for the redundancy of reliable networks with noisy gatesPippenger, Nicholas.; Stamoulis, George D.; Tsitsiklis, John N.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
1-Jun-2013On the average communication complexity of asynchronous distributed algorithmsStamoulis, George D.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.; Tsitsiklis, John N.
5-Jun-2013On the average communication complexity of asynchronous distributed algorithmsTsitsiklis, John N.; Stamoulis, George D.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
5-Jun-2013On the settling time of the congested G/G/1 queueStamoulis, George D.; Tsitsiklis, John N.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
1-Jun-2013Optimal distributed policies for choosing among multiple serversTsitsiklis, John N.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.; Stamoulis, George D.
1-Jun-2013The efficiency of greedy routing in hypercubes and butterfliesTsitsiklis, John N.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.; Stamoulis, George D.