BARC Retreat 2025
| Monday | Tuesday | Wednesday | Thursday | Friday |
|---|---|---|---|---|
| Meet in the courtyard of Vibenshuset at 8:30 | Morning dip at the beach with Mads at 7:00 (optional) – meet in front of the Party House | Morning dip at the beach with Mads at 7:00 (optional) – meet in front of the Party House | Morning dip at the beach with Mads at 7:00 (optional) – meet in front of the Party House | Pack up and check out, bring luggage to the reception for storage. Leave houses neat and tidy, dishwashers and bins emptied! |
| Bus transport (with breakfast) from Vibenshuset to Rømø Departure at 9:00 Arrival at 13:30 We will be staying at: Enjoy Resorts Rømø Vestergade 31 6792 Rømø |
Breakfast available 8:00 – 8:50 | Breakfast available 8:00 – 8:50 | Breakfast available 8:00 – 8:50 | Breakfast available 8:00 – 8:30 Departure from reception 8:40 to Havneby (15 min walk) |
| Lunch resort restaurant “Diget” 13:30 | Academic Workshop 9:00 – 12:30 Coffee break at 10:30 Meta discussions in smaller groups, collective presentations before lunch. Lunch resort restaurant “Diget” 12:30 |
Academic Workshop 9:00 – 12:30 Coffee break at 10:30 FOCS proceedings Lunch resort restaurant “Diget” 12:30 |
Academic Workshop 9:00 – 12:00 Coffee break at 10:30 FOCS proceedings and discussion of WPA 2025. Bus pick-up at hotel reception 12:10, transfer to Lakolk (15 min by chartered bus) Lunch at Café Fru Dax 12:30 – 13:30 |
Seal Safari by boat at 9:00 Bring: Passport (!), windbreaker, warm clothing and binoculars Back approx. 13:15 Return to hotel for lunch, 15 min walk Quick lunch resort restaurant “Diget” 13:30 – 14:15 |
| Check-in 14:00 – 15:00 | Exploring the Wadden Sea Departure from reception at 13:30 Dress according to weather and expect walking for 2-3 hours. |
Recreational time Choose between: Pool / wellness area until 16:00 Table tennis (at resort) Golf (at own expense) Rent a bike (tandems available!) Walk in the area If you can’t resist: do research |
Cultural sightseeing WWII bunker, highest point (19 m) and museum 13:30 – 15:30 Arrival back at resort approx. 15:45 |
Retrieve your luggage and board the bus at 14:20 |
| Free time until dinner (Pool and wellness area open extraordinarily until 17:00) |
Black Sun excursion (optional) 17:15 – 20:30 (pick-up at hotel) Bring: Passport (!), windbreaker, warm clothing and binoculars |
Cooking contest! Every house must prepare a home-made lasagne to be ready at 19:00 at The Party House. Houses 7&8 as well as 9&10 team up. The Party House prepares dessert! | Free time until dinner | Bus transport with snacks and tea/coffee back to Vibenshuset. Departure from resort 14:30 Brief stop at Fredericia approx. 16:15, arrival in Copenhagen approx. 19:30 |
| Dinner at resort restaurant “Diget” 18:00 Hygge and board games at the Party House |
Dinner at resort restaurant “Diget” 20:45 | Dinner at The Party House at 19:00 Lasagne showdown – which house wins? Hygge and board games at the Party House |
Dinner at resort restaurant “Diget” 18:00 – 19:00 BARC’n’Bowl at hotel 19:00 – 21:00 |
Packing List ❤️
We have put together a packing list for you:
PACKING LIST
- Valid passport (on the boat trips we pass into German waters and a passport is mandatory to bring)
Please note that if your passport is issued by a non-EU country you must also be able to document your entry permit to the EU. Living and working in Denmark you should have this visa already, so don’t worry, just remember to bring it. - Backpack for daytrips
- What you need for work: pen & paper, your laptop/tablet incl. charger, either printed or downloaded FOCS 2025 abstracts
- Refillable water bottle
- Phone and charger
- Wallet. If you are holding a KU Master card, please bring it!
- Your best lasagna recipe
- Clothes (You know what you need but maybe check the weather forecast for Rømø when packing.)
- Raincoat/wind proof jacket
- Swim wear and a towel for the beach (you cannot take hotel towels to the beach!)
- Scarf, hat (might get chilly on the boat rides)
- Toiletries and medication (as needed)
- Binoculars (if you have)
- Your favorite BARC shirts
- Table tennis bat (if you suffer from this inclination)
Plan for the houses
| The Party House | House 2 | House 3 | House 4 | House 5 | House 6 | House 7 | House 8 | House 9 | House 10 |
|---|---|---|---|---|---|---|---|---|---|
| Jacob Imola | Hanzhi | Mikkel Thorup | Yassine | Benjamin | Prateek | Florestan | Hanwen | Mikkel Abrahamsen | Jacob Holm |
| Mads | Sia | Rasmus | Sophus | Amik | Tuukka | Egor | Shuyi | Amir | Stephen |
| Ian | Deborah | Thore | Christian | Jack | Srikant | ||||
| Anne | Anders | Duri | Théo | Nutan |
- The Party House will be the gathering point for social activities in the evenings.
- Every house has two bedrooms with each two beds.
- In houses 2 – 6 two people share a room.
- In houses 7 – 10 each person has a room to themself.
FOCS Proceedings
Accepted Papers
| Title | Authors | |
|---|---|---|
| Incompressibility and spectral gaps of random circuits | Chi-Fang Chen, Jeongwan Haah, Jonas Haferkamp, Yunchao Liu, Tony Metger, Xinyu Tan | |
| Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices | Vijay Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee, Xuandi Ren | |
| Deterministic counting from coupling independence | Xiaoyu Chen, Weiming Feng, Heng Guo, Xinyuan Zhang, Zongrui Zou | |
| Beyond Regularity: Simple versus Optimal Mechanisms, Revisited | Yiding Feng, Yaonan Jin | |
| Complexity theory of orbit closure intersection for tensors: reductions, completeness, and graph isomorphism hardness | Vladimir Lysikov, Michael Walter | |
| Maximally Extendable Product Codes are Good Coboundary Expanders | Gleb Kalachev, Pavel Panteleev | |
| The Power of Recursive Embeddings for $\\ell_p$ Metrics | Robert Krauthgamer, Nir Petruschka, Shay Sapir | |
| Integer multiplication is at least as hard as matrix transposition, | David Harvey, Joris van der Hoeven | |
| Distributed Triangle Detection is Hard in Few Rounds | Sepehr Assadi, Janani Sundaresan | |
| Polynomial Bounds for the Graph Minor Structure Theorem | Maximilian Gorsky, Michał Seweryn, Sebastian Wiederrecht | |
| Learning quantum Gibbs states locally and efficiently | Chi-Fang Chen, Anurag Anshu, Quynh T. Nguyen | |
| Dynamic Treewidth in Logarithmic Time | Tuukka Korhonen | |
| A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number | Romain Bourneuf, Pierre Charbit, Stephan Thomasse | |
| Rapid Mixing on Random Regular Graphs beyond Uniqueness | Xiaoyu Chen, Zejia Chen, Zongchen Chen, Yitong Yin, Xinyuan Zhang | |
| Optimal Smoothed Analysis of the Simplex Method | Eleon Bach, Sophie Huiberts | |
| Tight Low Degree Hardness for Optimizing Pure Spherical Spin Glasses, | Mark Sellke | |
| Group Order is in QCMA | François Le Gall, Harumichi Nishimura, Dhara Thakkar | |
| Quasipolynomial bounds for the corners theorem | Michael Jaber, Yang P. Liu, Shachar Lovett, Anthony Ostuni, Mehtaab Sawhney | |
| Collapsing Catalytic Classes | Michal Koucky, Edward Pyne, Ian Mertz, Sasha Sami | |
| High dimensional online calibration in polynomial time | Binghui Peng | |
| Bipartite Matching is in Catalytic Logspace | Ian Mertz, Aryan Agarwala | |
| Density Measures for Language Generation | Jon Kleinberg, Fan Wei | |
| Explicit Lossless Vertex Expanders | Jun-Ting Hsieh, Alexander Lubotzky, Sidhanth Mohanty, Assaf Reiner, Rachel Yun Zhang | |
| How Global Calibration Strengthens Multiaccuracy | Sílvia Casacuberta, Parikshit Gopalan, Varun Kanade, Omer Reingold | |
| Adaptivity Gaps for Stochastic Probing with Subadditive Functions | Jian Li, Yinchen Liu, Yiran Zhang | |
| The Sponge is Quantum Indifferentiable | Gorjan Alagic, Joseph Carolan, Christian Majenz, Saliha Tokat | |
| Shuffling Cards When You Are of Very Little Brain: \\\\Low Memory Generation of Permutations | Moni Naor, Boaz Menuhin | |
| More efficient sifting for grid norms, and applications to multiparty communication complexity | Zander Kelley, Xin Lyu | |
| Faster logconcave sampling from a cold start in high dimension | Yunbum Kook, Santosh S. Vempala | |
| On optimal distinguishers for Planted Clique, | Ansh Nagda, Prasad Raghavendra | |
| Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching | Seri Khoury, Aaron Schild | |
| The Proof Analysis Problem | Noel Arteche, Albert Atserias, Susanna F. de Rezende, Erfan Khaniki | |
| On the Parallel Complexity of Finding a Matroid Basis | Sanjeev Khanna, Aaron Putterman, Junkai Song | |
| Paths and Intersections: Exact Emulators for Planar Graphs | George Z. Li, Zihan Tan, Tianyi Zhang | |
| Obfuscation of Unitary Quantum Programs | Mi-Ying Huang, Er-Cheng Tang | |
| Fast Algorithms for Graph Arboricity and Related Problems | Ruoxu Cen, Henry Fleischmann, George Z. Li, Jason Li, Debmalya Panigrahi | |
| Improved 2-Approximate Shortest Paths for close vertex pairs | Manoj Gupta | |
| Faster exact learning of k-term DNFs with membership and equivalence queries | Josh Alman, Shivam Nadimpalli, Shyamal Patel, Rocco A. Servedio | |
| Online Edge Coloring: Sharp Thresholds | Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc | |
| Asymptotically Optimal Inapproximability of E$k$-SAT Reconfiguration | Shuichi Hirahara, Naoto Ohsaka | |
| Adversarially robust quantum state learning and testing | Maryam Aliakbarpour, Vladimir Braverman, Nai-Hui Chia, Yuhan Liu | |
| A Little Clairvoyance Is All You Need | Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter, Sorrachai Yingchareonthawornchai | |
| Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives | Thomas Kesselheim, Marco Molinaro, Kalen Patton, Sahil Singla | |
| Proving Natural Distribution Properties is Harder than Testing Them | Tal Herman, Guy Rothblum | |
| Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings) | Lasse Wulf | |
| Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences | Jonathan Leake, Kasper Lindberg, Shayan Oveis Gharan | |
| Faster Mixing of the Jerrum-Sinclair Chain | Xiaoyu Chen, Weiming Feng, Zhe Ju, Tianshun Miao, Yitong Yin, Xinyuan Zhang | |
| Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent | Matan Levi, Jonathan Mosheiff, Nikhil Shagrithaya | |
| Root Ridge Leverage Score Sampling for $\\ell_p$ Subspace Approximation | David P. Woodruff, Taisuke Yasuda | |
| Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness | Xiaolin Bu, Biaoshuai Tao | |
| RE-completeness of entangled constraint satisfaction problems | Eric Culf, Kieran Mastel | |
| Average-Distortion Sketching | Yiqiao Bao, Anubhav Baweja, Nicolas Menand, Erik Waingarten, Nathan White, Tian Zhang | |
| A k^{q/q-2} Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs | Oliver Janzer, Peter Manohar | |
| Overcomplete Tensor Decomposition via Koszul-Young Flattenings | Pravesh K Kothari, Ankur Moitra, Alexander S Wein | |
| Improved Lower Bounds for all Odd-Query Locally Decodable Codes | Arpon Basu, Jun-Ting Hsieh, Pravesh K. Kothari, Andrew D. Lin | |
| Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models | Ilias Diakonikolas, Daniel Kane | |
| Theoretical limitations of multi-layer Transformer | Lijie Chen, Binghui Peng, Hongxun Wu | |
| Near-Optimal Algorithms for Omniprediction | Princewill Okoroafor, Bobby Kleinberg, Michael Kim | |
| Robust Learning of Multi-index Models via Iterative Subspace Approximation | Ilias Diakonikolas, Giannis Iakovidis, Daniel M. Kane, Nikos Zarifis | |
| Query-Efficient Fixpoints of $\\ell_p$-Contractions | Sebastian Haslebacher, Jonas Lill, Patrick Schnider, Simon Weber | |
| Multi-Pass Streaming Lower Bounds for Approximating Max-Cut | Yumou Fei, Dor Minzer, Shuo Wang | |
| Ineffectiveness for Search and Undecidability of PCSP Meta-Problems | Alberto Larrauri | |
| Radial Isotropic Position via an Implicit Newton’s Method | Arun Jambulapati, Jonathan Li, Kevin Tian | |
| Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics, | Hyung-Chan An, Mong-Jen Kao, Changyeol Lee, Mu-Ting Lee | |
| Deterministic factorization of constant-depth algebraic circuits in subexponential time | Somnath Bhattacharjee, Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Shubhangi Saraf | |
| Breaking a Long-Standing Barrier: 2-$\\varepsilon$ Approximation for Steiner Forest | Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi | |
| Rank Bounds and PIT for $\\Sigma^3 \\Pi \\Sigma \\Pi^d$ circuits via a non-linear Edelstein-Kelly theorem | Abhibhav Garg, Rafael Oliveira, Akash Kumar Sengupta | |
| Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set | Mohsen Ghaffari, Christoph Grunau | |
| List Decoding Expander-Based Codes up to Capacity in Near-Linear Time | Shashank Srivastava, Madhur Tulsiani | |
| Lower Bounds for Non-adaptive Local Computation Algorithms | Amir Azarmehr, Soheil Behnezhad, Alma Ghafari, Madhu Sudan | |
| Stochastic scheduling with Bernoulli-type jobs through policy stratification | Antonios Antoniadis, Ruben Hoeksma, Kevin Schewior, Marc Uetz | |
| Gap-preserving reductions and RE-completeness of Independent Set Games | Laura Mančinska, Pieter Spaas, Taro Spirig, Matthijs Vernooij | |
| The Quasi-Polynomial Low-Degree Conjecture is False | Rares-Darius Buhai, Jun-Ting Hsieh, Aayush Jain, Pravesh Kothari | |
| A distillation–teleportation protocol for fault-tolerant QRAM | Alexander Dalzell, Connor T. Hann, András Gilyén, Sam McArdle, Grant Salton, Quynh Nguyen, Aleksander Kubica, Fernando Brandao | |
| Parallel Repetition for Post-Quantum Arguments | Andrew Huang, Yael Tauman Kalai | |
| Sign-Rank of k-Hamming Distance is Constant | Mika Göös, Nathaniel Harms, Valentin Imbach, Dmitry Sokolov | |
| Polynomial-Time Approximation Schemes via Utility Alignment: Unit-Demand Pricing and More | Robin Bowers, Marius Garbea, Emmanouil Pountourakis, Samuel Taggart | |
| Almost Tight Additive Guarantees for $k$-Edge-Connectivity | Nikhil Kumar, Chaitanya Swamy | |
| Computational-Statistical Tradeoffs from NP-hardness | Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan | |
| Edge-weighted Matching in the Dark | Zhiyi Huang, Enze Sun, Xiaowei Wu, Jiahao Zhao | |
| Cycle-factors of regular graphs via entropy | Eoin Hurley, Antonio Girao, Lukas Michel, Nemanja Draganic, Alp Müyesser, Micha Christoph | |
| Deterministic Almost-Linear-Time Gomory-Hu Trees | Amir Abboud, Rasmus Kyng, Jason Li, Debmalya Panigrahi, Maximilian Probst, Thatchaphol Saranurak, Wuwei Yuan, Weixuan Yuan | |
| An Improved Bound for the Beck-Fiala Conjecture | Nikhil Bansal, Haotian Jiang | |
| Instance-Optimal Uniformity Testing and Tracking | Guy Blanc, Clément Canonne, Erik Waingarten | |
| Finding Colorings in One-Sided Expanders | Rares-Darius Buhai, Yiding Hua, David Steurer, Andor Vári-Kakas | |
| Approximating High-Dimensional Earth Mover’s Distance as Fast as Closest Pair | Lorenzo Beretta, Vincent Cohen-Addad, Rajesh Jayaram, Erik Waingarten | |
| Stronger Cell Probe Lower Bounds via Local PRGs | Oliver Korten, Toniann Pitassi, Russell Impagliazzo | |
| Extractors for Samplable Distribution with Polynomially Small Min-Entropy | Ronen Shaltiel | |
| Succinct Homomorphic MACs from Groups and Applications | Yuval Ishai, Hanjun Li, Huijia Lin | |
| Cryptography meets worst-case complexity: Optimal security and more from iO and worst-case assumptions | Rahul Ilango, Alex Lombardi | |
| Godel in Cryptography: Effectively Zero Knowledge Proofs for NP with No Interaction, No Setup, and Perfect Soundness | Rahul Ilango | |
| Binary Codes for Computationally Bounded Errors Under Standard Crypto Assumptions | George Lu, Jad Silbak, Daniel Wichs | |
| Improved Round-by-round Soundness IOPs via Reed-Muller Codes | Dor Minzer, Kai Zhe Zheng | |
| Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs | Aaron Bernstein, Joakim Blikstad, Jason Li, Thatchaphol Saranurak, Ta-Wei Tu | |
| Solving Linear Inequalities over Convex Sets & its Applications to Cryptography and Hydrodynamics | Saugata Basu, Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen | |
| Direct Product Theorems for Randomized Query Complexity | Shalev Ben-David, Eric Blais | Not found |
| Embeddings into Similarity Measures for Nearest Neighbor Search | Alexandr Andoni, Negev Shekel Nosatzki | Not found |
| Pattern Matching under Weighted Edit Distance | Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz | Not found |
| Generalized Flow in Nearly-linear Time on Moderately Dense Graphs | Shunhua Jiang, Michael Kapralov, Lawrence Li Er Lu, Aaron Sidford | Not found |
| Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa | Benjamin Bedert, Tamio-Vesa Nakajima, Karolina Okrasa, Stanislav Zivny | Not found |
| On Inverse Theorems and Combinatorial Lines | Amey Bhangale, Subhash Khot, Yang Liu, Dor Minzer | Not found |
| A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams | Sanjeev Khanna, Ashwin Padaki, Krish Singal, Erik Waingarten | Not found |
| On Succinct Obfuscation via Propositional Logic (or: How to use pv-IO) | Abhishek Jain, Zhengzhong Jin, Surya Mathialagan, Omer Paneth | Not found |
| Tight Pair Query Lower Bounds for Matching and Earth Mover’s Distance | Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein | Not found |
| Undirected Multicast Network Coding Gaps via Locally Decodable Codes | Zhongtian He, Mark Braverman | Not found |
| Distance Approximating Minors for Planar and Minor-Free Graphs | Hsien-Chih Chang, Jonathan Conroy | Not found |
| Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance | Debarati Das, Jacob Gilbert, Tomasz Kociumaka, MohammadTaghi Hajiaghayi, Barna Saha | Not found |
| Exponential improvements to the average-case hardness of BosonSampling | Adam Bouland, Shaun Datta, Bill Fefferman, Felipe Hernandez | Not found |
| Random-Shift Revisited: Tight Approximations for Tree Embeddings and ℓ1-Oblivious Routings | Maximilian Probst, Rasmus Kyng, Tim Rieder | Not found |
| High-to-Low Dimensional PPA-completeness: Borsuk-Ulam, Tucker, Consensus Halving, and Ham Sandwich | Ruiquan Gao, Alexandros Hollender, Aviad Rubinstein | Not found |
| Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension | Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, Da Wei Zheng | Not found |
| Shortest Paths on Convex Polyhedral Surfaces | Haitao Wang | Not found |
| Near-Optimal Fault-Tolerant Strong Connectivity Preservers | Gary Hoppenworth, Thatchaphol Saranurak, Benyu Wang | Not found |
| Constant Rate Codes for Adaptive Broadcasts Do Not Exist | Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena | Not found |
| Near-Optimal Property Testers for Pattern Matching | Ce Jin, Tomasz Kociumaka | Not found |
| Weighted k-Path and Other Problems in Almost O*(2^k) Deterministic Time via Dynamic Representative Sets | Jesper Nederlof | Not found |
| Kronecker Powers, Orthogonal Vectors, and the Asymptotic Spectrum | Josh Alman, Baitian Li | Not found |
| Robust Local Testability of Tensor Products of Constant-Rate Algebraic Geometry Codes, | Sumegha Garg, Akash Kumar Sengupta | Not found |
| Constant Approximation of Arboricity in Near-Optimal Sublinear Time | Jiangqi Dai, Mohsen Ghaffari, Julian Portmann | Not found |
| Solving Zero-Sum Games with Fewer Matrix-Vector Products | Ishani Karmarkar, Liam O’Carroll, Aaron Sidford | Not found |
| Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade | Simone Di Gregorio, Paul Duetting, Federico Fusco, Chris Schwiegelshohn | Not found |
| Characterization of Priority-Neutral Matching Lattices | Clayton Thomas | Not found |
| ℓ2/ℓ2 Sparse Recovery via Weighted Hypergraph Peeling | Nick Fischer, Vasileios Nakos | Not found |
| Stochastic Knapsack without Relaxing the Capacity | Anindya De, Sanjeev Khanna, Nathan White | Not found |
| Perfect L_p Sampling with Polylogarithmic Update Time | William Swartworth, David P. Woodruff, Samson Zhou | Not found |
| Optimal 4-Approximation for the Correlated Pandora’s Problem | Nikhil Bansal, Zhiyi Huang, Zixuan Zhu | Not found |
| PTF Testing Lower Bounds for Non-Gaussian Component Analysis | Ilias Diakonikolas, Daniel M. Kane, Sihan Liu, Thanasis Pittas | Not found |
| Parallel $(1+\\epsilon)$-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work | Bernhard Haeupler, Yonggang Jiang, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang | Not found |
| An Improved Greedy Approximation for (Metric) $k$-Means | Moses Charikar, Vincent Cohen-Addad, Ruiquan Gao, Fabrizio Grandoni, Euiwoong Lee, Ernest van Wijland | Not found |
| Static Retrieval Revisited: To Optimality and Beyond | Yang Hu, William Kuszmaul, Jingxun Liang, Huacheng Yu, Junkai Zhang, Renfei Zhou | Not found |
| Structural properties of the factorization norm | Igor Balla, Lianna Hambardzumyan, Istvan Tomon | Not found |
| On the Impossibility of SNARGs with Short CRS (or: Revisiting Gentry-Wichs Barrier in the Non-adaptive Setting) | Liyan Chen, Zhengzhong Jin | Not found |
| Ramanujan bigraphs and applications | Shai Evra, Brooke Feigon, Ori Parzanchevski, Kathrin Maurischat | Not found |
| Near-Asymptotically-Good Quantum Codes with Transversal CCZ Gates and Sublinear-Weight Parity-Checks | Louis Golowich, Venkatesan Guruswami | Not found |
| NP-hardness of the Minimum Circuit Size Problem from Well-Studied Assumptions | Shuichi Hirahara, Rahul Ilango | Not found |
| Fingerprint Filters are Optimal | William Kuszmaul, Jingxun Liang, Renfei Zhou | Not found |
| Efficiently Batching Unambiguous Interactive Proofs | Bonnie Berger, Rohan Goyal, Matthew M. Hong, Yael Tauman Kalai | Not found |
.-------------------------------------------------------------.
'------..-------------..----------..----------..----------..--.|
| \ || || || || ||
| \ || || || || ||
| .. || _ _ || _ _ || _ _ || _ _|| ||
| || || // // || // // ||// // || // //|| /||
|_.------"''----------''----------''----------''----------''--'|
|)| | | | | | mga| ||==| |
| | | _-_ | | | | .-. | ||==| C|
| | __ |.'.-.' | _ | _ | |.'.-.'. | __ | "__=='
'---------'|( )|'----------------------'|( )|'----------""
'-' '-'