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 24 matches
- 2021
- Dimitris Achlioptas, Amin Coja-Oghlan, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Manuel Penschuck, Guangyan Zhou:
The number of satisfying assignments of random 2-SAT formulas. Random Struct. Algorithms 58(4): 609-647 (2021) - Louigi Addario-Berry, Shankar Bhamidi, Sanchayan Sen:
A probabilistic approach to the leader problem in random graphs. Random Struct. Algorithms 58(1): 34-67 (2021) - Michael Anastos, Alan M. Frieze:
Finding maximum matchings in random regular graphs in linear expected time. Random Struct. Algorithms 58(3): 390-429 (2021) - Andrew D. Barbour, Peter Braunsteins, Nathan Ross:
Local limit theorems for occupancy models. Random Struct. Algorithms 58(1): 3-33 (2021) - Tom Bohman, Peter Keevash:
Dynamic concentration of the triangle-free process. Random Struct. Algorithms 58(2): 221-293 (2021) - Gilles Bonnet, Zakhar Kabluchko, Nicola Turchi:
Phase transition for the volume of high-dimensional random polytopes. Random Struct. Algorithms 58(4): 648-663 (2021) - Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda:
Fast algorithms at low temperatures via Markov chains. Random Struct. Algorithms 58(2): 294-321 (2021) - Antares Chen, David G. Harris, Aravind Srinivasan:
Partial resampling to approximate covering integer programs. Random Struct. Algorithms 58(1): 68-93 (2021) - Jean-François Delmas, Jean-Stéphane Dhersin, Marion Sciauveau:
Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon. Random Struct. Algorithms 58(1): 94-149 (2021) - Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger:
Node profiles of symmetric digital search trees: Concentration properties. Random Struct. Algorithms 58(3): 430-467 (2021) - Michael Farber, Tahl Nowik:
Topological embeddings into random 2-complexes. Random Struct. Algorithms 58(4): 664-675 (2021) - Jacob Fox, Cosmin Pohoata:
Sets without k-term progressions can have many shorter progressions. Random Struct. Algorithms 58(3): 383-389 (2021) - Lior Gishboliner, Asaf Shapira, Henrique Stagni:
Testing linear inequalities of subgraph statistics. Random Struct. Algorithms 58(3): 468-479 (2021) - Jie Han, Patrick Morris, Andrew Treglown:
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu. Random Struct. Algorithms 58(3): 480-516 (2021) - John Haslegrave, Christoforos Panagiotis:
Site percolation and isoperimetric inequalities for plane graphs. Random Struct. Algorithms 58(1): 150-163 (2021) - Tomas Juskevicius, Valentas Kurauskas:
On the Littlewood-Offord problem for arbitrary distributions. Random Struct. Algorithms 58(2): 370-380 (2021) - Joonkyung Lee:
On some graph densities in locally dense graphs. Random Struct. Algorithms 58(2): 322-344 (2021) - Nati Linial, Michael Simkin:
A randomized construction of high girth regular graphs. Random Struct. Algorithms 58(2): 345-369 (2021) - Yang P. Liu, Yufei Zhao:
On the upper tail problem for random hypergraphs. Random Struct. Algorithms 58(2): 179-220 (2021) - Peter Pfaffelhuber, Jakob Stiefel:
The range of once-reinforced random walk in one dimension. Random Struct. Algorithms 58(1): 164-175 (2021) - Ross G. Pinsky:
Permutations avoiding a pattern of length three under Mallows distributions. Random Struct. Algorithms 58(4): 676-690 (2021) - Boris G. Pittel:
On Bollobás-Riordan random pairing model of preferential attachment graph. Random Struct. Algorithms 58(4): 691-725 (2021) - Konstantin E. Tikhomirov, Pierre Youssef:
Outliers in spectrum of sparse Wigner matrices. Random Struct. Algorithms 58(3): 517-605 (2021) - Dirk Zeindler:
Long cycle of random permutations with polynomially growing cycle weights. Random Struct. Algorithms 58(4): 726-739 (2021)
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-10-06 07:25 CEST 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