| Year |
Citation |
Score |
| 2018 |
Ghandeharizadeh S, Irani S, Lam J. The Subset Assignment Problem for Data Placement in Caches Algorithmica. 80: 2201-2220. DOI: 10.1007/S00453-017-0403-4 |
0.347 |
|
| 2014 |
Boyar J, Irani S, Larsen KS. A Comparison of Performance Measures for Online Algorithms Algorithmica. 72: 969-994. DOI: 10.1007/S00453-014-9884-6 |
0.414 |
|
| 2010 |
Aharonov D, Arad I, Irani S. Efficient algorithm for approximating one-dimensional ground states Physical Review a - Atomic, Molecular, and Optical Physics. 82. DOI: 10.1103/Physreva.82.012315 |
0.368 |
|
| 2009 |
Gottesman D, Irani S. The quantum and classical complexity of translationally invariant tiling and hamiltonian problems Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 95-104. DOI: 10.4086/Toc.2013.V009A002 |
0.383 |
|
| 2009 |
Augustine J, Banerjee S, Irani S. Strip packing with precedence constraints and strip packing with release times Theoretical Computer Science. 410: 3792-3803. DOI: 10.1016/J.Tcs.2009.05.024 |
0.609 |
|
| 2008 |
Irani S, Leung V. Probabilistic analysis for scheduling with conflicts Theoretical Computer Science. 396: 158-179. DOI: 10.1016/J.Tcs.2008.01.027 |
0.402 |
|
| 2005 |
Irani S, Pruhs KR. Algorithmic problems in power management Sigact News. 36: 63-76. DOI: 10.1145/1067309.1067324 |
0.358 |
|
| 2005 |
Irani S, Singh G, Shukla SK, Gupta RK. An overview of the competitive and adversarial approaches to designing dynamic power management strategies Ieee Transactions On Very Large Scale Integration Systems. 13: 1349-1361. DOI: 10.1109/Tvlsi.2005.862725 |
0.315 |
|
| 2004 |
Augustine J, Irani S, Swamy C. Optimal power-down strategies Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 530-539. DOI: 10.1137/05063787X |
0.613 |
|
| 2004 |
Irani S, Lu X, Regan A. On-line algorithms for the dynamic traveling repair problem Journal of Scheduling. 7: 243-258. DOI: 10.1023/B:JOSH.0000019683.85186.57 |
0.338 |
|
| 2003 |
Irani S, Shukla S, Gupta R. Online strategies for dynamic power management in systems with multiple power-saving states Acm Transactions in Embedded Computing Systems. 2: 325-346. DOI: 10.1145/860176.860180 |
0.377 |
|
| 2003 |
Irani S, Shukla S, Gupta R. Algorithms for power savings Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 37-46. DOI: 10.1145/1290672.1290678 |
0.442 |
|
| 2003 |
Irani S, Leung V. Scheduling with conflicts on bipartite and interval graphs Journal of Scheduling. 6: 287-307. DOI: 10.1023/A:1022908509269 |
0.383 |
|
| 2002 |
Ramanathan D, Irani S, Gupta RK. An analysis of system level power management algorithms and their effects on latency Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 21: 291-305. DOI: 10.1109/43.986423 |
0.351 |
|
| 2002 |
Irani S. Page replacement with multi-size pages and applications to web caching Algorithmica (New York). 33: 384-409. DOI: 10.1007/S00453-001-0125-4 |
0.387 |
|
| 2002 |
Irani S. Randomized weighted caching with two page weights Algorithmica (New York). 32: 624-640. DOI: 10.1007/S00453-001-0095-6 |
0.339 |
|
| 1998 |
Canetti R, Irani S. Bounding the power of preemption in randomized scheduling Siam Journal On Computing. 27: 993-1015. DOI: 10.1137/S0097539795283292 |
0.455 |
|
| 1996 |
Irani S, Rabani Y. On the value of coordination in distributed decision making Siam Journal On Computing. 25: 498-519. DOI: 10.1137/S0097539794261428 |
0.341 |
|
| 1996 |
Irani S, Karlin AR, Phillips S. Strongly competitive algorithms for paging with locality of reference Siam Journal On Computing. 25: 477-497. DOI: 10.1137/S0097539792236353 |
0.394 |
|
| 1995 |
Irani S, Seiden S. Randomized algorithms for metrical task systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 955: 159-170. DOI: 10.1016/S0304-3975(97)00006-6 |
0.41 |
|
| 1994 |
Irani S. Coloring inductive graphs on-line Algorithmica. 11: 53-72. DOI: 10.1007/Bf01294263 |
0.303 |
|
| 1992 |
Irani S, Naor M, Rubinfeld R. On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? Mathematical Systems Theory. 25: 141-159. DOI: 10.1007/Bf02835833 |
0.315 |
|
| 1991 |
Irani S, Rubinfeld R. A competitive 2-server algorithm Information Processing Letters. 39: 85-91. DOI: 10.1016/0020-0190(91)90160-J |
0.432 |
|
| 1991 |
Irani S. Two results on the list update problem Information Processing Letters. 38: 301-306. DOI: 10.1016/0020-0190(91)90086-W |
0.314 |
|
| 1989 |
Amato N, Blum M, Irani S, Rubinfeld R. Reversing trains: A turn of the century sorting problem Journal of Algorithms. 10: 413-428. DOI: 10.1016/0196-6774(89)90037-0 |
0.336 |
|
| Show low-probability matches. |