Bitseki Penda, S. Valère; Roche, Angelina Local bandwidth selection for kernel density estimation in a bifurcating Markov chain model. (English) Zbl 07342637 J. Nonparametric Stat. 32, No. 3, 1-28 (2020). MSC: 62G05 62G10 62G20 60F05 60F10 60J20 60J80 92D25 PDF BibTeX XML Cite \textit{S. V. Bitseki Penda} and \textit{A. Roche}, J. Nonparametric Stat. 32, No. 3, 1--28 (2020; Zbl 07342637) Full Text: DOI
Bitseki Penda, S. Valère; Roche, Angelina Local bandwidth selection for kernel density estimation in a bifurcating Markov chain model. (English) Zbl 07342625 J. Nonparametric Stat. 32, No. 3, 535-562 (2020). MSC: 62G05 62G10 62G20 60F05 60F10 60J20 60J80 62P10 92D25 PDF BibTeX XML Cite \textit{S. V. Bitseki Penda} and \textit{A. Roche}, J. Nonparametric Stat. 32, No. 3, 535--562 (2020; Zbl 07342625) Full Text: DOI
Janson, Svante On the independence number of some random trees. (English) Zbl 07252783 Electron. Commun. Probab. 25, Paper No. 63, 14 p. (2020). Reviewer: Yilun Shang (Newcastle) MSC: 60C05 05C05 05C69 PDF BibTeX XML Cite \textit{S. Janson}, Electron. Commun. Probab. 25, Paper No. 63, 14 p. (2020; Zbl 07252783) Full Text: DOI Euclid
Bogun, Vladyslav Almost sure asymptotic expansions for profiles of simply generated random trees. (English) Zbl 1449.60086 Theory Stoch. Process. 24, No. 1, 49-63 (2019). MSC: 60G50 60F05 60J80 60J85 60F10 60F15 PDF BibTeX XML Cite \textit{V. Bogun}, Theory Stoch. Process. 24, No. 1, 49--63 (2019; Zbl 1449.60086) Full Text: Link
Kovchegov, Yevgeniy; Zaliapin, Ilya Random self-similar trees and a hierarchical branching process. (English) Zbl 1455.60114 Stochastic Processes Appl. 129, No. 7, 2528-2560 (2019). MSC: 60J80 05C05 PDF BibTeX XML Cite \textit{Y. Kovchegov} and \textit{I. Zaliapin}, Stochastic Processes Appl. 129, No. 7, 2528--2560 (2019; Zbl 1455.60114) Full Text: DOI arXiv
Belius, David; Rosen, Jay; Zeitouni, Ofer Barrier estimates for a critical Galton-Watson process and the cover time of the binary tree. (English. French summary) Zbl 1447.60133 Ann. Inst. Henri Poincaré, Probab. Stat. 55, No. 1, 127-154 (2019). Reviewer: Alexander Iksanov (Kiev) MSC: 60J80 60J85 60G50 PDF BibTeX XML Cite \textit{D. Belius} et al., Ann. Inst. Henri Poincaré, Probab. Stat. 55, No. 1, 127--154 (2019; Zbl 1447.60133) Full Text: DOI Euclid arXiv
Devroye, Luc; Holmgren, Cecilia; Sulzbach, Henning Heavy subtrees of Galton-Watson trees with an application to Apollonian networks. (English) Zbl 1406.60117 Electron. J. Probab. 24, Paper No. 2, 44 p. (2019). MSC: 60J80 60J85 05C80 PDF BibTeX XML Cite \textit{L. Devroye} et al., Electron. J. Probab. 24, Paper No. 2, 44 p. (2019; Zbl 1406.60117) Full Text: DOI Euclid
Tahir, Daniah; Glémin, Sylvain; Lascoux, Martin; Kaj, Ingemar Modeling a trait-dependent diversification process coupled with molecular evolution on a random species tree. (English) Zbl 1406.92438 J. Theor. Biol. 461, 189-203 (2019). MSC: 92D15 60J85 PDF BibTeX XML Cite \textit{D. Tahir} et al., J. Theor. Biol. 461, 189--203 (2019; Zbl 1406.92438) Full Text: DOI
Delmas, Jean-François; Dhersin, Jean-Stéphane; Sciauveau, Marion Cost functionals for large (uniform and simply generated) random trees. (English) Zbl 1398.05061 Electron. J. Probab. 23, Paper No. 87, 36 p. (2018). MSC: 05C05 05C80 60J80 60F17 PDF BibTeX XML Cite \textit{J.-F. Delmas} et al., Electron. J. Probab. 23, Paper No. 87, 36 p. (2018; Zbl 1398.05061) Full Text: DOI Euclid
da Costa Vieira Rezende, Josiane; Souza, Marcone Jamilson Freitas; Coelho, Vitor Nazário; Martins, Alexandre Xavier HMS: a hybrid multi-start algorithm for solving binary linear programs. (English) Zbl 1408.90335 Coelho, Vitor Nazário (ed.) et al., Selected short papers of the 5th international conference on variable neighborhood search (ICVNS’17), Ouro Preto, Brazil, 2–4, 2017. Amsterdam: Elsevier. Electron. Notes Discrete Math. 66, 7-14 (2018). MSC: 90C59 90C09 PDF BibTeX XML Cite \textit{J. da Costa Vieira Rezende} et al., Electron. Notes Discrete Math. 66, 7--14 (2018; Zbl 1408.90335) Full Text: DOI
Bitseki Penda, S. Valère; Olivier, Adélaïde Moderate deviation principle in nonlinear bifurcating autoregressive models. (English) Zbl 1392.62088 Stat. Probab. Lett. 138, 20-26 (2018). MSC: 62G05 60F10 60J80 62M10 PDF BibTeX XML Cite \textit{S. V. Bitseki Penda} and \textit{A. Olivier}, Stat. Probab. Lett. 138, 20--26 (2018; Zbl 1392.62088) Full Text: DOI
Bitseki Penda, S. Valère; Olivier, Adélaïde Autoregressive functions estimation in nonlinear bifurcating autoregressive models. (English) Zbl 1459.62167 Stat. Inference Stoch. Process. 20, No. 2, 179-210 (2017). MSC: 62M10 62G05 62G10 62G20 60J05 60J80 PDF BibTeX XML Cite \textit{S. V. Bitseki Penda} and \textit{A. Olivier}, Stat. Inference Stoch. Process. 20, No. 2, 179--210 (2017; Zbl 1459.62167) Full Text: DOI
Corre, Pierre-Antoine Oscillations in the height of the Yule tree and application to the binary search tree. (English) Zbl 1380.60079 Random Struct. Algorithms 51, No. 1, 90-120 (2017). MSC: 60J80 05C81 60G50 68P10 PDF BibTeX XML Cite \textit{P.-A. Corre}, Random Struct. Algorithms 51, No. 1, 90--120 (2017; Zbl 1380.60079) Full Text: DOI arXiv
Beame, Paul; Grosshans, Nathan; McKenzie, Pierre; Segoufin, Luc Nondeterminism and an abstract formulation of Nečiporuk’s lower bound method. (English) Zbl 1427.68103 ACM Trans. Comput. Theory 9, No. 1, Article No. 5, 34 p. (2016). MSC: 68Q17 68Q10 68Q15 PDF BibTeX XML Cite \textit{P. Beame} et al., ACM Trans. Comput. Theory 9, No. 1, Article No. 5, 34 p. (2016; Zbl 1427.68103) Full Text: DOI
Khadiev, K. On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs. (English) Zbl 1409.68105 Lobachevskii J. Math. 37, No. 6, 683-704 (2016). MSC: 68Q05 68Q10 68Q25 PDF BibTeX XML Cite \textit{K. Khadiev}, Lobachevskii J. Math. 37, No. 6, 683--704 (2016; Zbl 1409.68105) Full Text: DOI
Grübel, Rudolf; Kabluchko, Zakhar A functional central limit theorem for branching random walks, almost sure weak convergence and applications to random trees. (English) Zbl 1367.60028 Ann. Appl. Probab. 26, No. 6, 3659-3698 (2016). Reviewer: Marius Iosifescu (Bucureşti) MSC: 60F17 60F05 60J80 60G50 60B10 60G42 68P10 PDF BibTeX XML Cite \textit{R. Grübel} and \textit{Z. Kabluchko}, Ann. Appl. Probab. 26, No. 6, 3659--3698 (2016; Zbl 1367.60028) Full Text: DOI Euclid arXiv
Popovic, Lea; Rivas, Mariolys Topology and inference for Yule trees with multiple states. (English) Zbl 1355.92078 J. Math. Biol. 73, No. 5, 1251-1291 (2016). MSC: 92D15 60J80 60J10 60J27 60J85 92D10 PDF BibTeX XML Cite \textit{L. Popovic} and \textit{M. Rivas}, J. Math. Biol. 73, No. 5, 1251--1291 (2016; Zbl 1355.92078) Full Text: DOI
Vasiliev, Alexander V. Binary quantum hashing. (English. Russian original) Zbl 1348.81209 Russ. Math. 60, No. 9, 61-65 (2016); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2016, No. 9, 68-73 (2016). MSC: 81P94 94A60 81P70 PDF BibTeX XML Cite \textit{A. V. Vasiliev}, Russ. Math. 60, No. 9, 61--65 (2016; Zbl 1348.81209); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2016, No. 9, 68--73 (2016) Full Text: DOI
Ge, Daochuan; Yang, Yanhua Reliability analysis of non-repairable systems modeled by dynamic fault trees with priority AND gates. (English) Zbl 1410.90068 Appl. Stoch. Models Bus. Ind. 31, No. 6, 809-822 (2015). MSC: 90B25 90C59 PDF BibTeX XML Cite \textit{D. Ge} and \textit{Y. Yang}, Appl. Stoch. Models Bus. Ind. 31, No. 6, 809--822 (2015; Zbl 1410.90068) Full Text: DOI
Khadiev, K. Width hierarchy for \(k\)-OBDD of small width. (English) Zbl 1346.68092 Lobachevskii J. Math. 36, No. 2, 178-183 (2015). MSC: 68Q05 68Q15 PDF BibTeX XML Cite \textit{K. Khadiev}, Lobachevskii J. Math. 36, No. 2, 178--183 (2015; Zbl 1346.68092) Full Text: DOI
Hautphenne, Sophie; Fackrell, Mark An EM algorithm for the model Fitting of Markovian binary trees. (English) Zbl 06970941 Comput. Stat. Data Anal. 70, 19-34 (2014). MSC: 62 PDF BibTeX XML Cite \textit{S. Hautphenne} and \textit{M. Fackrell}, Comput. Stat. Data Anal. 70, 19--34 (2014; Zbl 06970941) Full Text: DOI
van Groningen, Anthony; Willenbring, Jeb F. The cubic, the quartic, and the exceptional group \(G_2\). (English) Zbl 1321.20041 Mason, Geoffrey (ed.) et al., Developments and retrospectives in Lie theory. Algebraic methods. Retrospective selected papers based on the presentations at the seminar “Lie groups, Lie algebras and their representations”, 1991–2014. Cham: Springer (ISBN 978-3-319-09803-6/hbk; 978-3-319-09804-3/ebook). Developments in Mathematics 38, 385-397 (2014). MSC: 20G05 17B10 13A50 15A72 17B20 20G41 15A63 PDF BibTeX XML Cite \textit{A. van Groningen} and \textit{J. F. Willenbring}, Dev. Math. 38, 385--397 (2014; Zbl 1321.20041) Full Text: DOI
Dang, Hui; Yang, Weiguo Equivalent properties of bifurcating Markov chains indexed by a binary tree. (Chinese. English summary) Zbl 1324.60068 Chin. J. Appl. Probab. Stat. 30, No. 5, 491-496 (2014). MSC: 60J10 60J80 PDF BibTeX XML Cite \textit{H. Dang} and \textit{W. Yang}, Chin. J. Appl. Probab. Stat. 30, No. 5, 491--496 (2014; Zbl 1324.60068) Full Text: DOI
Mercier, Lucas; Chassaing, Philippe The height of the Lyndon tree. (English) Zbl 1283.05058 Proceedings of the 25th international conference on formal power series and algebraic combinatorics, FPSAC 2013, Paris, France, June 24–28, 2013. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 957-968, electronic only (2013). MSC: 05C05 05C81 68P05 68R15 PDF BibTeX XML Cite \textit{L. Mercier} and \textit{P. Chassaing}, in: Proceedings of the 25th international conference on formal power series and algebraic combinatorics, FPSAC 2013, Paris, France, June 24--28, 2013. Nancy: The Association. Discrete Mathematics \& Theoretical Computer Science (DMTCS). 957--968 (2013; Zbl 1283.05058) Full Text: Link
Abraham, Romain; Delmas, Jean-François A construction of a \(\beta \)-coalescent via the pruning of binary trees. (English) Zbl 1285.60078 J. Appl. Probab. 50, No. 3, 772-790 (2013). Reviewer: Ove Frank (Stockholm) MSC: 60J25 60J80 PDF BibTeX XML Cite \textit{R. Abraham} and \textit{J.-F. Delmas}, J. Appl. Probab. 50, No. 3, 772--790 (2013; Zbl 1285.60078) Full Text: DOI Euclid
Ablayev, F. M.; Khadiev, K. R. Extension of the hierarchy for \(k\)-OBDDs of small width. (English. Russian original) Zbl 1290.68040 Russ. Math. 57, No. 3, 46-50 (2013); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2013, No. 3, 56-61 (2013). MSC: 68Q05 68Q15 PDF BibTeX XML Cite \textit{F. M. Ablayev} and \textit{K. R. Khadiev}, Russ. Math. 57, No. 3, 46--50 (2013; Zbl 1290.68040); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2013, No. 3, 56--61 (2013) Full Text: DOI
Bini, D. A.; Meini, B.; Poloni, F. On the solution of a quadratic vector equation arising in Markovian binary trees. (English) Zbl 1265.65105 Numer. Linear Algebra Appl. 18, No. 6, 981-991 (2011). Reviewer: Guillermo Matera (Buenos Aires) MSC: 65H10 92D25 60J80 PDF BibTeX XML Cite \textit{D. A. Bini} et al., Numer. Linear Algebra Appl. 18, No. 6, 981--991 (2011; Zbl 1265.65105) Full Text: DOI arXiv
Bassetti, Federico; Leisen, Fabrizio Maximal flow in branching trees and binary search trees. (English) Zbl 1231.90113 Methodol. Comput. Appl. Probab. 13, No. 3, 475-486 (2011). MSC: 90B15 60G70 PDF BibTeX XML Cite \textit{F. Bassetti} and \textit{F. Leisen}, Methodol. Comput. Appl. Probab. 13, No. 3, 475--486 (2011; Zbl 1231.90113) Full Text: DOI
Bollig, Beate On the OBDD complexity of the most significant bit of integer multiplication. (English) Zbl 1220.68059 Theor. Comput. Sci. 412, No. 18, 1686-1695 (2011). Reviewer: Thomas Jansen (Cork) MSC: 68Q25 68P05 68Q05 PDF BibTeX XML Cite \textit{B. Bollig}, Theor. Comput. Sci. 412, No. 18, 1686--1695 (2011; Zbl 1220.68059) Full Text: DOI
Roberts, Matthew I. Almost sure asymptotics for the random binary search tree. (English) Zbl 1355.68068 Drmota, Michael (ed.) et al., Proceeding of the 21st international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA’10), Vienna, Austria, June 28 – July 2, 2010. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 565-576 (2010). MSC: 68P05 68P10 68Q87 PDF BibTeX XML Cite \textit{M. I. Roberts}, in: Proceeding of the 21st international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA'10), Vienna, Austria, June 28 -- July 2, 2010. Nancy: The Association. Discrete Mathematics \& Theoretical Computer Science (DMTCS). 565--576 (2010; Zbl 1355.68068) Full Text: Link arXiv
Fekete, Eric Branching random walks on binary search trees: convergence of the occupation measure. (English) Zbl 1213.60044 ESAIM, Probab. Stat. 14, 286-298 (2010). MSC: 60F05 60G50 68W40 60J80 05C05 PDF BibTeX XML Cite \textit{E. Fekete}, ESAIM, Probab. Stat. 14, 286--298 (2010; Zbl 1213.60044) Full Text: DOI EuDML
Yamamoto, Ken; Yamazaki, Yoshihiro Topological self-similarity on the random binary-tree model. (English) Zbl 1193.05148 J. Stat. Phys. 139, No. 1, 62-71 (2010). MSC: 05C80 05C05 60G18 PDF BibTeX XML Cite \textit{K. Yamamoto} and \textit{Y. Yamazaki}, J. Stat. Phys. 139, No. 1, 62--71 (2010; Zbl 1193.05148) Full Text: DOI arXiv
Mubarakzyanov, R. G. On the complexity of randomized read-once branching programs. (Russian. English summary) Zbl 1222.68081 Uch. Zap. Kazan. Gos. Univ., Ser. Fiz.-Mat. Nauki 151, No. 2, 107-113 (2009). MSC: 68Q05 68Q17 PDF BibTeX XML Cite \textit{R. G. Mubarakzyanov}, Uch. Zap. Kazan. Gos. Univ., Ser. Fiz.-Mat. Nauki 151, No. 2, 107--113 (2009; Zbl 1222.68081)
Bollig, Beate On the size of (generalized) OBDDs for threshold functions. (English) Zbl 1209.68151 Inf. Process. Lett. 109, No. 10, 499-503 (2009). MSC: 68P05 68Q25 PDF BibTeX XML Cite \textit{B. Bollig}, Inf. Process. Lett. 109, No. 10, 499--503 (2009; Zbl 1209.68151) Full Text: DOI
Liu, RongLi; Ren, YanXia Some properties of superprocesses conditioned on non-extinction. (English) Zbl 1179.60056 Sci. China, Ser. A 52, No. 4, 771-784 (2009). MSC: 60J80 60B10 PDF BibTeX XML Cite \textit{R. Liu} and \textit{Y. Ren}, Sci. China, Ser. A 52, No. 4, 771--784 (2009; Zbl 1179.60056) Full Text: DOI
Klüppelholz, Sascha; Baier, Christel Symbolic model checking for channel-based component connectors. (English) Zbl 1167.68035 Sci. Comput. Program. 74, No. 9, 688-701 (2009). MSC: 68Q60 PDF BibTeX XML Cite \textit{S. Klüppelholz} and \textit{C. Baier}, Sci. Comput. Program. 74, No. 9, 688--701 (2009; Zbl 1167.68035) Full Text: DOI
Hautphenne, Sophie; Latouche, Guy; Remiche, Marie-Ange Newton’s iteration for the extinction probability of a Markovian binary tree. (English) Zbl 1155.65038 Linear Algebra Appl. 428, No. 11-12, 2791-2804 (2008). MSC: 65H10 60J80 65C50 PDF BibTeX XML Cite \textit{S. Hautphenne} et al., Linear Algebra Appl. 428, No. 11--12, 2791--2804 (2008; Zbl 1155.65038) Full Text: DOI
Brosenne, Henrik; Homeister, Matthias; Waack, Stephan Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance. (English) Zbl 1187.68247 Inf. Process. Lett. 98, No. 1, 6-10 (2006). MSC: 68Q17 PDF BibTeX XML Cite \textit{H. Brosenne} et al., Inf. Process. Lett. 98, No. 1, 6--10 (2006; Zbl 1187.68247) Full Text: DOI
Yanev, George P.; Mutafchiev, Ljuben Number of complete \(N\)-ary subtrees on Galton-Watson family trees. (English) Zbl 1101.60064 Methodol. Comput. Appl. Probab. 8, No. 2, 223-233 (2006). MSC: 60J80 05C05 PDF BibTeX XML Cite \textit{G. P. Yanev} and \textit{L. Mutafchiev}, Methodol. Comput. Appl. Probab. 8, No. 2, 223--233 (2006; Zbl 1101.60064) Full Text: DOI arXiv
Bollig, Beate; Waack, Stephan; Woelfel, Philipp Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication. (English) Zbl 1100.68024 Theor. Comput. Sci. 362, No. 1-3, 86-99 (2006). MSC: 68Q05 68Q17 PDF BibTeX XML Cite \textit{B. Bollig} et al., Theor. Comput. Sci. 362, No. 1--3, 86--99 (2006; Zbl 1100.68024) Full Text: DOI
Bazzi, Louay; Mitter, Sanjoy K. Encoding complexity versus minimum distance. (English) Zbl 1285.94028 IEEE Trans. Inf. Theory 51, No. 6, 2103-2112 (2005). MSC: 94A29 94B65 PDF BibTeX XML Cite \textit{L. Bazzi} and \textit{S. K. Mitter}, IEEE Trans. Inf. Theory 51, No. 6, 2103--2112 (2005; Zbl 1285.94028) Full Text: DOI
Pitman, Jim; Winkel, Matthias Growth of the Brownian forest. (English) Zbl 1092.60033 Ann. Probab. 33, No. 6, 2188-2211 (2005). Reviewer: Valentin Topchii (Omsk) MSC: 60J65 60J80 PDF BibTeX XML Cite \textit{J. Pitman} and \textit{M. Winkel}, Ann. Probab. 33, No. 6, 2188--2211 (2005; Zbl 1092.60033) Full Text: DOI arXiv
Woelfel, Philipp Bounds on the OBDD-size of integer multiplication via universal hashing. (English) Zbl 1082.68021 J. Comput. Syst. Sci. 71, No. 4, 520-534 (2005). MSC: 68P05 68Q17 68W35 PDF BibTeX XML Cite \textit{P. Woelfel}, J. Comput. Syst. Sci. 71, No. 4, 520--534 (2005; Zbl 1082.68021) Full Text: DOI
Nakamura, Atsuyoshi An efficient query learning algorithm for ordered binary decision diagrams. (English) Zbl 1088.68153 Inf. Comput. 201, No. 2, 178-198 (2005). MSC: 68T05 PDF BibTeX XML Cite \textit{A. Nakamura}, Inf. Comput. 201, No. 2, 178--198 (2005; Zbl 1088.68153) Full Text: DOI
Chauvin, Brigitte; Rouault, Alain Connecting Yule process, bisection and binary search tree via martingales. (English) Zbl 06657082 J. Iran. Stat. Soc. JIRSS 3, No. 2, 89-116 (2004). MSC: 62 PDF BibTeX XML Cite \textit{B. Chauvin} and \textit{A. Rouault}, J. Iran. Stat. Soc. JIRSS 3, No. 2, 89--116 (2004; Zbl 06657082) Full Text: Link
O’Hanlon, Amelia; Howard, Patricia; Brown, David A. Path length and height in asymmetric binary branching trees. (English) Zbl 1154.28301 Missouri J. Math. Sci. 16, No. 2, 88-103 (2004). Reviewer: Ting Zhong (Zhangjiajie, Hunan) MSC: 28A80 28A75 68N30 PDF BibTeX XML Cite \textit{A. O'Hanlon} et al., Missouri J. Math. Sci. 16, No. 2, 88--103 (2004; Zbl 1154.28301)
Fleischmann, Klaus; Swart, Jan M. Trimmed trees and embedded particle systems. (English) Zbl 1048.60063 Ann. Probab. 32, No. 3A, 2179-2221 (2004). Reviewer: Vladimir Vatutin (Moskva) MSC: 60J80 60J60 60K35 60G57 PDF BibTeX XML Cite \textit{K. Fleischmann} and \textit{J. M. Swart}, Ann. Probab. 32, No. 3A, 2179--2221 (2004; Zbl 1048.60063) Full Text: DOI arXiv
Drmota, Michael Stochastic analysis of tree-like data structures. (English) Zbl 1091.68034 Proc. R. Soc. Lond., Ser. A, Math. Phys. Eng. Sci. 460, No. 2041, 271-307 (2004). MSC: 68P05 60J80 05C05 05A15 60C05 PDF BibTeX XML Cite \textit{M. Drmota}, Proc. R. Soc. Lond., Ser. A, Math. Phys. Eng. Sci. 460, No. 2041, 271--307 (2004; Zbl 1091.68034) Full Text: DOI
Bollig, Beate; Wegener, Ingo Functions that have read-once branching programs of quadratic size are not necessarily testable. (English) Zbl 1175.68092 Inf. Process. Lett. 87, No. 1, 25-29 (2003). MSC: 68N01 PDF BibTeX XML Cite \textit{B. Bollig} and \textit{I. Wegener}, Inf. Process. Lett. 87, No. 1, 25--29 (2003; Zbl 1175.68092) Full Text: DOI
Sauerhoff, Martin Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (English) Zbl 1054.68056 J. Comput. Syst. Sci. 66, No. 3, 473-495 (2003). MSC: 68Q05 68Q10 PDF BibTeX XML Cite \textit{M. Sauerhoff}, J. Comput. Syst. Sci. 66, No. 3, 473--495 (2003; Zbl 1054.68056) Full Text: DOI
Janson, Svante Ideals in a forest, one-way infinite binary trees and the contraction method. (English) Zbl 1023.60011 Chauvin, Brigitte (ed.) et al., Mathematics and computer science II. Algorithms, trees, combinatorics and probabilities. Proceedings of the 2nd colloquium, Versailles-St.-Quentin, France, September 16-19, 2002. Basel: Birkhäuser. Trends in Mathematics. 393-414 (2002). MSC: 60C05 05C80 60J80 PDF BibTeX XML Cite \textit{S. Janson}, in: Mathematics and computer science II. Algorithms, trees, combinatorics and probabilities. Proceedings of the 2nd colloquium, Versailles-St. -Quentin, France, September 16--19, 2002. Basel: Birkhäuser. 393--414 (2002; Zbl 1023.60011)
Belyaev, V. N.; Bulitko, V. K. \(m\)-reducibility with upper and lower bounds for reducing functions. (English. Russian original) Zbl 1027.03035 Math. Notes 70, No. 1, 11-19 (2001); translation from Mat. Zametki 70, No. 1, 12-21 (2001). MSC: 03D30 PDF BibTeX XML Cite \textit{V. N. Belyaev} and \textit{V. K. Bulitko}, Math. Notes 70, No. 1, 11--19 (2001; Zbl 1027.03035); translation from Mat. Zametki 70, No. 1, 12--21 (2001) Full Text: DOI
Van Houdt, B.; Blondia, C. Stability and performance of stack algorithms for random access communication modeled as a tree structured QBD Markov chain. (English) Zbl 1017.90009 Stoch. Models 17, No. 3, 247-270 (2001). MSC: 90B18 68M20 60C05 60J80 PDF BibTeX XML Cite \textit{B. Van Houdt} and \textit{C. Blondia}, Stoch. Models 17, No. 3, 247--270 (2001; Zbl 1017.90009) Full Text: DOI
Golić, Jovan Dj. Cryptanalysis of three mutually clock-controlled stop/go shift registers. (English) Zbl 1006.94016 IEEE Trans. Inf. Theory 46, No. 3, 1081-1090 (2000). MSC: 94A55 94A60 PDF BibTeX XML Cite \textit{J. Dj. Golić}, IEEE Trans. Inf. Theory 46, No. 3, 1081--1090 (2000; Zbl 1006.94016) Full Text: DOI
Greven, A. On phase-transitions in spatial branching systems with interaction. (English) Zbl 0978.60108 Gorostiza, Luis G. (ed.) et al., Stochastic models. Proceedings of the international conference, in honour of Prof. Donald A. Dawson, Ottawa, Canada, June 10-13, 1998. Providence, RI: AMS, American Mathematical Society for the Canadian Mathematical Society. CMS Conf. Proc. 26, 173-204 (2000). Reviewer: Klaus Fleischmann (Berlin) MSC: 60K35 60H15 60J80 PDF BibTeX XML Cite \textit{A. Greven}, in: Stochastic models. Proceedings of the international conference, in honour of Prof. Donald A. Dawson, Ottawa, Canada, June 10--13, 1998. Providence, RI: AMS, American Mathematical Society for the Canadian Mathematical Society. 173--204 (2000; Zbl 0978.60108)
Gröpl, Clemens Binary decision diagrams for random Boolean functions. (English) Zbl 1023.94022 Berlin: Humboldt-Univ., Mathematisch-Naturwissenschaftliche Fakultät II, 126 p. (1999). MSC: 94C10 PDF BibTeX XML Cite \textit{C. Gröpl}, Binary decision diagrams for random Boolean functions. Berlin: Humboldt-Univ., Mathematisch-Naturwissenschaftliche Fakultät II (1999; Zbl 1023.94022) Full Text: Link
Sieling, Detlef Lower bounds for linear transformed OBDDs and FBDDs. (English) Zbl 0958.68071 Pandu Rangan, C. (ed.) et al., Foundations of software technology and theoretical computer science. 19th conference, Chennai, India, December 13-15, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1738, 356-368 (1999). MSC: 68Q17 68Q05 PDF BibTeX XML Cite \textit{D. Sieling}, Lect. Notes Comput. Sci. 1738, 356--368 (1999; Zbl 0958.68071)
Golić, Jovan Dj.; Clark, Andrew; Dawson, Ed Inversion attack and branching. (English) Zbl 0919.94036 Pieprzyk, Josef (ed.) et al., Information security and privacy. 4th Australian conference, ACISP ’99. Wollongong, NSW, Australia, April 7–9, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1587, 88-102 (1999). MSC: 94A60 94A55 PDF BibTeX XML Cite \textit{J. Dj. Golić} et al., Lect. Notes Comput. Sci. 1587, 88--102 (1999; Zbl 0919.94036)
Bollig, Beate; Sauerhoff, Martin; Sieling, Detlef; Wegener, Ingo Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs. (English) Zbl 0913.68078 Theor. Comput. Sci. 205, No. 1-2, 45-60 (1998). MSC: 68Q15 68N01 PDF BibTeX XML Cite \textit{B. Bollig} et al., Theor. Comput. Sci. 205, No. 1--2, 45--60 (1998; Zbl 0913.68078) Full Text: DOI
Durham, S. D.; Flournoy, N.; Li, W. A sequential design for maximizing the probability of a favourable response. (English) Zbl 0916.62057 Can. J. Stat. 26, No. 3, 479-495 (1998). MSC: 62L05 62P10 60J85 60G35 PDF BibTeX XML Cite \textit{S. D. Durham} et al., Can. J. Stat. 26, No. 3, 479--495 (1998; Zbl 0916.62057) Full Text: DOI
Bollig, Beate; Wegener, Ingo Completeness and non-completeness results with respect to read-once projections. (English) Zbl 0919.68098 Inf. Comput. 143, No. 1, 24-33 (1998). MSC: 68R10 PDF BibTeX XML Cite \textit{B. Bollig} and \textit{I. Wegener}, Inf. Comput. 143, No. 1, 24--33 (1998; Zbl 0919.68098) Full Text: DOI
Papageorgiou, Yannis Y. \(\text{SL}_2\), the cubic and the quartic. (English) Zbl 0901.20030 Ann. Inst. Fourier 48, No. 1, 29-71 (1998). MSC: 20G05 22E50 13A50 PDF BibTeX XML Cite \textit{Y. Y. Papageorgiou}, Ann. Inst. Fourier 48, No. 1, 29--71 (1998; Zbl 0901.20030) Full Text: DOI Numdam EuDML
Raghavan, V.; Wilkins, D. A characterization and nearly linear-time equivalence test for \(\mu\)-branching programs. (English) Zbl 0870.68124 Theory Comput. Syst. 30, No. 3, 249-283 (1997). MSC: 68T05 68P05 PDF BibTeX XML Cite \textit{V. Raghavan} and \textit{D. Wilkins}, Theory Comput. Syst. 30, No. 3, 249--283 (1997; Zbl 0870.68124)
Biggins, J. D. How fast does a general branching random walk spread? (English) Zbl 0873.60061 Athreya, Krishna B. (ed.) et al., Classical and modern branching processes. Proceedings of the IMA workshop, Minneapolis, MN, USA, June 13–17, 1994. New York, NY: Springer. IMA Vol. Math. Appl. 84, 19-39 (1997). Reviewer: H.Hering (Göttingen) MSC: 60J80 PDF BibTeX XML Cite \textit{J. D. Biggins}, IMA Vol. Math. Appl. 84, 19--39 (1997; Zbl 0873.60061)
Minato, Shin-ichi Binary decision diagrams and applications for VLSI CAD. (English) Zbl 0846.68022 The Kluwer International Series in Engineering and Computer Science. 342. Dordrecht: Kluwer Academic Publishers. xiii, 141 p. (1996). Reviewer: J.Hromkovič (Kiel) MSC: 68P05 68U07 68-02 PDF BibTeX XML Cite \textit{S.-i. Minato}, Binary decision diagrams and applications for VLSI CAD. Dordrecht: Kluwer Academic Publishers (1996; Zbl 0846.68022)
Breitbart, Y.; Hunt, H. III; Rosenkrantz, D. On the size of binary decision diagrams representing Boolean functions. (English) Zbl 0874.68283 Theor. Comput. Sci. 145, No. 1-2, 45-69 (1995). MSC: 68T35 PDF BibTeX XML Cite \textit{Y. Breitbart} et al., Theor. Comput. Sci. 145, No. 1--2, 45--69 (1995; Zbl 0874.68283) Full Text: DOI
Verzani, John Slow points in the support of historical Brownian motion. (English) Zbl 0841.60067 Ann. Probab. 23, No. 1, 56-70 (1995). Reviewer: K.Fleischmann (Berlin) MSC: 60J80 60G17 PDF BibTeX XML Cite \textit{J. Verzani}, Ann. Probab. 23, No. 1, 56--70 (1995; Zbl 0841.60067) Full Text: DOI
Mordecki, Ernesto Asymptotic mixed normality and Hellinger processes. (English) Zbl 0828.60013 Stochastics Stochastics Rep. 48, No. 3-4, 129-143 (1994). MSC: 60F05 62M99 PDF BibTeX XML Cite \textit{E. Mordecki}, Stochastics Stochastics Rep. 48, No. 3--4, 129--143 (1994; Zbl 0828.60013) Full Text: DOI
Yekutieli, Iddo; Mandelbrot, Benoit B. Horton-Strahler ordering of random binary trees. (English) Zbl 0820.60025 J. Phys. A, Math. Gen. 27, No. 2, 285-293 (1994). MSC: 60G18 82D20 PDF BibTeX XML Cite \textit{I. Yekutieli} and \textit{B. B. Mandelbrot}, J. Phys. A, Math. Gen. 27, No. 2, 285--293 (1994; Zbl 0820.60025) Full Text: DOI
Dawson, Donald A. Measure-valued Markov processes. (English) Zbl 0799.60080 Hennequin, P. L. (ed.), Ecole d’Eté de probabilités de Saint-Flour XXI - 1991, du 18 Août au 4 Septembre, 1991. Berlin: Springer-Verlag. Lect. Notes Math. 1541, 1-260 (1993). Reviewer: K.Fleischmann (Berlin) MSC: 60J80 60-02 60G57 PDF BibTeX XML Cite \textit{D. A. Dawson}, Lect. Notes Math. 1541, 1--260 (1993; Zbl 0799.60080)
Lous, Niels J. C.; Bours, Patrick A. H.; van Tilborg, Henk C. A. On maximum likelihood soft-decision decoding of binary linear codes. (English) Zbl 0765.94023 IEEE Trans. Inf. Theory 39, No. 1, 197-203 (1993). MSC: 94B35 94B05 PDF BibTeX XML Cite \textit{N. J. C. Lous} et al., IEEE Trans. Inf. Theory 39, No. 1, 197--203 (1993; Zbl 0765.94023) Full Text: DOI
Van Pelt, Jaap; Uylings, Harry B. M.; Verwer, Ronald W. H.; Woldenberg, Michael J.; Pentney, Roberta J. Tree asymmetry – a sensitive and practical measure for binary topological trees. (English) Zbl 0748.92001 Bull. Math. Biol. 54, No. 5, 759-784 (1992). MSC: 92B05 92C15 PDF BibTeX XML Cite \textit{J. Van Pelt} et al., Bull. Math. Biol. 54, No. 5, 759--784 (1992; Zbl 0748.92001) Full Text: DOI
Pakes, Anthony G.; Dekking, F. M. On family trees and subtrees of simple branching processes. (English) Zbl 0731.60076 J. Theor. Probab. 4, No. 2, 353-369 (1991). Reviewer: D.R.Grey (Sheffield) MSC: 60J80 PDF BibTeX XML Cite \textit{A. G. Pakes} and \textit{F. M. Dekking}, J. Theor. Probab. 4, No. 2, 353--369 (1991; Zbl 0731.60076) Full Text: DOI
Dekking, F. M. Branching processes that grow faster than binary splitting. (English) Zbl 0745.60086 Am. Math. Mon. 98, No. 8, 728-731 (1991). Reviewer: J.D.Biggins (Sheffield) MSC: 60J80 PDF BibTeX XML Cite \textit{F. M. Dekking}, Am. Math. Mon. 98, No. 8, 728--731 (1991; Zbl 0745.60086) Full Text: DOI
Swetina, J. First and second moments and the mean Hamming distance in a stochastic replication-mutation model for biological macromolecules. (English) Zbl 0715.92018 J. Math. Biol. 27, No. 4, 463-483 (1989). MSC: 92D15 60J85 60J80 PDF BibTeX XML Cite \textit{J. Swetina}, J. Math. Biol. 27, No. 4, 463--483 (1989; Zbl 0715.92018) Full Text: DOI
Halton, John H. Pseudo-random trees: Multiple independent sequence generators for parallel and branching computations. (English) Zbl 0687.65005 J. Comput. Phys. 84, No. 1, 1-56 (1989). Reviewer: K.G.Brokate MSC: 65C10 65Y05 65-04 82C70 PDF BibTeX XML Cite \textit{J. H. Halton}, J. Comput. Phys. 84, No. 1, 1--56 (1989; Zbl 0687.65005) Full Text: DOI
van Pelt, J.; Verwer, R. W. H.; Uylings, H. B. M. Centrifugal-order distributions in binary topological trees. (English) Zbl 0674.92002 Bull. Math. Biol. 51, No. 4, 511-536 (1989). MSC: 92-08 92B05 PDF BibTeX XML Cite \textit{J. van Pelt} et al., Bull. Math. Biol. 51, No. 4, 511--536 (1989; Zbl 0674.92002) Full Text: DOI
Pourahmadi, Mohsen Stationarity of the solution of \(X_ t=A_ tX_{t-1}+\epsilon _ t\) and analysis of non-Gaussian dependent random variables. (English) Zbl 0669.62082 J. Time Ser. Anal. 9, No. 3, 225-239 (1988). MSC: 62M10 62M05 60G10 PDF BibTeX XML Cite \textit{M. Pourahmadi}, J. Time Ser. Anal. 9, No. 3, 225--239 (1988; Zbl 0669.62082) Full Text: DOI
Althöfer, Ingo On the complexity of searching game trees and other recursion trees. (English) Zbl 0662.90040 J. Algorithms 9, No. 4, 538-567 (1988). Reviewer: S.Gal MSC: 90B40 68P10 68T20 PDF BibTeX XML Cite \textit{I. Althöfer}, J. Algorithms 9, No. 4, 538--567 (1988; Zbl 0662.90040) Full Text: DOI
Kobayashi, T. Branching processes in the presence of random immigration and representations for time series. (English) Zbl 0662.60092 J. Phys. A 21, No. 19, 3723-3737 (1988). Reviewer: H.-P.Altenburg MSC: 60J80 60J85 PDF BibTeX XML Cite \textit{T. Kobayashi}, J. Phys. A, Math. Gen. 21, No. 19, 3723--3737 (1988; Zbl 0662.60092) Full Text: DOI
Whitty, R. W. Vertex-disjoint paths and edge-disjoint branchings in directed graphs. (English) Zbl 0652.05021 J. Graph Theory 11, No. 3, 349-358 (1987). Reviewer: H.-J.Presia MSC: 05C20 05C38 PDF BibTeX XML Cite \textit{R. W. Whitty}, J. Graph Theory 11, No. 3, 349--358 (1987; Zbl 0652.05021) Full Text: DOI
Devroye, L. Branching processes in the analysis of the heights of trees. (English) Zbl 0643.60065 Acta Inf. 24, 277-298 (1987). MSC: 60J80 68P20 60F99 PDF BibTeX XML Cite \textit{L. Devroye}, Acta Inf. 24, 277--298 (1987; Zbl 0643.60065) Full Text: DOI
Horsfield, K.; Woldenberg, M. J.; Bowes, C. L. Sequential and synchronous growth models related to vertex analysis and branching ratios. (English) Zbl 0632.92002 Bull. Math. Biol. 49, 413-429 (1987). MSC: 92B05 92F05 PDF BibTeX XML Cite \textit{K. Horsfield} et al., Bull. Math. Biol. 49, 413--429 (1987; Zbl 0632.92002) Full Text: DOI
Hafer, Thilo; Thomas, Wolfgang Computation tree logic \(CTL^ *\) and path quantifiers in the monadic theory of the binary tree. (English) Zbl 0632.03027 Automata, languages and programming, Proc. 14th Int. Colloq., Karlsruhe/FRG 1987, Lect. Notes Comput. Sci. 267, 269-279 (1987). Reviewer: H.Nishimura MSC: 03B70 03B45 68Q65 PDF BibTeX XML
Udayabaskaran, S.; Sudalaiyandi, G. On a stochastic integral of a branching process. (English) Zbl 0614.60080 J. Math. Biol. 24, 467-472 (1986). Reviewer: Ch.J.Mode MSC: 60J80 60H05 PDF BibTeX XML Cite \textit{S. Udayabaskaran} and \textit{G. Sudalaiyandi}, J. Math. Biol. 24, 467--472 (1986; Zbl 0614.60080) Full Text: DOI
Giroux, Gaston Asymptotic results for nonlinear processes of McKean tagged-molecule type. (English) Zbl 0613.60098 J. Appl. Probab. 23, 42-51 (1986). MSC: 60K35 60F05 60J80 PDF BibTeX XML Cite \textit{G. Giroux}, J. Appl. Probab. 23, 42--51 (1986; Zbl 0613.60098) Full Text: DOI
van Pelt, J.; Verwer, R. W. H. Topological properties of binary trees grown with order-dependent branching probabilities. (English) Zbl 0585.92003 Bull. Math. Biol. 48, 197-211 (1986). MSC: 92B05 PDF BibTeX XML Cite \textit{J. van Pelt} and \textit{R. W. H. Verwer}, Bull. Math. Biol. 48, 197--211 (1986; Zbl 0585.92003) Full Text: DOI
Gurevich, Yuri; Shelah, Saharon To the decision problem for branching time logic. (English) Zbl 0621.03007 Foundations of logic and linguistics, Sel. Pap. 7th Int. Congr. Logic, Methodol. Philos. Sci., Salzburg/Austria 1983, 181-198 (1985). MSC: 03B45 03B25 PDF BibTeX XML
Kierstead, H. A.; Remmel, J. B. Degrees of indiscernibles in decidable models. (English) Zbl 0579.03008 Trans. Am. Math. Soc. 289, 41-57 (1985). Reviewer: J.M.Plotkin MSC: 03B25 PDF BibTeX XML Cite \textit{H. A. Kierstead} and \textit{J. B. Remmel}, Trans. Am. Math. Soc. 289, 41--57 (1985; Zbl 0579.03008) Full Text: DOI
Horibe, Yasuichi Entropy and balance in binary trees. (English) Zbl 0482.94004 Theorie de l’information, developpements recents et applications, Colloq. int. CNRS 276, Cachan/Fr. 1977, 115-120 (1978). MSC: 94A17 94A45 68P10 PDF BibTeX XML