-
1
-
-
0027188166
-
On-line load balancing with applications to machine scheduling and virtual circuit routing
-
[1] J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts, "On-line load balancing with applications to machine scheduling and virtual circuit routing," Proc ACM Symp on Theory of Computing, 1993, pp. 623-631.
-
(1993)
Proc ACM Symp on Theory of Computing
, pp. 623-631
-
-
Aspnes, J.1
Azar, Y.2
Fiat, A.3
Plotkin, S.4
Waarts, O.5
-
2
-
-
0031147056
-
On-line routing of virtual circuits with applications to load balancing and machine scheduling
-
[2] J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts, On-line routing of virtual circuits with applications to load balancing and machine scheduling, J Assoc Comput Mach 44 (1997), 486-504.
-
(1997)
J Assoc Comput Mach
, vol.44
, pp. 486-504
-
-
Aspnes, J.1
Azar, Y.2
Fiat, A.3
Plotkin, S.4
Waarts, O.5
-
3
-
-
0002591736
-
Local optimization of global objectives: Competitive distributed deadlock resolution and resource allocation
-
[3] B. Awerbuch and Y. Azar, "Local optimization of global objectives: Competitive distributed deadlock resolution and resource allocation," Proc IEEE Symp on Foundations of Computer Science, 1994, pp. 240-249.
-
(1994)
Proc IEEE Symp on Foundations of Computer Science
, pp. 240-249
-
-
Awerbuch, B.1
Azar, Y.2
-
4
-
-
0009116375
-
Packet routing via min-cost circuit routing
-
[4] B. Awerbuch, Y. Azar, and A. Fiat, "Packet routing via min-cost circuit routing," Proc Israeli Symp on the Theory of Computing and Systems, 1996, pp. 37-42.
-
(1996)
Proc Israeli Symp on the Theory of Computing and Systems
, pp. 37-42
-
-
Awerbuch, B.1
Azar, Y.2
Fiat, A.3
-
5
-
-
0027883370
-
Throughput-competitive on-line routing
-
[5] B. Awerbuch, Y. Azar, and S. Plotkin, "Throughput-competitive on-line routing," Proc IEEE Symp on Foundations of Computer Science, 1993, pp. 32-40.
-
(1993)
Proc IEEE Symp on Foundations of Computer Science
, pp. 32-40
-
-
Awerbuch, B.1
Azar, Y.2
Plotkin, S.3
-
6
-
-
0028337894
-
Competitive routing of virtual circuits with unknown duration
-
[6] B. Awerbuch, Y. Azar, S. Plotkin, and O. Waarts, "Competitive routing of virtual circuits with unknown duration," Proc ACM-SIAM Symp on Discrete Algorithms, 1994, pp. 321-327.
-
(1994)
Proc ACM-SIAM Symp on Discrete Algorithms
, pp. 321-327
-
-
Awerbuch, B.1
Azar, Y.2
Plotkin, S.3
Waarts, O.4
-
7
-
-
0028196392
-
Competitive non-preemptive call control
-
[7] B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosen, "Competitive non-preemptive call control," Proc ACM-SIAM Symp on Discrete Algorithms, 1994, pp. 312-320.
-
(1994)
Proc ACM-SIAM Symp on Discrete Algorithms
, pp. 312-320
-
-
Awerbuch, B.1
Bartal, Y.2
Fiat, A.3
Rosen, A.4
-
8
-
-
0002848637
-
On-line admission control and circuit routing for high performance computing and communication
-
[8] B. Awerbuch, R. Gawlick, T. Leighton, and Y. Rabani, "On-line admission control and circuit routing for high performance computing and communication," Proc IEEE Symp on Foundations of Computer Science, 1994, pp. 412-423.
-
(1994)
Proc IEEE Symp on Foundations of Computer Science
, pp. 412-423
-
-
Awerbuch, B.1
Gawlick, R.2
Leighton, T.3
Rabani, Y.4
-
9
-
-
84947791860
-
On-line load balancing of temporary tasks
-
[9] Y. Azar, B. Kalyanasundaram, S. Plotkin, K.R. Pruhs, and O. Waarts, "On-line load balancing of temporary tasks," Workshop on Algorithms and Data Structures, 1993, pp. 119-130.
-
(1993)
Workshop on Algorithms and Data Structures
, pp. 119-130
-
-
Azar, Y.1
Kalyanasundaram, B.2
Plotkin, S.3
Pruhs, K.R.4
Waarts, O.5
-
10
-
-
84902101004
-
The competitiveness of on-line assignments
-
[10] Y. Azar, J. Naor, and R. Rom, "The competitiveness of on-line assignments," Proc ACM-SIAM Symp on Discrete Algorithms, 1992, pp. 203-210.
-
(1992)
Proc ACM-SIAM Symp on Discrete Algorithms
, pp. 203-210
-
-
Azar, Y.1
Naor, J.2
Rom, R.3
-
11
-
-
58149209970
-
The competitiveness of on-line assignments
-
[11] Y. Azar, J. Naor, and R. Rom, The competitiveness of on-line assignments, J Alg 18 (1995), 221-237.
-
(1995)
J Alg
, vol.18
, pp. 221-237
-
-
Azar, Y.1
Naor, J.2
Rom, R.3
-
12
-
-
0026971183
-
New algorithms for an ancient scheduling problem
-
[12] Y. Bartal, A. Fiat, H. Karloff, and R. Vohra, "New algorithms for an ancient scheduling problem," Proc ACM Symp on Theory of Computing, 1992, pp. 51-58.
-
(1992)
Proc ACM Symp on Theory of Computing
, pp. 51-58
-
-
Bartal, Y.1
Fiat, A.2
Karloff, H.3
Vohra, R.4
-
13
-
-
0026978022
-
Call preemption in communication networks
-
[13] J.A. Garay and I.S. Gopal, "Call preemption in communication networks," Proc IEEE INFOCOM, 1992, pp. 1043-1050.
-
(1992)
Proc IEEE Infocom
, pp. 1043-1050
-
-
Garay, J.A.1
Gopal, I.S.2
-
14
-
-
0009254732
-
On-line routing for permanent virtual circuits
-
[14] R. Gawlick, C. Kalmanek, and K.G. Ramakrishnan, "On-line routing for permanent virtual circuits," IEEE INFOCOM, 1995, pp. 278-288.
-
(1995)
IEEE Infocom
, pp. 278-288
-
-
Gawlick, R.1
Kalmanek, C.2
Ramakrishnan, K.G.3
-
15
-
-
84944813080
-
Bounds for certain multiprocessing anomalies
-
[15] R.L. Graham, Bounds for certain multiprocessing anomalies, Bell Syst Tech J 45 (1966), 1563-1581.
-
(1966)
Bell Syst Tech J
, vol.45
, pp. 1563-1581
-
-
Graham, R.L.1
-
17
-
-
0009188838
-
A lower bound for on-line file transfer routing and scheduling
-
[17] J.T. Havill, W. Mao, and R. Simha, "A lower bound for on-line file transfer routing and scheduling," Proc 31st Annual Conf on Information Sciences and Systems, 1997, pp. 936-941.
-
(1997)
Proc 31st Annual Conf on Information Sciences and Systems
, pp. 936-941
-
-
Havill, J.T.1
Mao, W.2
Simha, R.3
-
18
-
-
0028195810
-
A better algorithm for an ancient scheduling problem
-
[18] D.R. Karger, S.J. Phillips, and E. Torng, "A better algorithm for an ancient scheduling problem," Proc ACM-SIAM Symp on Discrete Algorithms, 1994, pp. 132-140.
-
(1994)
Proc ACM-SIAM Symp on Discrete Algorithms
, pp. 132-140
-
-
Karger, D.R.1
Phillips, S.J.2
Torng, E.3
-
20
-
-
0028454922
-
Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts
-
[20] P. Klein, S. Plotkin, C. Stein, and E. Tardos, Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts, SIAM J Comput 23 (1994), 466-487.
-
(1994)
SIAM J Comput
, vol.23
, pp. 466-487
-
-
Klein, P.1
Plotkin, S.2
Stein, C.3
Tardos, E.4
-
21
-
-
0038452388
-
Fast approximation algorithms for multicommodity flow problems
-
[21] T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas, "Fast approximation algorithms for multicommodity flow problems," Proc ACM Symp on Theory of Computing, 1991, 101-111.
-
(1991)
Proc ACM Symp on Theory of Computing
, pp. 101-111
-
-
Leighton, T.1
Makedon, F.2
Plotkin, S.3
Stein, C.4
Tardos, E.5
Tragoudas, S.6
-
22
-
-
0032284323
-
On-line randomized call control revisited
-
[22] S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti, and A. Rosen, "On-line randomized call control revisited," Proc ACM-SIAM Symp on Discrete Algorithms, 1998, 323-332.
-
(1998)
Proc ACM-SIAM Symp on Discrete Algorithms
, pp. 323-332
-
-
Leonardi, S.1
Marchetti-Spaccamela, A.2
Presciutti, A.3
Rosen, A.4
-
23
-
-
0009183935
-
Routing and scheduling file transfers in packet-switched networks
-
[23] W. Mao and R. Simha, Routing and scheduling file transfers in packet-switched networks, J Comput Inf 1 (1994), 559-574.
-
(1994)
J Comput Inf
, vol.1
, pp. 559-574
-
-
Mao, W.1
Simha, R.2
-
24
-
-
0029358479
-
Competitive routing of virtual circuits in ATM networks
-
[24] S. Plotkin. Competitive routing of virtual circuits in ATM networks, IEEE J Select Areas Commun 13 (1995), 1128-1136.
-
(1995)
IEEE J Select Areas Commun
, vol.13
, pp. 1128-1136
-
-
Plotkin, S.1
-
25
-
-
0025415365
-
The maximum concurrent flow problem
-
[25] F. Shahrokhi and D.W. Matula, The maximum concurrent flow problem, J Assoc Comput Machin 37 (1990), 318-334.
-
(1990)
J Assoc Comput Machin
, vol.37
, pp. 318-334
-
-
Shahrokhi, F.1
Matula, D.W.2
|