| 2013 | ||
|---|---|---|
| j27 | Daniel Gottesman, Sandy Irani: The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems. Theory of Computing 9: 31-116 (2013) | |
| 2009 | ||
| j26 | 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) | |
| c30 | Daniel Gottesman, Sandy Irani: The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems. FOCS 2009: 95-104 | |
| c29 | Joan Boyar, Sandy Irani, Kim S. Larsen: A Comparison of Performance Measures for Online Algorithms. WADS 2009: 119-130 | |
| i2 | Daniel Gottesman, Sandy Irani: The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems. CoRR abs/0905.2419 (2009) | |
| 2008 | ||
| j25 | John Augustine, Sandy Irani, Chaitanya Swamy: Optimal Power-Down Strategies. SIAM J. Comput. 37(5): 1499-1516 (2008) | |
| j24 | Sandy Irani, Vitus J. Leung: Probabilistic analysis for scheduling with conflicts. Theor. Comput. Sci. 396(1-3): 158-179 (2008) | |
| i1 | Joan Boyar, Sandy Irani, Kim S. Larsen: A Comparison of Performance Measures for Online Algorithms. CoRR abs/0806.0983 (2008) | |
| 2007 | ||
| j23 | Sandy Irani, Sandeep K. Shukla, Rajesh Gupta: Algorithms for power savings. ACM Transactions on Algorithms 3(4) (2007) | |
| j22 | ||
| c28 | Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe: The Power of Quantum Systems on a Line. FOCS 2007: 373-383 | |
| 2006 | ||
| c27 | Aditi Majumder, Sandy Irani: Contrast enhancement of images using human contrast sensitivity. APGV 2006: 69-76 | |
| c26 | John Augustine, Sudarshan Banerjee, Sandy Irani: Strip packing with precedence constraints and strip packing with release times. SPAA 2006: 180-189 | |
| 2005 | ||
| j21 | ||
| j20 | 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) | |
| c25 | Kartic Subr, Aditi Majumder, Sandy Irani: Greedy Algorithm for Local Contrast Enhancement of Images. ICIAP 2005: 171-179 | |
| 2004 | ||
| j19 | Sandy Irani, Xiangwen Lu, Amelia Regan: On-Line Algorithms for the Dynamic Traveling Repair Problem. J. Scheduling 7(3): 243-258 (2004) | |
| j18 | ||
| c24 | ||
| c23 | Qi Han, Matthew Ba Nguyen, Sandy Irani, Nalini Venkatasubramanian: Time-Sensitive Computation of Aggregate Functions over Distributed Imprecise Data. IPDPS 2004 | |
| 2003 | ||
| j17 | Sandy Irani, Vitus J. Leung: Scheduling with Conflicts on Bipartite and Interval Graphs. J. Scheduling 6(3): 287-307 (2003) | |
| j16 | 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) | |
| c22 | Rajesh K. Gupta, Sandy Irani, Sandeep K. Shukla: Formal Methods for Dynamic Power Management. ICCAD 2003: 874-882 | |
| c21 | ||
| 2002 | ||
| j15 | ||
| j14 | Sandy Irani: Page Replacement with Multi-Size Pages and Applications to Web Caching. Algorithmica 33(3): 384-409 (2002) | |
| j13 | 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) | |
| c20 | 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 | |
| c19 | Sandy Irani, Xiangwen Lu, Amelia Regan: On-line algorithms for the dynamic traveling repair problem. SODA 2002: 517-524 | |
| 2001 | ||
| c18 | Vitus J. Leung, Sandy Irani: Experimental Results on Statistical Approaches to Page Replacement Policies. ALENEX 2001: 61-77 | |
| c17 | Sandy Irani, Nalini Venkatasubramanian: Semi-Continuous Transmission for Cluster-Based Video Servers. CLUSTER 2001: 303-312 | |
| 2000 | ||
| c16 | Dinesh Ramanathan, Sandy Irani, Rajesh K. Gupta: Latency Effects of System Level Power Management Algorithms. ICCAD 2000: 350-356 | |
| 1999 | ||
| j12 | Sandy Irani, Prabhakar Raghavan: Combinatorial and experimental results for randomized point matching algorithms. Comput. Geom. 12(1-2): 17-31 (1999) | |
| c15 | Ali Dasdan, Sandy Irani, Rajesh K. Gupta: Efficient Algorithms for Optimum Cycle Mean and Optimum Cost to Time Ratio Problems. DAC 1999: 37-42 | |
| 1998 | ||
| j11 | Ran Canetti, Sandy Irani: Bounding the Power of Preemption in Randomized Scheduling. SIAM J. Comput. 27(4): 993-1015 (1998) | |
| j10 | Sandy Irani, Steven S. Seiden: Randomized Algorithms for Metrical Task Systems. Theor. Comput. Sci. 194(1-2): 163-182 (1998) | |
| 1997 | ||
| j9 | William R. Burley, Sandy Irani: On Algorithm Design for Metrical Task Systems. Algorithmica 18(4): 461-485 (1997) | |
| c14 | Sandy Irani, Vitus J. Leung: Probabilistic Analysis for Scheduling with Conflicts. SODA 1997: 286-295 | |
| c13 | Sandy Irani: Page Replacement with Multi-Size Pages and Applications to Web Caching. STOC 1997: 701-710 | |
| c12 | Pei Cao, Sandy Irani: Cost-Aware WWW Proxy Caching Algorithms. USENIX Symposium on Internet Technologies and Systems 1997 | |
| 1996 | ||
| j8 | Sandy Irani, Anna R. Karlin, Steven Phillips: Strongly Competitive Algorithms for Paging with Locality of Reference. SIAM J. Comput. 25(3): 477-497 (1996) | |
| j7 | Sandy Irani, Yuval Rabani: On the Value of Coordination in Distributed Decision Making. SIAM J. Comput. 25(3): 498-519 (1996) | |
| c11 | Sandy Irani, Prabhakar Raghavan: Combinatorial and Experimental Results for Randomized Point Matching Algorithms. Symposium on Computational Geometry 1996: 68-77 | |
| c10 | ||
| c9 | Sandy Irani, Vitus J. Leung: Scheduling with Conflicts, and Applications to Traffic Signal Control. SODA 1996: 85-94 | |
| 1995 | ||
| j6 | Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber: Competitive Paging with Locality of Reference. J. Comput. Syst. Sci. 50(2): 244-258 (1995) | |
| c8 | ||
| c7 | Ran Canetti, Sandy Irani: Bounding the power of preemption in randomized scheduling. STOC 1995: 606-615 | |
| c6 | ||
| 1994 | ||
| j5 | ||
| 1993 | ||
| c5 | Sandy Irani, Yuval Rabani: On the Value of Information in Coordination Games (preliminary version). FOCS 1993: 12-21 | |
| 1992 | ||
| j4 | 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) | |
| c4 | Sandy Irani, Anna R. Karlin, Steven Phillips: Strongly Competitive Algorithms for Paging with Locality of Reference. SODA 1992: 228-236 | |
| 1991 | ||
| j3 | ||
| j2 | Sandy Irani, Ronitt Rubinfeld: A Competitive 2-Server Algorithm. Inf. Process. Lett. 39(2): 85-91 (1991) | |
| c3 | Sandy Irani, Nick Reingold, Jeffery Westbrook, Daniel Dominic Sleator: Randomized Competitive Algorithms for the List Update Problem. SODA 1991: 251-260 | |
| c2 | Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber: Competitive Paging with Locality of Reference (Preliminary Version). STOC 1991: 249-259 | |
| 1990 | ||
| c1 | ||
| 1989 | ||
| j1 | 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) | |
Colors in the list of coauthors
Last update Thu May 23 16:04:50 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page