@article{15374,
  abstract     = {Clathrin-mediated endocytosis (CME) is an essential process of cargo uptake operating in all eukaryotes. In animals and yeast, BAR-SH3 domain proteins, endophilins and amphiphysins, function at the conclusion of CME to recruit factors for vesicle scission and uncoating. Arabidopsis thaliana contains the BAR-SH3 domain proteins SH3P1–SH3P3, but their role is poorly understood. Here, we identify SH3Ps as functional homologs of endophilin/amphiphysin. SH3P1–SH3P3 bind to discrete foci at the plasma membrane (PM), and SH3P2 recruits late to a subset of clathrin-coated pits. The SH3P2 PM recruitment pattern is nearly identical to its interactor, a putative uncoating factor, AUXILIN-LIKE1. Notably, SH3P1–SH3P3 are required for most of AUXILIN-LIKE1 recruitment to the PM. This indicates a plant-specific modification of CME, where BAR-SH3 proteins recruit auxilin-like uncoating factors rather than the uncoating phosphatases, synaptojanins. SH3P1–SH3P3 act redundantly in overall CME with the plant-specific endocytic adaptor TPLATE complex but not due to an SH3 domain in its TASH3 subunit.},
  author       = {Adamowski, Maciek and Randuch, Marek and Matijevic, Ivana and Narasimhan, Madhumitha and Friml, Jiří},
  issn         = {2211-1247},
  journal      = {Cell Reports},
  number       = {5},
  publisher    = {Cell Press},
  title        = {{SH3Ps recruit auxilin-like vesicle uncoating factors for clathrin-mediated endocytosis}},
  doi          = {10.1016/j.celrep.2024.114195},
  volume       = {43},
  year         = {2024},
}

@article{17233,
  abstract     = {CRISPR-Cas9 technology has become an essential tool for plant genome editing. Recent advancements have significantly improved the ability to target multiple genes simultaneously within the same genetic background through various strategies. Additionally, there has been significant progress in developing methods for inducible or tissue-specific editing. These advancements offer numerous possibilities for tailored genome modifications. Building upon existing research, we have developed an optimized and modular strategy allowing the targeting of several genes simultaneously in combination with the synchronized expression of the Cas9 endonuclease in the egg cell. This system allows significant editing efficiency while avoiding mosaicism. In addition, the versatile system we propose allows adaptation to inducible and/or tissue-specific edition according to the promoter chosen to drive the expression of the Cas9 gene. Here, we describe a step-by-step protocol for generating the binary vector necessary for establishing Arabidopsis edited lines using a versatile cloning strategy that combines Gateway® and Golden Gate technologies. We describe a versatile system that allows the cloning of as many guides as needed to target DNA, which can be multiplexed into a polycistronic gene and combined in the same construct with sequences for the expression of the Cas9 endonuclease. The expression of Cas9 is controlled by selecting from among a collection of promoters, including constitutive, inducible, ubiquitous, or tissue-specific promoters. Only one vector containing the polycistronic gene (tRNA-sgRNA) needs to be constructed. For that, sgRNA (composed of protospacers chosen to target the gene of interest and sgRNA scaffold) is cloned in tandem with the pre-tRNA sequence. Then, a single recombination reaction is required to assemble the promoter, the zCas9 coding sequence, and the tRNA-gRNA polycistronic gene. Each element is cloned in an entry vector and finally assembled according to the Multisite Gateway® Technology. Here, we detail the process to express zCas9 under the control of egg cell promoter fused to enhancer sequence (EC1.2en-EC1.1p) and to simultaneously target two multiple C2 domains and transmembrane region protein genes (MCTP3 and MCTP4, respectively at3g57880 and at1g51570), using one or two sgRNA per gene.},
  author       = {Li, Ziqiang and Huard, Jennifer and Bayer, Emmanuelle M. and Wattelet-Boyer, Valérie},
  issn         = {2331-8325},
  journal      = {Bio-protocol},
  number       = {13},
  publisher    = {Bio-Protocol},
  title        = {{Versatile cloning strategy for efficient multigene editing in Arabidopsis}},
  doi          = {10.21769/BioProtoc.5029},
  volume       = {14},
  year         = {2024},
}

