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

• 2022
• 
  Ali Akhavi, Frédéric Paccaut, Brigitte Vallée:
  Building Sources of Zero Entropy: Rescaling and Inserting Delays (Invited Talk). AofA 2022: 1:1-1:28
• 
  Etienne Bellin:
  On the Independence Number of Random Trees via Tricolourations. AofA 2022: 2:1-2:14
• 
  Fabian Burghart:
  A Modification of the Random Cutting Model. AofA 2022: 4:1-4:14
• 
  Yu-Sheng Chang, Michael Fuchs, Hexuan Liu, Michael Wallner, Guan-Ru Yu:
  Enumeration of d-Combining Tree-Child Networks. AofA 2022: 5:1-5:13
• 
  Guillaume Chapuy, Baptiste Louf, Harriet Walsh:
  Random Partitions Under the Plancherel-Hurwitz Measure, High Genus Hurwitz Numbers and Maps. AofA 2022: 6:1-6:12
• 
  Michael Drmota, Eva-Maria Hainzl:
  Universal Properties of Catalytic Variable Equations. AofA 2022: 7:1-7:15
• 
  Amalia Duch, Conrado Martínez:
  Partial Match Queries in Quad- K-d Trees. AofA 2022: 8:1-8:16
• 
  Zhicheng Gao:
  Improved Error Bounds for the Number of Irreducible Polynomials and Self-Reciprocal Irreducible Monic Polynomials with Prescribed Coefficients over a Finite Field. AofA 2022: 9:1-9:13
• 
  Benjamin Hackl, Alois Panholzer, Stephan Wagner:
  Uncovering a Random Tree. AofA 2022: 10:1-10:17
• 
  Philippe Jacquet, Svante Janson:
  Depth-First Search Performance in a Random Digraph with Geometric Degree Distribution. AofA 2022: 11:1-11:15
• 
  Jérémie O. Lumbroso, Conrado Martínez:
  Affirmative Sampling: Theory and Applications. AofA 2022: 12:1-12:17
• 
  Bianca Marin Moreno, Christine Fricker, Hanene Mohamed, Amaury Philippe, Martin Trépanier:
  Mean Field Analysis of an Incentive Algorithm for a Closed Stochastic Network. AofA 2022: 13:1-13:17
• 
  Ralph Neininger, Jasmin Straub:
  On the Contraction Method with Reduced Independence Assumptions. AofA 2022: 14:1-14:13
• 
  Andreas Nessmann:
  Polyharmonic Functions in the Quarter Plane. AofA 2022: 15:1-15:16
• 
  Gabriel Berzunza Ojeda, Cecilia Holmgren:
  Fragmentation Processes Derived from Conditioned Stable Galton-Watson Trees. AofA 2022: 3:1-3:14
• 
  Christoffer Olsson, Stephan Wagner:
  Automorphisms of Random Trees. AofA 2022: 16:1-16:16
• 
  Dimbinaina Ralaivaosaona:
  The Number of Sources and Isolated Vertices in Random Directed Acyclic Graphs. AofA 2022: 17:1-17:14
• 
  Front Matter, Table of Contents, Preface, Conference Organization. AofA 2022: 0:1-0:16
• 
  Mei Yin:
  Parking Functions, Multi-Shuffle, and Asymptotic Phenomena. AofA 2022: 18:1-18:12
• 
  Mark Daniel Ward:
  33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2022, June 20-24, 2022, Philadelphia, PA, USA. LIPIcs 225, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-230-3 [contents]