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

• 2016
• 
  Andreas Göbel, Leslie Ann Goldberg, David Richerby:
  Counting Homomorphisms to Square-Free Graphs, Modulo 2. ACM Trans. Comput. Theory 8(3): 12:1-12:29 (2016)
• 
  Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma:
  Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices. ACM Trans. Comput. Theory 8(3): 8:1-8:17 (2016)
• 
  Nir Ailon:
  An Omega((n log n)/R) Lower Bound for Fourier Transform Computation in the R-Well Conditioned Model. ACM Trans. Comput. Theory 8(1): 4:1-4:14 (2016)
• 
  Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou:
  Limitations of Deterministic Auction Design for Correlated Bidders. ACM Trans. Comput. Theory 8(4): 13:1-13:18 (2016)
• 
  Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai:
  Tractable Parameterizations for the Minimum Linear Arrangement Problem. ACM Trans. Comput. Theory 8(2): 6:1-6:12 (2016)
• 
  Eldar Fischer, Yonatan Goldhirsh, Oded Lachish:
  Testing Read-Once Formula Satisfaction. ACM Trans. Comput. Theory 8(2): 5:1-5:26 (2016)
• 
  Peter Fulla, Stanislav Zivný:
  A Galois Connection for Weighted (Relational) Clones of Infinite Size. ACM Trans. Comput. Theory 8(3): 9:1-9:21 (2016)
• 
  Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
  Space-Efficient Approximations for Subset Sum. ACM Trans. Comput. Theory 8(4): 16:1-16:28 (2016)
• 
  Oded Goldreich, Dana Ron:
  On Sample-Based Testers. ACM Trans. Comput. Theory 8(2): 7:1-7:54 (2016)
• 
  Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf:
  Planarizing Gadgets for Perfect Matching Do Not Exist. ACM Trans. Comput. Theory 8(4): 14:1-14:15 (2016)
• 
  Ishay Haviv, Oded Regev:
  The List-Decoding Size of Fourier-Sparse Boolean Functions. ACM Trans. Comput. Theory 8(3): 10:1-10:14 (2016)
• 
  Stefan Kratsch, Dániel Marx, Magnus Wahlström:
  Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. ACM Trans. Comput. Theory 8(1): 1:1-1:28 (2016)
• 
  Massimo Lauria:
  A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem. ACM Trans. Comput. Theory 8(4): 17:1-17:13 (2016)
• 
  Dung T. Nguyen, Alan L. Selman:
  Structural Properties of Nonautoreducible Sets. ACM Trans. Comput. Theory 8(3): 11:1-11:24 (2016)
• 
  Dana Ron, Gilad Tsur:
  The Power of an Example: Hidden Set Size Approximation Using Group Queries and Conditional Sampling. ACM Trans. Comput. Theory 8(4): 15:1-15:19 (2016)
• 
  Sylvain Schmitz:
  Complexity Hierarchies beyond Elementary. ACM Trans. Comput. Theory 8(1): 3:1-3:36 (2016)
• 
  Emanuele Viola:
  Quadratic Maps Are Hard to Sample. ACM Trans. Comput. Theory 8(4): 18:1-18:4 (2016)
• 
  Ilya Volkovich:
  Characterizing Arithmetic Read-Once Formulae. ACM Trans. Comput. Theory 8(1): 2:1-2:19 (2016)