@article{17191,
  abstract     = {Dendritic cells migrate to and from lymph nodes in response to chemokine gradients.Data now show that steady-state migration of these cells can be triggered by a mechanosensitive pathway.},
  author       = {Lembo, Sergio and Sixt, Michael K},
  issn         = {1529-2916},
  journal      = {Nature Immunology},
  pages        = {1131–1132 },
  publisher    = {Springer Nature},
  title        = {{Nuclear squeezing wakes up dendritic cells}},
  doi          = {10.1038/s41590-024-01881-2},
  volume       = {25},
  year         = {2024},
}

@misc{18716,
  abstract     = {Data for publication 10.1039/d4cp03727h},
  author       = {Hrast, Mateja},
  publisher    = {Zenodo},
  title        = {{Data for: Ab initio Auger spectrum of the ultrafast dissociating 2p3/2−1σ* resonance in HCl}},
  doi          = {10.5281/ZENODO.13833474},
  year         = {2024},
}

@misc{22866,
  author       = {Hrast, Mateja},
  publisher    = {Repository},
  title        = {{Data for: Ab initio Auger spectrum of the ultrafast dissociating 2p3/2−1σ* resonance in HCl}},
  doi          = {10.5281/zenodo.13833474},
  year         = {2024},
}

@article{18109,
  abstract     = {Venous thromboembolism (VTE) is a common, deadly disease with an increasing incidence despite preventive efforts. Clinical observations have associated elevated antibody concentrations or antibody-based therapies with thrombotic events. However, how antibodies contribute to thrombosis is unknown. Here, we show that reduced blood flow enabled immunoglobulin M (IgM) to bind to FcμR and the polymeric immunoglobulin receptor (pIgR), initiating endothelial activation and platelet recruitment. Subsequently, the procoagulant surface of activated platelets accommodated antigen- and FcγR-independent IgG deposition. This leads to classical complement activation, setting in motion a prothrombotic vicious circle. Key elements of this mechanism were present in humans in the setting of venous stasis as well as in the dysregulated immunothrombosis of COVID-19. This antibody-driven thrombosis can be prevented by pharmacologically targeting complement. Hence, our results uncover antibodies as previously unrecognized central regulators of thrombosis. These findings carry relevance for therapeutic application of antibodies and open innovative avenues to target thrombosis without compromising hemostasis.},
  author       = {Stark, Konstantin and Kilani, Badr and Stockhausen, Sven and Busse, Johanna and Schubert, Irene and Tran, Thuy Duong and Gärtner, Florian R and Leunig, Alexander and Pekayvaz, Kami and Nicolai, Leo and Fumagalli, Valeria and Stermann, Julia and Stephan, Felix and David, Christian and Müller, Martin B. and Heyman, Birgitta and Lux, Anja and Da Palma Guerreiro, Alexandra and Frenzel, Lukas P. and Schmidt, Christoph Q. and Dopler, Arthur and Moser, Markus and Chandraratne, Sue and Von Brühl, Marie Luise and Lorenz, Michael and Korff, Thomas and Rudelius, Martina and Popp, Oliver and Kirchner, Marieluise and Mertins, Philipp and Nimmerjahn, Falk and Iannacone, Matteo and Sperandio, Markus and Engelmann, Bernd and Verschoor, Admar and Massberg, Steffen},
  issn         = {1097-4180},
  journal      = {Immunity},
  number       = {9},
  pages        = {2140--2156},
  publisher    = {Elsevier},
  title        = {{Antibodies and complement are key drivers of thrombosis}},
  doi          = {10.1016/j.immuni.2024.08.007},
  volume       = {57},
  year         = {2024},
}

@inproceedings{15008,
  abstract     = {Oblivious routing is a well-studied paradigm that uses static precomputed routing tables for selecting routing paths within a network. Existing oblivious routing schemes with polylogarithmic competitive ratio for general networks are tree-based, in the sense that routing is performed according to a convex combination of trees. However, this restriction to trees leads to a construction that has time quadratic in the size of the network and does not parallelize well. 
In this paper we study oblivious routing schemes based on electrical routing. In particular, we show that general networks with n vertices and m edges admit a routing scheme that has competitive ratio O(log² n) and consists of a convex combination of only O(√m) electrical routings. This immediately leads to an improved construction algorithm with time Õ(m^{3/2}) that can also be implemented in parallel with Õ(√m) depth.},
  author       = {Goranci, Gramoz and Henzinger, Monika H and Räcke, Harald and Sachdeva, Sushant and Sricharan, A. R.},
  booktitle    = {15th Innovations in Theoretical Computer Science Conference},
  isbn         = {9783959773096},
  issn         = {1868-8969},
  location     = {Berkeley, CA, United States},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Electrical flows for polylogarithmic competitive oblivious routing}},
  doi          = {10.4230/LIPIcs.ITCS.2024.55},
  volume       = {287},
  year         = {2024},
}

