Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/rsa/rsa10.bht:"
@article{DBLP:journals/rsa/BlomerKW97, author = {Johannes Bl{\"{o}}mer and Richard M. Karp and Emo Welzl}, title = {The rank of sparse random matrices over finite fields}, journal = {Random Struct. Algorithms}, volume = {10}, number = {4}, pages = {407--419}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199707)10:4\<407::AID-RSA1\>3.0.CO;2-Y}, doi = {10.1002/(SICI)1098-2418(199707)10:4\<407::AID-RSA1\>3.0.CO;2-Y}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/BlomerKW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/BoucheronG97, author = {St{\'{e}}phane Boucheron and Dani{\`{e}}le Gardy}, title = {An urn model from learning theory}, journal = {Random Struct. Algorithms}, volume = {10}, number = {1-2}, pages = {43--67}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199701/03)10:1/2\<43::AID-RSA3\>3.0.CO;2-X}, doi = {10.1002/(SICI)1098-2418(199701/03)10:1/2\<43::AID-RSA3\>3.0.CO;2-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/BoucheronG97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Chao97, author = {Chern{-}Ching Chao}, title = {A note on applications of the martingale central limit theorem to random permutations}, journal = {Random Struct. Algorithms}, volume = {10}, number = {3}, pages = {323--332}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199705)10:3\<323::AID-RSA2\>3.0.CO;2-Y}, doi = {10.1002/(SICI)1098-2418(199705)10:3\<323::AID-RSA2\>3.0.CO;2-Y}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Chao97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/CoffmanJSW97, author = {Edward G. Coffman Jr. and David S. Johnson and Peter W. Shor and Richard R. Weber}, title = {Bin packing with discrete item sizes, part {II:} Tight bounds on First Fit}, journal = {Random Struct. Algorithms}, volume = {10}, number = {1-2}, pages = {69--101}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199701/03)10:1/2\<69::AID-RSA4\>3.0.CO;2-V}, doi = {10.1002/(SICI)1098-2418(199701/03)10:1/2\<69::AID-RSA4\>3.0.CO;2-V}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/CoffmanJSW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Drmota97, author = {Michael Drmota}, title = {Systems of functional equations}, journal = {Random Struct. Algorithms}, volume = {10}, number = {1-2}, pages = {103--124}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199701/03)10:1/2\<103::AID-RSA5\>3.0.CO;2-Z}, doi = {10.1002/(SICI)1098-2418(199701/03)10:1/2\<103::AID-RSA5\>3.0.CO;2-Z}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Drmota97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/DrmotaG97, author = {Michael Drmota and Bernhard Gittenberger}, title = {On the profile of random trees}, journal = {Random Struct. Algorithms}, volume = {10}, number = {4}, pages = {421--451}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199707)10:4\<421::AID-RSA2\>3.0.CO;2-W}, doi = {10.1002/(SICI)1098-2418(199707)10:4\<421::AID-RSA2\>3.0.CO;2-W}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/DrmotaG97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/DyerKM97, author = {Martin E. Dyer and Ravi Kannan and John Mount}, title = {Sampling contingency tables}, journal = {Random Struct. Algorithms}, volume = {10}, number = {4}, pages = {487--506}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199707)10:4\<487::AID-RSA4\>3.0.CO;2-Q}, doi = {10.1002/(SICI)1098-2418(199707)10:4\<487::AID-RSA4\>3.0.CO;2-Q}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/DyerKM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/FlajoletS97, author = {Philippe Flajolet and Wojciech Szpankowski}, title = {Analysis of algorithms}, journal = {Random Struct. Algorithms}, volume = {10}, number = {1-2}, pages = {1--3}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199701)10:1/2\<1::AID-RSA1\>3.0.CO;2-4}, doi = {10.1002/(SICI)1098-2418(199701)10:1/2\<1::AID-RSA1\>3.0.CO;2-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/FlajoletS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/FriezeM97, author = {Alan M. Frieze and Colin McDiarmid}, title = {Algorithmic theory of random graphs}, journal = {Random Struct. Algorithms}, volume = {10}, number = {1-2}, pages = {5--42}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199701/03)10:1/2\<5::AID-RSA2\>3.0.CO;2-Z}, doi = {10.1002/(SICI)1098-2418(199701/03)10:1/2\<5::AID-RSA2\>3.0.CO;2-Z}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/FriezeM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/GrableP97, author = {David A. Grable and Alessandro Panconesi}, title = {Nearly optimal distributed edge coloring in O(log log n) rounds}, journal = {Random Struct. Algorithms}, volume = {10}, number = {3}, pages = {385--405}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199705)10:3\<385::AID-RSA6\>3.0.CO;2-S}, doi = {10.1002/(SICI)1098-2418(199705)10:3\<385::AID-RSA6\>3.0.CO;2-S}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/GrableP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Hwang97, author = {Hsien{-}Kuei Hwang}, title = {A constant arising from the analysis of algorithms for determining the maximum of a random walk}, journal = {Random Struct. Algorithms}, volume = {10}, number = {3}, pages = {333--335}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199705)10:3\<333::AID-RSA3\>3.0.CO;2-X}, doi = {10.1002/(SICI)1098-2418(199705)10:3\<333::AID-RSA3\>3.0.CO;2-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Hwang97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/JansonK97, author = {Svante Janson and Donald E. Knuth}, title = {Shellsort with three increments}, journal = {Random Struct. Algorithms}, volume = {10}, number = {1-2}, pages = {125--142}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199701/03)10:1/2\<125::AID-RSA6\>3.0.CO;2-X}, doi = {10.1002/(SICI)1098-2418(199701/03)10:1/2\<125::AID-RSA6\>3.0.CO;2-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/JansonK97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/KirschenhoferPM97, author = {Peter Kirschenhofer and Helmut Prodinger and Conrado Martinez}, title = {Analysis of Hoare's {FIND} algorithm with Median-of-three partition}, journal = {Random Struct. Algorithms}, volume = {10}, number = {1-2}, pages = {143--156}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199701/03)10:1/2\<143::AID-RSA7\>3.0.CO;2-V}, doi = {10.1002/(SICI)1098-2418(199701/03)10:1/2\<143::AID-RSA7\>3.0.CO;2-V}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/KirschenhoferPM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/LefmannS97, author = {Hanno Lefmann and Petr Savick{\'{y}}}, title = {Some typical properties of large {AND/OR} Boolean formulas}, journal = {Random Struct. Algorithms}, volume = {10}, number = {3}, pages = {337--351}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199705)10:3\<337::AID-RSA4\>3.0.CO;2-X}, doi = {10.1002/(SICI)1098-2418(199705)10:3\<337::AID-RSA4\>3.0.CO;2-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/LefmannS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Louchard97, author = {Guy Louchard}, title = {Probabilistic analysis of adaptative sampling}, journal = {Random Struct. Algorithms}, volume = {10}, number = {1-2}, pages = {157--168}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199701/03)10:1/2\<157::AID-RSA8\>3.0.CO;2-U}, doi = {10.1002/(SICI)1098-2418(199701/03)10:1/2\<157::AID-RSA8\>3.0.CO;2-U}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Louchard97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/MahmoudSR97, author = {Hosam M. Mahmoud and Robert T. Smythe and Mireille R{\'{e}}gnier}, title = {Analysis of Boyer-Moore-Horspool string-matching heuristic}, journal = {Random Struct. Algorithms}, volume = {10}, number = {1-2}, pages = {169--186}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199701/03)10:1/2\<169::AID-RSA9\>3.0.CO;2-T}, doi = {10.1002/(SICI)1098-2418(199701/03)10:1/2\<169::AID-RSA9\>3.0.CO;2-T}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/MahmoudSR97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/McDiarmidJS97, author = {Colin McDiarmid and Theodore Johnson and Harold S. Stone}, title = {On finding a minimum spanning tree in a network with random weights}, journal = {Random Struct. Algorithms}, volume = {10}, number = {1-2}, pages = {187--204}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199701/03)10:1/2\<187::AID-RSA10\>3.0.CO;2-6}, doi = {10.1002/(SICI)1098-2418(199701/03)10:1/2\<187::AID-RSA10\>3.0.CO;2-6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/McDiarmidJS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/MehlhornP97, author = {Kurt Mehlhorn and Volker Priebe}, title = {On the all-pairs shortest-path algorithm of Moffat and Takaoka}, journal = {Random Struct. Algorithms}, volume = {10}, number = {1-2}, pages = {205--220}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199701/03)10:1/2\<205::AID-RSA11\>3.0.CO;2-7}, doi = {10.1002/(SICI)1098-2418(199701/03)10:1/2\<205::AID-RSA11\>3.0.CO;2-7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/MehlhornP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/MillerP97, author = {Zevi Miller and Dan Pritikin}, title = {On randomized greedy matchings}, journal = {Random Struct. Algorithms}, volume = {10}, number = {3}, pages = {353--383}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199705)10:3\<353::AID-RSA5\>3.0.CO;2-V}, doi = {10.1002/(SICI)1098-2418(199705)10:3\<353::AID-RSA5\>3.0.CO;2-V}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/MillerP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/MolloyRRW97, author = {Michael Molloy and Hanna D. Robalewska and Robert W. Robinson and Nicholas C. Wormald}, title = {1-Factorizations of random regular graphs}, journal = {Random Struct. Algorithms}, volume = {10}, number = {3}, pages = {305--321}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199705)10:3\<305::AID-RSA1\>3.0.CO;2-\%23}, doi = {10.1002/(SICI)1098-2418(199705)10:3\<305::AID-RSA1\>3.0.CO;2-\%23}, timestamp = {Thu, 24 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/MolloyRRW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/PobleteVM97, author = {Patricio V. Poblete and Alfredo Viola and J. Ian Munro}, title = {The Diagonal Poisson Transform and its application to the analysis of a hashing scheme}, journal = {Random Struct. Algorithms}, volume = {10}, number = {1-2}, pages = {221--255}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199701/03)10:1/2\<221::AID-RSA12\>3.0.CO;2-B}, doi = {10.1002/(SICI)1098-2418(199701/03)10:1/2\<221::AID-RSA12\>3.0.CO;2-B}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/PobleteVM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Schmid97, author = {Ulrich Schmid}, title = {Static priority scheduling of aperiodic real-time tasks}, journal = {Random Struct. Algorithms}, volume = {10}, number = {1-2}, pages = {257--303}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199701/03)10:1/2\<257::AID-RSA13\>3.0.CO;2-5}, doi = {10.1002/(SICI)1098-2418(199701/03)10:1/2\<257::AID-RSA13\>3.0.CO;2-5}, timestamp = {Mon, 20 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/Schmid97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Woods97, author = {Alan R. Woods}, title = {Coloring rules for finite trees, and probabilities of monadic second order sentences}, journal = {Random Struct. Algorithms}, volume = {10}, number = {4}, pages = {453--485}, year = {1997}, url = {https://doi.org/10.1002/(SICI)1098-2418(199707)10:4\<453::AID-RSA3\>3.0.CO;2-T}, doi = {10.1002/(SICI)1098-2418(199707)10:4\<453::AID-RSA3\>3.0.CO;2-T}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Woods97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.