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

• 2019
• 
  Olivier Bodini, Antoine Genitrini, Mehdi Naima:
  Ranked Schröder Trees. ANALCO 2019: 13-26
• 
  Oliver Cooley, Wenjie Fang, Nicola Del Giudice, Mihyun Kang:
  Subcritical random hypergraphs, high-order components, and hypertrees. ANALCO 2019: 111-118
• 
  Colin Desmarais, Cecilia Holmgren:
  Degree distributions of generalized hooking networks. ANALCO 2019: 103-110
• 
  James Allen Fill, Wei-Chun Hung:
  QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract). ANALCO 2019: 87-93
• 
  Zbigniew Golebiewski, Mateusz Klimczak:
  Protection Number of Recursive Trees. ANALCO 2019: 45-53
• 
  Benjamin Hackl, Clemens Heuberger, Stephan G. Wagner:
  Reducing Simply Generated Trees by Iterative Leaf Cutting. ANALCO 2019: 36-44
• 
  Clemens Heuberger, Daniel Krenn:
  Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory Functions of Regular Sequences. ANALCO 2019: 27-35
• 
  Simon Langowski, Mark Daniel Ward:
  Moments of Select Sets. ANALCO 2019: 67-73
• 
  Johannes Lengler, Anders Martinsson, Angelika Steger:
  When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument. ANALCO 2019: 94-102
• 
  Conrado Martínez, Markus Nebel, Sebastian Wild:
  Sesquickselect: One and a half pivots for cache-efficient selection. ANALCO 2019: 54-66
• 
  Michael Mitzenmacher:
  Arithmetic Progression Hypergraphs: Examining the Second Moment Method. ANALCO 2019: 127-134
• 
  Markus E. Nebel, Elisabeth Neumann, Sebastian Wild:
  Median-of-k Jumplists and Dangling-Min BSTs. ANALCO 2019: 74-86
• 
  Roberto I. Oliveira, Yuval Peres:
  Random walks on graphs: new bounds on hitting, meeting, coalescing and returning. ANALCO 2019: 119-126
• 
  Elie de Panafieu, Mohamed Lamine Lamali, Michael Wallner:
  Combinatorics of nondeterministic walks of the Dyck and Motzkin type. ANALCO 2019: 1-12
• 
  Marni Mishna, J. Ian Munro:
  Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019, San Diego, CA, USA, January 6, 2019. SIAM 2019 [contents]
• 2018
• 
  Maryam Bahrani, Jérémie O. Lumbroso:
  Split-Decomposition Trees with Prime Nodes: Enumeration and Random Generation of Cactus Graphs. ANALCO 2018: 143-157
• 
  Frédérique Bassino, Tsinjo Rakotoarimalala, Andrea Sportiello:
  The complexity of the Multiple Pattern Matching Problem for random strings. ANALCO 2018: 40-53
• 
  Maciej Bendkowski, Olivier Bodini, Sergey Dovgal:
  Polynomial tuning of multiparametric combinatorial samplers. ANALCO 2018: 92-106
• 
  Megan Bernstein, Matthew Fahrbach, Dana Randall:
  Analyzing Boltzmann Samplers for Bose-Einstein Condensates with Dirichlet Generating Functions. ANALCO 2018: 107-117
• 
  Colin Cooper, Alan M. Frieze, Samantha Petti:
  The cover time of a biased random walk on G_{n, p}. ANALCO 2018: 158-167
• 
  Kunal Dutta, C. R. Subramanian:
  On Induced Paths, Holes and Trees in Random Graphs. ANALCO 2018: 168-177
• 
  Joachim Gudmundsson, Irina Kostitsyna, Maarten Löffler, Tobias Müller, Vera Sacristán, Rodrigo I. Silveira:
  Theoretical analysis of beaconless geocast protocols in 1D. ANALCO 2018: 62-76
• 
  Lisa Hartung, Nina Holden, Yuval Peres:
  Trace reconstruction with varying deletion probabilities. ANALCO 2018: 54-61
• 
  Meng He, Richard Peng, Yinzhan Xu:
  Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts. ANALCO 2018: 32-39
• 
  Rosa M. Jiménez, Conrado Martínez:
  On Deletions in Open Addressing Hashing. ANALCO 2018: 23-31
• 
  Jérémie O. Lumbroso, Jessica Shi:
  Exponential Bounds on Graph Enumerations from Vertex Incremental Characterizations. ANALCO 2018: 118-132
• 
  Ralph Neininger, Jasmin Straub:
  Probabilistic Analysis of the Dual-Pivot Quicksort "Count". ANALCO 2018: 1-7
• 
  Konstantinos Panagiotou, Leon Ramzews:
  Asymptotic Enumeration of Graph Classes with Many Components. ANALCO 2018: 133-142
• 
  Chris Whidden, Frederick A. Matsen IV:
  Efficiently Inferring Pairwise Subtree Prune-and-Regraft Adjacencies between Phylogenetic Trees. ANALCO 2018: 77-91
• 
  Sebastian Wild:
  Quicksort Is Optimal For Many Equal Keys. ANALCO 2018: 8-22

skipping 219 more matches