@article{15408,
  abstract     = {Background: IgE-mediated degranulation of mast cells (MCs) provides rapid protection against environmental hazards, including animal venoms. A fraction of tissue-resident MCs intimately associates with blood vessels. These perivascular MCs were reported to extend projections into the vessel lumen and to be the first MCs to acquire intravenously injected IgE, suggesting that IgE loading of MCs depends on their vascular association.
Objective: We sought to elucidate the molecular basis of the MC–blood vessel interaction and to determine its relevance for IgE-mediated immune responses.
Methods: We selectively inactivated the Itgb1 gene, encoding the β1 chain of integrin adhesion molecules (ITGB1), in MCs by conditional gene targeting in mice. We analyzed skin MCs for blood vessel association, surface IgE density, and capability to bind circulating antibody specific for MC surface molecules, as well as in vivo responses to antigen administered via different routes.
Results: Lack of ITGB1 expression severely compromised MC–blood vessel association. ITGB1-deficient MCs showed normal densities of surface IgE but reduced binding of intravenously injected antibodies. While their capacity to degranulate in response to IgE ligation in vivo was unimpaired, anaphylactic responses to antigen circulating in the vasculature were largely abolished.
Conclusions: ITGB1-mediated association of MCs with blood vessels is key for MC immune surveillance of blood vessel content, but is dispensable for slow steady-state loading of endogenous IgE onto tissue-resident MCs.},
  author       = {Link, Kristina and Muhandes, Lina and Polikarpova, Anastasia and Lämmermann, Tim and Sixt, Michael K and Fässler, Reinhard and Roers, Axel},
  issn         = {1097-6825},
  journal      = {Journal of Allergy and Clinical Immunology},
  number       = {3},
  pages        = {745--753},
  publisher    = {Elsevier},
  title        = {{Integrin β1–mediated mast cell immune-surveillance of blood vessel content}},
  doi          = {10.1016/j.jaci.2024.03.022},
  volume       = {154},
  year         = {2024},
}

@article{14933,
  abstract     = {Centrioles are part of centrosomes and cilia, which are microtubule organising centres (MTOC) with diverse functions. Despite their stability, centrioles can disappear during differentiation, such as in oocytes, but little is known about the regulation of their structural integrity. Our previous research revealed that the pericentriolar material (PCM) that surrounds centrioles and its recruiter, Polo kinase, are downregulated in oogenesis and sufficient for maintaining both centrosome structural integrity and MTOC activity. We now show that the expression of specific components of the centriole cartwheel and wall, including ANA1/CEP295, is essential for maintaining centrosome integrity. We find that Polo kinase requires ANA1 to promote centriole stability in cultured cells and eggs. In addition, ANA1 expression prevents the loss of centrioles observed upon PCM-downregulation. However, the centrioles maintained by overexpressing and tethering ANA1 are inactive, unlike the MTOCs observed upon tethering Polo kinase. These findings demonstrate that several centriole components are needed to maintain centrosome structure. Our study also highlights that centrioles are more dynamic than previously believed, with their structural stability relying on the continuous expression of multiple components.},
  author       = {Pimenta-Marques, Ana and Perestrelo, Tania and Dos Reis Rodrigues, Patricia and Duarte, Paulo and Ferreira-Silva, Ana and Lince-Faria, Mariana and Bettencourt-Dias, Mónica},
  issn         = {1469-3178},
  journal      = {EMBO Reports},
  number       = {1},
  pages        = {102--127},
  publisher    = {Embo Press},
  title        = {{Ana1/CEP295 is an essential player in the centrosome maintenance program regulated by Polo kinase and the PCM}},
  doi          = {10.1038/s44319-023-00020-6},
  volume       = {25},
  year         = {2024},
}

