UB Paderborn / Katalog / Suche / in CDI

A survey of results for deletion channels and related synchronization channels

Probability surveys, 2009-01, Vol.6 (none)

Mitzenmacher, Michael

2009

Volltextzugriff (PDF)

A Brief History of Generative Models for Power Law and Lognormal Distributions

Internet mathematics, 2004-01, Vol.1 (2), p.226-251

Mitzenmacher, Michael

2004

Volltextzugriff (PDF)

Privacy preserving keyword searches on remote encrypted data

Lecture notes in computer science, 2005, p.442-455

2005

Volltextzugriff (PDF)

Detecting Novel Associations in Large Data Sets

Science (American Association for the Advancement of Science), 2011-12, Vol.334 (6062), p.1518-1524

2011

Volltextzugriff (PDF)

Network Applications of Bloom Filters: A Survey

Internet mathematics, 2004-01, Vol.1 (4), p.485-509

2004

Volltextzugriff (PDF)

AN EMPIRICAL STUDY OF THE MAXIMAL AND TOTAL INFORMATION COEFFICIENTS AND LEADING MEASURES OF DEPENDENCE

The annals of applied statistics, 2018-03, Vol.12 (1), p.123-155

2018

Volltextzugriff (PDF)

Edge-colored directed subgraph enumeration on the connectome

Scientific reports, 2022-07, Vol.12 (1), p.11349-11349, Article 11349

2022

Volltextzugriff (PDF)

Cleaning up the record on the maximal information coefficient and equitability

Proceedings of the National Academy of Sciences - PNAS, 2014-08, Vol.111 (33), p.E3362-E3363

2014

Volltextzugriff (PDF)

Editorial: The Future of Power Law Research

Internet mathematics, 2005-01, Vol.2 (4), p.525-534

Mitzenmacher, Michael

2005

Volltextzugriff (PDF)

Simple multi-party set reconciliation

Distributed computing, 2018-11, Vol.31 (6), p.441-453

2018

Volltextzugriff (PDF)

Less hashing, same performance: Building a better Bloom filter

Random structures & algorithms, 2008-09, Vol.33 (2), p.187-218

2008

Volltextzugriff (PDF)

Compressed Bloom filters

IEEE/ACM transactions on networking, 2002-10, Vol.10 (5), p.604-612

Mitzenmacher, M.

2002

Volltextzugriff (PDF)

Leveraging parameterized Chernoff bounds for simplified algorithm analyses

Information processing letters, 2025-01, Vol.187, p.106516, Article 106516

2025

Volltextzugriff (PDF)

The Supermarket Model With Known and Predicted Service Times

IEEE transactions on parallel and distributed systems, 2022-11, Vol.33 (11), p.2740-2751

2022

Volltextzugriff (PDF)

An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets

Journal of the ACM, 2012-06, Vol.59 (3), p.1-22

2012

Volltextzugriff (PDF)

Joint Alignment From Pairwise Differences with a Noisy Oracle

Internet mathematics, 2020-12

2020

Volltextzugriff (PDF)

EMOMA: Exact Match in One Memory Access

IEEE transactions on knowledge and data engineering, 2018-11, Vol.30 (11), p.2120-2133

2018

Volltextzugriff (PDF)

Stochastic Shortest Paths Via Quasi-convex Maximization

Algorithms – ESA 2006, 2006, p.552-563

2006

Volltextzugriff (PDF)

Algorithms and Models for the Web Graph: 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings

2013, 2013

Volltextzugriff (PDF)

Dynamic algorithms for LIS and distance to monotonicity

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, p.671-684

2020

Volltextzugriff (PDF)

Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation

Automata, Languages and Programming, p.576-587

Volltextzugriff (PDF)

Adaptive Cuckoo Filters

The ACM journal of experimental algorithmics, 2020-12, Vol.25, p.1-20, Article 1.1

2020

Volltextzugriff (PDF)

Metric Sublinear Algorithms via Linear Sampling

2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, p.11-22

2018

Volltextzugriff (PDF)

Hardness of peeling with stashes

Information processing letters, 2016-11, Vol.116 (11), p.682-688

2016

Volltextzugriff (PDF)

Network Coding Meets TCP: Theory and Implementation

Proceedings of the IEEE, 2011-03, Vol.99 (3), p.490-512

2011

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

A survey of results for deletion channels and related synchronization channels

A Brief History of Generative Models for Power Law and Lognormal Distributions

Privacy preserving keyword searches on remote encrypted data

Detecting Novel Associations in Large Data Sets

Network Applications of Bloom Filters: A Survey

AN EMPIRICAL STUDY OF THE MAXIMAL AND TOTAL INFORMATION COEFFICIENTS AND LEADING MEASURES OF DEPENDENCE

Edge-colored directed subgraph enumeration on the connectome

Cleaning up the record on the maximal information coefficient and equitability

Editorial: The Future of Power Law Research

Simple multi-party set reconciliation

Less hashing, same performance: Building a better Bloom filter

Compressed Bloom filters

Leveraging parameterized Chernoff bounds for simplified algorithm analyses

The Supermarket Model With Known and Predicted Service Times

An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets

Joint Alignment From Pairwise Differences with a Noisy Oracle

EMOMA: Exact Match in One Memory Access

Stochastic Shortest Paths Via Quasi-convex Maximization

Algorithms and Models for the Web Graph: 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings

Dynamic algorithms for LIS and distance to monotonicity

Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation

Adaptive Cuckoo Filters

Metric Sublinear Algorithms via Linear Sampling

Hardness of peeling with stashes

Network Coding Meets TCP: Theory and Implementation

Suchergebnisse filtern