×

Found 92 Documents (Results 1–92)

100
MathJax

Split trees – a unifying model for many important random trees of logarithmic height: a brief survey. (English) Zbl 1484.68057

Lindblad, Joakim (ed.) et al., Discrete geometry and mathematical morphology. First international joint conference, DGMM 2021, Uppsala, Sweden, May 24–27, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12708, 20-57 (2021).
PDF BibTeX XML Cite
Full Text: DOI

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
Full Text: DOI

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).
PDF BibTeX XML Cite
Full Text: DOI

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).
PDF BibTeX XML Cite
Full Text: Link

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
Full Text: arXiv Link

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

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).
MSC:  60K35 60H15 60J80
PDF BibTeX XML Cite

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Classification

all top 3

Software