@inproceedings{14769,
  abstract     = {For a set of points in Rd, the Euclidean k-means problems consists of finding k centers such that the sum of distances squared from each data point to its closest center is minimized. Coresets are one the main tools developed recently to solve this problem in a big data context. They allow to compress the initial dataset while preserving its structure: running any algorithm on the coreset provides a guarantee almost equivalent to running it on the full data. In this work, we study coresets in a fully-dynamic setting: points are added and deleted with the goal to efficiently maintain a coreset with which a k-means solution can be computed. Based on an algorithm from Henzinger and Kale [ESA'20], we present an efficient and practical implementation of a fully dynamic coreset algorithm, that improves the running time by up to a factor of 20 compared to our non-optimized implementation of the algorithm by Henzinger and Kale, without sacrificing more than 7% on the quality of the k-means solution.},
  author       = {Henzinger, Monika H and Saulpic, David and Sidl, Leonhard},
  booktitle    = {2024 Proceedings of the Symposium on Algorithm Engineering and Experiments},
  location     = {Alexandria, VA, United States},
  pages        = {220--233},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Experimental evaluation of fully dynamic k-means via coresets}},
  doi          = {10.1137/1.9781611977929.17},
  year         = {2024},
}

@article{17279,
  abstract     = {In a recent issue of Cell, Zhang et al.1 demonstrate that mechanical features of a solid tumor can drive T cells into dysfunctionality and identify pathways that revert this “exhausted” state.},
  author       = {Avellaneda Sarrió, Mario and Sixt, Michael K},
  issn         = {2451-9448},
  journal      = {Cell Chemical Biology},
  number       = {7},
  pages        = {1242--1243},
  publisher    = {Elsevier},
  title        = {{Rescuing T cells from stiff tumors}},
  doi          = {10.1016/j.chembiol.2024.06.011},
  volume       = {31},
  year         = {2024},
}

@inproceedings{18557,
  abstract     = {Broadcast and Consensus are most fundamental tasks in distributed computing. These tasks are particularly challenging in dynamic networks where communication across the network links may be unreliable, e.g., due to mobility or failures. Over the last years, researchers have derived several impossibility results and high time complexity lower bounds for these tasks. Specifically for the setting where in each round of communication the adversary is allowed to choose one rooted tree along which the information is disseminated, there is a lower as well as an upper bound that is linear in the number n of nodes for Broadcast and for n ≥ 3 the adversary can guarantee that Consensus never happens. This setting is called the oblivious message adversary for rooted trees. Also note that if the adversary is allowed to choose a graph that does not contain a rooted tree, then it can guarantee that Broadcast and Consensus will never happen. However, such deterministic adversarial models may be overly pessimistic, as many processes in real-world settings are stochastic in nature rather than worst-case. This paper studies Broadcast on stochastic dynamic networks and shows that the situation is very different to the deterministic case. In particular, we show that if information dissemination occurs along random rooted trees and directed Erdős–Rényi graphs, Broadcast completes in O(log n) rounds of communication with high probability. The fundamental insight in our analysis is that key variables are mutually independent. We then study two adversarial models, (a) one with Byzantine nodes and (b) one where an adversary controls the edges. (a) Our techniques without Byzantine nodes are general enough so that they can be extended to Byzantine nodes. (b) In the spirit of smoothed analysis, we introduce the notion of randomized oblivious message adversary, where in each round, an adversary picks k ≤ 2n/3 edges to appear in the communication network, and then a graph (e.g. rooted tree or directed Erdős–Rényi graph) is chosen uniformly at random among the set of all such graphs that include these edges. We show that Broadcast completes in a finite number of rounds, which is, e.g., O(k+log n) rounds in rooted trees. We then extend these results to All-to-All Broadcast, and Consensus, and give lower bounds that show that most of our upper bounds are tight.},
  author       = {El-Hayek, Antoine and Henzinger, Monika H and Schmid, Stefan},
  booktitle    = {38th International Symposium on Distributed Computing},
  isbn         = {9783959773522},
  issn         = {1868-8969},
  location     = {Madrid, Spain},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges}},
  doi          = {10.4230/LIPIcs.DISC.2024.21},
  volume       = {319},
  year         = {2024},
}

