 | 2009 |
|---|
| 57 |       | Joan Boyar,
Sandy Irani,
Kim S. Larsen:
A Comparison of Performance Measures for Online Algorithms.
WADS 2009: 119-130 |
| 56 | | Daniel Gottesman,
Sandy Irani:
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems
CoRR abs/0905.2419: (2009) |
| 55 | | John Augustine,
Sudarshan Banerjee,
Sandy Irani:
Strip packing with precedence constraints and strip packing with release times.
Theor. Comput. Sci. 410(38-40): 3792-3803 (2009) |
| 2008 |
|---|
| 54 | | Joan Boyar,
Sandy Irani,
Kim S. Larsen:
A Comparison of Performance Measures for Online Algorithms
CoRR abs/0806.0983: (2008) |
| 53 | | John Augustine,
Sandy Irani,
Chaitanya Swamy:
Optimal Power-Down Strategies.
SIAM J. Comput. 37(5): 1499-1516 (2008) |
| 52 | | Sandy Irani,
Vitus J. Leung:
Probabilistic analysis for scheduling with conflicts.
Theor. Comput. Sci. 396(1-3): 158-179 (2008) |
| 2007 |
|---|
| 51 | | Dorit Aharonov,
Daniel Gottesman,
Sandy Irani,
Julia Kempe:
The Power of Quantum Systems on a Line.
FOCS 2007: 373-383 |
| 50 | | Sandy Irani,
Sandeep K. Shukla,
Rajesh Gupta:
Algorithms for power savings.
ACM Transactions on Algorithms 3(4): (2007) |
| 49 | | Aditi Majumder,
Sandy Irani:
Perception-based contrast enhancement of images.
TAP 4(3): (2007) |
| 2006 |
|---|
| 48 | | Aditi Majumder,
Sandy Irani:
Contrast enhancement of images using human contrast sensitivity.
APGV 2006: 69-76 |
| 47 | | John Augustine,
Sudarshan Banerjee,
Sandy Irani:
Strip packing with precedence constraints and strip packing with release times.
SPAA 2006: 180-189 |
| 2005 |
|---|
| 46 | | Kartic Subr,
Aditi Majumder,
Sandy Irani:
Greedy Algorithm for Local Contrast Enhancement of Images.
ICIAP 2005: 171-179 |
| 45 | | Sandy Irani,
Gaurav Singh,
Sandeep K. Shukla,
Rajesh K. Gupta:
An overview of the competitive and adversarial approaches to designing dynamic power management strategies.
IEEE Trans. VLSI Syst. 13(12): 1349-1361 (2005) |
| 44 | | Sandy Irani,
Kirk Pruhs:
Algorithmic problems in power management.
SIGACT News 36(2): 63-76 (2005) |
| 2004 |
|---|
| 43 | | John Augustine,
Sandy Irani,
Chaitanya Swamy:
Optimal Power-Down Strategies.
FOCS 2004: 530-539 |
| 42 | | Qi Han,
Matthew Ba Nguyen,
Sandy Irani,
Nalini Venkatasubramanian:
Time-Sensitive Computation of Aggregate Functions over Distributed Imprecise Data.
IPDPS 2004 |
| 41 | | Sandy Irani,
Xiangwen Lu,
Amelia Regan:
On-Line Algorithms for the Dynamic Traveling Repair Problem.
J. Scheduling 7(3): 243-258 (2004) |
| 40 | | Amos Fiat,
Sandy Irani:
Foreword.
Theor. Comput. Sci. 324(2-3): 133-135 (2004) |
| 2003 |
|---|
| 39 | | Rajesh K. Gupta,
Sandy Irani,
Sandeep K. Shukla:
Formal Methods for Dynamic Power Management.
ICCAD 2003: 874-882 |
| 38 | | Sandy Irani,
Sandeep K. Shukla,
Rajesh K. Gupta:
Algorithms for power savings.
SODA 2003: 37-46 |
| 37 | | Sandy Irani,
Sandeep K. Shukla,
Rajesh K. Gupta:
Online strategies for dynamic power management in systems with multiple power-saving states.
ACM Trans. Embedded Comput. Syst. 2(3): 325-346 (2003) |
| 36 |  | Sandy Irani,
Vitus J. Leung:
Scheduling with Conflicts on Bipartite and Interval Graphs.
J. Scheduling 6(3): 287-307 (2003) |
| 2002 |
|---|
| 35 | | Sandy Irani,
Rajesh K. Gupta,
Sandeep K. Shukla:
Competitive Analysis of Dynamic Power Management Strategies for Systems with Multiple Power Savings States.
DATE 2002: 117-123 |
| 34 | | Sandy Irani,
Xiangwen Lu,
Amelia Regan:
On-line algorithms for the dynamic traveling repair problem.
SODA 2002: 517-524 |
| 33 | | Sandy Irani:
Randomized Weighted Caching with Two Page Weights.
Algorithmica 32(4): 624-640 (2002) |
| 32 | | Sandy Irani:
Page Replacement with Multi-Size Pages and Applications to Web Caching.
Algorithmica 33(3): 384-409 (2002) |
| 31 | | Dinesh Ramanathan,
Sandy Irani,
Rajesh K. Gupta:
An analysis of system level power management algorithms and theireffects on latency.
IEEE Trans. on CAD of Integrated Circuits and Systems 21(3): 291-305 (2002) |
| 2001 |
|---|
| 30 | | Vitus J. Leung,
Sandy Irani:
Experimental Results on Statistical Approaches to Page Replacement Policies.
ALENEX 2001: 61-77 |
| 29 | | Sandy Irani,
Nalini Venkatasubramanian:
Semi-Continuous Transmission for Cluster-Based Video Servers.
CLUSTER 2001: 303-312 |
| 2000 |
|---|
| 28 | | Dinesh Ramanathan,
Sandy Irani,
Rajesh K. Gupta:
Latency Effects of System Level Power Management Algorithms.
ICCAD 2000: 350-356 |
| 1999 |
|---|
| 27 | | Ali Dasdan,
Sandy Irani,
Rajesh K. Gupta:
Efficient Algorithms for Optimum Cycle Mean and Optimum Cost to Time Ratio Problems.
DAC 1999: 37-42 |
| 26 | | Sandy Irani,
Prabhakar Raghavan:
Combinatorial and experimental results for randomized point matching algorithms.
Comput. Geom. 12(1-2): 17-31 (1999) |
| 1998 |
|---|
| 25 | | Ran Canetti,
Sandy Irani:
Bounding the Power of Preemption in Randomized Scheduling.
SIAM J. Comput. 27(4): 993-1015 (1998) |
| 24 | | Sandy Irani,
Steven S. Seiden:
Randomized Algorithms for Metrical Task Systems.
Theor. Comput. Sci. 194(1-2): 163-182 (1998) |
| 1997 |
|---|
| 23 | | Sandy Irani,
Vitus J. Leung:
Probabilistic Analysis for Scheduling with Conflicts.
SODA 1997: 286-295 |
| 22 | | Sandy Irani:
Page Replacement with Multi-Size Pages and Applications to Web Caching.
STOC 1997: 701-710 |
| 21 | | Pei Cao,
Sandy Irani:
Cost-Aware WWW Proxy Caching Algorithms.
USENIX Symposium on Internet Technologies and Systems 1997 |
| 20 | | William R. Burley,
Sandy Irani:
On Algorithm Design for Metrical Task Systems.
Algorithmica 18(4): 461-485 (1997) |
| 1996 |
|---|
| 19 | | Sandy Irani:
Competitive Analysis of Paging.
Online Algorithms 1996: 52-73 |
| 18 | | Sandy Irani,
Vitus J. Leung:
Scheduling with Conflicts, and Applications to Traffic Signal Control.
SODA 1996: 85-94 |
| 17 | | Sandy Irani,
Prabhakar Raghavan:
Combinatorial and Experimental Results for Randomized Point Matching Algorithms.
Symposium on Computational Geometry 1996: 68-77 |
| 16 | | Sandy Irani,
Anna R. Karlin,
Steven Phillips:
Strongly Competitive Algorithms for Paging with Locality of Reference.
SIAM J. Comput. 25(3): 477-497 (1996) |
| 15 | | Sandy Irani,
Yuval Rabani:
On the Value of Coordination in Distributed Decision Making.
SIAM J. Comput. 25(3): 498-519 (1996) |
| 1995 |
|---|
| 14 | | William R. Burley,
Sandy Irani:
On Algorithm Design for Metrical Task Systems.
SODA 1995: 420-429 |
| 13 | | Ran Canetti,
Sandy Irani:
Bounding the power of preemption in randomized scheduling.
STOC 1995: 606-615 |
| 12 | | Sandy Irani,
Steven S. Seiden:
Randomized Algorithms for Metrical Task Systems.
WADS 1995: 159-170 |
| 11 | | Allan Borodin,
Sandy Irani,
Prabhakar Raghavan,
Baruch Schieber:
Competitive Paging with Locality of Reference.
J. Comput. Syst. Sci. 50(2): 244-258 (1995) |
| 1994 |
|---|
| 10 | | Sandy Irani:
Coloring Inductive Graphs On-Line.
Algorithmica 11(1): 53-72 (1994) |
| 1993 |
|---|
| 9 | | Sandy Irani,
Yuval Rabani:
On the Value of Information in Coordination Games (preliminary version)
FOCS 1993: 12-21 |
| 1992 |
|---|
| 8 | | Sandy Irani,
Anna R. Karlin,
Steven Phillips:
Strongly Competitive Algorithms for Paging with Locality of Reference.
SODA 1992: 228-236 |
| 7 | | Sandy Irani,
Moni Naor,
Ronitt Rubinfeld:
On the Time and Space Complexity of Computation Using Write-Once Memory Or Is Pen Really Much Worse Than Pencil?
Mathematical Systems Theory 25(2): 141-159 (1992) |
| 1991 |
|---|
| 6 | | Sandy Irani,
Nick Reingold,
Jeffery Westbrook,
Daniel Dominic Sleator:
Randomized Competitive Algorithms for the List Update Problem.
SODA 1991: 251-260 |
| 5 | | Allan Borodin,
Sandy Irani,
Prabhakar Raghavan,
Baruch Schieber:
Competitive Paging with Locality of Reference (Preliminary Version)
STOC 1991: 249-259 |
| 4 | | Sandy Irani:
Two Results on the List Update Problem.
Inf. Process. Lett. 38(6): 301-306 (1991) |
| 3 | | Sandy Irani,
Ronitt Rubinfeld:
A Competitive 2-Server Algorithm.
Inf. Process. Lett. 39(2): 85-91 (1991) |
| 1990 |
|---|
| 2 | | Sandy Irani:
Coloring Inductive Graphs On-Line
FOCS 1990: 470-479 |
| 1989 |
|---|
| 1 | | Nancy M. Amato,
Manuel Blum,
Sandy Irani,
Ronitt Rubinfeld:
Reversing Trains: A Turn of the Century Sorting Problem.
J. Algorithms 10(3): 413-428 (1989) |
