default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSandy Irani
Person information
- affiliation: University of California, Irvine, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i9]Jiaqing Jiang, Sandy Irani:
Quantum Metropolis Sampling via Weak Measurement. CoRR abs/2406.16023 (2024)- [i8]Shahram Ghandeharizadeh, Sandy Irani, Jenny Lam, Jason Yap:
CAMP: A Cost Adaptive Multi-Queue Eviction Policy for Key-Value Stores. CoRR abs/2411.01246 (2024) - 2023
- [c41]Shion Fukuzawa, Christopher Ho, Sandy Irani, Jasen Zion:
Modified Iterative Quantum Amplitude Estimation is Asymptotically Optimal. ALENEX 2023: 135-147 - [c40]Dorit Aharonov, Sandy Irani:
Translationally Invariant Constraint Optimization Problems. CCC 2023: 23:1-23:15 - [i7]Shion Fukuzawa, Michael T. Goodrich, Sandy Irani:
Quantum Tutte Embeddings. CoRR abs/2307.08851 (2023) - 2022
- [c39]Sandy Irani, Anand Natarajan, Chinmay Nirkhe, Sujit Rao
, Henry Yuen:
Quantum Search-To-Decision Reductions and the State Synthesis Problem. CCC 2022: 5:1-5:19 - [c38]Dorit Aharonov, Sandy Irani:
Hamiltonian complexity in the thermodynamic limit. STOC 2022: 750-763 - [i6]Dorit Aharonov, Sandy Irani:
Translationally Invariant Constraint Optimization Problems. CoRR abs/2209.08731 (2022) - 2021
- [j31]William E. Devanny, Michael T. Goodrich, Sandy Irani:
A competitive analysis for the Start-Gap algorithm for online memory wear leveling. Inf. Process. Lett. 166: 106042 (2021) - [i5]Bryan O'Gorman, Sandy Irani, James Whitfield, Bill Fefferman:
Electronic Structure in a Fixed Basis is QMA-complete. CoRR abs/2103.08215 (2021) - [i4]Sandy Irani, Anand Natarajan, Chinmay Nirkhe, Sujit Rao, Henry Yuen:
Quantum search-to-decision reductions and the state synthesis problem. CoRR abs/2111.02999 (2021) - 2020
- [c37]Sandy Irani, Kameryn Denaro:
Incorporating Active Learning Strategies and Instructor Presence into an Online Discrete Mathematics Class. SIGCSE 2020: 1186-1192 - [e1]Sandy Irani:
61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020. IEEE 2020, ISBN 978-1-7281-9621-3 [contents]
2010 – 2019
- 2018
- [j30]Shahram Ghandeharizadeh, Sandy Irani, Jenny Lam:
The Subset Assignment Problem for Data Placement in Caches. Algorithmica 80(7): 2201-2220 (2018) - [j29]Costis Daskalakis, Yael Kalai, Sandy Irani:
Special Section on the Forty-Seventh Annual ACM Symposium on Theory of Computing (STOC 2015). SIAM J. Comput. 47(3): 888-889 (2018) - [c36]Shahram Ghandeharizadeh, Sandy Irani, Jenny Lam:
On Configuring a Hierarchy of Storage Media in the Age of NVM. ICDE 2018: 1380-1383 - 2016
- [c35]Shahram Ghandeharizadeh, Sandy Irani, Jenny Lam:
The Subset Assignment Problem for Data Placement in Caches. ISAAC 2016: 35:1-35:12 - [i3]Shahram Ghandeharizadeh, Sandy Irani, Jenny Lam:
The Subset Assignment Problem for Data Placement in Caches. CoRR abs/1609.08767 (2016) - 2015
- [j28]Joan Boyar, Sandy Irani, Kim S. Larsen:
A Comparison of Performance Measures for Online Algorithms. Algorithmica 72(4): 969-994 (2015) - [c34]Shahram Ghandeharizadeh, Sandy Irani, Jenny Lam:
Cache Replacement with Memory Allocation. ALENEX 2015: 1-9 - 2014
- [c33]Shahram Ghandeharizadeh, Connor Gorman, Sandy Irani, Shiva Jahangiri, Jenny Lam, Hieu Nguyen, Ryan Tani, Jason Yap:
A demonstration of KOSAR: an elastic, scalable, highly available SQL middleware. Middleware (Posters & Demos) 2014: 23-24 - [c32]Shahram Ghandeharizadeh, Sandy Irani, Jenny Lam, Jason Yap:
CAMP: a cost adaptive multi-queue eviction policy for key-value stores. Middleware 2014: 289-300 - 2013
- [j27]Daniel Gottesman, Sandy Irani:
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems. Theory Comput. 9: 31-116 (2013)
2000 – 2009
- 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) - [c31]Daniel Gottesman, Sandy Irani:
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems. FOCS 2009: 95-104 - [c30]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 Trans. Algorithms 3(4): 41 (2007) - [j22]Aditi Majumder, Sandy Irani:
Perception-based contrast enhancement of images. ACM Trans. Appl. Percept. 4(3): 17 (2007) - [c29]Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe:
The Power of Quantum Systems on a Line. FOCS 2007: 373-383 - 2006
- [c28]Aditi Majumder, Sandy Irani:
Contrast enhancement of images using human contrast sensitivity. APGV 2006: 69-76 - [c27]John Augustine, Sudarshan Banerjee, Sandy Irani:
Strip packing with precedence constraints and strip packing with release times. SPAA 2006: 180-189 - 2005
- [j21]Sandy Irani, Kirk Pruhs:
Algorithmic problems in power management. SIGACT News 36(2): 63-76 (2005) - [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. Very Large Scale Integr. Syst. 13(12): 1349-1361 (2005) - [c26]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. Sched. 7(3): 243-258 (2004) - [j18]Amos Fiat, Sandy Irani:
Foreword. Theor. Comput. Sci. 324(2-3): 133-135 (2004) - [c25]John Augustine, Sandy Irani, Chaitanya Swamy:
Optimal Power-Down Strategies. FOCS 2004: 530-539 - [c24]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. Sched. 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. Embed. Comput. Syst. 2(3): 325-346 (2003) - [c23]Rajesh K. Gupta, Sandy Irani, Sandeep K. Shukla:
Formal Methods for Dynamic Power Management. ICCAD 2003: 874-882 - [c22]Sandy Irani, Sandeep K. Shukla, Rajesh K. Gupta:
Algorithms for power savings. SODA 2003: 37-46 - 2002
- [j15]Sandy Irani:
Randomized Weighted Caching with Two Page Weights. Algorithmica 32(4): 624-640 (2002) - [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. Comput. Aided Des. Integr. Circuits Syst. 21(3): 291-305 (2002) - [c21]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 - [c20]Sandy Irani, Xiangwen Lu, Amelia Regan:
On-line algorithms for the dynamic traveling repair problem. SODA 2002: 517-524 - 2001
- [c19]Vitus J. Leung, Sandy Irani:
Experimental Results on Statistical Approaches to Page Replacement Policies. ALENEX 2001: 61-77 - [c18]Sandy Irani, Nalini Venkatasubramanian:
Semi-Continuous Transmission for Cluster-Based Video Servers. CLUSTER 2001: 303-312 - 2000
- [c17]Dinesh Ramanathan, Sandy Irani, Rajesh K. Gupta:
Latency Effects of System Level Power Management Algorithms. ICCAD 2000: 350-356
1990 – 1999
- 1999
- [j12]Sandy Irani, Prabhakar Raghavan:
Combinatorial and experimental results for randomized point matching algorithms. Comput. Geom. 12(1-2): 17-31 (1999) - [c16]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) - [c15]Sandy Irani, Vitus J. Leung:
Probabilistic Analysis for Scheduling with Conflicts. SODA 1997: 286-295 - [c14]Sandy Irani:
Page Replacement with Multi-Size Pages and Applications to Web Caching. STOC 1997: 701-710 - [c13]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 J. 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) - [c12]Sandy Irani, Prabhakar Raghavan:
Combinatorial and Experimental Results for Randomized Point Matching Algorithms. SCG 1996: 68-77 - [c11]Sandy Irani:
Competitive Analysis of Paging. Online Algorithms 1996: 52-73 - [c10]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) - [c9]William R. Burley, Sandy Irani:
On Algorithm Design for Metrical Task Systems. SODA 1995: 420-429 - [c8]Ran Canetti, Sandy Irani:
Bounding the power of preemption in randomized scheduling. STOC 1995: 606-615 - [c7]Sandy Irani, Steven S. Seiden:
Randomized Algorithms for Metrical Task Systems. WADS 1995: 159-170 - 1994
- [j5]Sandy Irani:
Coloring Inductive Graphs On-Line. Algorithmica 11(1): 53-72 (1994) - 1993
- [c6]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? Math. Syst. Theory 25(2): 141-159 (1992) - [c5]Sandy Irani, Anna R. Karlin, Steven J. Phillips:
Strongly Competitive Algorithms for Paging with Locality of Reference. SODA 1992: 228-236 - 1991
- [j3]Sandy Irani:
Two Results on the List Update Problem. Inf. Process. Lett. 38(6): 301-306 (1991) - [j2]Sandy Irani, Ronitt Rubinfeld:
A Competitive 2-Server Algorithm. Inf. Process. Lett. 39(2): 85-91 (1991) - [c4]Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber:
Competitive Paging with Locality of Reference (Brief Summary). On-Line Algorithms 1991: 167-168 - [c3]Sandy Irani, Nick Reingold, Jeffery R. 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]Sandy Irani:
Coloring Inductive Graphs On-Line. FOCS 1990: 470-479
1980 – 1989
- 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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-12 22:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
