• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 70 matches

• 2016
• 
  Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi:
  Arithmetic Circuits: A Chasm at Depth 3. SIAM J. Comput. 45(3): 1064-1079 (2016)
• 
  Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
  Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits. SIAM J. Comput. 45(4): 1533-1562 (2016)
• 
  Dorit Aharonov, André Chailloux, Maor Ganz, Iordanis Kerenidis, Loïck Magnin:
  A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias. SIAM J. Comput. 45(3): 633-679 (2016)
• 
  Andris Ambainis:
  Superlinear Advantage for Exact Quantum Algorithms. SIAM J. Comput. 45(2): 617-631 (2016)
• 
  Matthew Andrews, Spyridon Antonakopoulos, Lisa Zhang:
  Minimum-Cost Network Design with (Dis)economies of Scale. SIAM J. Comput. 45(1): 49-66 (2016)
• 
  Sanjeev Arora, Rong Ge, Ravi Kannan, Ankur Moitra:
  Computing a Nonnegative Matrix Factorization - Provably. SIAM J. Comput. 45(4): 1582-1611 (2016)
• 
  Gilad Asharov, Gil Segev:
  Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. SIAM J. Comput. 45(6): 2117-2176 (2016)
• 
  James Aspnes, Keren Censor-Hillel, Hagit Attiya, Danny Hendler:
  Lower Bounds for Restricted-Use Objects. SIAM J. Comput. 45(3): 734-762 (2016)
• 
  James Aspnes, Yuval Ishai, Peter Bro Miltersen:
  Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013). SIAM J. Comput. 45(2): 459-460 (2016)
• 
  Maria-Florina Balcan, Yingyu Liang:
  Clustering under Perturbation Resilience. SIAM J. Comput. 45(1): 102-155 (2016)
• 
  Pablo Barceló, Miguel Romero, Moshe Y. Vardi:
  Semantic Acyclicity on Graph Databases. SIAM J. Comput. 45(4): 1339-1376 (2016)
• 
  Yair Bartal, Lee-Ad Gottlieb, Robert Krauthgamer:
  The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme. SIAM J. Comput. 45(4): 1563-1581 (2016)
• 
  Libor Barto, Marcin Kozik:
  Robustly Solvable Constraint Satisfaction Problems. SIAM J. Comput. 45(4): 1646-1669 (2016)
• 
  Paul Beame, Chris Beck, Russell Impagliazzo:
  Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space. SIAM J. Comput. 45(4): 1612-1645 (2016)
• 
  Aaron Bernstein:
  Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs. SIAM J. Comput. 45(2): 548-574 (2016)
• 
  Jingguo Bi, Qi Cheng, J. Maurice Rojas:
  Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields. SIAM J. Comput. 45(4): 1433-1447 (2016)
• 
  Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
  On the Existence of Extractable One-Way Functions. SIAM J. Comput. 45(5): 1910-1952 (2016)
• 
  Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk:
  A c^k n 5-Approximation Algorithm for Treewidth. SIAM J. Comput. 45(2): 317-378 (2016)
• 
  Ilario Bonacina, Nicola Galesi, Neil Thapen:
  Total Space in Resolution. SIAM J. Comput. 45(5): 1894-1909 (2016)
• 
  Jin-Yi Cai, Xi Chen, Pinyan Lu:
  Nonnegative Weighted #CSP: An Effective Complexity Dichotomy. SIAM J. Comput. 45(6): 2177-2198 (2016)
• 
  Jin-Yi Cai, Heng Guo, Tyson Williams:
  A Complete Dichotomy Rises from the Capture of Vanishing Signatures. SIAM J. Comput. 45(5): 1671-1728 (2016)
• 
  Ran Canetti, Huijia Lin, Rafael Pass:
  Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions. SIAM J. Comput. 45(5): 1793-1834 (2016)
• 
  Armando Castañeda, Damien Imbs, Sergio Rajsbaum, Michel Raynal:
  Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects. SIAM J. Comput. 45(2): 379-414 (2016)
• 
  Deeparnab Chakrabarty, C. Seshadhri:
  An o(n) Monotonicity Tester for Boolean Functions over the Hypercube. SIAM J. Comput. 45(2): 461-472 (2016)
• 
  Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah:
  On the Power of Conditional Samples in Distribution Testing. SIAM J. Comput. 45(4): 1261-1296 (2016)
• 
  Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi:
  Upper and Lower Bounds on the Power of Advice. SIAM J. Comput. 45(4): 1412-1432 (2016)
• 
  Hubie Chen, Víctor Dalmau:
  Decomposing Quantified Conjunctive (or Disjunctive) Formulas. SIAM J. Comput. 45(6): 2066-2086 (2016)
• 
  Rajesh Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk:
  Designing FPT Algorithms for Cut Problems Using Randomized Contractions. SIAM J. Comput. 45(4): 1171-1229 (2016)
• 
  Kai-Min Chung, Rafael Pass, Karn Seth:
  Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security. SIAM J. Comput. 45(2): 415-458 (2016)
• 
  Julia Chuzhoy:
  Routing in Undirected Graphs with Constant Congestion. SIAM J. Comput. 45(4): 1490-1532 (2016)