Girão, António; Illingworth, Freddie; Scott, Alex; Wood, David R. Defective coloring of hypergraphs. (English) Zbl 07823352 Random Struct. Algorithms 64, No. 3, 663-675 (2024). MSC: 05C15 05C65 PDFBibTeX XMLCite \textit{A. Girão} et al., Random Struct. Algorithms 64, No. 3, 663--675 (2024; Zbl 07823352) Full Text: DOI arXiv OA License
Fox, Jacob; Himwich, Zoe; Mani, Nitya Extremal results on feedback arc sets in digraphs. (English) Zbl 07811290 Random Struct. Algorithms 64, No. 2, 287-308 (2024). MSC: 05C20 05C35 PDFBibTeX XMLCite \textit{J. Fox} et al., Random Struct. Algorithms 64, No. 2, 287--308 (2024; Zbl 07811290) Full Text: DOI arXiv OA License
Yuster, Raphael The number of bounded-degree spanning trees. (English) Zbl 1522.05042 Random Struct. Algorithms 62, No. 3, 737-757 (2023). MSC: 05C05 05C30 05C07 05C40 PDFBibTeX XMLCite \textit{R. Yuster}, Random Struct. Algorithms 62, No. 3, 737--757 (2023; Zbl 1522.05042) Full Text: DOI arXiv
Bansal, Nikhil; Harris, David G. Some remarks on hypergraph matching and the Füredi-Kahn-Seymour conjecture. (English) Zbl 1522.05336 Random Struct. Algorithms 62, No. 1, 52-67 (2023). MSC: 05C65 05C70 90C27 68W25 PDFBibTeX XMLCite \textit{N. Bansal} and \textit{D. G. Harris}, Random Struct. Algorithms 62, No. 1, 52--67 (2023; Zbl 1522.05336) Full Text: DOI arXiv
Bodini, Olivier; Genitrini, Antoine; Gittenberger, Bernhard; Larcher, Isabella; Naima, Mehdi Compaction for two models of logarithmic-depth trees: analysis and experiments. (English) Zbl 1522.05031 Random Struct. Algorithms 61, No. 1, 31-61 (2022). MSC: 05C05 05C10 05A15 68P05 PDFBibTeX XMLCite \textit{O. Bodini} et al., Random Struct. Algorithms 61, No. 1, 31--61 (2022; Zbl 1522.05031) Full Text: DOI arXiv
van der Hofstad, Remco; Komjáthy, Júlia; Vadon, Viktória Phase transition in random intersection graphs with communities. (English) Zbl 1522.05446 Random Struct. Algorithms 60, No. 3, 406-461 (2022). MSC: 05C80 05C82 60C05 91D30 PDFBibTeX XMLCite \textit{R. van der Hofstad} et al., Random Struct. Algorithms 60, No. 3, 406--461 (2022; Zbl 1522.05446) Full Text: DOI arXiv OA License
Pallavoor, Ramesh Krishnan S.; Raskhodnikova, Sofya; Waingarten, Erik Approximating the distance to monotonicity of Boolean functions. (English) Zbl 1522.68749 Random Struct. Algorithms 60, No. 2, 233-260 (2022). MSC: 68W20 06E30 PDFBibTeX XMLCite \textit{R. K. S. Pallavoor} et al., Random Struct. Algorithms 60, No. 2, 233--260 (2022; Zbl 1522.68749) Full Text: DOI
Raskhodnikova, Sofya; Ron-Zewi, Noga; Varma, Nithin Erasures versus errors in local decoding and property testing. (English) Zbl 1522.68750 Random Struct. Algorithms 59, No. 4, 640-670 (2021). MSC: 68W20 94B35 PDFBibTeX XMLCite \textit{S. Raskhodnikova} et al., Random Struct. Algorithms 59, No. 4, 640--670 (2021; Zbl 1522.68750) Full Text: DOI
Pinsky, Ross G. The infinite limit of separable permutations. (English) Zbl 07749502 Random Struct. Algorithms 59, No. 4, 622-639 (2021). Reviewer: Michael Wallner (Wien) MSC: 05A05 60C05 60B10 PDFBibTeX XMLCite \textit{R. G. Pinsky}, Random Struct. Algorithms 59, No. 4, 622--639 (2021; Zbl 07749502) Full Text: DOI arXiv
Dyer, Martin; Greenhill, Catherine; Müller, Haiko Counting independent sets in graphs with bounded bipartite pathwidth. (English) Zbl 1522.05202 Random Struct. Algorithms 59, No. 2, 204-237 (2021). MSC: 05C30 05C69 60J10 68W25 68Q25 PDFBibTeX XMLCite \textit{M. Dyer} et al., Random Struct. Algorithms 59, No. 2, 204--237 (2021; Zbl 1522.05202) Full Text: DOI
Achlioptas, Dimitris; Coja-Oghlan, Amin; Hahn-Klimroth, Max; Lee, Joon; Müller, Noëla; Penschuck, Manuel; Zhou, Guangyan The number of satisfying assignments of random 2-SAT formulas. (English) Zbl 1522.68375 Random Struct. Algorithms 58, No. 4, 609-647 (2021). MSC: 68R07 60F05 68Q87 PDFBibTeX XMLCite \textit{D. Achlioptas} et al., Random Struct. Algorithms 58, No. 4, 609--647 (2021; Zbl 1522.68375) Full Text: DOI OA License
de Graaf, Maurits; Boucherie, Richard J.; Hurink, Johann L.; van Ommeren, Jan-Kees An average case analysis of the minimum spanning tree heuristic for the power assignment problem. (English) Zbl 1430.68469 Random Struct. Algorithms 55, No. 1, 89-103 (2019). MSC: 68W40 68R10 68W25 PDFBibTeX XMLCite \textit{M. de Graaf} et al., Random Struct. Algorithms 55, No. 1, 89--103 (2019; Zbl 1430.68469) Full Text: DOI
Berman, Piotr; Murzabulatov, Meiram; Raskhodnikova, Sofya Testing convexity of figures under the uniform distribution. (English) Zbl 1417.52002 Random Struct. Algorithms 54, No. 3, 413-443 (2019). Reviewer: George Stoica (Saint John) MSC: 52A05 52A27 PDFBibTeX XMLCite \textit{P. Berman} et al., Random Struct. Algorithms 54, No. 3, 413--443 (2019; Zbl 1417.52002) Full Text: DOI
McDiarmid, Colin; Yolov, Nikola Random perfect graphs. (English) Zbl 1405.05165 Random Struct. Algorithms 54, No. 1, 148-186 (2019). MSC: 05C80 05C17 05C15 PDFBibTeX XMLCite \textit{C. McDiarmid} and \textit{N. Yolov}, Random Struct. Algorithms 54, No. 1, 148--186 (2019; Zbl 1405.05165) Full Text: DOI arXiv
Chern, Hua-Huai; Fuchs, Michael; Hwang, Hsien-Kuei; Neininger, Ralph Dependence and phase changes in random \(m\)-ary search trees. (English) Zbl 1364.05023 Random Struct. Algorithms 50, No. 3, 353-379 (2017). MSC: 05C05 05C80 05C12 05C38 68P10 PDFBibTeX XMLCite \textit{H.-H. Chern} et al., Random Struct. Algorithms 50, No. 3, 353--379 (2017; Zbl 1364.05023) Full Text: DOI arXiv
Parczyk, Olaf; Person, Yury Spanning structures and universality in sparse hypergraphs. (English) Zbl 1352.05139 Random Struct. Algorithms 49, No. 4, 819-844 (2016). MSC: 05C65 05C42 05C80 05C60 05D40 PDFBibTeX XMLCite \textit{O. Parczyk} and \textit{Y. Person}, Random Struct. Algorithms 49, No. 4, 819--844 (2016; Zbl 1352.05139) Full Text: DOI arXiv
Ben-Sasson, Eli; Viderman, Michael A combinatorial characterization of smooth LTCs and applications. (English) Zbl 1409.94921 Random Struct. Algorithms 49, No. 2, 280-307 (2016). MSC: 94B05 PDFBibTeX XMLCite \textit{E. Ben-Sasson} and \textit{M. Viderman}, Random Struct. Algorithms 49, No. 2, 280--307 (2016; Zbl 1409.94921) Full Text: DOI
Cooper, Jeff; Mubayi, Dhruv List coloring triangle-free hypergraphs. (English) Zbl 1325.05075 Random Struct. Algorithms 47, No. 3, 487-519 (2015). MSC: 05C15 05C65 PDFBibTeX XMLCite \textit{J. Cooper} and \textit{D. Mubayi}, Random Struct. Algorithms 47, No. 3, 487--519 (2015; Zbl 1325.05075) Full Text: DOI arXiv
Coja-Oghlan, Amin; Efthymiou, Charilaos On independent sets in random graphs. (English) Zbl 1325.05147 Random Struct. Algorithms 47, No. 3, 436-486 (2015). MSC: 05C80 05C69 05C42 PDFBibTeX XMLCite \textit{A. Coja-Oghlan} and \textit{C. Efthymiou}, Random Struct. Algorithms 47, No. 3, 436--486 (2015; Zbl 1325.05147) Full Text: DOI arXiv
Perkins, Will Random \(k\)-SAT and the power of two choices. (English) Zbl 1322.05125 Random Struct. Algorithms 47, No. 1, 163-173 (2015). MSC: 05C80 68T20 60C05 PDFBibTeX XMLCite \textit{W. Perkins}, Random Struct. Algorithms 47, No. 1, 163--173 (2015; Zbl 1322.05125) Full Text: DOI arXiv
Viderman, Michael A combination of testability and decodability by tensor products. (English) Zbl 1316.94112 Random Struct. Algorithms 46, No. 3, 572-598 (2015). MSC: 94B05 94B35 PDFBibTeX XMLCite \textit{M. Viderman}, Random Struct. Algorithms 46, No. 3, 572--598 (2015; Zbl 1316.94112) Full Text: DOI
Rubinfeld, Ronitt; Xie, Ning Robust characterizations of \(k\)-wise independence over product spaces and related testing results. (English) Zbl 1281.68230 Random Struct. Algorithms 43, No. 3, 265-312 (2013). MSC: 68W20 68Q87 42A16 PDFBibTeX XMLCite \textit{R. Rubinfeld} and \textit{N. Xie}, Random Struct. Algorithms 43, No. 3, 265--312 (2013; Zbl 1281.68230) Full Text: DOI
Sinclair, Alistair; Vilenchik, Dan Delaying satisfiability for random 2SAT. (English) Zbl 1272.05185 Random Struct. Algorithms 43, No. 2, 251-263 (2013). MSC: 05C80 05C85 PDFBibTeX XMLCite \textit{A. Sinclair} and \textit{D. Vilenchik}, Random Struct. Algorithms 43, No. 2, 251--263 (2013; Zbl 1272.05185) Full Text: DOI
Anandkumar, Animashree; Hassidim, Avinatan; Kelner, Jonathan Topology discovery of sparse random graphs with few participants. (English) Zbl 1270.05088 Random Struct. Algorithms 43, No. 1, 16-48 (2013). MSC: 05C80 05C42 05C10 PDFBibTeX XMLCite \textit{A. Anandkumar} et al., Random Struct. Algorithms 43, No. 1, 16--48 (2013; Zbl 1270.05088) Full Text: DOI Link
Frieze, Alan; Melsted, Páll Maximum matchings in random bipartite graphs and the space utilization of cuckoo hash tables. (English) Zbl 1252.05175 Random Struct. Algorithms 41, No. 3, 334-364 (2012). MSC: 05C70 05C35 05C80 68P05 68P10 68R10 PDFBibTeX XMLCite \textit{A. Frieze} and \textit{P. Melsted}, Random Struct. Algorithms 41, No. 3, 334--364 (2012; Zbl 1252.05175) Full Text: DOI arXiv
Fountoulakis, Nikolaos; Panagiotou, Konstantinos Sharp load thresholds for cuckoo hashing. (English) Zbl 1252.68084 Random Struct. Algorithms 41, No. 3, 306-333 (2012). MSC: 68P05 68R10 05C80 05C65 68P10 PDFBibTeX XMLCite \textit{N. Fountoulakis} and \textit{K. Panagiotou}, Random Struct. Algorithms 41, No. 3, 306--333 (2012; Zbl 1252.68084) Full Text: DOI arXiv
Gronau, Ilan; Moran, Shlomo; Snir, Sagi Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges. (English) Zbl 1238.05055 Random Struct. Algorithms 40, No. 3, 350-384 (2012). MSC: 05C05 05C85 05C60 92D15 PDFBibTeX XMLCite \textit{I. Gronau} et al., Random Struct. Algorithms 40, No. 3, 350--384 (2012; Zbl 1238.05055) Full Text: DOI
Krivelevich, Michael; Sudakov, Benny; Wormald, Nicholas Regular induced subgraphs of a random graph. (English) Zbl 1223.05278 Random Struct. Algorithms 38, No. 3, 235-250 (2011). MSC: 05C80 05C35 PDFBibTeX XMLCite \textit{M. Krivelevich} et al., Random Struct. Algorithms 38, No. 3, 235--250 (2011; Zbl 1223.05278) Full Text: DOI arXiv
Călinescu, Gruia; Chekuri, Chandra; Vondrák, Jan Disjoint bases in a polymatroid. (English) Zbl 1205.05039 Random Struct. Algorithms 35, No. 4, 418-430 (2009). MSC: 05B35 PDFBibTeX XMLCite \textit{G. Călinescu} et al., Random Struct. Algorithms 35, No. 4, 418--430 (2009; Zbl 1205.05039) Full Text: DOI
Newman, Ilan Computing in fault tolerant broadcast networks and noisy decision trees. (English) Zbl 1208.68054 Random Struct. Algorithms 34, No. 4, 478-501 (2009). MSC: 68M10 68M12 68M15 PDFBibTeX XMLCite \textit{I. Newman}, Random Struct. Algorithms 34, No. 4, 478--501 (2009; Zbl 1208.68054) Full Text: DOI
Hatami, Hamed; Molloy, Michael Sharp thresholds for constraint satisfaction problems and homomorphisms. (English) Zbl 1182.05110 Random Struct. Algorithms 33, No. 3, 310-332 (2008). MSC: 05C80 05C65 PDFBibTeX XMLCite \textit{H. Hatami} and \textit{M. Molloy}, Random Struct. Algorithms 33, No. 3, 310--332 (2008; Zbl 1182.05110) Full Text: DOI arXiv
Gärtner, Bernd; Tschirschnitz, Falk; Welzl, Emo; Solymosi, József; Valtr, Pavel One line and \(n\) points. (English) Zbl 1154.90545 Random Struct. Algorithms 23, No. 4, 453-471 (2003). MSC: 90C08 60C05 60D05 90C15 PDFBibTeX XMLCite \textit{B. Gärtner} et al., Random Struct. Algorithms 23, No. 4, 453--471 (2003; Zbl 1154.90545) Full Text: DOI
Istrate, Gabriel The phase transition in random Horn satisfiability and its algorithmic implications. (English) Zbl 1066.68054 Random Struct. Algorithms 20, No. 4, 483-506 (2002). MSC: 68Q25 68T15 PDFBibTeX XMLCite \textit{G. Istrate}, Random Struct. Algorithms 20, No. 4, 483--506 (2002; Zbl 1066.68054) Full Text: DOI arXiv
Konjevod, Goran; Ravi, R.; Srinivasan, Aravind Approximation algorithms for the covering Steiner problem. (English) Zbl 1017.68090 Random Struct. Algorithms 20, No. 3, 465-482 (2002). MSC: 68R10 PDFBibTeX XMLCite \textit{G. Konjevod} et al., Random Struct. Algorithms 20, No. 3, 465--482 (2002; Zbl 1017.68090) Full Text: DOI
Gärtner, Bernd The random-facet simplex algorithm on combinatorial cubes. (English) Zbl 1017.68159 Random Struct. Algorithms 20, No. 3, 353-381 (2002). MSC: 68W20 PDFBibTeX XMLCite \textit{B. Gärtner}, Random Struct. Algorithms 20, No. 3, 353--381 (2002; Zbl 1017.68159) Full Text: DOI
Carr, Robert; Vempala, Santosh Randomized metarounding. (English) Zbl 1005.90050 Random Struct. Algorithms 20, No. 3, 343-352 (2002). MSC: 90C27 90C59 90C10 PDFBibTeX XMLCite \textit{R. Carr} and \textit{S. Vempala}, Random Struct. Algorithms 20, No. 3, 343--352 (2002; Zbl 1005.90050) Full Text: DOI Link
Vu, V. H. Concentration of non-Lipschitz functions and applications. (English) Zbl 0999.60027 Random Struct. Algorithms 20, No. 3, 262-316 (2002). Reviewer: Ljuben Mutafchiev (Sofia) MSC: 60F10 05C80 05B10 11B13 PDFBibTeX XMLCite \textit{V. H. Vu}, Random Struct. Algorithms 20, No. 3, 262--316 (2002; Zbl 0999.60027) Full Text: DOI
Baeza-Yates, Ricardo; Navarro, Gonzalo New and faster filters for multiple approximate string matching. (English) Zbl 0996.68244 Random Struct. Algorithms 20, No. 1, 23-49 (2002). MSC: 68W05 PDFBibTeX XMLCite \textit{R. Baeza-Yates} and \textit{G. Navarro}, Random Struct. Algorithms 20, No. 1, 23--49 (2002; Zbl 0996.68244) Full Text: DOI
Devroye, Luc Analysis of random LC tries. (English) Zbl 0992.68035 Random Struct. Algorithms 19, No. 3-4, 359-375 (2001). MSC: 68P05 PDFBibTeX XMLCite \textit{L. Devroye}, Random Struct. Algorithms 19, No. 3--4, 359--375 (2001; Zbl 0992.68035) Full Text: DOI
Chern, Hua-Huai; Hwang, Hsien-Kuei Phase changes in random \(m\)-ary search trees and generalized quicksort. (English) Zbl 0990.68052 Random Struct. Algorithms 19, No. 3-4, 316-358 (2001). MSC: 68P10 68R10 PDFBibTeX XMLCite \textit{H.-H. Chern} and \textit{H.-K. Hwang}, Random Struct. Algorithms 19, No. 3--4, 316--358 (2001; Zbl 0990.68052) Full Text: DOI
Czumaj, Artur; Stemann, Volker Randomized allocation processes. (English) Zbl 1011.68177 Random Struct. Algorithms 18, No. 4, 297-331 (2001). MSC: 68W20 68M20 PDFBibTeX XMLCite \textit{A. Czumaj} and \textit{V. Stemann}, Random Struct. Algorithms 18, No. 4, 297--331 (2001; Zbl 1011.68177) Full Text: DOI
Bollobás, Béla; Borgs, Christian; Chayes, Jennifer T.; Kim, Jeong Han; Wilson, David B. The scaling window of the 2-SAT transition. (English) Zbl 0979.68053 Random Struct. Algorithms 18, No. 3, 201-256 (2001). MSC: 68Q25 05C80 PDFBibTeX XMLCite \textit{B. Bollobás} et al., Random Struct. Algorithms 18, No. 3, 201--256 (2001; Zbl 0979.68053) Full Text: DOI arXiv
Broder, Andrei Z.; Mitzenmacher, Michael Completeness and robustness properties of min-wise independent permutations. (English) Zbl 0973.60019 Random Struct. Algorithms 18, No. 1, 18-30 (2001). Reviewer: Neculai Curteanu (Iaşi) MSC: 60C05 68P20 05A05 PDFBibTeX XMLCite \textit{A. Z. Broder} and \textit{M. Mitzenmacher}, Random Struct. Algorithms 18, No. 1, 18--30 (2001; Zbl 0973.60019) Full Text: DOI
Kumar, V. S. Anil; Ramesh, H. Coupling vs. conductance for the Jerrum-Sinclair chain. (English) Zbl 0970.60086 Random Struct. Algorithms 18, No. 1, 1-17 (2001). MSC: 60J20 05C70 PDFBibTeX XMLCite \textit{V. S. A. Kumar} and \textit{H. Ramesh}, Random Struct. Algorithms 18, No. 1, 1--17 (2001; Zbl 0970.60086) Full Text: DOI
Fernandez de la Vega, W.; Karpinski, M. Polynomial time approximation of dense weighted instances of MAX-CUT. (English) Zbl 0965.68072 Random Struct. Algorithms 16, No. 4, 314-332 (2000). MSC: 68R10 PDFBibTeX XMLCite \textit{W. Fernandez de la Vega} and \textit{M. Karpinski}, Random Struct. Algorithms 16, No. 4, 314--332 (2000; Zbl 0965.68072) Full Text: DOI
Vu, Van H. New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help. (English) Zbl 0953.05056 Random Struct. Algorithms 17, No. 1, 29-63 (2000). Reviewer: Ian M.Wanless (Oxford) MSC: 05C65 05C70 05C85 PDFBibTeX XMLCite \textit{V. H. Vu}, Random Struct. Algorithms 17, No. 1, 29--63 (2000; Zbl 0953.05056) Full Text: DOI
Savický, Petr On random orderings of variables for parity ordered binary decision diagrams. (English) Zbl 0952.68067 Random Struct. Algorithms 16, No. 3, 233-239 (2000). MSC: 68Q25 94C99 PDFBibTeX XMLCite \textit{P. Savický}, Random Struct. Algorithms 16, No. 3, 233--239 (2000; Zbl 0952.68067) Full Text: DOI
Wilson, David Bruce How to couple from the past using a read-once source of randomness. (English) Zbl 0952.60072 Random Struct. Algorithms 16, No. 1, 85-113 (2000). Reviewer: G.Orman (Braşov) MSC: 60J22 PDFBibTeX XMLCite \textit{D. B. Wilson}, Random Struct. Algorithms 16, No. 1, 85--113 (2000; Zbl 0952.60072) Full Text: DOI arXiv
Cooper, Colin; Frieze, Alan; Mehlhorn, Kurt; Priebe, Volker Average-case complexity of shortest-paths problems in the vertex-potential model. (English) Zbl 0951.68109 Random Struct. Algorithms 16, No. 1, 33-46 (2000). Reviewer: N.F.Quimpo (Manila) MSC: 68R10 05C38 PDFBibTeX XMLCite \textit{C. Cooper} et al., Random Struct. Algorithms 16, No. 1, 33--46 (2000; Zbl 0951.68109) Full Text: DOI
Monasson, Rémi; Zecchina, Riccardo; Kirkpatrick, Scott; Selman, Bart; Troyansky, Lidror 2+p-SAT: Relation of typical-case complexity to the nature of the phase transition. (English) Zbl 0931.68056 Random Struct. Algorithms 15, No. 3-4, 414-435 (1999). MSC: 68Q15 PDFBibTeX XMLCite \textit{R. Monasson} et al., Random Struct. Algorithms 15, No. 3--4, 414--435 (1999; Zbl 0931.68056) Full Text: DOI arXiv
Poblete, Patricio V.; Viola, Alfredo; Munro, J. Ian The diagonal Poisson transform and its application to the analysis of a hashing scheme. (English) Zbl 0870.68076 Random Struct. Algorithms 10, No. 1-2, 221-255 (1997). MSC: 68W10 68P10 PDFBibTeX XMLCite \textit{P. V. Poblete} et al., Random Struct. Algorithms 10, No. 1--2, 221--255 (1997; Zbl 0870.68076) Full Text: DOI
Naor, Joseph; Roth, Ron M. Constructions of permutation arrays for certain scheduling cost measures. (English) Zbl 0853.05019 Random Struct. Algorithms 6, No. 1, 39-50 (1995). Reviewer: A.Bonisoli (Potenza) MSC: 05B30 05B15 68R05 68M20 PDFBibTeX XMLCite \textit{J. Naor} and \textit{R. M. Roth}, Random Struct. Algorithms 6, No. 1, 39--50 (1995; Zbl 0853.05019) Full Text: DOI
Prömel, Hans Jürgen; Steger, Angelika Random \(\l\)-colorable graphs. (English) Zbl 0817.05052 Random Struct. Algorithms 6, No. 1, 21-37 (1995). Reviewer: R.Vohra (Columbus / Ohio) MSC: 05C80 05C15 PDFBibTeX XMLCite \textit{H. J. Prömel} and \textit{A. Steger}, Random Struct. Algorithms 6, No. 1, 21--37 (1995; Zbl 0817.05052) Full Text: DOI
Deneen, Linda L.; Shute, Gary M.; Thomborson, Clark D. A probably fast, provably optimal algorithm for rectilinear Steiner trees. (English) Zbl 0822.68080 Random Struct. Algorithms 5, No. 4, 535-557 (1994). MSC: 68R10 68Q25 05C05 PDFBibTeX XMLCite \textit{L. L. Deneen} et al., Random Struct. Algorithms 5, No. 4, 535--557 (1994; Zbl 0822.68080) Full Text: DOI
Pittel, Boris Note on the heights of random recursive trees and random \(m\)-ary search trees. (English) Zbl 0790.05077 Random Struct. Algorithms 5, No. 2, 337-347 (1994). MSC: 05C80 05C05 PDFBibTeX XMLCite \textit{B. Pittel}, Random Struct. Algorithms 5, No. 2, 337--347 (1994; Zbl 0790.05077) Full Text: DOI
Devroye, Luc On random Cartesian trees. (English) Zbl 0792.05124 Random Struct. Algorithms 5, No. 2, 305-327 (1994). MSC: 05C80 05C05 PDFBibTeX XMLCite \textit{L. Devroye}, Random Struct. Algorithms 5, No. 2, 305--327 (1994; Zbl 0792.05124) Full Text: DOI
Dyer, Martin; Frieze, Alan Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph. (English) Zbl 0731.68044 Random Struct. Algorithms 2, No. 1, 233-239 (1991). MSC: 68Q25 68P10 05C80 PDFBibTeX XMLCite \textit{M. Dyer} and \textit{A. Frieze}, Random Struct. Algorithms 2, No. 1, 233--239 (1991; Zbl 0731.68044) Full Text: DOI
Maier, Robert S. Colliding stacks: A large deviations analysis. (English) Zbl 0737.60097 Random Struct. Algorithms 2, No. 4, 379-420 (1991). MSC: 60K40 60F10 60K30 37J99 60J99 68P05 PDFBibTeX XMLCite \textit{R. S. Maier}, Random Struct. Algorithms 2, No. 4, 379--420 (1991; Zbl 0737.60097) Full Text: DOI