The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

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

Publication years (Num. hits)
1969 (32) 1970 (28) 1971 (24) 1972 (30) 1973 (31) 1974 (36) 1975 (32) 1976 (31) 1977 (32) 1978 (39) 1979 (38) 1980 (48) 1981 (44) 1982 (46) 1983 (55) 1984 (67) 1985 (54) 1986 (48) 1987 (51) 1988 (55) 1989 (57) 1990 (60) 1991 (59) 1992 (76) 1993 (87) 1994 (82) 1995 (79) 1996 (75) 1997 (80) 1998 (77) 1999 (87) 2000 (86) 2001 (87) 2002 (93) 2003 (81) 2004 (74) 2005 (86) 2006 (80) 2007 (79) 2008 (86) 2009 (80) 2010 (83) 2011 (85) 2012 (90) 2013 (101) 2014 (92) 2015 (94) 2016 (93) 2017 (111) 2018 (114) 2019 (114) 2020 (114) 2021 (152) 2022 (135) 2023 (156)
Publication types (Num. hits)
inproceedings(3951) proceedings(55)
Venues (Conferences, Journals, ...)
STOC(4006)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1771 occurrences of 757 keywords

Results
Found 4006 publication records. Showing 4006 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Noah Golowich, Ankur Moitra, Dhruv Rohatgi Planning and Learning in Partially Observable Systems via Filter Stability. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jan van den Brand, Yang P. Liu, Aaron Sidford Dynamic Maxflow via Dynamic Interior Point Methods. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Noam Touitou Improved and Deterministic Online Service with Deadlines or Delay. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Xiaoyu He, Ray Li Approximating Binary Longest Common Subsequence in Almost-Linear Time. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Xiaoyu Chen, Shaofeng H.-C. Jiang, Robert Krauthgamer Streaming Euclidean Max-Cut: Dimension vs Data Reduction. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman Almost Chor-Goldreich Sources and Adversarial Random Walks. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Noga Amit, Guy N. Rothblum Constant-Round Arguments from One-Way Functions. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Ronen Eldan, Avi Wigderson, Pei Wu An Optimal "It Ain't Over Till It's Over" Theorem. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Atul Singh Arora, Andrea Coladangelo, Matthew Coudron, Alexandru Gheorghiu, Uttam Singh, Hendrik Waldner Quantum Depth in the Random Oracle Model. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jannis Blauth, Martin Nägele An Improved Approximation Guarantee for Prize-Collecting TSP. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Cheng Mao, Yihong Wu 0001, Jiaming Xu, Sophie H. Yu Random Graph Matching at Otter's Threshold via Counting Chandeliers. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Yeyuan Chen, Yizhi Huang, Jiatu Li, Hanlin Ren Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Zhengyang Liu 0002, Zeyu Ren, Zihe Wang 0001 Improved Approximation Ratios of Fixed-Price Mechanisms in Bilateral Trades. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Václav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Yotam Dikstein New High Dimensional Expanders from Covers. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Anurag Anshu, Nikolas P. Breuckmann, Chinmay Nirkhe NLTS Hamiltonians from Good Quantum Codes. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Josh Alman, Kevin Rao Faster Walsh-Hadamard and Discrete Fourier Transforms from Matrix Non-rigidity. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1James Bartusek, Fuyuki Kitagawa, Ryo Nishimaki, Takashi Yamakawa Obfuscation of Pseudo-Deterministic Quantum Circuits. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Xi Chen 0001, Vincent Cohen-Addad, Rajesh Jayaram, Amit Levi, Erik Waingarten Streaming Euclidean MST to a Constant Factor. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Eoin Hurley, François Pirot Uniformly Random Colourings of Sparse Graphs. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Ravishankar Krishnaswamy, Shi Li 0001, Varun Suriyanarayana Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Or Zamir Algorithmic Applications of Hypergraph and Partition Containers. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Matija Bucic, Richard Montgomery 0001 Towards the Erdős-Gallai Cycle Decomposition Conjecture. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Amir Abboud, Karl Bringmann, Nick Fischer Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Ioannis Caragiannis, Zhile Jiang Computing Better Approximate Pure Nash Equilibria in Cut Games via Semidefinite Programming. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep SDPs and Robust Satisfiability of Promise CSP. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Yizhi Huang, Rahul Ilango, Hanlin Ren NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Amey Bhangale, Subhash Khot, Dor Minzer On Approximability of Satisfiable k-CSPs: II. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Meghal Gupta, Rachel Yun Zhang Efficient Interactive Coding Achieving Optimal Error Resilience over the Binary Channel. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Xi Chen 0001, Binghui Peng Complexity of Equilibria in First-Price Auctions under General Tie-Breaking Rules. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro 0002 Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓp Norms. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Meghal Gupta, Venkatesan Guruswami, Rachel Yun Zhang Binary Error-Correcting Codes with Minimal Noiseless Feedback. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Riddhi Ghosal, Yuval Ishai, Alexis Korb, Eyal Kushilevitz, Paul Lou, Amit Sahai Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sam Gunn, Nathan Ju, Fermi Ma, Mark Zhandry Commitments to Quantum States. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Anand Natarajan, Tina Zhang Quantum Free Games. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jiatu Li, Igor C. Oliveira Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Omar Alrabiah, Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Xiaorui Sun Faster Isomorphism for Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira A Duality between One-Way Functions and Average-Case Symmetry of Information. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Lorenzo Ciardo, Stanislav Zivný Approximate Graph Colouring and the Hollow Shadow. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Daniel Alabi, Pravesh K. Kothari, Pranay Tankala, Prayaag Venkat, Fred Zhang Privately Estimating a Gaussian: Efficient, Robust, and Optimal. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Mohsen Ghaffari 0001, Christoph Grunau Faster Deterministic Distributed MIS and Approximate Matching. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Lap Chi Lau, Kam Chuen Tung, Robert Wang 0004 Cheeger Inequalities for Directed Graphs and Hypergraphs using Reweighted Eigenvalues. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Yeshwanth Cherapanamjeri, Constantinos Daskalakis, Andrew Ilyas, Manolis Zampetakis What Makes a Good Fisherman? Linear Regression under Self-Selection Bias. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sitan Chen, Jerry Li 0001, Yuanzhi Li, Anru R. Zhang Learning Polynomial Transformations via Generalized Tensor Decompositions. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jan Dreier, Nikolas Mählmann, Sebastian Siebertz First-Order Model Checking on Structurally Sparse Graph Classes. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1George Christodoulou 0001, Elias Koutsoupias, Annamária Kovács A Proof of the Nisan-Ronen Conjecture. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu Fast Algorithms via Dynamic-Oracle Matroids. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Yonggang Jiang, Sagnik Mukhopadhyay Finding a Small Vertex Cut on Distributed Networks. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Zeyu Guo 0001, Ben Lee Volk, Akhil Jalan, David Zuckerman Extractors for Images of Varieties. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Mark Bun, Marco Gaboardi, Max Hopkins, Russell Impagliazzo, Rex Lei, Toniann Pitassi, Satchit Sivakumar, Jessica Sorrell Stability Is Stable: Connections between Replicability, Privacy, and Adaptive Generalization. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Shouzhen Gu, Christopher A. Pattison, Eugene Tang An Efficient Decoder for a Linear Distance Quantum LDPC Code. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Srikanth Srinivasan 0001, Utkarsh Tripathi Optimal Explicit Small-Depth Formulas for the Coin Problem. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sebastian Forster, Yasamin Nazari, Maximilian Probst Gutenberg Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch. Search on Bibsonomy STOC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Ioana Oriana Bercea, Guy Even An extendable data structure for incremental stable perfect hashing. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Peter Dixon 0002, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran Pseudodeterminism: promises and lowerbounds. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Sepehr Assadi, Pankaj Kumar, Parth Mittal Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Xi Chen 0001, Rajesh Jayaram, Amit Levi, Erik Waingarten New streaming algorithms for high dimensional EMD and MST. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Tal Herman, Guy N. Rothblum Verifying the unseen: interactive proofs for label-invariant distribution properties. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan Parallel repetition for all 3-player games over binary alphabet. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Siqi Liu 0005, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang Testing thresholds for high-dimensional sparse random geometric graphs. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Meghal Gupta, Rachel Yun Zhang The optimal error resilience of interactive communication over binary channels. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Arjan Cornelissen, Yassine Hamoudi, Sofiène Jerbi Near-optimal Quantum algorithms for multivariate mean estimation. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Richard Peng, Zhuoqing Song Sparsified block elimination for directed laplacians. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Shahar Dobzinski, Shiri Ron, Jan Vondrák On the hardness of dominant strategy mechanism design. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Sepehr Assadi, Andrew Chen, Glenn Sun Deterministic graph coloring in the streaming model. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Arun Jambulapati, Yang P. Liu, Aaron Sidford Improved iteration complexities for overconstrained p-norm regression. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Fabrizio Grandoni 0001, Afrouz Jabal Ameli, Vera Traub Breaching the 2-approximation barrier for the forest augmentation problem. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Samuel B. Hopkins, Gautam Kamath 0001, Mahbod Majid Efficient mean estimation with pure differential privacy via a sum-of-squares exponential mechanism. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Sitan Chen, Frederic Koehler, Ankur Moitra, Morris Yau Kalman filtering with adversarial corruptions. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Hsien-Chih Chang, Robert Krauthgamer, Zihan Tan Almost-linear ε-emulators for planar graphs. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab Sawhney, Jakub Tarnawski Online edge coloring via tree recurrences and correlation decay. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong Entropic independence: optimal mixing of down-up random walks. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Bart M. P. Jansen, Michal Wlodarczyk 0001 Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OV. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Constantinos Daskalakis, Noah Golowich Fast rates for nonparametric online learning: from realizability to learning in games. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Daniel Dadush, Haotian Jiang, Victor Reis A new framework for matrix discrepancy: partial coloring bounds via mirror descent. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Adam Karczmarz, Anish Mukherjee 0001, Piotr Sankowski Subquadratic dynamic path reporting in directed graphs against an adaptive adversary. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk Twin-width IV: ordered graphs and matrices. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Samuel B. Hopkins, Prasad Raghavendra, Abhishek Shetty Matrix discrepancy from Quantum communication. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Chi-Ning Chou, Alexander Golovnev, Madhu Sudan 0001, Ameya Velingker, Santhoshini Velusamy Linear space streaming lower bounds for approximating CSPs. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Ilias Diakonikolas, Daniel M. Kane, Daniel Kongsgaard, Jerry Li 0001, Kevin Tian Clustering mixture models in almost-linear time via list-decodable mean estimation. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Tom Gur, Noam Lifshitz, Siqi Liu 0005 Hypercontractivity on high dimensional expanders. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Emmanuel Abbe, Shuangping Li, Allan Sly Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Alkida Balliu, Sebastian Brandt 0002, Fabian Kuhn, Dennis Olivetti Distributed ∆-coloring plays hide-and-seek. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Matthew B. Hastings, Ryan O'Donnell Optimizing strongly interacting fermionic Hamiltonians. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Andrea Coladangelo, Shafi Goldwasser, Umesh V. Vazirani Deniable encryption in a Quantum world. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett Hypercontractivity on high dimensional expanders. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Andreas Björklund, Thore Husfeldt, Petteri Kaski The shortest even cycle problem is tractable. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia On the complexity of two-party differential privacy. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Philipp Hieronymi, Christian Schulz 0013 A strong version of Cobham's theorem. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Anurag Anshu, Itai Arad, David Gosset An area law for 2d frustration-free spin systems. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Sevag Gharibian, François Le Gall Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Zhihao Gavin Tang, Jinzhao Wu, Hongxun Wu (Fractional) online stochastic matching via fine-grained offline statistics. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Alexandros Eskenazis, Paata Ivanisvili Learning low-degree functions from a logarithmic number of random queries. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Xavier Allamigeon, Stéphane Gaubert, Nicolas Vandame No self-concordant barrier interior point method is strongly polynomial. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Vincent Cohen-Addad Bypassing the surface embedding: approximation schemes for network design in minor-free graphs. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Fabrizio Grandoni 0001, Tobias Mömke, Andreas Wiese A PTAS for unsplittable flow on a path. Search on Bibsonomy STOC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
Displaying result #101 - #200 of 4006 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][>>]
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