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

• 2019
• 
  Lina Jansson Andrén, Carl Johan Casselgren, Klas Markström:
  Restricted completion of sparse partial Latin squares. Comb. Probab. Comput. 28(5): 675-695 (2019)
• 
  Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger:
  Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths. Comb. Probab. Comput. 28(4): 485-518 (2019)
• 
  József Balogh, Andrew Treglown, Zsolt Adam Wagner:
  Tilings in Randomly Perturbed Dense Graphs. Comb. Probab. Comput. 28(2): 159-176 (2019)
• 
  Alexander I. Barvinok, Guus Regts:
  Weighted counting of solutions to sparse systems of equations. Comb. Probab. Comput. 28(5): 696-719 (2019)
• 
  Erik Bates, Lisa Sauermann:
  An Upper Bound on the Size of Avoidance Couplings. Comb. Probab. Comput. 28(3): 325-334 (2019)
• 
  Patrick Bennett, Tom Bohman:
  A natural barrier in random greedy hypergraph matching. Comb. Probab. Comput. 28(6): 816-825 (2019)
• 
  François Bienvenu:
  Positive association of the oriented percolation cluster in randomly oriented graphs. Comb. Probab. Comput. 28(6): 811-815 (2019)
• 
  Antonio Blanca, Yuxuan Chen, David J. Galvin, Dana Randall, Prasad Tetali:
  Phase Coexistence for the Hard-Core Model on ℤ2. Comb. Probab. Comput. 28(1): 1-22 (2019)
• 
  Nicolas Bousquet, Louis Esperet, Ararat Harutyunyan, Rémi de Joannis de Verclos:
  Exact Distance Colouring in Trees. Comb. Probab. Comput. 28(2): 177-186 (2019)
• 
  Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman:
  Inversions in Split Trees and Conditional Galton-Watson Trees. Comb. Probab. Comput. 28(3): 335-364 (2019)
• 
  Sarah Cannon, David A. Levin, Alexandre Stauffer:
  Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings. Comb. Probab. Comput. 28(3): 365-387 (2019)
• 
  G. Collet, Michael Drmota, Lukas Daniel Klausner:
  Limit laws of planar maps with prescribed vertex degrees. Comb. Probab. Comput. 28(4): 519-541 (2019)
• 
  Stephen Desalvo, Igor Pak:
  Limit Shapes via Bijections. Comb. Probab. Comput. 28(2): 187-240 (2019)
• 
  Michael Drmota, Abram Magner, Wojciech Szpankowski:
  Asymmetric Rényi Problem. Comb. Probab. Comput. 28(4): 542-573 (2019)
• 
  David Ellis, Noam Lifshitz:
  On the union of intersecting families. Comb. Probab. Comput. 28(6): 826-839 (2019)
• 
  Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
  Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle. Comb. Probab. Comput. 28(2): 241-252 (2019)
• 
  Louis Esperet, Ross J. Kang, Stéphan Thomassé:
  Separation Choosability and Dense Bipartite Induced Subgraphs. Comb. Probab. Comput. 28(5): 720-732 (2019)
• 
  Jacob Fox, László Miklós Lovász, Yufei Zhao:
  A fast new algorithm for weak graph regularity. Comb. Probab. Comput. 28(5): 777-790 (2019)
• 
  Peter Frankl:
  A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families. Comb. Probab. Comput. 28(5): 733-739 (2019)
• 
  Shinya Fujita, Ruonan Li, Guanghui Wang:
  Decomposing edge-coloured graphs under colour degree constraints. Comb. Probab. Comput. 28(5): 755-767 (2019)
• 
  Wei Gao, Jie Han, Yi Zhao:
  Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles. Comb. Probab. Comput. 28(6): 840-870 (2019)
• 
  Olav Geil, Umberto Martínez-Peñas:
  Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives. Comb. Probab. Comput. 28(2): 253-279 (2019)
• 
  Gopal Goel, Andrew Ahn:
  Discrete derivative asymptotics of the β-Hermite eigenvalues. Comb. Probab. Comput. 28(5): 657-674 (2019)
• 
  Christina Goldschmidt, Michal Przykucki:
  Parking on a Random Tree. Comb. Probab. Comput. 28(1): 23-45 (2019)
• 
  Renan Gross, Uri Grupel:
  Indistinguishable Sceneries on the Boolean Hypercube. Comb. Probab. Comput. 28(1): 46-60 (2019)
• 
  Arran Hamm, Jeff Kahn:
  On Erdős-Ko-Rado for Random Hypergraphs II. Comb. Probab. Comput. 28(1): 61-80 (2019)
• 
  Arran Hamm, Jeff Kahn:
  On Erdős-Ko-Rado for random hypergraphs I. Comb. Probab. Comput. 28(6): 881-916 (2019)
• 
  Kevin Hendrey, David R. Wood:
  Defective and clustered choosability of sparse graphs. Comb. Probab. Comput. 28(5): 791-810 (2019)
• 
  Alexander E. Holroyd, Lionel Levine, Peter Winkler:
  Abelian Logic Gates. Comb. Probab. Comput. 28(3): 388-422 (2019)
• 
  Hsien-Kuei Hwang, Ralph Neininger, Marek Zaionc:
  Preface. Comb. Probab. Comput. 28(4): 483-484 (2019)

skipping 19 more matches