Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/rsa/rsa20.bht:"
@article{DBLP:journals/rsa/AbramsLLPZ02, author = {Aaron Abrams and Henry Landau and Zeph Landau and James Pommersheim and Eric Zaslow}, title = {Evasive random walks and the clairvoyant demon}, journal = {Random Struct. Algorithms}, volume = {20}, number = {2}, pages = {239--248}, year = {2002}, url = {https://doi.org/10.1002/rsa.999}, doi = {10.1002/RSA.999}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/AbramsLLPZ02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/AchlioptasKKT02, author = {Dimitris Achlioptas and Jeong Han Kim and Michael Krivelevich and Prasad Tetali}, title = {Two-coloring random hypergraphs}, journal = {Random Struct. Algorithms}, volume = {20}, number = {2}, pages = {249--259}, year = {2002}, url = {https://doi.org/10.1002/rsa.997}, doi = {10.1002/RSA.997}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/AchlioptasKKT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/AmitLM02, author = {Alon Amit and Nathan Linial and Jir{\'{\i}} Matousek}, title = {Random lifts of graphs: Independence and chromatic number}, journal = {Random Struct. Algorithms}, volume = {20}, number = {1}, pages = {1--22}, year = {2002}, url = {https://doi.org/10.1002/rsa.10003}, doi = {10.1002/RSA.10003}, timestamp = {Thu, 24 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/AmitLM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Baeza-YatesN02, author = {Ricardo A. Baeza{-}Yates and Gonzalo Navarro}, title = {New and faster filters for multiple approximate string matching}, journal = {Random Struct. Algorithms}, volume = {20}, number = {1}, pages = {23--49}, year = {2002}, url = {https://doi.org/10.1002/rsa.10014}, doi = {10.1002/RSA.10014}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/Baeza-YatesN02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Balister02, author = {Paul Balister}, title = {Vertex-distinguishing edge colorings of random graphs}, journal = {Random Struct. Algorithms}, volume = {20}, number = {1}, pages = {89--97}, year = {2002}, url = {https://doi.org/10.1002/rsa.10002}, doi = {10.1002/RSA.10002}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/Balister02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/BenderR02, author = {Michael A. Bender and Dana Ron}, title = {Testing properties of directed graphs: acyclicity and connectivity}, journal = {Random Struct. Algorithms}, volume = {20}, number = {2}, pages = {184--205}, year = {2002}, url = {https://doi.org/10.1002/rsa.10023}, doi = {10.1002/RSA.10023}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/BenderR02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/BohmanF02, author = {Tom Bohman and Alan M. Frieze}, title = {Addendum to avoiding a giant component}, journal = {Random Struct. Algorithms}, volume = {20}, number = {1}, pages = {126--130}, year = {2002}, url = {https://doi.org/10.1002/rsa.10018}, doi = {10.1002/RSA.10018}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/BohmanF02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/CarrV02, author = {Robert D. Carr and Santosh S. Vempala}, title = {Randomized metarounding}, journal = {Random Struct. Algorithms}, volume = {20}, number = {3}, pages = {343--352}, year = {2002}, url = {https://doi.org/10.1002/rsa.10033}, doi = {10.1002/RSA.10033}, timestamp = {Thu, 24 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/CarrV02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/DyerGM02, author = {Martin E. Dyer and Catherine S. Greenhill and Michael Molloy}, title = {Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs}, journal = {Random Struct. Algorithms}, volume = {20}, number = {1}, pages = {98--114}, year = {2002}, url = {https://doi.org/10.1002/rsa.10020}, doi = {10.1002/RSA.10020}, timestamp = {Thu, 24 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/DyerGM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/FeigeS02, author = {Uriel Feige and Gideon Schechtman}, title = {On the optimality of the random hyperplane rounding technique for {MAX} {CUT}}, journal = {Random Struct. Algorithms}, volume = {20}, number = {3}, pages = {403--440}, year = {2002}, url = {https://doi.org/10.1002/rsa.10036}, doi = {10.1002/RSA.10036}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/FeigeS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/FranklR02, author = {Peter Frankl and Vojtech R{\"{o}}dl}, title = {Extremal problems on set systems}, journal = {Random Struct. Algorithms}, volume = {20}, number = {2}, pages = {131--164}, year = {2002}, url = {https://doi.org/10.1002/rsa.10017}, doi = {10.1002/RSA.10017}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/FranklR02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/GarciaP02, author = {Nancy Lopes Garcia and Jos{\'{e}} Luis Palacios}, title = {On mixing times for stratified walks on the d-cube}, journal = {Random Struct. Algorithms}, volume = {20}, number = {4}, pages = {540--552}, year = {2002}, url = {https://doi.org/10.1002/rsa.10043}, doi = {10.1002/RSA.10043}, timestamp = {Mon, 21 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/GarciaP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Gartner02, author = {Bernd G{\"{a}}rtner}, title = {The Random-Facet simplex algorithm on combinatorial cubes}, journal = {Random Struct. Algorithms}, volume = {20}, number = {3}, pages = {353--381}, year = {2002}, url = {https://doi.org/10.1002/rsa.10034}, doi = {10.1002/RSA.10034}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Gartner02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/GnedinK02, author = {Alexander V. Gnedin and Sergei V. Kerov}, title = {Fibonacci solitaire}, journal = {Random Struct. Algorithms}, volume = {20}, number = {1}, pages = {71--88}, year = {2002}, url = {https://doi.org/10.1002/rsa.1028}, doi = {10.1002/RSA.1028}, timestamp = {Thu, 06 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/GnedinK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/HalperinZ02, author = {Eran Halperin and Uri Zwick}, title = {A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems}, journal = {Random Struct. Algorithms}, volume = {20}, number = {3}, pages = {382--402}, year = {2002}, url = {https://doi.org/10.1002/rsa.10035}, doi = {10.1002/RSA.10035}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/HalperinZ02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/HofstadHM02, author = {Remco van der Hofstad and Gerard Hooghiemstra and Piet Van Mieghem}, title = {On the covariance of the level sizes in random recursive trees}, journal = {Random Struct. Algorithms}, volume = {20}, number = {4}, pages = {519--539}, year = {2002}, url = {https://doi.org/10.1002/rsa.10030}, doi = {10.1002/RSA.10030}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/HofstadHM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/HuangPS02, author = {Bae{-}Shi Huang and Ljubomir Perkovic and Eric Schmutz}, title = {Inexpensive d-dimensional matchings}, journal = {Random Struct. Algorithms}, volume = {20}, number = {1}, pages = {50--58}, year = {2002}, url = {https://doi.org/10.1002/rsa.10027}, doi = {10.1002/RSA.10027}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/HuangPS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Istrate02, author = {Gabriel Istrate}, title = {The phase transition in random horn satisfiability and its algorithmic implications}, journal = {Random Struct. Algorithms}, volume = {20}, number = {4}, pages = {483--506}, year = {2002}, url = {https://doi.org/10.1002/rsa.10028}, doi = {10.1002/RSA.10028}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Istrate02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/JansonR02, author = {Svante Janson and Andrzej Rucinski}, title = {The infamous upper tail}, journal = {Random Struct. Algorithms}, volume = {20}, number = {3}, pages = {317--342}, year = {2002}, url = {https://doi.org/10.1002/rsa.10031}, doi = {10.1002/RSA.10031}, timestamp = {Thu, 23 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/JansonR02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/JiangLV02, author = {Tao Jiang and Ming Li and Paul M. B. Vit{\'{a}}nyi}, title = {The average-case area of Heilbronn-type triangles}, journal = {Random Struct. Algorithms}, volume = {20}, number = {2}, pages = {206--219}, year = {2002}, url = {https://doi.org/10.1002/rsa.10024}, doi = {10.1002/RSA.10024}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/JiangLV02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/JordanP02, author = {Tibor Jord{\'{a}}n and Alessandro Panconesi}, title = {Preface}, journal = {Random Struct. Algorithms}, volume = {20}, number = {3}, pages = {261}, year = {2002}, url = {https://doi.org/10.1002/rsa.10040}, doi = {10.1002/RSA.10040}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/JordanP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/KenyonM02, author = {Claire Kenyon and Michael Mitzenmacher}, title = {Linear waste of best fit bin packing on skewed distributions}, journal = {Random Struct. Algorithms}, volume = {20}, number = {3}, pages = {441--464}, year = {2002}, url = {https://doi.org/10.1002/rsa.10037}, doi = {10.1002/RSA.10037}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/KenyonM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/KonjevodRS02, author = {Goran Konjevod and R. Ravi and Aravind Srinivasan}, title = {Approximation algorithms for the covering Steiner problem}, journal = {Random Struct. Algorithms}, volume = {20}, number = {3}, pages = {465--482}, year = {2002}, url = {https://doi.org/10.1002/rsa.10038}, doi = {10.1002/RSA.10038}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/KonjevodRS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/LoweM02, author = {Matthias L{\"{o}}we and Christian Meise}, title = {Right order spectral gap estimates for generating sets of Z\({}_{\mbox{4}}\)}, journal = {Random Struct. Algorithms}, volume = {20}, number = {2}, pages = {220--238}, year = {2002}, url = {https://doi.org/10.1002/rsa.998}, doi = {10.1002/RSA.998}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/LoweM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/MarckertP02, author = {Jean{-}Fran{\c{c}}ois Marckert and Alois Panholzer}, title = {Noncrossing trees are almost conditioned Galton-Watson trees}, journal = {Random Struct. Algorithms}, volume = {20}, number = {1}, pages = {115--125}, year = {2002}, url = {https://doi.org/10.1002/rsa.10016}, doi = {10.1002/RSA.10016}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/MarckertP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/ParnasR02, author = {Michal Parnas and Dana Ron}, title = {Testing the diameter of graphs}, journal = {Random Struct. Algorithms}, volume = {20}, number = {2}, pages = {165--183}, year = {2002}, url = {https://doi.org/10.1002/rsa.10013}, doi = {10.1002/RSA.10013}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rsa/ParnasR02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Schweinsberg02, author = {Jason Schweinsberg}, title = {An O(n\({}^{\mbox{2}}\)) bound for the relaxation time of a Markov chain on cladograms}, journal = {Random Struct. Algorithms}, volume = {20}, number = {1}, pages = {59--70}, year = {2002}, url = {https://doi.org/10.1002/rsa.1029}, doi = {10.1002/RSA.1029}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Schweinsberg02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Vu02, author = {Van H. Vu}, title = {Concentration of non-Lipschitz functions and applications}, journal = {Random Struct. Algorithms}, volume = {20}, number = {3}, pages = {262--316}, year = {2002}, url = {https://doi.org/10.1002/rsa.10032}, doi = {10.1002/RSA.10032}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Vu02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Wierman02, author = {John C. Wierman}, title = {Bond percolation critical probability bounds for three Archimedean lattices}, journal = {Random Struct. Algorithms}, volume = {20}, number = {4}, pages = {507--518}, year = {2002}, url = {https://doi.org/10.1002/rsa.10029}, doi = {10.1002/RSA.10029}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Wierman02.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.