• 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 230 matches

• 2022
• 
  Xuangui Huang, Emanuele Viola:
  Approximate Degree, Weight, and Indistinguishability. ACM Trans. Comput. Theory 14(1): 3:1-3:26 (2022)
• 
  Victor Lagerkvist, Magnus Wahlström:
  The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems. ACM Trans. Comput. Theory 14(1): 2:1-2:54 (2022)
• 
  Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma:
  Erasure-Resilient Sublinear-Time Graph Algorithms. ACM Trans. Comput. Theory 14(1): 1:1-1:22 (2022)
• 
  Frédéric Magniez, Ashwin Nayak:
  Quantum Distributed Complexity of Set Disjointness on a Line. ACM Trans. Comput. Theory 14(1): 5:1-5:22 (2022)
• 
  Dana Ron, Asaf Rosin:
  Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness with One-Sided Error. ACM Trans. Comput. Theory 14(1): 4:1-4:31 (2022)
• 2021
• 
  Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs, Aleksejs Zajakins:
  All Classical Adversary Methods Are Equivalent for Total Functions. ACM Trans. Comput. Theory 13(1): 7:1-7:20 (2021)
• 
  Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf:
  Improved Bounds on Fourier Entropy and Min-entropy. ACM Trans. Comput. Theory 13(4): 22:1-22:40 (2021)
• 
  Florent Becker, Tom Besson, Jérôme Durand-Lose, Aurélien Emmanuel, Mohammad-Hadi Foroughmand-Araabi, Sama Goliaei, Shahrzad Heydarshahi:
  Abstract Geometrical Computation 10: An Intrinsically Universal Family of Signal Machines. ACM Trans. Comput. Theory 13(1): 4:1-4:31 (2021)
• 
  Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
  The Complexity of Approximating the Matching Polynomial in the Complex Plane. ACM Trans. Comput. Theory 13(2): 13:1-13:37 (2021)
• 
  Alex Brandts, Marcin Wrochna, Stanislav Zivný:
  The Complexity of Promise SAT on Non-Boolean Domains. ACM Trans. Comput. Theory 13(4): 26:1-26:20 (2021)
• 
  Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
  Complexity of Shift Bribery in Committee Elections. ACM Trans. Comput. Theory 13(3): 20:1-20:25 (2021)
• 
  Mark Bun, Nikhil S. Mande, Justin Thaler:
  Sign-rank Can Increase under Intersection. ACM Trans. Comput. Theory 13(4): 24:1-24:17 (2021)
• 
  Jin-yi Cai, Artem Govorov:
  On a Theorem of Lovász that (&sdot, H) Determines the Isomorphism Type of H. ACM Trans. Comput. Theory 13(2): 11:1-11:25 (2021)
• 
  Prasad Chaugule, Nutan Limaye, Aditya Varre:
  Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes. ACM Trans. Comput. Theory 13(4): 21:1-21:26 (2021)
• 
  Suryajith Chillara:
  On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits. ACM Trans. Comput. Theory 13(3): 16:1-16:21 (2021)
• 
  Holger Dell, John Lapinskas:
  Fine-Grained Reductions from Approximate Counting to Decision. ACM Trans. Comput. Theory 13(2): 8:1-8:24 (2021)
• 
  Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
  Multiplicative Parameterization Above a Guarantee. ACM Trans. Comput. Theory 13(3): 18:1-18:16 (2021)
• 
  Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi:
  Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ACM Trans. Comput. Theory 13(2): 10:1-10:25 (2021)
• 
  Andreas Galanis, Leslie Ann Goldberg, James Stewart:
  Fast Algorithms for General Spin Systems on Bipartite Expanders. ACM Trans. Comput. Theory 13(4): 25:1-25:18 (2021)
• 
  Andreas Göbel, J. A. Gregor Lagodzinski, Karen Seidel:
  Counting Homomorphisms to Trees Modulo a Prime. ACM Trans. Comput. Theory 13(3): 19:1-19:33 (2021)
• 
  Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
  On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. ACM Trans. Comput. Theory 13(4): 27:1-27:40 (2021)
• 
  Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
  Popular Matching in Roommates Setting Is NP-hard. ACM Trans. Comput. Theory 13(2): 9:1-9:20 (2021)
• 
  John M. Hitchcock, Adewale Sekoni, Hadi Shafei:
  Polynomial-Time Random Oracles and Separating Complexity Classes. ACM Trans. Comput. Theory 13(1): 11-16 (2021)
• 
  Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin:
  Computational and Proof Complexity of Partial String Avoidability. ACM Trans. Comput. Theory 13(1): 6:1-6:25 (2021)
• 
  Peter Jonsson, Victor Lagerkvist, Biman Roy:
  Fine-Grained Time Complexity of Constraint Satisfaction Problems. ACM Trans. Comput. Theory 13(1): 2:1-2:32 (2021)
• 
  Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor Carboni Oliveira:
  Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates. ACM Trans. Comput. Theory 13(4): 23:1-23:37 (2021)
• 
  William Kretschmer:
  Lower Bounding the AND-OR Tree via Symmetrization. ACM Trans. Comput. Theory 13(1): 3:1-3:11 (2021)
• 
  Qian Li, Xiaoming Sun:
  On the Sensitivity Complexity of k-Uniform Hypergraph Properties. ACM Trans. Comput. Theory 13(2): 12:1-12:13 (2021)
• 
  Neil Lutz:
  Fractal Intersections and Products via Algorithmic Dimension. ACM Trans. Comput. Theory 13(3): 14:1-14:15 (2021)
• 
  Akihiro Monde, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
  Can a Skywalker Localize the Midpoint of a Rope? ACM Trans. Comput. Theory 13(3): 17:1-17:23 (2021)

skipping 200 more matches