@inproceedings{18156,
  abstract     = {Privately counting distinct elements in a stream is a fundamental data analysis problem with many applications in machine learning. In the turnstile model, Jain et al. [NeurIPS2023] initiated the study of this problem parameterized by the maximum flippancy of any element, i.e., the number of times that the count of an element changes from 0 to above 0 or vice versa. They give an item-level (ε,δ)-differentially private algorithm whose additive error is tight with respect to that parameterization. In this work, we show that a very simple algorithm based on the sparse vector technique achieves a tight additive error for item-level (ε,δ)-differential privacy and item-level ε-differential privacy with regards to a different parameterization, namely the sum of all flippancies. Our second result is a bound which shows that for a large class of algorithms, including all existing differentially private algorithms for this problem, the lower bound from item-level differential privacy extends to event-level differential privacy. This partially answers an open question by Jain et al. [NeurIPS2023].},
  author       = {Henzinger, Monika H and Sricharan, A. R. and Steiner, Teresa Anna},
  booktitle    = {International Conference on Approximation Algorithms for Combinatorial Optimization Problems },
  isbn         = {9783959773485},
  issn         = {1868-8969},
  location     = {London, United Kingdom},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Private counting of distinct elements in the turnstile model and extensions}},
  doi          = {10.4230/LIPIcs.APPROX/RANDOM.2024.40},
  volume       = {317},
  year         = {2024},
}

@inproceedings{18308,
  abstract     = {We study in this paper the problem of maintaining a solution to k-median and k-means clustering in a fully dynamic setting. To do so, we present an algorithm to efficiently maintain a coreset, a compressed version of the dataset, that allows easy computation of a clustering solution at query time. Our coreset algorithm has near-optimal update time of Õ(k) in general metric spaces, which reduces to Õ(d) in the Euclidean space ℝ^d. The query time is O(k²) in general metrics, and O(kd) in ℝ^d. To maintain a constant-factor approximation for k-median and k-means clustering in Euclidean space, this directly leads to an algorithm with update time Õ(d), and query time Õ(kd + k²). To maintain a O(polylog k)-approximation, the query time is reduced to Õ(kd).},
  author       = {La Tour, Max Dupré and Henzinger, Monika H and Saulpic, David},
  booktitle    = {32nd Annual European Symposium on Algorithms},
  isbn         = {9783959773386},
  issn         = {1868-8969},
  location     = {London, United Kingdom},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Fully dynamic k-means coreset in near-optimal update time}},
  doi          = {10.4230/LIPIcs.ESA.2024.100},
  volume       = {308},
  year         = {2024},
}

@inproceedings{18309,
  abstract     = {The problem of designing connectivity oracles supporting vertex failures is one of the basic data structures problems for undirected graphs. It is already well understood: previous works [Duan-Pettie STOC'10; Long-Saranurak FOCS'22] achieve query time linear in the number of failed vertices, and it is conditionally optimal as long as we require preprocessing time polynomial in the size of the graph and update time polynomial in the number of failed vertices. We revisit this problem in the paradigm of algorithms with predictions: we ask if the query time can be improved if the set of failed vertices can be predicted beforehand up to a small number of errors. More specifically, we design a data structure that, given a graph G = (V,E) and a set of vertices predicted to fail D̂ ⊆ V of size d = |D̂|, preprocesses it in time Õ(d|E|) and then can receive an update given as the symmetric difference between the predicted and the actual set of failed vertices D̂△D = (D̂ ⧵ D) ∪ (D ⧵ D̂) of size η = |D̂△D|, process it in time Õ(η⁴), and after that answer connectivity queries in G ⧵ D in time O(η). Viewed from another perspective, our data structure provides an improvement over the state of the art for the fully dynamic subgraph connectivity problem in the sensitivity setting [Henzinger-Neumann ESA'16]. We argue that the preprocessing time and query time of our data structure are conditionally optimal under standard fine-grained complexity assumptions.},
  author       = {Hu, Bingbing and Kosinas, Evangelos and Polak, Adam},
  booktitle    = {32nd Annual European Symposium on Algorithms},
  isbn         = {9783959773386},
  issn         = {1868-8969},
  location     = {London, United Kingdom},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Connectivity oracles for predictable vertex failures}},
  doi          = {10.4230/LIPIcs.ESA.2024.72},
  volume       = {308},
  year         = {2024},
}

