×

Found 341 Documents (Results 1–100)

Effective divergence analysis for linear recurrence sequences. (English) Zbl 07378586

Schewe, Sven (ed.) et al., 29th international conference on concurrency theory. CONCUR 2018, Beijing, China, September 4–7, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 118, Article 42, 15 p. (2018).
MSC:  68Q25 03B25 11B37
PDFBibTeX XMLCite
Full Text: DOI arXiv

Average cost of QuickXsort with pivot sampling. (English) Zbl 1478.68071

Fill, James Allen (ed.) et al., 29th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA 2018, June 25–29, 2018, Uppsala, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 110, Article 36, 19 p. (2018).
MSC:  68P10 68W40
PDFBibTeX XMLCite
Full Text: DOI arXiv

Holonomic tools for basic hypergeometric functions. (English) Zbl 1411.33019

Nashed, M. Zuhair (ed.) et al., Frontiers in orthogonal polynomials and \(q\)-series. Papers based on the international conference, University of Central Florida, Orlando, FL, USA, May 10–12, 2015. Dedicated to Professor Mourad Ismail on his 70th birthday. Hackensack, NJ: World Scientific. Contemp. Math. Appl., Monogr. Expo. Lect. Notes 1, 393-416 (2018).
MSC:  33F10 05A30 33D15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Phase transitions in swarm optimization algorithms. (English) Zbl 1508.68351

Stepney, Susan (ed.) et al., Unconventional computation and natural computation. 17th international conference, UCNC 2018, Fontainebleau, France, June 25–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10867, 204-216 (2018).
MSC:  68T20 68W50 90C59
PDFBibTeX XMLCite
Full Text: DOI

Runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax. (English) Zbl 1365.68394

Proceedings of the 14th ACM/SIGEVO workshop on foundations of genetic algorithms, FOGA 2017, Copenhagen, Denmark, January 12–15, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4651-1). 13-24 (2017).
PDFBibTeX XMLCite
Full Text: DOI

Linear complexity and expansion complexity of some number theoretic sequences. (English) Zbl 1409.11138

Duquesne, Sylvain (ed.) et al., Arithmetic of finite fields. 6th international workshop, WAIFI 2016, Ghent, Belgium, July 13–15, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10064, 67-74 (2016).
MSC:  11Y16 11T71 94A60
PDFBibTeX XMLCite
Full Text: DOI

Symbolic summation in difference rings and applications. (English) Zbl 1360.68954

Rosenkranz, Markus (ed.), Proceedings of the 41st international symposium on symbolic and algebraic computation, ISSAC 2016, Waterloo, Canada, July 20–22, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4380-0). 9-12 (2016).
PDFBibTeX XMLCite
Full Text: DOI

Evaluating parametric holonomic sequences using rectangular splitting. (English) Zbl 1325.65178

Nabeshima, Katsusuke (ed.), Proceedings of the 39th international symposium on symbolic and algebraic computation, ISSAC 2014, Kobe, Japan, July 23–25, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2501-1). 256-263 (2014).
MSC:  65Q30 33F10 68W30
PDFBibTeX XMLCite
Full Text: DOI arXiv

A master theorem for discrete divide and conquer recurrences. (English) Zbl 1381.11113

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 342-361 (2011).
MSC:  11Y16 11B37 68W40
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference