default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Hütter
Person information
- affiliation: University of Salzburg, Salzburg, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j5]Konstantin Emil Thiel
, Daniel Kocher, Nikolaus Augsten, Thomas Hütter, Willi Mann, Daniel Ulrich Schmitt:
FINEX: A Fast Index for Exact & Flexible Density-Based Clustering. Proc. ACM Manag. Data 1(1): 71:1-71:25 (2023)- [j4]Christine Schäler, Thomas Hütter, Martin Schäler:
Benchmarking the Utility of w-event Differential Privacy Mechanisms - When Baselines Become Mighty Competitors. Proc. VLDB Endow. 16(8): 1830-1842 (2023) - 2020
- [j3]Thomas Hütter, Maximilian H. Ganser, Manuel Kocher, Merima Halkic, Sabine Agatha, Nikolaus Augsten:
DeSignate: detecting signature characters in gene sequence alignments for taxon diagnoses. BMC Bioinform. 21(1): 151 (2020) - 2019
- [j2]Mateusz Pawlik, Thomas Hütter, Daniel Kocher, Willi Mann, Nikolaus Augsten:
A Link is not Enough - Reproducibility of Data. Datenbank-Spektrum 19(2): 107-115 (2019) - 2018
- [j1]Mario Preishuber, Thomas Hütter, Stefan Katzenbeisser, Andreas Uhl:
Depreciating Motivation and Empirical Security Analysis of Chaos-Based Image and Video Encryption. IEEE Trans. Inf. Forensics Secur. 13(9): 2137-2150 (2018)
Conference and Workshop Papers
- 2023
- [c6]Thomas Hütter, Daniel Kocher:
Feedforward-Aided Course Designs for Similarity Search. DataEd@SIGMOD 2023 - 2022
- [c5]Thomas Hütter, Nikolaus Augsten, Christoph M. Kirsch, Michael J. Carey, Chen Li:
JEDI: These aren't the JSON documents you're looking for? SIGMOD Conference 2022: 1584-1597 - 2019
- [c4]Thomas Hütter, Mateusz Pawlik, Robert Loschinger, Nikolaus Augsten:
Effective Filters and Linear Time Verification for Tree Similarity Joins. ICDE 2019: 854-865 - 2016
- [c3]Thomas Hütter, Mario Preishuber, Jutta Hämmerle-Uhl, Andreas Uhl:
Weaknesses in Security Considerations Related to Chaos-Based Image Encryption. ICICS 2016: 278-291 - 2015
- [c2]Andreas Haas, Thomas Hütter, Christoph M. Kirsch, Michael Lippautz, Mario Preishuber, Ana Sokolova:
Scal: A Benchmarking Suite for Concurrent Data Structures. NETYS 2015: 1-14 - 2014
- [c1]Martin Aigner, Thomas Hütter, Christoph M. Kirsch, Alexander Miller, Hannes Payer, Mario Preishuber:
ACDC-JS: explorative benchmarking of javascript memory management. DLS 2014: 67-78
Informal and Other Publications
- 2023
- [i2]Konstantin Emil Thiel, Daniel Kocher, Nikolaus Augsten, Thomas Hütter, Willi Mann, Daniel Ulrich Schmitt:
FINEX: A Fast Index for Exact & Flexible Density-Based Clustering (Extended Version with Proofs). CoRR abs/2304.04817 (2023) - 2022
- [i1]Thomas Hütter, Nikolaus Augsten, Christoph M. Kirsch, Michael J. Carey, Chen Li:
JEDI: These aren't the JSON documents you're looking for... (Extended Version*). CoRR abs/2201.08099 (2022)
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-08-05 21:22 CEST 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:
