default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- 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.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 27 matches
- 2020
- Andrei Asinowski, Cyril Banderier:
On Lattice Paths with Marked Patterns: Generating Functions and Multivariate Gaussian Distribution. AofA 2020: 1:1-1:16 - Cyril Banderier, Marie-Louise Lackner, Michael Wallner:
Latticepathology and Symmetric Functions (Extended Abstract). AofA 2020: 2:1-2:16 - Frédérique Bassino, Tsinjo Rakotoarimalala, Andrea Sportiello:
The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings. AofA 2020: 3:1-3:15 - Valérie Berthé, Eda Cesaratto, Frédéric Paccaut, Pablo Rotondo, Martín D. Safe, Brigitte Vallée:
Two Arithmetical Sources and Their Associated Tries. AofA 2020: 4:1-4:19 - Gabriel Berzunza Ojeda, Xing Shi Cai, Cecilia Holmgren:
The k-Cut Model in Conditioned Galton-Watson Trees. AofA 2020: 5:1-5:10 - Gabriel Berzunza Ojeda, Cecilia Holmgren:
Largest Clusters for Supercritical Percolation on Split Trees. AofA 2020: 6:1-6:10 - Jacopo Borga, Mickaël Maazoun:
Scaling and Local Limits of Baxter Permutations Through Coalescent-Walk Processes. AofA 2020: 7:1-7:18 - Mireille Bousquet-Mélou, Michael Wallner:
More Models of Walks Avoiding a Quadrant. AofA 2020: 8:1-8:14 - François Chapon, Éric Fusy, Kilian Raschel:
Polyharmonic Functions And Random Processes in Cones. AofA 2020: 9:1-9:19 - Michael Drmota, Marc Noy, Benedikt Stufler:
Cut Vertices in Random Planar Maps. AofA 2020: 10:1-10:18 - Ilse Fischer, Matjaz Konvalinka:
The First Bijective Proof of the Alternating Sign Matrix Theorem Theorem. AofA 2020: 12:1-12:12 - Zhicheng Gao, Mihyun Kang:
Counting Cubic Maps with Large Genus. AofA 2020: 13:1-13:13 - Alexander V. Gnedin, Amirlan Seksenbayev:
Diffusion Limits in the Online Subsequence Selection Problems. AofA 2020: 14:1-14:15 - Philippe Jacquet, Wojciech Szpankowski:
Analysis of Lempel-Ziv'78 for Markov Sources. AofA 2020: 15:1-15:19 - Philippe Jacquet, Krzysztof Turowski, Wojciech Szpankowski:
Power-Law Degree Distribution in the Connected Component of a Duplication Graph. AofA 2020: 16:1-16:14 - Svante Janson, Wojciech Szpankowski:
Hidden Words Statistics for Large Patterns. AofA 2020: 17:1-17:15 - Mihyun Kang, Michael Missethan:
The Giant Component and 2-Core in Sparse Random Outerplanar Graphs. AofA 2020: 18:1-18:16 - Stefan Klootwijk, Bodo Manthey:
Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics. AofA 2020: 19:1-19:16 - Michael Krivelevich, Tamás Mészáros, Peleg Michaeli, Clara Shikhelman:
Greedy Maximal Independent Sets via Local Limits. AofA 2020: 20:1-20:19 - Cécile Mailler, Peter Mörters, Anna Senkevich:
The Disordered Chinese Restaurant and Other Competing Growth Processes. AofA 2020: 21:1-21:13 - Ralph Neininger, Jasmin Straub:
Convergence Rates in the Probabilistic Analysis of Algorithms. AofA 2020: 22:1-22:13 - Antony Pearson, Manuel E. Lladser:
Hidden Independence in Unstructured Probabilistic Models. AofA 2020: 23:1-23:13 - Andrew Elvey Price, Wenjie Fang, Michael Wallner:
Asymptotics of Minimal Deterministic Finite Automata Recognizing a Finite Binary Language. AofA 2020: 11:1-11:13 - Dimbinaina Ralaivaosaona, Clément Requilé, Stephan Wagner:
Block Statistics in Subcritical Graph Classes. AofA 2020: 24:1-24:14 - Dimbinaina Ralaivaosaona, Vonjy Rasendrahasina, Stephan Wagner:
On the Probability That a Random Digraph Is Acyclic. AofA 2020: 25:1-25:18 - Front Matter, Table of Contents, Preface, Conference Organization. AofA 2020: 0:1-0:12
- Michael Drmota, Clemens Heuberger:
31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2020, June 15-19, 2020, Klagenfurt, Austria (Virtual Conference). LIPIcs 159, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-147-4 [contents]
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-12-22 06:11 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint