| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126360 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6138070 | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147371 | 2024-01-15 | Paper |
| Adaptive Cuckoo Filters | 2023-05-23 | Paper |
| Joint Alignment from Pairwise Differences with a Noisy Oracle | 2023-03-09 | Paper |
| Scheduling with Predictions and the Price of Misprediction | 2023-02-03 | Paper |
| Simple multi-party set reconciliation | 2022-02-15 | Paper |
| When Simple Hash Functions Suffice | 2022-02-04 | Paper |
| Algorithms with Predictions | 2022-02-04 | Paper |
| Dynamic algorithms for LIS and distance to monotonicity | 2021-01-19 | Paper |
| Equitability, interval estimation, and statistical power | 2021-01-12 | Paper |
| Constant time per edge is optimal on rooted tree networks | 2020-12-02 | Paper |
| Load Thresholds for Cuckoo Hashing with Double Hashing | 2020-08-25 | Paper |
| Optimal Learning of Joint Alignments with a Faulty Oracle | 2019-09-21 | Paper |
| Arithmetic Progression Hypergraphs: Examining the Second Moment Method | 2019-09-18 | Paper |
| More Analysis of Double Hashing for Balanced Allocations | 2019-09-17 | Paper |
| A New Approach to Analyzing Robin Hood Hashing | 2019-09-17 | Paper |
| Adaptive Cuckoo Filters | 2019-09-12 | Paper |
| Hierarchical Heavy Hitters with the Space Saving Algorithm | 2019-09-12 | Paper |
| Distance-Sensitive Bloom Filters | 2019-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743386 | 2019-05-10 | Paper |
| Models and algorithms for graph watermarking | 2018-10-18 | Paper |
| An empirical study of the maximal and total information coefficients and leading measures of dependence | 2018-06-26 | Paper |
| Voronoi Choice Games | 2017-12-19 | Paper |
| How useful is old information (extended abstract)? | 2017-09-29 | Paper |
| Predicting Positive and Negative Links with Noisy Queries: Theory & Practice | 2017-09-19 | Paper |
| Designing Floating Codes for Expected Performance | 2017-07-27 | Paper |
| Codes for Deletion and Insertion Channels With Segmented Errors | 2017-07-27 | Paper |
| Detecting Novel Associations in Large Data Sets | 2017-02-15 | Paper |
| Measuring dependence powerfully and equitably | 2017-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2833177 | 2016-11-17 | Paper |
| Practical verified computation with streaming interactive proofs | 2016-10-07 | Paper |
| Hardness of peeling with stashes | 2016-07-27 | Paper |
| Scalable motif-aware graph clustering | 2016-06-20 | Paper |
| Revisiting the COUNTER algorithms for list update | 2016-05-26 | Paper |
| Compressed bloom filters | 2016-03-04 | Paper |
| Analysis of timing-based mutual exclusion with random times | 2015-09-11 | Paper |
| Equitability, interval estimation, and statistical power | 2015-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921670 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191600 | 2014-10-06 | Paper |
| Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket | 2014-09-30 | Paper |
| Optimal plans for aggregation | 2014-07-25 | Paper |
| Improving the performance of invertible Bloom lookup tables | 2014-04-15 | Paper |
| An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets | 2014-02-17 | Paper |
| External-memory multimaps | 2013-11-11 | Paper |
| Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability | 2013-04-19 | Paper |
| Streaming graph computations with a helpful advisor | 2013-03-05 | Paper |
| Anonymous Card Shuffling and Its Applications to Parallel Mixnets | 2012-11-01 | Paper |
| Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified | 2012-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113742 | 2012-01-23 | Paper |
| Detecting Novel Associations in Large Data Sets | 2011-12-16 | Paper |
| External-memory multimaps | 2011-12-16 | Paper |
| Cuckoo Hashing with Pages | 2011-09-16 | Paper |
| An Analysis of Random-Walk Cuckoo Hashing | 2011-07-29 | Paper |
| Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation | 2011-07-07 | Paper |
| Tight Thresholds for Cuckoo Hashing via XORSAT | 2010-09-07 | Paper |
| More Robust Hashing: Cuckoo Hashing with a Stash | 2010-09-06 | Paper |
| Streaming graph computations with a helpful advisor | 2010-09-06 | Paper |
| The Hiring Problem and Lake Wobegon Strategies | 2010-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579408 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579460 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579482 | 2010-08-06 | Paper |
| A survey of results for deletion channels and related synchronization channels | 2010-06-29 | Paper |
| Human-guided search | 2010-05-21 | Paper |
| Bubblesearch: a simple heuristic for improving priority-based greedy algorithms | 2009-12-18 | Paper |
| Some Open Questions Related to Cuckoo Hashing | 2009-10-29 | Paper |
| An Analysis of Random-Walk Cuckoo Hashing | 2009-10-28 | Paper |
| Exhaustive approaches to 2D rectangular perfect packings | 2009-07-21 | Paper |
| Using the Power of Two Choices to Improve Bloom Filters | 2009-04-28 | Paper |
| Capacity Bounds for Sticky Channels | 2009-02-24 | Paper |
| Power Laws for Monkeys Typing Randomly: The Case of Unequal Probabilities | 2008-12-21 | Paper |
| Binary intersymbol interference channels: gallager codes, density evolution, and code performance bounds | 2008-12-21 | Paper |
| Verification-Based Decoding for Packet-Based Low-Density Parity-Check Codes | 2008-12-21 | Paper |
| On the Hardness of Finding Optimal Multiple Preset Dictionaries | 2008-12-21 | Paper |
| A Simple Lower Bound for the Capacity of the Deletion Channel | 2008-12-21 | Paper |
| On Lower Bounds for the Capacity of Deletion Channels | 2008-12-21 | Paper |
| Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the $q$-ary Random Deletion Channel for Large $q$ | 2008-12-21 | Paper |
| Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels | 2008-12-21 | Paper |
| More Robust Hashing: Cuckoo Hashing with a Stash | 2008-11-25 | Paper |
| Less hashing, same performance: Building a better Bloom filter | 2008-09-04 | Paper |
| Less Hashing, Same Performance: Building a Better Bloom Filter | 2008-03-11 | Paper |
| Stochastic Shortest Paths Via Quasi-convex Maximization | 2008-03-11 | Paper |
| An Improved Construction for Counting Bloom Filters | 2008-03-11 | Paper |
| Privacy Preserving Keyword Searches on Remote Encrypted Data | 2007-09-24 | Paper |
| A derandomization using min-wise independent permutations | 2007-04-26 | Paper |
| Editorial: The Future of Power Law Research | 2006-10-12 | Paper |
| New heuristic and interactive approaches to 2D rectangular strip packing | 2006-01-16 | Paper |
| Probability and Computing | 2005-08-05 | Paper |
| Network Applications of Bloom Filters: A Survey | 2005-05-03 | Paper |
| Dynamic Models for File Sizes and Double Pareto Distributions | 2005-05-03 | Paper |
| A Brief History of Generative Models for Power Law and Lognormal Distributions | 2005-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828948 | 2004-11-29 | Paper |
| A scaling result for explosive processes | 2004-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818862 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542556 | 2004-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542543 | 2004-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4406375 | 2004-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768395 | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788604 | 2003-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801182 | 2003-04-07 | Paper |
| Delayed information and action in on-line algorithms | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542551 | 2002-09-17 | Paper |
| Efficient erasure correcting codes | 2002-08-04 | Paper |
| Improved low-density parity-check codes using irregular graphs | 2002-08-04 | Paper |
| Linear waste of best fit bin packing on skewed distributions | 2002-07-01 | Paper |
| Analysis of Timing-Based Mutual Exclusion with Random Times | 2002-04-23 | Paper |
| Towards more complete models of TCP latency and throughput | 2002-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234070 | 2001-08-27 | Paper |
| An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761355 | 2001-05-20 | Paper |
| Analyses of load stealing models based on families of differential equations | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526978 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941821 | 2000-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952676 | 2000-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250194 | 2000-10-17 | Paper |
| Min-wise independent permutations | 2000-08-27 | Paper |
| Average-case analyses of first fit and random fit bin packing | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952672 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250203 | 2000-01-31 | Paper |
| Studying Balanced Allocations with Differential Equations | 2000-01-30 | Paper |
| Parallel randomized load balancing | 1999-12-19 | Paper |
| On the analysis of randomized load balancing schemes | 1999-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252384 | 1999-06-17 | Paper |
| Average case analyses of list update algorithms, with applications to data compression | 1998-11-18 | Paper |
| Bounds on the greedy routing algorithm for array networks | 1997-06-09 | Paper |
| Computational complexity of loss networks | 1994-04-05 | Paper |
