Publications

  1. Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, and Helmut Prodinger, Counting zeros in random walks on the integers and analysis of optimal dual-pivot quicksort, Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, 2016.
  2. Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, and Helmut Prodinger, Dual-pivot quicksort: Optimality, analysis and zeros of associated lattice paths, Combin. Probab. Comput. (2018).
  3. Uta Freiberg, Clemens Heuberger, and Helmut Prodinger, Application of Smirnov words to waiting time distributions of runs, Electron. J. Combin. 24 (2017), no. 3. MR3711097.
  4. Benjamin Hackl, Clemens Heuberger, and Helmut Prodinger, Ascents in non-negative lattice paths, arXiv:1801.02996 [math.CO], 2018.
  5. Benjamin Hackl, Clemens Heuberger, and Helmut Prodinger, Reductions of binary trees and lattice paths induced by the register function, Theoret. Comput. Sci. 705 (2018), 31–57. MR3721457.
  6. Benjamin Hackl, Clemens Heuberger, Sara Kropf, and Helmut Prodinger, Fringe analysis of plane trees related to cutting and pruning, Aequationes Math. 92 (2018), 311–353.
  7. Benjamin Hackl, Clemens Heuberger, and Helmut Prodinger, The register function and reductions of binary trees and lattice paths, Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, 2016.
  8. Benjamin Hackl, Clemens Heuberger, and Daniel Krenn, Asymptotic expansions in SageMath, http://trac.sagemath.org/17601, 2015, module in SageMath 6.10.
  9. Benjamin Hackl, Clemens Heuberger, Helmut Prodinger, and Stephan Wagner, Analysis of bidirectional ballot sequences and random walks ending in their maximum, Ann. Comb. 20 (2016), 775–797. MR3572386.
  10. Benjamin Hackl, Sara Kropf, and Helmut Prodinger, Iterative cutting and pruning of planar trees, Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Philadelphia PA), SIAM, 2017, pp. 66–72.
  11. Benjamin Hackl and Helmut Prodinger, Growing and destroying Catalan–{S}tanley trees, Discrete Math. Theor. Comput. Sci. 20 (2018), no. 1.
  12. Clemens Heuberger, Daniel Krenn, and Stephan Wagner, Canonical trees, compact prefix-free codes and sums of unit fractions: A probabilistic analysis, SIAM J. Discrete Math. 29 (2015), no. 3, 1600–1653. MR3391977.
  13. Clemens Heuberger, Daniel Krenn, and Sara Kropf, Finite state machines, automata, transducers, http://trac.sagemath.org/15078, 2013, module in Sage 5.13.
  14. Clemens Heuberger, Daniel Krenn, and Sara Kropf, Automata in SageMath—combinatorics meets theoretical computer science, Discrete Math. Theor. Comput. Sci. 18 (2016), no. 3.
  15. Clemens Heuberger, Sara Kropf, and Helmut Prodinger, Asymptotic analysis of the sum of the output of transducers, 25th International Conference on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'14), DMTCS-HAL Proceedings Series, vol. BA, 2014, pp. 145–156. MR3525971.
  16. Clemens Heuberger, Sara Kropf, and Helmut Prodinger, Output sum of transducers: Limiting distribution and periodic fluctuation, Electron. J. Combin. 22 (2015), no. 2, 1–53. MR3359922.
  17. Clemens Heuberger, Sara Kropf, and Helmut Prodinger, Analysis of carries in signed digit expansions, Monatsh. Math. 182 (2017), no. 2, 299–334. MR3600406.
  18. Clemens Heuberger, Sara Kropf, and Stephan Wagner, Variances and covariances in the central limit theorem for the output of a transducer, European J. Combin. 49 (2015), 167–187. MR3349532.
  19. Clemens Heuberger and Sara Kropf, Analysis of the binary asymmetric joint sparse form, Combin. Probab. Comput. 23 (2014), 1087–1113. MR3265839. Electronic version © Cambridge University Press 2014.
  20. Clemens Heuberger and Sara Kropf, Higher dimensional quasi-power theorem and Berry–Esseen inequality, Monatsh. Math. 187 (2018), 293–314.
  21. Clemens Heuberger and Sara Kropf, On the higher dimensional quasi-power theorem and a Berry–Esseen inequality, Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, 2016.
  22. Clemens Heuberger and Michela Mazzoli, Symmetric digit sets for elliptic curve scalar multiplication without precomputation, Theoret. Comput. Sci. 547 (2014), 18–33. MR3233460.
  23. Clemens Heuberger and Michela Mazzoli, Elliptic curves with isomorphic groups of points over finite field extensions, J. Number Theory 181 (2017), 89–98. MR3689671.
  24. Clemens Heuberger, Helmut Prodinger, and Stephan Wagner, The height of multiple edge plane trees, Aequationes Math. 90 (2016), 625–645. MR3500212.
  25. Clemens Heuberger and Helmut Prodinger, Protection number in plane trees, Appl. Anal. Discrete Math. 11 (2017), 314–326. MR3719828.
  26. Clemens Heuberger and Roswitha Rissner, Computing J-ideals of a matrix over a principal ideal domain, Linear Algebra Appl. 527 (2017), 12–31. MR3647467.
  27. Clemens Heuberger and Stephan Wagner, On the monoid generated by a Lucas sequence, Number Theory—Diophantine Problems, Uniform Distribution and Applications. Festschrift in Honour of Robert F. Tichy‚Äôs 60th Birthday (Christian Elsholtz and Peter Grabner, eds.), Springer, 2017, pp. 281–301. MR3676406.
  28. Daniel Krenn, An extended note on the comparison-optimal dual-pivot quickselect, 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics ({ANALCO}), SIAM, 2017, pp. 115–123.
  29. Daniel Krenn, Hosam M. Mahmoud, and Mark D. Ward, The continuum P\'olya-like random walk, arXiv:1608.01233 [math.PR], 2016.
  30. Daniel Krenn and Stephan Wagner, The number of compositions into powers of b, 25th International Conference on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'14), DMTCS-HAL Proceedings Series, vol. BA, 2014, pp. 241–252.
  31. Daniel Krenn and Stephan Wagner, Compositions into powers of b: Asymptotic enumeration and parameters, Algorithmica 75 (2016), no. 4, 606–631.
  32. Daniel Krenn, Dimbinaina Ralaivaosaona, and Stephan Wagner, On the number of multi-base representations of an integer, 25th International Conference on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'14), DMTCS-HAL Proceedings, vol. BA, 2014, pp. 229–240.
  33. Daniel Krenn, Dimbinaina Ralaivaosaona, and Stephan Wagner, Multi-base representations of integers: Asymptotic enumeration and central limit theorems, Appl. Anal. Discrete Math. 9 (2015), no. 2, 285–312.
  34. Daniel Krenn and Volker Ziegler, Non-minimality of the width-w non-adjacent form in conjunction with trace one \tau-adic digit expansions and Koblitz curves in characteristic two, Math. Comp. 87 (2018), no. 310, 821–854.
  35. Sara Kropf and Stephan Wagner, q-quasiadditive functions, Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, 2016.
  36. Sara Kropf and Stephan Wagner, On q-quasiadditive and q-quasimultiplicative functions, Electron. J. Combin. 24 (2017), no. 1, \#P1.60.
  37. Sara Kropf, Variance and covariance of several simultaneous outputs of a Markov chain, Discrete Math. Theor. Comput. Sci. 18 (2016), no. 3.