@inproceedings{18115,
  abstract     = {We study the data selection problem, whose aim is to select a small representative subset of data that can be used to efficiently train a machine learning model. We present a new data selection approach based on k-means clustering and sensitivity sampling. Assuming access to an embedding representation of the data with respect to which the model loss is Holder continuous, our approach provably allows selecting a set of “typical” k+1/ε2 elements whose average loss corresponds to the average loss of the whole dataset, up to a multiplicative (1±ε)
 factor and an additive ελΦk, where Φk represents the k-means cost for the input embeddings and λ is the Holder constant. We furthermore demonstrate the performance and scalability of our approach on fine-tuning foundation models and show that it outperforms state-of-the-art methods. We also show how it can be applied on linear regression, leading to a new sampling strategy that surprisingly matches the performance of leverage score sampling, while being conceptually simpler and more scalable.},
  author       = {Axiotis, Kyriakos and Cohen-Addad, Vincent and Henzinger, Monika H and Jerome, Sammy and Mirrokni, Vahab and Saulpic, David and Woodruff, David P. and Wunder, Michael},
  booktitle    = {Proceedings of the 41st International Conference on Machine Learning},
  issn         = {2640-3498},
  location     = {Vienna, Austria},
  pages        = {2086--2107},
  publisher    = {ML Research Press},
  title        = {{Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond}},
  volume       = {235},
  year         = {2024},
}

@inproceedings{18503,
  abstract     = {In 1996, Karger [Kar96] gave a startling randomized algorithm that finds a minimum-cut in a (weighted) graph in time O(m log3 n) which he termed near-linear time meaning linear (in the size of the input) times a polylogarthmic factor. In this paper, we give the first deterministic algorithm which runs in near-linear time for weighted graphs.
Previously, the breakthrough results of Kawarabayashi and Thorup [KT19] gave a near-linear time algorithm for simple graphs (which was improved to have running time O(m log2 n log log n) in [HRW20].) The main technique here is a clustering procedure that perfectly preserves minimum cuts. Recently, Li [Li21] gave an m1+o(1) deterministic minimum-cut algorithm for weighted graphs; this form of running time has been termed “almost-linear”. Li uses almost-linear time deterministic expander decompositions which do not perfectly preserve minimum cuts, but he can use these clusterings to, in a sense, “derandomize” the methods of Karger.
In terms of techniques, we provide a structural theorem that says there exists a sparse clustering that preserves minimum cuts in a weighted graph with o(1) error. In addition, we construct it deterministically in near linear time. This was done exactly for simple graphs in [KT19, HRW20] and with polylogarithmic error for weighted graphs in [Li21]. Extending the techniques in [KT19, HRW20] to weighted graphs presents significant challenges, and moreover, the algorithm can only polylogarithmically approximately preserve minimum cuts. A remaining challenge is to reduce the polylogarithmic-approximate clusterings to 1 + o(1/ log n)-approximate so that they can be applied recursively as in [Li21] over O(log n) many levels. This is an additional challenge that requires building on properties of tree-packings in the presence of a wide range of edge weights to, for example, find sources for local flow computations which identify minimum cuts that cross clusters.},
  author       = {Henzinger, Monika H and Li, Jason and Rao, Satish and Wang, Di},
  booktitle    = {35th Annual ACM-SIAM Symposium on Discrete Algorithms},
  location     = {Alexandria, VA,  United States},
  pages        = {3089--3139},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Deterministic near-linear time minimum cut in weighted graphs}},
  doi          = {10.1137/1.9781611977912.111},
  year         = {2024},
}

