×

Found 177 Documents (Results 1–100)

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).
PDFBibTeX XMLCite
Full Text: DOI

Open problems about regular languages, 35 years later. (English) Zbl 1402.68120

Konstantinidis, Stavros (ed.) et al., The role of theory in computer science. Essays dedicated to Janusz Brzozowski. Hackensack, NJ: World Scientific (ISBN 978-981-3148-19-2/hbk; 978-981-3148-21-5/ebook). 153-175 (2017).
MSC:  68Q45 20M35 68Q70
PDFBibTeX XMLCite
Full Text: DOI HAL

Minimum layout of circulant graphs into certain height balanced trees. (English) Zbl 1430.68169

Arumugam, S. (ed.) et al., Theoretical computer science and discrete mathematics. First international conference, ICTCSDM 2016, Krishnankoil, India, December 19–21, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10398, 90-97 (2017).
MSC:  68R10 05C60 05C85
PDFBibTeX XMLCite
Full Text: DOI

Asymmetric Rényi problem and PATRICIA tries. (English) Zbl 1411.68033

Neininger, Ralph (ed.) et al., Proceedings of the 27th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms – AofA’16, Kraków, Poland, July 4–8, 2016. Kraków: Jagiellonian University, Department of Theoretical Computer Science. 18 p. (2016).
MSC:  68P05 60C05 68W40
PDFBibTeX XMLCite
Full Text: arXiv

A practically efficient algorithm for generating answers to keyword search over data graphs. (English) Zbl 1369.68184

Martens, Wim (ed.) et al., 19th international conference on database theory, ICDT ’16, Bordeaux, France, March 15–18, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-002-6). LIPIcs – Leibniz International Proceedings in Informatics 48, Article 23, 17 p. (2016).
MSC:  68P15 68P10
PDFBibTeX XMLCite
Full Text: DOI arXiv

It’s a small world for random surfers. (English) Zbl 1359.68022

Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 17th international workshop on approximation algorithms for combinatorial optimization problems (APPROX 2014) and the 18th international workshop on randomization and computation (RANDOM 2014), Universitat Politècnica de Catalunya, Barcelona, Spain, September 4–6, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-74-3). LIPIcs – Leibniz International Proceedings in Informatics 28, 857-871 (2014).
MSC:  68M11 05C82
PDFBibTeX XMLCite
Full Text: DOI arXiv

Subexponential estimates in the height theorem and estimates on numbers of periodic parts of small periods. (English. Russian original) Zbl 1294.16014

J. Math. Sci., New York 193, No. 4, 493-515 (2013); translation from Fundam. Prikl. Mat. 17(2011/12), No. 5, 21-54 (2012).
PDFBibTeX XMLCite
Full Text: DOI

Piecewise periodicity structure estimates in Shirshov’s height theorem. (English. Russian original) Zbl 1286.16022

Mosc. Univ. Math. Bull. 68, No. 1, 26-31 (2013); translation from Vestn. Mosk. Univ., Ser. I 68, No. 1, 10-16 (2013).
MSC:  16R10 68R15 16P90
PDFBibTeX XMLCite
Full Text: DOI

Two-sided estimates for essential height in Shirshov’s height theorem. (English. Russian original) Zbl 1286.16021

Mosc. Univ. Math. Bull. 67, No. 2, 64-68 (2012); translation from Vestn. Mosk. Univ., Ser. I 67, No. 2, 20-24 (2012).
MSC:  16R10 68R15 16P90
PDFBibTeX XMLCite
Full Text: DOI

The height of random binary unlabelled trees. (English) Zbl 1355.68061

Fifth colloquium on mathematics and computer science. Lectures from the colloquium, Blaubeuren, Germany, September 22–26, 2008. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science Proceedings AI, 121-134 (2008).
MSC:  68P05 60C05 60F10
PDFBibTeX XMLCite
Full Text: arXiv Link

Irreducibility and greatest common divisor algorithms for sparse polynomials. (English) Zbl 1270.11129

McKee, James (ed.) et al., Number theory and polynomials. Proceedings of the workshop, Bristol, UK, April 3–7, 2006. Cambridge: Cambridge University Press (ISBN 978-0-521-71467-9/pbk). London Mathematical Society Lecture Note Series 352, 155-176 (2008).
MSC:  11Y16 12Y05 68W30 11C08 11R09
PDFBibTeX XMLCite
Full Text: DOI

Approximate invariant property checking using term-height reduction for a subset of first-order logic. (English) Zbl 1183.68382

Cha, Sungdeok (Steve) (ed.) et al., Automated technology for verification and analysis. 6th international symposium, ATVA 2008, Seoul, Korea, October 20–23, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-88386-9/pbk). Lecture Notes in Computer Science 5311, 318-331 (2008).
MSC:  68Q60
PDFBibTeX XMLCite
Full Text: DOI

The height of watermelons with wall, extended abstract. (English) Zbl 1192.68957

2007 Conference on analysis of algorithms, AofA 07. Papers from the 13th Conference held in Juan-les-Pins, France, June 17–22, 2007. Nancy: The Association Discrete Mathematics & Theoretical Science (DMTCS). 427-438, electronic only (2007).
MSC:  68W40 65Y99
PDFBibTeX XMLCite
Full Text: Link

The height of list-tries and TST. (English) Zbl 1192.68945

2007 Conference on analysis of algorithms, AofA 07. Papers from the 13th Conference held in Juan-les-Pins, France, June 17–22, 2007. Nancy: The Association Discrete Mathematics & Theoretical Science (DMTCS). 247-258, electronic only (2007).
MSC:  68W40 65Y99 68R10
PDFBibTeX XMLCite
Full Text: Link

Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. (English) Zbl 1356.11093

Dumas, Jean-Guillaume (ed.), Proceedings of the 2006 international symposium on symbolic and algebraic computation, ISSAC 06, Genova, Italy, July 9–12, 2006. New York, NY: ACM Press (ISBN 1-59593-276-3). 162-168 (2006).
MSC:  11Y16 11Y40 68W30
PDFBibTeX XMLCite
Full Text: DOI

Some results for monotonically labelled simply generated trees. (English) Zbl 1104.68084

Martínez, Conrado (ed.), 2005 international conference on analysis of algorithms. Papers from the conference, Barcelona, Spain, June 6–10, 2005. Nancy: The Association Discrete Mathematics & Theoretical Science (DMTCS). Discrete Mathematics and Theoretical Computer Science Proceedings AD, 173-180, electronic (2005).
MSC:  68R10 05C05 05C78
PDFBibTeX XMLCite

Resolution refutations and propositional proofs with height-restrictions. (English) Zbl 1021.03052

Bradfield, Julian (ed.), Computer science logic. 16th international workshop, CSL 2002, 11th annual conference of the EACSL, Edinburgh, Scotland, GB, September 22-25, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2471, 599-612 (2002).
PDFBibTeX XMLCite
Full Text: Link

Using linked micromap plots to characterize Omernik ecoregions. Repr. from Data Mining and Knowledge Discovery 4, No. 1 (2000). (English) Zbl 0969.68694

Brown, Timothy J. et al., Statistical mining and data visualization in atmospheric sciences. Boston: Kluwer Academic Publishers. 43-67 (2000).
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software