| Publication | Date of Publication | Type |
|---|
| Bucket oblivious sort: an extremely simple oblivious sort | 2024-05-14 | Paper |
| Generalized sorting with predictions revisited | 2024-02-28 | Paper |
| Max-min greedy matching problem: hardness for the adversary and fractional variant | 2024-02-28 | Paper |
| Max-min greedy matching problem: hardness for the adversary and fractional variant | 2024-01-16 | Paper |
| A theory of composition for differential obliviousness | 2023-12-12 | Paper |
| Game-theoretically secure protocols for the ordinal random assignment problem | 2023-11-10 | Paper |
| Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions. | 2023-07-03 | Paper |
| Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms | 2023-07-03 | Paper |
| Foundations of Differentially Oblivious Algorithms | 2023-04-27 | Paper |
| On the hardness of opinion dynamics optimization with \(L_1\)-budget on varying susceptibility to persuasion | 2023-03-30 | Paper |
| Communication complexity of Byzantine agreement, revisited | 2023-03-14 | Paper |
| MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture | 2023-02-03 | Paper |
| Game-theoretic fairness meets multi-party protocols: the case of leader election | 2022-04-22 | Paper |
| Locality-preserving oblivious RAM | 2022-03-03 | Paper |
| Sublinear-round Byzantine agreement under corrupt majority | 2021-12-01 | Paper |
| Influence maximization under the non-progressive linear threshold model | 2021-07-08 | Paper |
| A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics | 2021-05-03 | Paper |
| Communication Complexity of Byzantine Agreement, Revisited | 2021-01-20 | Paper |
| Optimizing social welfare for network bargaining games in the face of instability, greed and idealism | 2020-08-26 | Paper |
| Online Submodular Maximization Problem with Vector Packing Constraint. | 2020-05-27 | Paper |
| Locality-preserving oblivious RAM | 2020-02-06 | Paper |
| Foundations of Differentially Oblivious Algorithms | 2019-10-15 | Paper |
| Diffusion operator and spectral analysis for directed hypergraph Laplacian | 2019-08-13 | Paper |
| Online Submodular Maximization with Free Disposal | 2019-03-28 | Paper |
| More is less: perfectly secure oblivious algorithms in the multi-server setting | 2019-01-23 | Paper |
| Path ORAM | 2018-12-06 | Paper |
| Spectral Properties of Hypergraph Laplacian and Approximation Algorithms | 2018-12-06 | Paper |
| Perfectly secure oblivious parallel RAM | 2018-12-06 | Paper |
| Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity | 2018-11-13 | Paper |
| Distributed Private Data Analysis | 2018-11-12 | Paper |
| Reducing Curse of Dimensionality | 2018-11-12 | Paper |
| On Hierarchical Routing in Doubling Metrics | 2018-11-05 | Paper |
| SDP primal-dual approximation algorithms for directed hypergraph expansion and sparsest cut with product demands | 2018-10-04 | Paper |
| On \((1, \epsilon )\)-restricted max-min fair allocation problem | 2018-07-25 | Paper |
| On the depth of oblivious parallel RAM | 2018-04-06 | Paper |
| Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM | 2018-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608037 | 2018-03-15 | Paper |
| Beating ratio 0.5 for weighted oblivious matching problems | 2018-03-02 | Paper |
| Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs | 2018-01-19 | Paper |
| Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order | 2017-10-05 | Paper |
| New Doubling Spanners: Better and Simpler | 2017-01-13 | Paper |
| Fast convergence for consensus in dynamic networks | 2016-04-11 | Paper |
| On the Complexity of the Minimum Independent Set Partition Problem | 2015-10-29 | Paper |
| Cheeger Inequalities for General Edge-Weighted Directed Graphs | 2015-10-29 | Paper |
| Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree | 2015-03-02 | Paper |
| An SDP primal-dual algorithm for approximating the Lovász-theta function | 2014-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417622 | 2014-05-22 | Paper |
| Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree | 2013-08-12 | Paper |
| New Doubling Spanners: Better and Simpler | 2013-08-06 | Paper |
| Privacy-Preserving Stream Aggregation with Fault Tolerance | 2012-11-09 | Paper |
| Optimal Lower Bound for Differentially Private Multi-party Aggregation | 2012-09-25 | Paper |
| Optimizing Social Welfare for Network Bargaining Games in the Face of Unstability, Greed and Spite | 2012-09-25 | Paper |
| Approximating TSP on metrics with bounded global growth | 2012-09-12 | Paper |
| Oblivious RAM with O((logN)3) Worst-Case Cost | 2011-12-02 | Paper |
| A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics | 2011-11-25 | Paper |
| Fast Convergence for Consensus in Dynamic Networks | 2011-07-07 | Paper |
| Private and Continual Release of Statistics | 2010-09-07 | Paper |
| Small hop-diameter sparse spanners for doubling metrics | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579379 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579397 | 2010-08-06 | Paper |
| Ultra-low-dimensional embeddings for doubling metrics | 2010-07-14 | Paper |
| Metric Embeddings with Relaxed Guarantees | 2010-01-06 | Paper |
| Small hop-diameter sparse spanners for doubling metrics | 2009-03-24 | Paper |
| Spanners with Slack | 2008-03-11 | Paper |
| A Tight Lower Bound for the Steiner Point Removal Problem on Trees | 2007-08-28 | Paper |
