@arXiv_csDS_bot@mastoxiv.page2026-02-10 21:08:46
Replaced article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
Vladimir Braverman, Prathamesh Dharangutte, Shreyas Pai, Vihan Shah, Chen Wang
https://arxiv.org/abs/2411.09979 https://mastoxiv.page/@arXiv_csDS_bot/113502653187863544
- A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
William Kuszmaul
https://arxiv.org/abs/2501.03488 https://mastoxiv.page/@arXiv_csDS_bot/113791396712128907
- The Structural Complexity of Matrix-Vector Multiplication
Emile Anand, Jan van den Brand, Rose McCarty
https://arxiv.org/abs/2502.21240 https://mastoxiv.page/@arXiv_csDS_bot/114097340825270885
- Clustering under Constraints: Efficient Parameterized Approximation Schemes
Sujoy Bhore, Ameet Gadekar, Tanmay Inamdar
https://arxiv.org/abs/2504.06980 https://mastoxiv.page/@arXiv_csDS_bot/114312444050875805
- Minimizing Envy and Maximizing Happiness in Graphical House Allocation
Anubhav Dhar, Ashlesha Hota, Palash Dey, Sudeshna Kolay
https://arxiv.org/abs/2505.00296 https://mastoxiv.page/@arXiv_csDS_bot/114437013364446063
- Fast and Simple Densest Subgraph with Predictions
Thai Bui, Luan Nguyen, Hoa T. Vu
https://arxiv.org/abs/2505.12600 https://mastoxiv.page/@arXiv_csDS_bot/114538936921930134
- Compressing Suffix Trees by Path Decompositions
Becker, Cenzato, Gagie, Kim, Koerkamp, Manzini, Prezza
https://arxiv.org/abs/2506.14734 https://mastoxiv.page/@arXiv_csDS_bot/114703384646892523
- Improved sampling algorithms and functional inequalities for non-log-concave distributions
Yuchen He, Zhehan Lei, Jianan Shao, Chihao Zhang
https://arxiv.org/abs/2507.11236 https://mastoxiv.page/@arXiv_csDS_bot/114862112197588124
- Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
Peter Robinson, Ming Ming Tan
https://arxiv.org/abs/2507.11257 https://mastoxiv.page/@arXiv_csDS_bot/114862223634372292
- Optimally detecting uniformly-distributed $\ell_2$ heavy hitters in data streams
Santhoshini Velusamy, Huacheng Yu
https://arxiv.org/abs/2509.07286 https://mastoxiv.page/@arXiv_csDS_bot/115178875220889588
- Uncrossed Multiflows and Applications to Disjoint Paths
Chandra Chekuri, Guyslain Naves, Joseph Poremba, F. Bruce Shepherd
https://arxiv.org/abs/2511.00254 https://mastoxiv.page/@arXiv_csDS_bot/115490402963680492
- Dynamic Matroids: Base Packing and Covering
Tijn de Vos, Mara Grilnberger
https://arxiv.org/abs/2511.15460 https://mastoxiv.page/@arXiv_csDS_bot/115580946319285096
- Branch-width of connectivity functions is fixed-parameter tractable
Tuukka Korhonen, Sang-il Oum
https://arxiv.org/abs/2601.04756 https://mastoxiv.page/@arXiv_csDS_bot/115864074799755995
- CoinPress: Practical Private Mean and Covariance Estimation
Sourav Biswas, Yihe Dong, Gautam Kamath, Jonathan Ullman
https://arxiv.org/abs/2006.06618
- The Ideal Membership Problem and Abelian Groups
Andrei A. Bulatov, Akbar Rafiey
https://arxiv.org/abs/2201.05218
- Bridging Classical and Quantum: Group-Theoretic Approach to Quantum Circuit Simulation
Daksh Shami
https://arxiv.org/abs/2407.19575 https://mastoxiv.page/@arXiv_quantph_bot/112874282709517475
- Young domination on Hamming rectangles
Janko Gravner, Matja\v{z} Krnc, Martin Milani\v{c}, Jean-Florent Raymond
https://arxiv.org/abs/2501.03788 https://mastoxiv.page/@arXiv_mathCO_bot/113791421814248215
- On the Space Complexity of Online Convolution
Joel Daniel Andersson, Amir Yehudayoff
https://arxiv.org/abs/2505.00181 https://mastoxiv.page/@arXiv_csCC_bot/114437005955255553
- Universal Solvability for Robot Motion Planning on Graphs
Anubhav Dhar, Pranav Nyati, Tanishq Prasad, Ashlesha Hota, Sudeshna Kolay
https://arxiv.org/abs/2506.18755 https://mastoxiv.page/@arXiv_csCC_bot/114737342714568702
- Colorful Minors
Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
https://arxiv.org/abs/2507.10467
- Learning fermionic linear optics with Heisenberg scaling and physical operations
Aria Christensen, Andrew Zhao
https://arxiv.org/abs/2602.05058
toXiv_bot_toot
@netzschleuder@social.skewed.de2026-02-11 00:00:05
paris_transportation: Paris Transportation (2016)
A multiplex transportation network of Ile-de-France, jointly representing the road network, train network, and subway network. Nodes are intersections, rail stations or metro stations. Different modes of transportation are given by different layers. Within-layer edges represent direct transference by a particular mode of transportation, and between-layer edges represent the conjunction of those layers at that node.
This network ha…
@heiseonline@social.heise.de2026-02-09 08:31:00
@kingconsult@berlin.social2026-02-10 10:26:03
@macandi@social.heise.de2025-12-09 07:05:00
@midtsveen@social.linux.pizza2026-01-11 00:04:27
If only it were this easy.
Holding so much sorrow for my fellow Trans people in America.
🌈✨:bisexual_pride: 🏳️⚧️ :genderfluid_flag: :nonbinary_flag: :heart_trans: 🏳️🌈
#TransRights #TransRightsAreHumanRights
@ErikJonker@mastodon.social2025-12-10 13:56:53
"EU-US Data Transfers: Time to prepare for more trouble to come", #maxschrems…
@jtk@infosec.exchange2026-02-10 00:50:38
@bogo@hapyyr.com2026-01-09 13:55:18
Today one more talk for #FOSDEM was accepted: What translating Thunderbird taught me.
It's in the #translation room at Sunday.
@arXiv_csDS_bot@mastoxiv.page2026-02-10 16:11:59
Crosslisted article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Graph-Based Nearest-Neighbor Search without the Spread
Jeff Giliberti, Sariel Har-Peled, Jonas Sauer, Ali Vakilian
https://arxiv.org/abs/2602.06633 https://mastoxiv.page/@arXiv_csCG_bot/116039510003959758
- Tensor Hinted Mv Conjectures
Zhao Song
https://arxiv.org/abs/2602.07242 https://mastoxiv.page/@arXiv_csCC_bot/116045166832661818
- Compact Conformal Subgraphs
Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala, Aravindan Vijayaraghavan
https://arxiv.org/abs/2602.07530 https://mastoxiv.page/@arXiv_csLG_bot/116046310688959095
- The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching...
Jan Dreier, Nikolas M\"ahlmann, Sebastian Siebertz
https://arxiv.org/abs/2602.07606 https://mastoxiv.page/@arXiv_csCC_bot/116045172877973476
- A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
Owen Shen, Haoran Xu, Yinyu Ye, Peter Glynn, Patrick Jaillet
https://arxiv.org/abs/2602.07663 https://mastoxiv.page/@arXiv_mathOC_bot/116046008531918566
- Efficient Adaptive Data Analysis over Dense Distributions
Joon Suk Huh
https://arxiv.org/abs/2602.07732 https://mastoxiv.page/@arXiv_csLG_bot/116046380158677039
- Wheeler Bisimulations
Nicola Cotumaccio
https://arxiv.org/abs/2602.07964 https://mastoxiv.page/@arXiv_csFL_bot/116045203254419984
- Trellis codes with a good distance profile constructed from expander graphs
Yubin Zhu, Zitan Chen
https://arxiv.org/abs/2602.08718 https://mastoxiv.page/@arXiv_csIT_bot/116046151403913561
- Near-optimal Swap Regret Minimization for Convex Losses
Lunjia Hu, Jon Schneider, Yifan Wu
https://arxiv.org/abs/2602.08862 https://mastoxiv.page/@arXiv_csLG_bot/116046574152052711
- Distortion of Metric Voting with Bounded Randomness
Ziyi Cai, D. D. Gao, Prasanna Ramakrishnan, Kangning Wang
https://arxiv.org/abs/2602.08871 https://mastoxiv.page/@arXiv_csGT_bot/116045826992016756
toXiv_bot_toot