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

• 2018
• 
  Mohammed Amin Abdullah, Nikolaos Fountoulakis:
  A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs. Random Struct. Algorithms 52(3): 379-418 (2018)
• 
  Louigi Addario-Berry, Laura Eslava:
  High degrees in random recursive trees. Random Struct. Algorithms 52(4): 560-575 (2018)
• 
  Alessandro Arlotto, Yehua Wei, Xinchang Xie:
  An adaptive O(log n)-optimal policy for the online selection of a monotone subsequence from a random sample. Random Struct. Algorithms 52(1): 41-53 (2018)
• 
  Chen Avin, Michal Koucký, Zvi Lotker:
  Cover time and mixing time of random walks on dynamic graphs. Random Struct. Algorithms 52(4): 576-596 (2018)
• 
  Paul Balister, Béla Bollobás, Jonathan Lee, Bhargav P. Narayanan:
  Line percolation. Random Struct. Algorithms 52(4): 597-616 (2018)
• 
  J. Barré, Marc Lelarge, Dieter Mitsche:
  On rigidity, orientability, and cores of random graphs with sliders. Random Struct. Algorithms 52(3): 419-453 (2018)
• 
  Alessandra Caraceni, Nicolas Curien:
  Geometry of the uniform infinite half-planar quadrangulation. Random Struct. Algorithms 52(3): 454-494 (2018)
• 
  Carl Johan Casselgren:
  Coloring graphs of various maximum degree from random lists. Random Struct. Algorithms 52(1): 54-73 (2018)
• 
  Asaf Ferber, Van Vu:
  Packing perfect matchings in random hypergraphs. Random Struct. Algorithms 52(3): 367-378 (2018)
• 
  David Gamarnik, Quan Li:
  On the max-cut of sparse random graphs. Random Struct. Algorithms 52(2): 219-262 (2018)
• 
  Pu Gao, Michael Molloy:
  Inside the clustering window for random linear equations. Random Struct. Algorithms 52(2): 197-218 (2018)
• 
  Pu Gao, Xavier Pérez-Giménez, Cristiane M. Sato:
  Arboricity and spanning-tree packing in random graphs. Random Struct. Algorithms 52(3): 495-535 (2018)
• 
  Lior Gishboliner, Michael Krivelevich, Gal Kronenberg:
  On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. Random Struct. Algorithms 52(4): 545-559 (2018)
• 
  David G. Harris, Aravind Srinivasan:
  Improved bounds and algorithms for graph cuts and network reliability. Random Struct. Algorithms 52(1): 74-135 (2018)
• 
  Wilfried Huss, Lionel Levine, Ecaterina Sava-Huss:
  Interpolating between random walk and rotor walk. Random Struct. Algorithms 52(2): 263-282 (2018)
• 
  Mikhail Isaev, Brendan D. McKay:
  Complex martingales and asymptotic enumeration. Random Struct. Algorithms 52(4): 617-661 (2018)
• 
  Srikanth K. Iyer:
  The random connection model: Connectivity, edge lengths, and degree distributions. Random Struct. Algorithms 52(2): 283-300 (2018)
• 
  Varun S. Jog, Po-Ling Loh:
  Persistence of centrality in random growing trees. Random Struct. Algorithms 52(1): 136-157 (2018)
• 
  Jeong Han Kim, Sang June Lee, Joohan Na:
  On the total variation distance between the binomial random graph and the random intersection graph. Random Struct. Algorithms 52(4): 662-679 (2018)
• 
  Matthew Kwan, Benny Sudakov:
  Intercalates and discrepancy in random Latin squares. Random Struct. Algorithms 52(2): 181-196 (2018)
• 
  Guy Moshkovitz, Asaf Shapira:
  Decomposing a graph into expanding subgraphs. Random Struct. Algorithms 52(1): 158-178 (2018)
• 
  Brendan Nagle, Vojtech Rödl, Mathias Schacht:
  An algorithmic hypergraph regularity lemma. Random Struct. Algorithms 52(2): 301-353 (2018)
• 
  Dmitry Panchenko:
  On the K-sat model with large number of clauses. Random Struct. Algorithms 52(3): 536-542 (2018)
• 
  Barna Saha, Aravind Srinivasan:
  A new approximation technique for resource-allocation problems. Random Struct. Algorithms 52(4): 680-715 (2018)
• 
  Mathias Schacht, Fabian Schulenburg:
  Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs. Random Struct. Algorithms 52(1): 3-40 (2018)
• 
  Paul M. B. Vitányi:
  On the average-case complexity of Shellsort. Random Struct. Algorithms 52(2): 354-363 (2018)
• 
  Issue information. Random Struct. Algorithms 52(3): 365-366 (2018)
• 
  Issue information. Random Struct. Algorithms 52(4): 543-544 (2018)