@inproceedings{18116,
  abstract     = {As a staple of data analysis and unsupervised learning, the problem of private clustering has been widely studied, under various privacy models. Centralized differential privacy is the first of them, and the problem has also been studied for the local and the shuffle variation. In each case, the goal is to design an algorithm that computes privately a clustering, with the smallest possible error. The study of each variation gave rise to new algorithm: the landscape of private clustering algorithm is therefore quite intricate. In this paper, we show that a 20 year-old algorithm can be slightly modified to work for any of those models. This provides a unified picture: while matching almost all previously known results, it allows us to improve some of them, and extend to a new privacy model, the continual observation setting, where the input is changing over time and the algorithm must output a new solution at each time step.},
  author       = {La Tour, Max Dupré and Henzinger, Monika H and Saulpic, David},
  booktitle    = {Proceedings of the 41st International Conference on Machine Learning},
  issn         = {2640-3498},
  location     = {Vienna, Austria},
  pages        = {12046--12086},
  publisher    = {ML Research Press},
  title        = {{Making old things new: A unified algorithm for differentially private clustering}},
  volume       = {235},
  year         = {2024},
}

@inproceedings{15253,
  abstract     = {We study the problem of maintaining a differentially private decaying sum under continual observation. We give a unifying framework and an efficient algorithm for this problem for any sufficiently smooth function. Our algorithm is the first differentially private algorithm that does not have a multiplicative error for polynomially decaying weights. Our algorithm improves on all prior works on differentially private decaying sums under continual observation and recovers exactly the additive error for the special case of continual counting from Henzinger et al. (SODA 2023) as a corollary.
Our algorithm is a variant of the matrix mechanism whose error depends on the γ2 and γF norm of the underlying matrix. We give a constructive proof for an almost exact upper bound on the γ2 and γF norm and an almost tight lower bound on the γ2 norm for a large class of lower-triangular matrices. This is the first non-trivial lower bound for lower-triangular matrices whose non-zero entries are not all the same. It includes matrices for all continual decaying sums problems, resulting in an upper bound on the additive error of any differentially private decaying sums algorithm under continual observation.
We also explore some implications of our result in discrepancy theory and operator algebra. Given the importance of the γ2 norm in computer science and the extensive work in mathematics, we believe our result will have further applications.},
  author       = {Henzinger, Monika H and Upadhyay, Jalaj and Upadhyay, Sarvagya},
  booktitle    = {Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms},
  location     = {Alexandria, VA, United States},
  pages        = {995--1018},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{A unifying framework for differentially private sums under continual observation}},
  doi          = {10.1137/1.9781611977912.38},
  volume       = {2024},
  year         = {2024},
}

@inproceedings{18928,
  abstract     = {Algorithms with predictions is a new research direction that leverages machine learned predictions for algorithm design. So far a plethora of recent works have incorporated predictions to improve on worst-case bounds for online problems. In this paper, we initiate the study of complexity of dynamic data structures with predictions, including dynamic graph algorithms. Unlike online algorithms, the goal in dynamic data structures is to maintain the solution efficiently with every update.
We investigate three natural models of prediction: (1) δ-accurate predictions where each predicted request matches the true request with probability δ, (2) list-accurate predictions where a true request comes from a list of possible requests, and (3) bounded delay predictions where the true requests are a permutation of the predicted requests. We give general reductions among the prediction models, showing that bounded delay is the strongest prediction model, followed by list-accurate, and δ-accurate.
Further, we identify two broad problem classes based on lower bounds due to the Online Matrix Vector (OMv) conjecture. Specifically, we show that locally correctable dynamic problems have strong conditional lower bounds for list-accurate predictions that are equivalent to the non-prediction setting, unless list-accurate predictions are perfect. Moreover, we show that locally reducible dynamic problems have time complexity that degrades gracefully with the quality of bounded delay predictions. We categorize problems with known OMv lower bounds accordingly and give several upper bounds in the delay model that show that our lower bounds are almost tight.
We note that concurrent work by v.d.Brand et al. [SODA '24] and Liu and Srinivas [arXiv:2307.08890] independently study dynamic graph algorithms with predictions, but their work is mostly focused on showing upper bounds.},
  author       = {Henzinger, Monika H and Saha, Barna and Seybold, Martin P. and Ye, Christopher},
  booktitle    = {15th Innovations in Theoretical Computer Science Conference},
  isbn         = {9783959773096},
  issn         = {1868-8969},
  location     = {Berkeley, CA, United States},
  pages        = {62:1--62:25},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{On the complexity of algorithms with predictions for dynamic graph problems}},
  doi          = {10.4230/LIPIcs.ITCS.2024.62},
  volume       = {287},
  year         = {2024},
}