Остановите войну!
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 23 matches
- 1997
- Johannes Blömer, Richard M. Karp, Emo Welzl:
The rank of sparse random matrices over finite fields. Random Struct. Algorithms 10(4): 407-419 (1997) - Stéphane Boucheron, Danièle Gardy:
An urn model from learning theory. Random Struct. Algorithms 10(1-2): 43-67 (1997) - Chern-Ching Chao:
A note on applications of the martingale central limit theorem to random permutations. Random Struct. Algorithms 10(3): 323-332 (1997) - Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber:
Bin packing with discrete item sizes, part II: Tight bounds on First Fit. Random Struct. Algorithms 10(1-2): 69-101 (1997) - Michael Drmota:
Systems of functional equations. Random Struct. Algorithms 10(1-2): 103-124 (1997) - Michael Drmota, Bernhard Gittenberger:
On the profile of random trees. Random Struct. Algorithms 10(4): 421-451 (1997) - Martin E. Dyer, Ravi Kannan, John Mount:
Sampling contingency tables. Random Struct. Algorithms 10(4): 487-506 (1997) - Philippe Flajolet, Wojciech Szpankowski:
Analysis of algorithms. Random Struct. Algorithms 10(1-2): 1-3 (1997) - Alan M. Frieze, Colin McDiarmid:
Algorithmic theory of random graphs. Random Struct. Algorithms 10(1-2): 5-42 (1997) - David A. Grable, Alessandro Panconesi:
Nearly optimal distributed edge coloring in O(log log n) rounds. Random Struct. Algorithms 10(3): 385-405 (1997) - Hsien-Kuei Hwang:
A constant arising from the analysis of algorithms for determining the maximum of a random walk. Random Struct. Algorithms 10(3): 333-335 (1997) - Svante Janson, Donald E. Knuth:
Shellsort with three increments. Random Struct. Algorithms 10(1-2): 125-142 (1997) - Peter Kirschenhofer, Helmut Prodinger, Conrado Martinez:
Analysis of Hoare's FIND algorithm with Median-of-three partition. Random Struct. Algorithms 10(1-2): 143-156 (1997) - Hanno Lefmann, Petr Savický:
Some typical properties of large AND/OR Boolean formulas. Random Struct. Algorithms 10(3): 337-351 (1997) - Guy Louchard:
Probabilistic analysis of adaptative sampling. Random Struct. Algorithms 10(1-2): 157-168 (1997) - Hosam M. Mahmoud, Robert T. Smythe, Mireille Régnier:
Analysis of Boyer-Moore-Horspool string-matching heuristic. Random Struct. Algorithms 10(1-2): 169-186 (1997) - Colin McDiarmid, Theodore Johnson, Harold S. Stone:
On finding a minimum spanning tree in a network with random weights. Random Struct. Algorithms 10(1-2): 187-204 (1997) - Kurt Mehlhorn, Volker Priebe:
On the all-pairs shortest-path algorithm of Moffat and Takaoka. Random Struct. Algorithms 10(1-2): 205-220 (1997) - Zevi Miller, Dan Pritikin:
On randomized greedy matchings. Random Struct. Algorithms 10(3): 353-383 (1997) - Michael Molloy, Hanna D. Robalewska, Robert W. Robinson, Nicholas C. Wormald:
1-Factorizations of random regular graphs. Random Struct. Algorithms 10(3): 305-321 (1997) - Patricio V. Poblete, Alfredo Viola, J. Ian Munro:
The Diagonal Poisson Transform and its application to the analysis of a hashing scheme. Random Struct. Algorithms 10(1-2): 221-255 (1997) - Ulrich Schmid:
Static priority scheduling of aperiodic real-time tasks. Random Struct. Algorithms 10(1-2): 257-303 (1997) - Alan R. Woods:
Coloring rules for finite trees, and probabilities of monadic second order sentences. Random Struct. Algorithms 10(4): 453-485 (1997)
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-04-28 11: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