![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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
- 2008
- Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder:
Routing complexity of faulty networks. Random Struct. Algorithms 32(1): 71-87 (2008) - Mihalis Beis, William Duckworth, Michele Zito:
Packing vertices and edges in random regular graphs. Random Struct. Algorithms 32(1): 20-37 (2008) - Michael Ben-Or
, Don Coppersmith, Michael Luby, Ronitt Rubinfeld:
Non-abelian homomorphism testing, and distributions close to their self-convolutions. Random Struct. Algorithms 32(1): 49-70 (2008) - Itai Benjamini, Simi Haber
, Michael Krivelevich, Eyal Lubetzky:
The isoperimetric constant of the random graph process. Random Struct. Algorithms 32(1): 101-114 (2008) - Manuel Bodirsky
, Clemens Gröpl, Mihyun Kang
:
Generating unlabeled connected cubic planar graphs uniformly at random. Random Struct. Algorithms 32(2): 157-180 (2008) - Tom Bohman
, Alan M. Frieze
, Benny Sudakov:
The game chromatic number of random graphs. Random Struct. Algorithms 32(2): 223-235 (2008) - Béla Bollobás, Oliver Riordan:
Percolation on dual lattices with k-fold symmetry. Random Struct. Algorithms 32(4): 463-472 (2008) - Magnus Bordewich
, Martin E. Dyer
, Marek Karpinski:
Path coupling using stopping times and counting independent sets and colorings in hypergraphs. Random Struct. Algorithms 32(3): 375-399 (2008) - Alex Brodsky, Shlomo Hoory:
Simple permutations mix even better. Random Struct. Algorithms 32(3): 274-289 (2008) - Nicolas Broutin, Luc Devroye, Erin McLeish, M. de la Salle:
The height of increasing trees. Random Struct. Algorithms 32(4): 494-518 (2008) - Guan-Yu Chen
, Laurent Saloff-Coste:
The cutoff phenomenon for randomized riffle shuffles. Random Struct. Algorithms 32(3): 346-374 (2008) - Demetres Christofides
, Klas Markström:
Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales. Random Struct. Algorithms 32(1): 88-100 (2008) - Fan Chung Graham, Ronald L. Graham:
Quasi-random graphs with given degree sequences. Random Struct. Algorithms 32(1): 1-19 (2008) - Colin Cooper, Alan M. Frieze
:
The cover time of the giant component of a random graph. Random Struct. Algorithms 32(4): 401-439 (2008) - Michel Dekking, Károly Simon:
On the size of the algebraic difference of two random Cantor sets. Random Struct. Algorithms 32(2): 205-222 (2008) - Petros Drineas
, Ravi Kannan, Michael W. Mahoney:
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms. Random Struct. Algorithms 32(3): 307-333 (2008) - Zeev Dvir, Ran Raz
:
Analyzing linear mergers. Random Struct. Algorithms 32(3): 334-345 (2008) - Abraham Flaxman:
A spectral technique for random satisfiable 3CNF formulas. Random Struct. Algorithms 32(4): 519-534 (2008) - Zhicheng Gao, Nicholas C. Wormald:
Distribution of subgraphs of random regular graphs. Random Struct. Algorithms 32(1): 38-48 (2008) - Nicholas Georgiou, Malgorzata Kuchta
, Michal Morayne, Jaroslaw Niemiec:
On a universal best choice algorithm for partially ordered sets. Random Struct. Algorithms 32(3): 263-273 (2008) - Stefanie Gerke, Dirk Schlatter, Angelika Steger, Anusch Taraz:
The random planar graph process. Random Struct. Algorithms 32(2): 236-261 (2008) - William M. Y. Goh, Pawel Hitczenko
:
Random partitions with restricted part sizes. Random Struct. Algorithms 32(4): 440-462 (2008) - Oded Goldreich
, Dana Ron
:
Approximating average parameters of graphs. Random Struct. Algorithms 32(4): 473-493 (2008) - Bhupendra Gupta, Srikanth K. Iyer, D. Manjunath:
Topological properties of the one dimensional exponential random geometric graph. Random Struct. Algorithms 32(2): 181-204 (2008) - David Kravitz:
On an online random k-SAT model. Random Struct. Algorithms 32(1): 115-124 (2008) - Mathew D. Penrose, Andrew R. Wade
:
Limit theory for the random on-line nearest-neighbor graph. Random Struct. Algorithms 32(2): 125-156 (2008) - Benny Sudakov, Jan Vondrák:
How many random edges make a dense hypergraph non-2-colorable? Random Struct. Algorithms 32(3): 290-306 (2008)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-07-01 00:15 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