Sandy Irani

Orcid: 0000-0002-0642-9436

Affiliations:
  • University of California, Irvine, USA


According to our database1, Sandy Irani authored at least 60 papers between 1989 and 2024.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2022, "For contributions to the theory of online algorithms and quantum complexity theory".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Quantum Metropolis Sampling via Weak Measurement.
CoRR, 2024

2023
Quantum Tutte Embeddings.
CoRR, 2023

Translationally Invariant Constraint Optimization Problems.
Proceedings of the 38th Computational Complexity Conference, 2023

Modified Iterative Quantum Amplitude Estimation is Asymptotically Optimal.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022
Hamiltonian complexity in the thermodynamic limit.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Quantum Search-To-Decision Reductions and the State Synthesis Problem.
Proceedings of the 37th Computational Complexity Conference, 2022

2021
A competitive analysis for the Start-Gap algorithm for online memory wear leveling.
Inf. Process. Lett., 2021

Electronic Structure in a Fixed Basis is QMA-complete.
CoRR, 2021

2020
Incorporating Active Learning Strategies and Instructor Presence into an Online Discrete Mathematics Class.
Proceedings of the 51st ACM Technical Symposium on Computer Science Education, 2020

2018
Special Section on the Forty-Seventh Annual ACM Symposium on Theory of Computing (STOC 2015).
SIAM J. Comput., 2018

The Subset Assignment Problem for Data Placement in Caches.
Algorithmica, 2018

On Configuring a Hierarchy of Storage Media in the Age of NVM.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2015
A Comparison of Performance Measures for Online Algorithms.
Algorithmica, 2015

Cache Replacement with Memory Allocation.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
CAMP: a cost adaptive multi-queue eviction policy for key-value stores.
Proceedings of the 15th International Middleware Conference, 2014

A demonstration of KOSAR: an elastic, scalable, highly available SQL middleware.
Proceedings of the Middleware '14 Posters & Demos Session, 2014

2013
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems.
Theory Comput., 2013

2009
Strip packing with precedence constraints and strip packing with release times.
Theor. Comput. Sci., 2009

2008
Probabilistic analysis for scheduling with conflicts.
Theor. Comput. Sci., 2008

Optimal Power-Down Strategies.
SIAM J. Comput., 2008

2007
Perception-based contrast enhancement of images.
ACM Trans. Appl. Percept., 2007

Algorithms for power savings.
ACM Trans. Algorithms, 2007

The Power of Quantum Systems on a Line.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006
Contrast enhancement of images using human contrast sensitivity.
Proceedings of the 3rd Symposium on Applied Perception in Graphics and Visualization, 2006

2005
An overview of the competitive and adversarial approaches to designing dynamic power management strategies.
IEEE Trans. Very Large Scale Integr. Syst., 2005

Algorithmic problems in power management.
SIGACT News, 2005

Greedy Algorithm for Local Contrast Enhancement of Images.
Proceedings of the Image Analysis and Processing, 2005

2004
Foreword.
Theor. Comput. Sci., 2004

On-Line Algorithms for the Dynamic Traveling Repair Problem.
J. Sched., 2004

Time-Sensitive Computation of Aggregate Functions over Distributed Imprecise Data.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003
Online strategies for dynamic power management in systems with multiple power-saving states.
ACM Trans. Embed. Comput. Syst., 2003

Scheduling with Conflicts on Bipartite and Interval Graphs.
J. Sched., 2003

Formal Methods for Dynamic Power Management.
Proceedings of the 2003 International Conference on Computer-Aided Design, 2003

2002
An analysis of system level power management algorithms and theireffects on latency.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2002

Page Replacement with Multi-Size Pages and Applications to Web Caching.
Algorithmica, 2002

Randomized Weighted Caching with Two Page Weights.
Algorithmica, 2002

Competitive Analysis of Dynamic Power Management Strategies for Systems with Multiple Power Savings States.
Proceedings of the 2002 Design, 2002

2001
Semi-Continuous Transmission for Cluster-Based Video Servers.
Proceedings of the 2001 IEEE International Conference on Cluster Computing (CLUSTER 2001), 2001

Experimental Results on Statistical Approaches to Page Replacement Policies.
Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000
Latency Effects of System Level Power Management Algorithms.
Proceedings of the 2000 IEEE/ACM International Conference on Computer-Aided Design, 2000

1999
Combinatorial and experimental results for randomized point matching algorithms.
Comput. Geom., 1999

Efficient Algorithms for Optimum Cycle Mean and Optimum Cost to Time Ratio Problems.
Proceedings of the 36th Conference on Design Automation, 1999

1998
Randomized Algorithms for Metrical Task Systems.
Theor. Comput. Sci., 1998

Bounding the Power of Preemption in Randomized Scheduling.
SIAM J. Comput., 1998

1997
On Algorithm Design for Metrical Task Systems.
Algorithmica, 1997

Cost-Aware WWW Proxy Caching Algorithms.
Proceedings of the 1st USENIX Symposium on Internet Technologies and Systems, 1997

1996
On the Value of Coordination in Distributed Decision Making.
SIAM J. Comput., 1996

Strongly Competitive Algorithms for Paging with Locality of Reference.
SIAM J. Comput., 1996

Scheduling with Conflicts, and Applications to Traffic Signal Control.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Competitive Analysis of Paging.
Proceedings of the Online Algorithms, 1996

1995
Competitive Paging with Locality of Reference.
J. Comput. Syst. Sci., 1995

1994
Coloring Inductive Graphs On-Line.
Algorithmica, 1994

1993
On the Value of Information in Coordination Games (preliminary version)
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
On the Time and Space Complexity of Computation Using Write-Once Memory Or Is Pen Really Much Worse Than Pencil?
Math. Syst. Theory, 1992

1991
A Competitive 2-Server Algorithm.
Inf. Process. Lett., 1991

Two Results on the List Update Problem.
Inf. Process. Lett., 1991

Competitive Paging with Locality of Reference (Preliminary Version)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Randomized Competitive Algorithms for the List Update Problem.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Competitive Paging with Locality of Reference (Brief Summary).
Proceedings of the On-Line Algorithms, 1991

1989
Reversing Trains: A Turn of the Century Sorting Problem.
J. Algorithms, 1989


  Loading...