default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTeresa Anna Steiner
Person information
- affiliation: Technical University of Denmark, Lyngby, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner:
Private Counting of Distinct Elements in the Turnstile Model and Extensions. APPROX/RANDOM 2024: 40:1-40:21- [c11]Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner
:
Compressed Consecutive Pattern Matching†. DCC 2024: 163-172 - [c10]Teresa Anna Steiner:
Differentially Private Approximate Pattern Matching. ITCS 2024: 94:1-94:18 - [c9]Joel Daniel Andersson, Monika Henzinger, Rasmus Pagh, Teresa Anna Steiner, Jalaj Upadhyay:
Continual Counting with Gradual Privacy Expiration. NeurIPS 2024 - [c8]Philip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner:
Gapped String Indexing in Subquadratic Space and Sublinear Query Time. STACS 2024: 16:1-16:21 - [i14]Aleksander B. G. Christiansen, Eva Rotenberg, Teresa Anna Steiner, Juliette Vlieghe:
Private graph colouring with limited defectiveness. CoRR abs/2404.18692 (2024) - [i13]Joel Daniel Andersson, Monika Henzinger, Rasmus Pagh, Teresa Anna Steiner, Jalaj Upadhyay:
Continual Counting with Gradual Privacy Expiration. CoRR abs/2406.03802 (2024) - [i12]Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner:
Private Counting of Distinct Elements in the Turnstile Model and Extensions. CoRR abs/2408.11637 (2024) - [i11]Sofya Raskhodnikova, Teresa Anna Steiner:
Fully Dynamic Graph Algorithms with Edge Differential Privacy. CoRR abs/2409.17623 (2024) - [i10]Giulia Bernardini, Philip Bille, Inge Li Gørtz, Teresa Anna Steiner:
Differentially Private Substring and Document Counting. CoRR abs/2412.13813 (2024) - 2023
- [j4]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner:
Gapped Indexing for Consecutive Occurrences. Algorithmica 85(4): 879-901 (2023) - [j3]Philip Bille, Inge Li Gørtz, Teresa Anna Steiner:
String Indexing with Compressed Patterns. ACM Trans. Algorithms 19(4): 32:1-32:19 (2023) - [c7]Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner:
Compressed Indexing for Consecutive Occurrences. CPM 2023: 12:1-12:22 - [i9]Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner:
Differentially Private Data Structures under Continual Observation for Histograms and Related Queries. CoRR abs/2302.11341 (2023) - [i8]Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner:
Compressed Indexing for Consecutive Occurrences. CoRR abs/2304.00887 (2023) - [i7]Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner:
Differentially Private Histogram, Predecessor, and Set Cardinality under Continual Observation. CoRR abs/2306.10428 (2023) - [i6]Teresa Anna Steiner:
Differentially Private Approximate Pattern Matching. CoRR abs/2311.07415 (2023) - 2022
- [j2]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner:
String indexing for top-k close consecutive occurrences. Theor. Comput. Sci. 927: 133-147 (2022) - [c6]Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann:
The Fine-Grained Complexity of Episode Matching. CPM 2022: 4:1-4:12 - [i5]Philip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner:
Gapped String Indexing in Subquadratic Space and Sublinear Query Time. CoRR abs/2211.16860 (2022) - 2021
- [c5]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner:
Gapped Indexing for Consecutive Occurrences. CPM 2021: 10:1-10:19 - [i4]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner:
Gapped Indexing for Consecutive Occurrences. CoRR abs/2102.02505 (2021) - [i3]Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann:
A Conditional Lower Bound for Episode Matching. CoRR abs/2108.08613 (2021) - 2020
- [j1]Finn Fernstrøm, Teresa Anna Steiner:
A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands. Inf. Process. Lett. 159-160: 105960 (2020) - [c4]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner:
String Indexing for Top-k Close Consecutive Occurrences. FSTTCS 2020: 14:1-14:17 - [c3]Philip Bille, Inge Li Gørtz, Teresa Anna Steiner:
String Indexing with Compressed Patterns. STACS 2020: 10:1-10:13 - [i2]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner:
String Indexing for Top-k Close Consecutive Occurrences. CoRR abs/2007.04128 (2020)
2010 – 2019
- 2019
- [c2]Teresa Anna Steiner:
Differential Privacy in Online Dating Recommendation Systems. Privacy and Identity Management 2019: 395-410 - [i1]Philip Bille, Inge Li Gørtz, Teresa Anna Steiner:
String Indexing with Compressed Patterns. CoRR abs/1909.11930 (2019) - 2018
- [c1]Teresa Anna Steiner, David Enslev Nyrnberg, Lars Kai Hansen:
A Differential Privacy Workflow for Inference of Parameters in the Rasch Model. MIDAS/PAP@PKDD/ECML 2018: 113-124
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 2025-02-15 00:24 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:
