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

• 2019
• 
  Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy:
  On the Computability of Conditional Probability. J. ACM 66(3): 23:1-23:40 (2019)
• 
  Anna Adamaszek, Sariel Har-Peled, Andreas Wiese:
  Approximation Schemes for Independent Set and Sparse Subsets of Polygons. J. ACM 66(4): 29:1-29:40 (2019)
• 
  Guy Avni, Thomas A. Henzinger, Ventsislav Chonev:
  Infinite-duration Bidding Games. J. ACM 66(4): 31:1-31:29 (2019)
• 
  Paul Beame, Vincent Liew:
  Toward Verifying Nonlinear Integer Arithmetic. J. ACM 66(3): 22:1-22:30 (2019)
• 
  Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young:
  Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness. J. ACM 66(1): 6:1-6:33 (2019)
• 
  Aaron Bernstein, Jacob Holm, Eva Rotenberg:
  Online Bipartite Matching with Amortized O(log ² n) Replacements. J. ACM 66(5): 37:1-37:23 (2019)
• 
  Steve Bishop, Matthew Fairbairn, Hannes Mehnert, Michael Norrish, Tom Ridge, Peter Sewell, Michael Smith, Keith Wansbrough:
  Engineering with Logic: Rigorous Test-Oracle Specification and Validation for TCP/IP and the Sockets API. J. ACM 66(1): 1:1-1:77 (2019)
• 
  Peter Bürgisser, Felipe Cucker, Pierre Lairez:
  Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time. J. ACM 66(1): 5:1-5:30 (2019)
• 
  Victor Bushkov, Dmytro Dziuma, Panagiota Fatourou, Rachid Guerraoui:
  The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live. J. ACM 66(1): 2:1-2:66 (2019)
• 
  Mahdi Cheraghchi:
  Capacity Upper Bounds for Deletion-type Channels. J. ACM 66(2): 9:1-9:79 (2019)
• 
  Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu:
  Hierarchical Clustering: Objective Functions and Algorithms. J. ACM 66(4): 26:1-26:42 (2019)
• 
  Vincent Despré, Francis Lazarus:
  Computing the Geometric Intersection Number of Curves. J. ACM 66(6): 45:1-45:49 (2019)
• 
  Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan, Christopher A. Wilkens:
  Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems. J. ACM 66(1): 7:1-7:41 (2019)
• 
  Yann Disser, Jan Hackfeld, Max Klimm:
  Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents. J. ACM 66(6): 40:1-40:41 (2019)
• 
  Thomas Ferrère, Oded Maler, Dejan Nickovic, Amir Pnueli:
  From Real-time Logic to Timed Automata. J. ACM 66(3): 19:1-19:31 (2019)
• 
  Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh:
  Exact Algorithms via Monotone Local Search. J. ACM 66(2): 8:1-8:23 (2019)
• 
  Pierre Fraigniaud, Amos Korman, Yoav Rodeh:
  Parallel Bayesian Search with No Coordination. J. ACM 66(3): 17:1-17:28 (2019)
• 
  Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
  Shellability is NP-complete. J. ACM 66(3): 21:1-21:18 (2019)
• 
  Heng Guo, Mark Jerrum, Jingcheng Liu:
  Uniform Sampling Through the Lovász Local Lemma. J. ACM 66(3): 18:1-18:31 (2019)
• 
  David G. Harris, Aravind Srinivasan:
  The Moser-Tardos Framework with Partial Resampling. J. ACM 66(5): 36:1-36:45 (2019)
• 
  Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah:
  On the Complexity of Hazard-free Circuits. J. ACM 66(4): 25:1-25:20 (2019)
• 
  Russell Impagliazzo, Raghu Meka, David Zuckerman:
  Pseudorandomness from Shrinkage. J. ACM 66(2): 11:1-11:16 (2019)
• 
  Satoru Iwata, Taihei Oki, Mizuyo Takamatsu:
  Index Reduction for Differential-algebraic Equations with Mixed Matrices. J. ACM 66(5): 35:1-35:34 (2019)
• 
  Artur Jez:
  Deciding Context Unification. J. ACM 66(6): 39:1-39:45 (2019)
• 
  Daniel M. Kane, Shachar Lovett, Shay Moran:
  Near-optimal Linear Decision Trees for k-SUM and Related Problems. J. ACM 66(3): 16:1-16:18 (2019)
• 
  Ken-ichi Kawarabayashi, Mikkel Thorup:
  Deterministic Edge Connectivity in Near-Linear Time. J. ACM 66(1): 4:1-4:50 (2019)
• 
  Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer:
  The Weisfeiler-Leman Dimension of Planar Graphs Is at Most 3. J. ACM 66(6): 44:1-44:31 (2019)
• 
  Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal:
  Bandits and Experts in Metric Spaces. J. ACM 66(4): 30:1-30:77 (2019)
• 
  Ilan Komargodski, Moni Naor, Eylon Yogev:
  White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. J. ACM 66(5): 34:1-34:28 (2019)
• 
  Christoph Lenzen, Joel Rybicki:
  Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus. J. ACM 66(5): 32:1-32:56 (2019)

skipping 15 more matches