Santhoshini Velusamy

Orcid: 0000-0002-0294-5425

According to our database1, Santhoshini Velusamy authored at least 21 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Streaming approximation resistance of every ordering CSP.
Comput. Complex., June, 2024

Sketching Approximability of All Finite CSPs.
J. ACM, April, 2024

Efficient Location Sampling Algorithms for Road Networks.
Proceedings of the Companion Proceedings of the ACM on Web Conference 2024, 2024

2023
Fair allocation of a multiset of indivisible items.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

An Improved Lower Bound for Matroid Intersection Prophet Inequalities.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Multi-Item Nontruthful Auctions Achieve Good Revenue.
SIAM J. Comput., 2022

Streaming beyond sketching for Maximum Directed Cut.
Electron. Colloquium Comput. Complex., 2022

Streaming complexity of CSPs with randomly ordered constraints.
Electron. Colloquium Comput. Complex., 2022

Sketching Approximability of (Weak) Monarchy Predicates.
Electron. Colloquium Comput. Complex., 2022

On sketching approximations for symmetric Boolean CSPs.
Electron. Colloquium Comput. Complex., 2022

2021
Linear Space Streaming Lower Bounds for Approximating CSPs.
Electron. Colloquium Comput. Complex., 2021

Approximability of all finite CSPs in the dynamic streaming setting.
Electron. Colloquium Comput. Complex., 2021

Classification of the streaming approximability of Boolean CSPs.
Electron. Colloquium Comput. Complex., 2021

Closed-form expressions for the sketching approximability of (some) symmetric Boolean CSPs.
CoRR, 2021

Approximability of all finite CSPs with linear sketches.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Optimal Streaming Approximations for all Boolean Max-2CSPs.
CoRR, 2020

Simple, Credible, and Approximately-Optimal Auctions.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Optimal Streaming Approximations for all Boolean Max-2CSPs and Max-ksat.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2017
Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph.
Proceedings of the Approximation, 2017


  Loading...