The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "FOCS"( http://dblp.L3S.de/Venues/FOCS )

URL (DBLP): http://dblp.uni-trier.de/db/conf/focs

Publication years (Num. hits)
1975 (29) 1976 (32) 1977 (32) 1978 (34) 1979 (44) 1980 (46) 1981 (52) 1982 (47) 1983 (61) 1984 (60) 1985 (62) 1986 (55) 1987 (56) 1988 (60) 1989 (100) 1990 (93) 1991 (87) 1992 (78) 1993 (75) 1994 (74) 1995 (74) 1996 (66) 1997 (64) 1998 (80) 1999 (68) 2000 (67) 2001 (66) 2002 (81) 2003 (65) 2004 (65) 2005 (74) 2006 (72) 2007 (67) 2008 (83) 2009 (74) 2010 (83) 2011 (89) 2012 (81) 2013 (80) 2014 (69) 2015 (87) 2016 (87) 2017 (91) 2018 (88) 2019 (93) 2020 (128) 2021 (118) 2022 (112) 2023 (143)
Publication types (Num. hits)
inproceedings(3542) proceedings(50)
Venues (Conferences, Journals, ...)
FOCS(3592)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4036 occurrences of 1595 keywords

Results
Found 3592 publication records. Showing 3592 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Anupam Gupta 0001, Madhusudhan Reddy Pittu, Ola Svensson, Rachel Yuan The Price of Explainability for Clustering. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Soh Kumabe, Yuichi Yoshida Lipschitz Continuous Algorithms for Graph Problems. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Ioana O. Bercea, Lorenzo Beretta 0001, Jonas Klausen, Jakob Bæk Tejs Houen, Mikkel Thorup Locally Uniform Hashing. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1AmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil P. Vadhan Singular Value Approximation and Sparsifying Random Walks on Directed Graphs. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Binghui Peng, Aviad Rubinstein Near Optimal Memory-Regret Tradeoff for Online Learning. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Mohsen Ghaffari 0001, Christoph Grunau, Václav Rozhon Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Michael Elkin, Idan Shabat Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n log log n). Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Tal Herman, Guy N. Rothblum Doubley-Efficient Interactive Proofs for Distribution Properties. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Amir Abboud, Jason Li 0006, Debmalya Panigrahi, Thatchaphol Saranurak All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Shachar Lovett, Jiapeng Zhang Streaming Lower Bounds and Asymmetric Set-Disjointness. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jan van den Brand, Daniel J. Zhang Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Dor Minzer, Kai Zhe Zheng Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Ohad Klein Slicing all Edges of an n-cube Requires n2/3 Hyperplanes. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Gal Arnon, Alessandro Chiesa, Eylon Yogev IOPs with Inverse Polynomial Soundness Error. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Vaggos Chatziafratis, Konstantin Makarychev Triplet Reconstruction and all other Phylogenetic CSPs are Approximation Resistant. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Greg Bodwin, Gary Hoppenworth Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n Barrier. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Louis Golowich From Grassmannian to Simplicial High-Dimensional Expanders. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Vida Dujmovic, Louis Esperet, Pat Morin, David R. Wood Proof of the Clustered Hadwiger Conjecture. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Tony Metger, Henry Yuen stateQIP = statePSPACE. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang Improved Hardness of Approximating k-Clique under ETH. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Hung Le 0001, Shay Solomon, Cuong Than Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Rainie Bozzai, Victor Reis, Thomas Rothvoss The Vector Balancing Constant for Zonotopes. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Raghuvansh R. Saxena, Noah G. Singer, Madhu Sudan 0001, Santhoshini Velusamy Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Silas Richelson, Sourya Roy Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal Binary Codes. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Guy Bresler, Chenghao Guo, Yury Polyanskiy Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Vincent Cohen-Addad, Hung Le 0001, Marcin Pilipczuk, Michal Pilipczuk Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sepehr Assadi, Janani Sundaresan Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate Matchings. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford Sparsifying Sums of Norms. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick Separating MAX 2-AND, MAX DI-CUT and MAX CUT. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Alexandr Andoni, Hengjie Zhang Sub-quadratic (1+ϵ)-approximate Euclidean Spanners, with Applications. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Eric Blais, Cameron Seth Testing Graph Properties with the Container Method. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Merav Parter Secure Computation Meets Distributed Universal Optimality. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase Parameterized Approximation Schemes for Clustering with General Norm Objectives. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Vishesh Jain, Marcus Michelen, Huy Tuan Pham, Thuy-Duong Vuong Optimal mixing of the down-up walk on independent sets of a given size. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Benny Applebaum, Oded Nir Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Edward Pyne, Ran Raz, Wei Zhan Certified Hardness vs. Randomness for Log-Space. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Szymon Torunczyk Flip-width: Cops and Robber on dense graphs. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski 0001 Dynamic treewidth. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jan van den Brand, Li Chen 0028, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Caleb Koch, Carmen Strassle, Li-Yang Tan Properly learning decision trees with queries is NP-hard. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Antonio Blanca, Reza Gheissari Sampling from the Potts model at low temperatures via Swendsen-Wang dynamics. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Clément L. Canonne, Samuel B. Hopkins, Jerry Li 0001, Allen Liu, Shyam Narayanan The Full Landscape of Robust Mean Testing: Sharp Separations between Oblivious and Adaptive Contamination. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Tomasz Kociumaka, Anish Mukherjee 0001, Barna Saha Approximating Edit Distance in the Fully Dynamic Model. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Nick Gravin, Enze Sun, Zhihao Gavin Tang Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal Complexity. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Lijie Chen 0001, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam Polynomial-Time Pseudodeterministic Construction of Primes. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Neil Olver, Leon Sering, Laura Vargas Koch Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Timothy M. Chan, Ce Jin 0001, Virginia Vassilevska Williams, Yinzhan Xu Faster Algorithms for Text-to-Pattern Hamming Distances. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Mark Braverman, Subhash Khot, Dor Minzer Parallel Repetition for the GHZ Game: Exponential Decay. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan A strong composition theorem for junta complexity and the boosting of property testers. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Zeyu Guo 0001, Zihan Zhang Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sumanta Ghosh, Prahladh Harsha, Simao Herdade, Mrinal Kumar 0001, Ramprasad Saptharishi Fast Numerical Multivariate Multipoint Evaluation. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Xiao Liang 0014, Omkant Pandey, Takashi Yamakawa A New Approach to Post-Quantum Non-Malleability. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Arturo I. Merino, Torsten Mütze Traversing combinatorial 0/1-polytopes via optimization. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Vincent Cohen-Addad, David P. Woodruff, Samson Zhou Streaming Euclidean k-median and k-means with o(log n) Space. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Susanna F. de Rezende, Aaron Potechin, Kilian Risse Clique Is Hard on Average for Unary Sherali-Adams. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sinho Chewi, Jaume de Dios Pont, Jerry Li 0001, Chen Lu 0002, Shyam Narayanan Query lower bounds for log-concave sampling. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Victor Reis, Thomas Rothvoss The Subspace Flatness Conjecture and Faster Integer Programming. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Weiming Feng 0001, Heng Guo 0001, Chunyang Wang, Jiaheng Wang 0002, Yitong Yin Towards derandomising Markov chain Monte Carlo. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Lijie Chen 0001, Roei Tell, Ryan Williams 0001 Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Johan Håstad On small-depth Frege proofs for PHP. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou Dynamic "Succincter". Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Hiroshi Hirai 0001, Harold Nieuwboer, Michael Walter 0005 Interior-point methods on manifolds: theory and applications. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Arturo Acuaviva, Visu Makam, Harold Nieuwboer, David Pérez-García, Friedrich Sittner, Michael Walter 0005, Freek Witteveen The minimal canonical form of a tensor network. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Johannes Carmesin, Jan Kurkofka Canonical decompositions of 3-connected graphs. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Ran Duan, Jiayi Mao, Xinkai Shu, Longhui Yin A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted Graphs. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Zachary Chase 0001, Shay Moran, Amir Yehudayoff Stability and Replicability in Learning. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Yao-Ching Hsieh, Huijia Lin, Ji Luo 0002 Attribute-Based Encryption for Circuits of Unbounded Depth from Lattices. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz Optimal Algorithms for Bounded Weighted Edit Distance. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Lijie Chen 0001, William M. Hoza, Xin Lyu 0002, Avishay Tal, Hongxun Wu Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Valerio Cini, Hoeteck Wee ABE for Circuits with poly (λ) -sized Keys from LWE. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jan van den Brand, Adam Karczmarz Deterministic Fully Dynamic SSSP and More. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1William Kuszmaul Strongly History-Independent Storage Allocation: New Upper and Lower Bounds. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Emmanuel Abbe, Colin Sandon A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Xiaoyu Chen, Jingcheng Liu 0005, Yitong Yin Uniqueness and Rapid Mixing in the Bipartite Hardcore Model (extended abstract). Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Zongchen Chen, Kuikui Liu, Nitya Mani, Ankur Moitra Strong Spatial Mixing for Colorings on Trees and its Algorithmic Applications. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak Chasing Positive Bodies. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Rahul Ilango SAT Reduces to the Minimum Circuit Size Problem with a Random Oracle. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Reilly Browne, Prahlad Narasimhan Kasthurirangan, Joseph S. B. Mitchell, Valentin Polishchuk Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple Polygon. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Divesh Aggarwal, Rajendra Kumar 0002 Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms! Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Alejandro Cassis, Nick Fischer Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster! Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Andrei Graur, Haotian Jiang, Aaron Sidford Sparse Submodular Function Minimization. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Fernando Granha Jeronimo, Shashank Srivastava, Madhur Tulsiani List Decoding of Tanner and Expander Amplified Codes from Distance Certificates. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Michal Wlodarczyk 0001, Meirav Zehavi Planar Disjoint Paths, Treewidth, and Kernels. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023 Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Hadley Black, Deeparnab Chakrabarty, C. Seshadhri 0001 A d1/2+o(1) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein Local Computation Algorithms for Maximum Matching: New Lower Bounds. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu 0001 Fourier Growth of Communication Protocols for XOR Functions. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Praneeth Kacham, Rasmus Pagh, Mikkel Thorup, David P. Woodruff Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jason M. Altschuler, Sinho Chewi Faster high-accuracy log-concave sampling via algorithmic warm starts. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Alexandros Hollender, Aviad Rubinstein Envy-Free Cake-Cutting for Four Agents. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Emily Fox, Jiashuai Lu A deterministic near-linear time approximation scheme for geometric transportation. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Xin Li 0006 Two Source Extractors for Asymptotically Optimal Entropy, and (Many) More. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Nathaniel Johnston, Benjamin Lovitz, Aravindan Vijayaraghavan Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Alon Eden, Michal Feldman, Kira Goldner, Simon Mauras, Divyarthi Mohan Constant Approximation for Private Interdependent Valuations. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Mika Göös, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov 0001 Top-Down Lower Bounds for Depth-Four Circuits. Search on Bibsonomy FOCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 3592 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license