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 28 matches
- 2006
- Noga Alon, Eitan Bachmat:
Regular graphs whose subgraphs tend to be acyclic. Random Struct. Algorithms 29(3): 324-337 (2006) - Paul N. Balister, Béla Bollobás, Robert Kozma:
Large deviations for mean field models of probabilistic cellular automata. Random Struct. Algorithms 29(3): 399-415 (2006) - Jacob van den Berg, Olle Häggström, Jeff Kahn:
Some conditional correlation inequalities for percolation and related processes. Random Struct. Algorithms 29(4): 417-435 (2006) - Jean Bertoin, Grégory Miermont:
Asymptotics in Knuth's parking problem for caravans. Random Struct. Algorithms 29(1): 38-55 (2006) - Béla Bollobás, Jeong Han Kim, Jacques Verstraëte:
Regular subgraphs of random graphs. Random Struct. Algorithms 29(1): 1-13 (2006) - Béla Bollobás, Oliver Riordan:
Sharp thresholds and percolation in the plane. Random Struct. Algorithms 29(4): 524-548 (2006) - Mireille Bousquet-Mélou:
Limit laws for embedded trees: Applications to the integrated superBrownian excursion. Random Struct. Algorithms 29(4): 475-523 (2006) - Amin Coja-Oghlan:
A spectral heuristic for bisecting random graphs. Random Struct. Algorithms 29(3): 351-398 (2006) - Béla Csaba, Sachin Lodha:
A randomized on-line algorithm for the k-server problem on a line. Random Struct. Algorithms 29(1): 82-104 (2006) - Yotam Drier, Nathan Linial:
Minors in lifts of graphs. Random Struct. Algorithms 29(2): 208-225 (2006) - Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze, Eric Vigoda:
Randomly coloring sparse random graphs with fewer colors than the maximum degree. Random Struct. Algorithms 29(4): 450-465 (2006) - Robert B. Ellis, Xingde Jia, Catherine H. Yan:
On random points in the unit disk. Random Struct. Algorithms 29(1): 14-25 (2006) - Zhicheng Gao, Daniel Panario:
Degree distribution of the greatest common divisor of polynomials over Fq. Random Struct. Algorithms 29(1): 26-37 (2006) - Michel X. Goemans, Jan Vondrák:
Covering minimum spanning trees of random subgraphs. Random Struct. Algorithms 29(3): 257-276 (2006) - Johan Håstad:
The square lattice shuffle. Random Struct. Algorithms 29(4): 466-474 (2006) - Matthias Heveling, Günter Last:
Existence, uniqueness, and algorithmic computation of general lilypond systems. Random Struct. Algorithms 29(3): 338-350 (2006) - Svante Janson:
Random cutting and records in deterministic and random trees. Random Struct. Algorithms 29(2): 139-179 (2006) - Jonathan H. Jordan:
The degree sequences and spectra of scale-free random graphs. Random Struct. Algorithms 29(2): 226-242 (2006) - Mihyun Kang, Youngmee Koh, Sangwook Ree, Tomasz Luczak:
The connectivity threshold for the min-degree random graph process. Random Struct. Algorithms 29(1): 105-120 (2006) - Zsolt Katona:
Levels of a scale-free tree. Random Struct. Algorithms 29(2): 194-207 (2006) - Shuji Kijima, Tomomi Matsui:
Polynomial time perfect sampling algorithm for two-rowed contingency tables. Random Struct. Algorithms 29(2): 243-256 (2006) - Michael Krivelevich, Asaf Nachmias:
Coloring complete bipartite graphs from random lists. Random Struct. Algorithms 29(4): 436-449 (2006) - Michael Krivelevich, Benny Sudakov, Prasad Tetali:
On smoothed analysis in dense graphs and formulas. Random Struct. Algorithms 29(2): 180-193 (2006) - Andreas Maurer:
Concentration inequalities for functions of independent variables. Random Struct. Algorithms 29(2): 121-138 (2006) - Colin McDiarmid, Bruce A. Reed:
Concentration for self-bounding functions and an inequality of Talagrand. Random Struct. Algorithms 29(4): 549-557 (2006) - Elchanan Mossel, Amir Shpilka, Luca Trevisan:
On epsilon-biased generators in NC0. Random Struct. Algorithms 29(1): 56-81 (2006) - Ross G. Pinsky:
Law of large numbers for increasing subsequences of random permutations. Random Struct. Algorithms 29(3): 277-295 (2006) - Toyoaki Sugimoto, Naoto Miyoshi:
On the asymptotics of fault probability in least-recently-used caching with Zipf-type request distribution. Random Struct. Algorithms 29(3): 296-323 (2006)
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-02 16:17 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