Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/rsa/rsa8.bht:"
@article{DBLP:journals/rsa/BergE96, author = {J. van den Berg and A. Ermakov}, title = {A new lower bound for the critical probability of site percolation on the square lattice}, journal = {Random Struct. Algorithms}, volume = {8}, number = {3}, pages = {199--212}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199605)8:3\<199::AID-RSA4\>3.0.CO;2-T}, doi = {10.1002/(SICI)1098-2418(199605)8:3\<199::AID-RSA4\>3.0.CO;2-T}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/BergE96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Fill96, author = {James Allen Fill}, title = {On the distribution of binary search trees under the random permutation model}, journal = {Random Struct. Algorithms}, volume = {8}, number = {1}, pages = {1--25}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199601)8:1\<1::AID-RSA1\>3.0.CO;2-1}, doi = {10.1002/(SICI)1098-2418(199601)8:1\<1::AID-RSA1\>3.0.CO;2-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Fill96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/FillH96, author = {James Allen Fill and Lars Holst}, title = {On the distribution of search cost for the move-to-front rule}, journal = {Random Struct. Algorithms}, volume = {8}, number = {3}, pages = {179--186}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199605)8:3\<179::AID-RSA2\>3.0.CO;2-V}, doi = {10.1002/(SICI)1098-2418(199605)8:3\<179::AID-RSA2\>3.0.CO;2-V}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/FillH96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Fundia96, author = {Andr{\'{e}}s D. Fundia}, title = {Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs}, journal = {Random Struct. Algorithms}, volume = {8}, number = {2}, pages = {131--147}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199603)8:2\<131::AID-RSA4\>3.0.CO;2-Z}, doi = {10.1002/(SICI)1098-2418(199603)8:2\<131::AID-RSA4\>3.0.CO;2-Z}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Fundia96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Furedi96, author = {Zolt{\'{a}}n F{\"{u}}redi}, title = {Scrambling permutations and entropy of hypergraphs}, journal = {Random Struct. Algorithms}, volume = {8}, number = {2}, pages = {97--104}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199603)8:2\<97::AID-RSA1\>3.0.CO;2-J}, doi = {10.1002/(SICI)1098-2418(199603)8:2\<97::AID-RSA1\>3.0.CO;2-J}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Furedi96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Hildebrand96, author = {Martin Hildebrand}, title = {Random walks on random simple graphs}, journal = {Random Struct. Algorithms}, volume = {8}, number = {4}, pages = {301--318}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199607)8:4\<301::AID-RSA2\>3.0.CO;2-1}, doi = {10.1002/(SICI)1098-2418(199607)8:4\<301::AID-RSA2\>3.0.CO;2-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Hildebrand96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Howard96, author = {C. Douglas Howard}, title = {Detecting defects in periodic scenery by random walks on {Z}}, journal = {Random Struct. Algorithms}, volume = {8}, number = {1}, pages = {59--74}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199601)8:1\<59::AID-RSA3\>3.0.CO;2-Q}, doi = {10.1002/(SICI)1098-2418(199601)8:1\<59::AID-RSA3\>3.0.CO;2-Q}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Howard96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Hwang96, author = {Hsien{-}Kuei Hwang}, title = {Limit theorems for mergesort}, journal = {Random Struct. Algorithms}, volume = {8}, number = {4}, pages = {319--336}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199607)8:4\<319::AID-RSA3\>3.0.CO;2-0}, doi = {10.1002/(SICI)1098-2418(199607)8:4\<319::AID-RSA3\>3.0.CO;2-0}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Hwang96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Jong96, author = {Peter de Jong}, title = {A central limit theorem with applications to random hypergraphs}, journal = {Random Struct. Algorithms}, volume = {8}, number = {2}, pages = {105--120}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199603)8:2\<105::AID-RSA2\>3.0.CO;2-1}, doi = {10.1002/(SICI)1098-2418(199603)8:2\<105::AID-RSA2\>3.0.CO;2-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Jong96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Kahn96, author = {Jeff Kahn}, title = {A linear programming perspective on the Frankl - R{\"{o}}dl - Pippenger theorem}, journal = {Random Struct. Algorithms}, volume = {8}, number = {2}, pages = {149--157}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199603)8:2\<149::AID-RSA5\>3.0.CO;2-Y}, doi = {10.1002/(SICI)1098-2418(199603)8:2\<149::AID-RSA5\>3.0.CO;2-Y}, timestamp = {Mon, 05 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Kahn96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/KestenP96, author = {Harry Kesten and Boris G. Pittel}, title = {A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree}, journal = {Random Struct. Algorithms}, volume = {8}, number = {4}, pages = {243--299}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199607)8:4\<243::AID-RSA1\>3.0.CO;2-Y}, doi = {10.1002/(SICI)1098-2418(199607)8:4\<243::AID-RSA1\>3.0.CO;2-Y}, timestamp = {Fri, 26 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/KestenP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/McDiarmid96, author = {Colin McDiarmid}, title = {A random bit-flipping method for seeking agreement}, journal = {Random Struct. Algorithms}, volume = {8}, number = {2}, pages = {121--130}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199603)8:2\<121::AID-RSA3\>3.0.CO;2-\%23}, doi = {10.1002/(SICI)1098-2418(199603)8:2\<121::AID-RSA3\>3.0.CO;2-\%23}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/McDiarmid96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Molloy96, author = {Michael Molloy}, title = {A gap between the appearances of a k-core and a (k+1)-chromatic graph}, journal = {Random Struct. Algorithms}, volume = {8}, number = {2}, pages = {159--160}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199603)8:2\<159::AID-RSA6\>3.0.CO;2-X}, doi = {10.1002/(SICI)1098-2418(199603)8:2\<159::AID-RSA6\>3.0.CO;2-X}, timestamp = {Thu, 24 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/Molloy96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/RodlT96, author = {Vojtech R{\"{o}}dl and Lubos Thoma}, title = {Asymptotic packing and the random greedy algorithm}, journal = {Random Struct. Algorithms}, volume = {8}, number = {3}, pages = {161--177}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199605)8:3\<161::AID-RSA1\>3.0.CO;2-W}, doi = {10.1002/(SICI)1098-2418(199605)8:3\<161::AID-RSA1\>3.0.CO;2-W}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/RodlT96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Roos96, author = {Malgorzata Roos}, title = {An extension of Janson's inequality}, journal = {Random Struct. Algorithms}, volume = {8}, number = {3}, pages = {213--227}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199605)8:3\<213::AID-RSA5\>3.0.CO;2-0}, doi = {10.1002/(SICI)1098-2418(199605)8:3\<213::AID-RSA5\>3.0.CO;2-0}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Roos96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Sidorenko96, author = {Alexander F. Sidorenko}, title = {Randomness friendly graphs}, journal = {Random Struct. Algorithms}, volume = {8}, number = {3}, pages = {229--241}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199605)8:3\<229::AID-RSA6\>3.0.CO;2-\%23}, doi = {10.1002/(SICI)1098-2418(199605)8:3\<229::AID-RSA6\>3.0.CO;2-\%23}, timestamp = {Mon, 28 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Sidorenko96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/SimonsY96, author = {Gordon Simons and Yi{-}Ching Yao}, title = {Asymptotic sine laws arising from alternating random permutations and sequences}, journal = {Random Struct. Algorithms}, volume = {8}, number = {1}, pages = {75--95}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199601)8:1\<75::AID-RSA4\>3.0.CO;2-O}, doi = {10.1002/(SICI)1098-2418(199601)8:1\<75::AID-RSA4\>3.0.CO;2-O}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/SimonsY96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/SrivastavS96, author = {Anand Srivastav and Peter Stangier}, title = {Algorithmic Chernoff-Hoeffding inequalities in integer programming}, journal = {Random Struct. Algorithms}, volume = {8}, number = {1}, pages = {27--58}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199601)8:1\<27::AID-RSA2\>3.0.CO;2-T}, doi = {10.1002/(SICI)1098-2418(199601)8:1\<27::AID-RSA2\>3.0.CO;2-T}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/SrivastavS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Vega96, author = {Wenceslas Fernandez de la Vega}, title = {{MAX-CUT} has a randomized approximation scheme in dense graphs}, journal = {Random Struct. Algorithms}, volume = {8}, number = {3}, pages = {187--198}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199605)8:3\<187::AID-RSA3\>3.0.CO;2-U}, doi = {10.1002/(SICI)1098-2418(199605)8:3\<187::AID-RSA3\>3.0.CO;2-U}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Vega96.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.