default search action
Daniel Ting
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i14]Peihan Li, Vishnu Menon, Bhavanaraj Gudiguntla, Daniel Ting, Lifeng Zhou:
Challenges Faced by Large Language Models in Solving Multi-Agent Flocking. CoRR abs/2404.04752 (2024) - 2023
- [c16]Jonathan Hehir, Daniel Ting, Graham Cormode:
Sketch-Flip-Merge: Mergeable Sketches for Private Distinct Counting. ICML 2023: 12846-12865 - [i13]Jonathan Hehir, Daniel Ting, Graham Cormode
:
Sketch-Flip-Merge: Mergeable Sketches for Private Distinct Counting. CoRR abs/2302.02056 (2023) - 2022
- [j6]Pedro Reviriego
Breaking Cuckoo Hash: Black Box Attacks. IEEE Trans. Dependable Secur. Comput. 19(4): 2421-2427 (2022) - [c15]Charlie Dickens, Justin Thaler, Daniel Ting:
Order-Invariant Cardinality Estimators Are Differentially Private. NeurIPS 2022 - [c14]Justin Talbot, Daniel Ting:
Statistical Schema Learning with Occam's Razor. SIGMOD Conference 2022: 176-189 - [c13]Daniel Ting:
Adaptive Threshold Sampling. SIGMOD Conference 2022: 1612-1625 - [i12]Charlie Dickens, Justin Thaler, Daniel Ting:
(Nearly) All Cardinality Estimators Are Differentially Private. CoRR abs/2203.15400 (2022) - 2021
- [j5]Valerio Bruschi
More Accurate Streaming Cardinality Estimation With Vectorized Counters. IEEE Netw. Lett. 3(2): 75-79 (2021) - [c12]Daniel Ting, Rick Cole:
Conditional Cuckoo Filters. SIGMOD Conference 2021: 1838-1850 - [i11]Daniel Ting:
Simple, Optimal Algorithms for Random Sampling Without Replacement. CoRR abs/2104.05091 (2021) - 2020
- [j4]Pedro Reviriego
Security of HyperLogLog (HLL) Cardinality Estimation: Vulnerabilities and Protection. IEEE Commun. Lett. 24(5): 976-980 (2020) - [j3]Pedro Reviriego
Fast Updates for Line-Rate HyperLogLog-Based Cardinality Estimation. IEEE Commun. Lett. 24(12): 2737-2741 (2020) - [c11]Daniel Ting, Jonathan Malkin, Lee Rhodes:
Data Sketching for Real Time Analytics: Theory and Practice. KDD 2020: 3567-3568 - [i10]Pedro Reviriego, Daniel Ting:
Security of HyperLogLog (HLL) Cardinality Estimation: Vulnerabilities and Protection. CoRR abs/2002.06463 (2020) - [i9]Daniel Ting, Rick Cole:
Conditional Cuckoo Filters. CoRR abs/2005.02537 (2020) - [i8]Daniel Ting, Michael I. Jordan:
Manifold Learning via Manifold Deflation. CoRR abs/2007.03315 (2020) - [i7]Pedro Reviriego, Pablo Adell, Daniel Ting:
HyperLogLog (HLL) Security: Inflating Cardinality Estimates. CoRR abs/2011.10355 (2020)
2010 – 2019
- 2019
- [c10]Liqi Xu, Richard L. Cole, Daniel Ting:
Learning to optimize federated queries. aiDM@SIGMOD 2019: 2:1-2:7 - [c9]Daniel Ting:
Approximate Distinct Counts for Billions of Datasets. SIGMOD Conference 2019: 69-86 - 2018
- [c8]Daniel Ting:
Count-Min: Optimal Estimation and Tight Error Bounds using Empirical Error Distributions. KDD 2018: 2319-2328 - [c7]Daniel Ting, Eric Brochu:
Optimal Subsampling with Influence Functions. NeurIPS 2018: 3654-3663 - [c6]Daniel Ting:
Data Sketches for Disaggregated Subset Sum and Frequent Item Estimation. SIGMOD Conference 2018: 1129-1140 - [i6]Daniel Ting:
Count-Min: Optimal Estimation and Tight Error Bounds using Empirical Error Distributions. CoRR abs/1811.04150 (2018) - 2017
- [i5]Daniel Ting:
Adaptive Threshold Sampling and Estimation. CoRR abs/1708.04970 (2017) - [i4]Daniel Ting, Eric Brochu:
Optimal Sub-sampling with Influence Functions. CoRR abs/1709.01716 (2017) - [i3]Daniel Ting:
Data Sketches for Disaggregated Subset Sum and Frequent Item Estimation. CoRR abs/1709.04048 (2017) - 2016
- [c5]Daniel Ting:
Towards Optimal Cardinality Estimation of Unions and Intersections with Sketches. KDD 2016: 1195-1204 - 2014
- [c4]Daniel Ting:
Streamed approximate counting of distinct elements: beating optimal batch methods. KDD 2014: 442-451 - 2013
- [c3]John Mark Agosta, Jaideep Chandrashekar, Mark Crovella, Nina Taft, Daniel Ting:
Mixture models of endhost network traffic. INFOCOM 2013: 225-229 - 2012
- [i2]Michal Valko, Branislav Kveton, Ling Huang, Daniel Ting:
Online Semi-Supervised Learning on Quantized Graphs. CoRR abs/1203.3522 (2012) - [i1]John Mark Agosta, Jaideep Chandrashekar, Mark Crovella, Nina Taft, Daniel Ting:
Mixture Models of Endhost Network Traffic. CoRR abs/1212.2744 (2012) - 2010
- [j2]Daniel Ting, Guoli Wang, Maxim V. Shapovalov, Rajib Mitra, Michael I. Jordan
Neighbor-Dependent Ramachandran Probability Distributions of Amino Acids Developed from a Hierarchical Dirichlet Process Model. PLoS Comput. Biol. 6(4) (2010) - [c2]Daniel Ting, Ling Huang, Michael I. Jordan:
An Analysis of the Convergence of Graph Laplacians. ICML 2010: 1079-1086 - [c1]Michal Valko, Branislav Kveton, Ling Huang, Daniel Ting:
Online Semi-Supervised Learning on Quantized Graphs. UAI 2010: 606-614
2000 – 2009
- 2008
- [j1]Daniel Ting, Stephen E. Fienberg, Mario Trottini
Random orthogonal matrix masking methodology for microdata release. Int. J. Inf. Comput. Secur. 2(1): 86-105 (2008)
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-11-15 19:34 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: