![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 23 matches
- 2002
- Noga Alon:
Testing subgraphs in large graphs. Random Struct. Algorithms 21(3-4): 359-370 (2002) - Noga Alon, Benjamin Doerr, Tomasz Luczak
, Tomasz Schoen
:
On the discrepancy of combinatorial rectangles. Random Struct. Algorithms 21(3-4): 205-215 (2002) - Noga Alon, Jaroslaw Grytczuk
, Mariusz Haluszczak, Oliver Riordan:
Nonrepetitive colorings of graphs. Random Struct. Algorithms 21(3-4): 336-346 (2002) - Gunnar Andersson, Lars Engebretsen:
Property testers for dense constraint satisfaction programs on finite domains. Random Struct. Algorithms 21(1): 14-32 (2002) - Sheng Bau, Nicholas C. Wormald, Sanming Zhou:
Decycling numbers of random regular graphs. Random Struct. Algorithms 21(3-4): 397-413 (2002) - Béla Bollobás, Alex D. Scott:
Problems and results on judicious partitions. Random Struct. Algorithms 21(3-4): 414-430 (2002) - Marshall W. Buck, Clara S. Chan, David P. Robbins:
On the expected value of the minimum assignment. Random Struct. Algorithms 21(1): 33-58 (2002) - Philippe Chassaing, Guy Louchard:
Phase transition for Parking blocks, Brownian excursion and coalescence. Random Struct. Algorithms 21(1): 76-119 (2002) - Don Coppersmith, David Gamarnik, Maxim Sviridenko:
The diameter of a long-range percolation graph. Random Struct. Algorithms 21(1): 1-13 (2002) - Y. Dementieva, Penny E. Haxell, Brendan Nagle, Vojtech Rödl:
On characterizing hypergraph regularity. Random Struct. Algorithms 21(3-4): 293-335 (2002) - William Duckworth, Nicholas C. Wormald:
Minimum independent dominating sets of random cubic graphs. Random Struct. Algorithms 21(2): 147-161 (2002) - David Eppstein, George S. Lueker:
The minimum expectation selection problem. Random Struct. Algorithms 21(3-4): 278-292 (2002) - Nadine Guillotin-Plantard, René Schott:
Distributed algorithms with dynamical random transitions. Random Struct. Algorithms 21(3-4): 371-396 (2002) - Svante Janson, Dana Randall, Joel Spencer:
Random dyadic tilings of the unit square. Random Struct. Algorithms 21(3-4): 225-251 (2002) - Jeong Han Kim, Benny Sudakov, Van H. Vu:
On the asymmetry of random regular graphs and random graphs. Random Struct. Algorithms 21(3-4): 216-224 (2002) - Marcos A. Kiwi
, Martin Loebl
:
Largest planar matching in random bipartite graphs. Random Struct. Algorithms 21(2): 162-181 (2002) - Ben J. Morris:
Improved bounds for sampling contingency tables. Random Struct. Algorithms 21(2): 135-146 (2002) - Markus E. Nebel:
A unified approach to the analysis of Horton-Strahler parameters of binary tree structures. Random Struct. Algorithms 21(3-4): 252-277 (2002) - Robert T. Smythe, J. A. Wellner:
Asymptotic analysis of (3, 2, 1)-shell sort. Random Struct. Algorithms 21(1): 59-75 (2002) - Joel Spencer, Géza Tóth:
Crossing numbers of random graphs. Random Struct. Algorithms 21(3-4): 347-358 (2002) - Michel Talagrand:
Gaussian averages, Bernoulli averages, and Gibbs' measures. Random Struct. Algorithms 21(3-4): 197-204 (2002) - David Bruce Wilson:
On the critical exponents of random k-SAT. Random Struct. Algorithms 21(2): 182-195 (2002) - Raphael Yuster:
The decomposition threshold for bipartite graphs with minimum degree one. Random Struct. Algorithms 21(2): 121-134 (2002)
loading more results
failed to load more results, please try again later
![](https://dblp1.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-06-20 10:26 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