Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Mitzenmacher, Michael"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improving the performance of invertible Bloom Lookup Tables
Salvatore Pontarelli
,
Pedro Reviriego
,
Michael Mitzenmacher
Information Processing Letters
114
(4), 2014, pp. 185-191
External-memory multimaps
Elaine Angelino
,
Michael T. Goodrich
,
Michael Mitzenmacher
,
Justin Thaler
Algorithmica
67
(1), 2013, pp. 23-48
Streaming graph computations with a helpful advisor
Graham Cormode
,
Michael Mitzenmacher
,
Justin Thaler
Algorithmica
65
(2), 2013, pp. 409-442
Chernoff-Hoeffding bounds for Markov chains: Generalized and simplified
Kai-Min Chung
,
Henry Lam
,
Zhenming Liu
,
Michael Mitzenmacher
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 124-135
Anonymous card shuffling and its applications to parallel mixnets
Michael T. Goodrich
,
Michael Mitzenmacher
Lecture Notes in Computer Science
7392
, 2012, pp. 549-560
An efficient rigorous approach for identifying statistically significant frequent itemsets
Adam Kirsch
,
Michael Mitzenmacher
,
Andrea Pietracaprina
,
Geppino Pucci
,
Eli Upfal
,
Fabio Vandin
Journal of the ACM
59
(3), 2012, pp. 12: 1-22
External-memory multimaps
Elaine Angelino
,
Michael T. Goodrich
,
Michael Mitzenmacher
,
Justin Thaler
Lecture Notes in Computer Science
7074
, 2011, pp. 384-394
Cuckoo hashing with pages
Martin Dietzfelbinger
,
Michael Mitzenmacher
,
Michael Rink
Lecture Notes in Computer Science
6942
, 2011, pp. 615-627
An analysis of random-walk cuckoo hashing
Alan Frieze
,
Páll Melsted
,
Michael Mitzenmacher
SIAM Journal on Computing
40
(2), 2011, pp. 291-308
Privacy-preserving access of outsourced data via oblivious RAM simulation
Michael T. Goodrich
,
Michael Mitzenmacher
Lecture Notes in Computer Science
6756
, 2011, pp. 576-587
Large-scale multimaps
Michael T. Goodrich
,
Michael Mitzenmacher
Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011)
, 2011, pp. 259-260
AMS without 4-wise independence on product domains
Vladimir Braverman
,
Kai-Min Chung
,
Zhenming Liu
,
Michael Mitzenmacher
,
Rafail Ostrovsky
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 119-130
Streaming graph computations with a helpful advisor
Graham Cormode
,
Michael Mitzenmacher
,
Justin Thaler
Lecture Notes in Computer Science
6346
, 2010, pp. 231-242
Tight thresholds for cuckoo hashing via XORSAT
Martin Dietzfelbinger
,
Andreas Goerdt
,
Michael Mitzenmacher
,
Andrea Montanari
,
Rasmus Pagh
,
Michael Rink
Lecture Notes in Computer Science
6198
, 2010, pp. 213-225
The hiring problem and Lake Wobegon strategies
Andrei Z. Broder
,
Adam Kirsch
,
Ravi Kumar
,
Michael Mitzenmacher
,
Eli Upfal
,
Sergei Vassilvitskii
SIAM Journal on Computing
39
(4), 2009-2010, pp. 1233-1255
More robust hashing: Cuckoo hashing with a stash
Adam Kirsch
,
Michael Mitzenmacher
,
Udi Wieder
SIAM Journal on Computing
39
(4), 2009-2010, pp. 1543-1561
Some open questions related to cuckoo hashing
Michael Mitzenmacher
Lecture Notes in Computer Science
5757
, 2009, pp. 1-10
More robust hashing: Cuckoo hashing with a stash
Adam Kirsch
,
Michael Mitzenmacher
,
Udi Wieder
Lecture Notes in Computer Science
5193
, 2008, pp. 611-622
A survey of results for deletion channels and related synchronization channels
Michael Mitzenmacher
Lecture Notes in Computer Science
5124
, 2008, pp. 1-3
An improved construction for counting Bloom filters
Flavio Bonomi
,
Michael Mitzenmacher
,
Rina Panigrahy
,
Sushil Singh
,
George Varghese
Lecture Notes in Computer Science
4168
, 2006, pp. 684-695
Less hashing, same performance: Building a better Bloom filter
Adam Kirsch
,
Michael Mitzenmacher
Lecture Notes in Computer Science
4168
, 2006, pp. 456-467
Stochastic shortest paths via quasi-convex maximization
Evdokia Nikolova
,
Jonathan A. Kelner
,
Matthew Brand
,
Michael Mitzenmacher
Lecture Notes in Computer Science
4168
, 2006, pp. 552-563
Geometric generalizations of the power of two choices
John W. Byers
,
Jeffrey Considine
,
Michael Mitzenmacher
Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2004 (Barcelona, Spain, June 27-30, 2004)
, 2004, pp. 54-63
A complete and effective move set for simplified protein folding
Neal Lesh
,
Michael Mitzenmacher
,
Sue Whitesides
Proceedings of the 7th Annual International Conference on Research in Computational Molecular Biology, RECOMB'2003 (Berlin, Germany, April 10-13, 2003)
, 2003, pp. 188-195
Load balancing with memory
Michael Mitzenmacher
,
Balaji Prabhakar
,
Devavrat Shah
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 799-808
Seiten 1
2
3
>