Teresa Anna Steiner

Orcid: 0000-0003-1078-4075

Affiliations:
  • Technical University of Denmark, Lyngby, Denmark


According to our database1, Teresa Anna Steiner authored at least 24 papers between 2018 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Fully Dynamic Algorithms for Graph Databases with Edge Differential Privacy.
Proc. ACM Manag. Data, May, 2025

Differentially Private Substring and Document Counting.
Proc. ACM Manag. Data, May, 2025

Count on Your Elders: Laplace vs Gaussian Noise.
Proceedings of the 6th Symposium on Foundations of Responsible Computing, 2025

Text Indexing for Simple Regular Expressions.
Proceedings of the 36th Annual Symposium on Combinatorial Pattern Matching, 2025

Differentially Private Continual Release of Histograms and Related Queries.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2025

2024
Fully Dynamic Graph Algorithms with Edge Differential Privacy.
CoRR, 2024

Private graph colouring with limited defectiveness.
CoRR, 2024

Gapped String Indexing in Subquadratic Space and Sublinear Query Time.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Continual Counting with Gradual Privacy Expiration.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Differentially Private Approximate Pattern Matching.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Compressed Consecutive Pattern Matching<sup>†</sup>.
Proceedings of the Data Compression Conference, 2024

Private Counting of Distinct Elements in the Turnstile Model and Extensions.
Proceedings of the Approximation, 2024

2023
String Indexing with Compressed Patterns.
ACM Trans. Algorithms, October, 2023

Gapped Indexing for Consecutive Occurrences.
Algorithmica, April, 2023

Differentially Private Histogram, Predecessor, and Set Cardinality under Continual Observation.
CoRR, 2023

Differentially Private Data Structures under Continual Observation for Histograms and Related Queries.
CoRR, 2023

Compressed Indexing for Consecutive Occurrences.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022
String indexing for top-<i>k</i> close consecutive occurrences.
Theor. Comput. Sci., 2022

The Fine-Grained Complexity of Episode Matching.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021
A Conditional Lower Bound for Episode Matching.
CoRR, 2021

2020
A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands.
Inf. Process. Lett., 2020

String Indexing for Top-k Close Consecutive Occurrences.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019
Differential Privacy in Online Dating Recommendation Systems.
Proceedings of the Privacy and Identity Management. Data for Better Living: AI and Privacy, 2019

2018
A Differential Privacy Workflow for Inference of Parameters in the Rasch Model.
Proceedings of the ECML PKDD 2018 Workshops, 2018


  Loading...