Applications of approximation algorithms to cooperative games
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A randomized online algorithm for bandwidth utilization
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Theoretical Problems Related to the Internet
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Discrete Prediction Games with Arbitrary Feedback and Loss
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
TCP is competitive against a limited adversary
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Adaptive AIMD congestion control
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Exploiting the efficiency and fairness potential of AIMD-based congestion avoidance and control
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Randomized Online Algorithm for Bandwidth Utilization
Journal of Scheduling
Emulating low-priority transport at the application layer: a background transfer service
Proceedings of the joint international conference on Measurement and modeling of computer systems
An Antisocial Strategy for Scheduling Mechanisms
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09
A TCP with guaranteed performance in networks with dynamic congestion and random wireless losses
WICON '06 Proceedings of the 2nd annual international workshop on Wireless internet
A Distributed Throttling Approach for Handling High Bandwidth Aggregates
IEEE Transactions on Parallel and Distributed Systems
Greedy distributed optimization of multi-commodity flows
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Window-Games between TCP Flows
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
On the convergence of regret minimization dynamics in concave games
Proceedings of the forty-first annual ACM symposium on Theory of computing
Proceedings of the 2005 conference on Self-Organization and Autonomic Informatics (I)
On Equilibria for ADM Minimization Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Window-games between TCP flows
Theoretical Computer Science
On the quality and complexity of pareto equilibria in the job scheduling game
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Dynamic internet congestion with bursts
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
New results on the complexity of uniformly mixed nash equilibria
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Optimal flow distribution among multiple channels with unknown capacities
Theoretical Computer Science
Computer Science Review
Flood search under the California Split rule
Operations Research Letters
InSite: QoE-aware video delivery from cloud data centers
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
On the competitiveness of AIMD-TCP within a general network
Theoretical Computer Science
Hi-index | 0.00 |
For any positive integers r and n, let H(r,n) denote the family of graphs on n vertices with maximum degree r, and let H(r,n,n) denote the family of bipartite graphs H on 2n vertices with n vertices in each vertex class, and with maximum degree r. On ...