Остановите войну!
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 47 matches
- 1994
- David J. Aldous, Jim Pitman:
Brownian Bridge Asymptotics for Random Mappings. Random Struct. Algorithms 5(4): 487-512 (1994) - Noga Alon, Yuval Roichman:
Random Cayley Graphs and Expanders. Random Struct. Algorithms 5(2): 271-285 (1994) - Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg:
Low-Diameter Graph Decomposition Is in NC. Random Struct. Algorithms 5(3): 441-452 (1994) - Krystyna T. Balinska, Louis V. Quintas, Jerzy Szymanski:
Random Recursive Forests. Random Struct. Algorithms 5(1): 3-12 (1994) - Paul Balister, Béla Bollobás, Alan Stacey:
Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions. Random Struct. Algorithms 5(4): 573-590 (1994) - Philippe Biane:
Some Comments on the Paper "Brownian Bridge Asymptotics for Random Mappings". Random Struct. Algorithms 5(4): 513-516 (1994) - Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak:
On the Diameter and Radius of Random Subgraphs of the Cube. Random Struct. Algorithms 5(5): 627-648 (1994) - Andrei Z. Broder, Alan M. Frieze, Eli Shamir:
Finding Hidden Hamiltonian Cycles. Random Struct. Algorithms 5(3): 395-411 (1994) - Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal:
Near-perfect Token Distribution. Random Struct. Algorithms 5(4): 559-572 (1994) - Robin Carr, William M. Y. Goh, Eric Schmutz:
The Maximum Degree in a Random Tree and Related Problems. Random Struct. Algorithms 5(1): 13-24 (1994) - Anne Condon, Diane Hernek:
Random Walks on Colored Graphs. Random Struct. Algorithms 5(2): 285-304 (1994) - Colin Cooper:
The Threshold for Hamilton Cycles in the Square of a Random Graph. Random Struct. Algorithms 5(1): 25-32 (1994) - Linda L. Deneen, Gary M. Shute, Clark D. Thomborson:
A Probaby Fast, Provably Optimal Algorithm for Rectilinear Steiner Trees. Random Struct. Algorithms 5(4): 535-558 (1994) - Luc Devroye:
On Random Cartesian Trees. Random Struct. Algorithms 5(2): 305-328 (1994) - Michael Drmota:
The Instability Time Distribution Behavior of Slotted ALOHA. Random Struct. Algorithms 5(1): 33-44 (1994) - Paul Erdös, Tomasz Luczak:
Change of Leadership in a Random Graph Process. Random Struct. Algorithms 5(1): 243-252 (1994) - Alan M. Frieze, Svante Janson, Tomasz Luczak:
Introduction. Random Struct. Algorithms 5(1): 1-3 (1994) - Alan M. Frieze, Brendan D. McKay:
Multicolored Trees in Random Graphs. Random Struct. Algorithms 5(1): 45-56 (1994) - Alan M. Frieze, Stephen Suen:
On the Independence Number of Random Cubic Graphs. Random Struct. Algorithms 5(5): 649-664 (1994) - William M. Y. Goh, Eric Schmutz:
Unlabeled Trees: Distribution of the Maximum Degree. Random Struct. Algorithms 5(3): 411-440 (1994) - Walter J. Gutjahr:
Connection Reliabilities in Stochastic Acyclic Networks. Random Struct. Algorithms 5(1): 57-73 (1994) - Jennie C. Hansen:
Order Statistics for Decomposable Combinatorial Structures. Random Struct. Algorithms 5(4): 517-534 (1994) - Jerzy Jaworski, Ljuben R. Mutafchiev:
The Largest Connected in a Random Mapping. Random Struct. Algorithms 5(1): 73-94 (1994) - Jan Kärrman:
An Example of a Superproportional Graph. Random Struct. Algorithms 5(1): 95-98 (1994) - Rainer Kemp:
Balanced Ordered Trees. Random Struct. Algorithms 5(1): 99-122 (1994) - Claire Kenyon, Valerie King:
On Boolean Decision Trees with Faulty Nodes. Random Struct. Algorithms 5(3): 453-464 (1994) - Peter Kirschenhofer, Helmut Prodinger:
Multidimensional Digital Searching-Alternative Data Structures. Random Struct. Algorithms 5(1): 123-134 (1994) - Valentin F. Kolchin:
Random Graphs and Systems of Linear Equations in Finite Fields. Random Struct. Algorithms 5(1): 135-146 (1994) - A. V. Kostichka:
On the Number of Connected Subgraphs with Small Edge-Boundary in Regular Graphs. Random Struct. Algorithms 5(1): 147-154 (1994) - Guy Louchard:
Trie Size in a Dynamic List Structure. Random Struct. Algorithms 5(5): 665-702 (1994)
skipping 17 more matches
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-05-29 17:56 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