Publications
Found 17 results
Author Title Type [ Year] Filters: Author is Christos H. Papadimitriou [Clear All Filters]
Linked Decomposition of Networks and the Power of Choice in Polya Urns.
Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA 2008). 993-1002.
(2008). Balancing the Traffic Load in Wireless Networks with Curveball Routing.
Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2007).
(2007). A BGP-Based Mechanism for Lowest-Cost Routing.
Distributed Computing. 18(1), 61-72.
(2005). Global Synchronization in Sensornets.
Proceedings of the 6th Latin American Theoretical Informatics Symposium (LATIN '04). 2976, 609-624.
(2004). Geographic Routing Without Location Information.
Proceedings of the 9th ACM Annual International Conference on Mobile Computing and Networking (MOBICOMM '03). 96-108.
(2003). On a Network Creation Game.
Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing (PODC '03). 347-351.
(2003). A Simple Algorithm for Finding Frequent Elements in Streams and Bags.
ACM Transactions on Database Systems. 28(1), 51-55.
(2003). A Simple Algorithm for Finding Frequent Elements in Streams and Bags.
ACM Transactions on Database Systems. 28(1), 51-55.
(2003). A BGP-Based Mechanism for Lowest-Cost Routing.
Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002). 173-182.
(2002). Selfish Behavior and Stability of the Internet: A Gamer-Theoretic Analysis of TCP.
Proceedings of ACM Special Interest Group on Data Communications Conference (SIGCOMM 2002). 117-130.
(2002). Selfish Behavior and Stability of the Internet: A Gamer-Theoretic Analysis of TCP.
ACM SIGCOMM Computer Communication Review. 32(4), 117-130.
(2002). Sharing the Cost of Multicast Transmissions.
Journal of Computer and System Sciences. 63(1), 21-41.
(2001). Optimization Problems in Congestion Control.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000). 66-74.
(2000). Sharing the Cost of Multicast Transmissions.
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC 2000). 218-227.
(2000). On Linear Characterizations of Combinatorial Optimization Problems.
SIAM Journal on Computing. 11(4), 620-632.
(1982). The Complexity of Testing Whether a Graph is a Superconcentrator.
13(4-5), 164-167.
(1981). On Linear Characterizations of Combinatorial Optimization Problems.
Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science. 1-9.
(1980).