default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikkel Thorup
- > Home > Persons > Mikkel Thorup
Publications
- 2014
[j65]Edith Cohen, Nick G. Duffield
, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Algorithms and estimators for summarization of unaggregated data streams. J. Comput. Syst. Sci. 80(7): 1214-1244 (2014)- 2011
- [j57]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. SIAM J. Comput. 40(5): 1402-1431 (2011) - 2009
- [j54]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. Proc. VLDB Endow. 2(1): 431-442 (2009) - [c83]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Stream sampling for variance-optimal estimation of subset sums. SODA 2009: 1255-1264 - 2008
- [c82]Edith Cohen, Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Confident estimation for multistage measurement sampling and aggregation. SIGMETRICS 2008: 109-120 - [i8]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Variance optimal sampling based estimation of subset sums. CoRR abs/0803.0473 (2008) - 2007
- [j44]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Priority sampling for estimation of arbitrary subset sums. J. ACM 54(6): 32 (2007) - [c76]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Algorithms and estimators for accurate summarization of internet traffic. Internet Measurement Conference 2007: 265-278 - [c75]Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup:
Sketching unaggregated data streams for subpopulation-size queries. PODS 2007: 253-262 - 2005
- [j37]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Learn more, sample less: control of volume and variance in network measurement. IEEE Trans. Inf. Theory 51(5): 1756-1775 (2005) - [j36]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Estimating flow distributions from sampled flow statistics. IEEE/ACM Trans. Netw. 13(5): 933-946 (2005) - [c66]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Optimal Combination of Sampled Network Measurements. Internet Measurement Conference 2005: 91-104 - [c65]Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Estimating arbitrary subset sums with few probes. PODS 2005: 317-325 - [i5]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Sampling to estimate arbitrary subset sums. CoRR abs/cs/0509026 (2005) - 2004
- [c62]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Flow sampling under hard resource constraints. SIGMETRICS 2004: 85-96 - 2003
- [c54]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Estimating flow distributions from sampled flow statistics. SIGCOMM 2003: 325-336 - 2002
- [c43]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Properties and prediction of flow statistics from sampled packet streams. Internet Measurement Workshop 2002: 159-171 - 2001
- [c37]Nick G. Duffield, Carsten Lund, Mikkel Thorup:
Charging from sampled network usage. Internet Measurement Workshop 2001: 245-256
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.
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.
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.
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-07-09 21:32 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:
