Остановите войну!
for scientists:
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 21 matches
- 2004
- Andrew D. Barbour, Gesine Reinert:
Correction: Small worlds. Random Struct. Algorithms 25(1): 115 (2004) - Michael A. Bender, Saurabh Sethia, Steven Skiena:
Data structures for maintaining set partitions. Random Struct. Algorithms 25(1): 43-67 (2004) - Jean Bertoin:
Random covering of an interval and a variation of Kingman's coalescent. Random Struct. Algorithms 25(3): 277-292 (2004) - Tom Bohman, Alan M. Frieze, Nicholas C. Wormald:
Avoidance of a giant component in half the edge set of a random graph. Random Struct. Algorithms 25(4): 432-449 (2004) - Vivek S. Borkar, Vladimir Ejov, Jerzy A. Filar:
Directed graphs, Hamiltonicity and doubly stochastic matrices. Random Struct. Algorithms 25(4): 376-395 (2004) - Fan R. K. Chung, Joshua N. Cooper:
De Bruijn cycles for covering codes. Random Struct. Algorithms 25(4): 421-431 (2004) - Colin Cooper:
The cores of random hypergraphs with a given degree sequence. Random Struct. Algorithms 25(4): 353-375 (2004) - Sándor Csörgo, Wei Biao Wu:
On the clustering of independent uniform random variables. Random Struct. Algorithms 25(4): 396-420 (2004) - Martin E. Dyer, Catherine S. Greenhill:
Corrigendum: The complexity of counting graph homomorphisms. Random Struct. Algorithms 25(3): 346-352 (2004) - Lars Engebretsen, Venkatesan Guruswami:
Is constraint satisfaction over two variables always easy? Random Struct. Algorithms 25(2): 150-178 (2004) - Michael M. Erlihson, Boris L. Granovsky:
Reversible coagulation-fragmentation processes and random combinatorial structures: Asymptotics for the number of groups. Random Struct. Algorithms 25(2): 227-245 (2004) - Jochen Geiger, Lars Kauffmann:
The shape of large Galton-Watson trees with possibly infinite variance. Random Struct. Algorithms 25(3): 311-335 (2004) - Johan Håstad, Srinivasan Venkatesh:
On the advantage over a random assignment. Random Struct. Algorithms 25(2): 117-149 (2004) - Charles Knessl, Wojciech Szpankowski:
On the number of full levels in tries. Random Struct. Algorithms 25(3): 247-276 (2004) - David A. Levin, Yuval Peres:
Identifying several biased coins encountered by a hidden random walk. Random Struct. Algorithms 25(1): 91-114 (2004) - Servet Martínez:
Some bounds on the coupon collector problem. Random Struct. Algorithms 25(2): 208-226 (2004) - Christian Mazza:
Simply generated trees, B-series and Wigner processes. Random Struct. Algorithms 25(3): 293-310 (2004) - Alois Panholzer:
The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees. Random Struct. Algorithms 25(2): 179-207 (2004) - Timothy Prescott, Francis Edward Su:
Random walks on the torus with several generators. Random Struct. Algorithms 25(3): 336-345 (2004) - Vojtech Rödl, Jozef Skokan:
Regularity Lemma for k-uniform hypergraphs. Random Struct. Algorithms 25(1): 1-42 (2004) - Mohammad R. Salavatipour:
A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova'sz Local Lemma. Random Struct. Algorithms 25(1): 68-90 (2004)
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-06-03 20:45 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