Stephen Melczer

Orcid: 0000-0002-0995-3444

According to our database1, Stephen Melczer authored at least 28 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Computing error bounds for asymptotic expansions of regular P-recursive sequences.
Math. Comput., June, 2023

A Compact Representation for AVL Trees.
CoRR, 2023

Rigorous Analytic Combinatorics in Several Variables in SageMath.
CoRR, 2023

Exact Asymptotics for Discrete Noiseless Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Stationary Points at Infinity for Analytic Combinatorics.
Found. Comput. Math., 2022

Asymptotics of multivariate sequences IV: generating functions with poles on a hyperplane arrangement.
CoRR, 2022

Homotopy Techniques for Analytic Combinatorics in Several Variables.
Proceedings of the 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2022

2021
Algorithmic and Symbolic Combinatorics - A Series of the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria
Texts & Monographs in Symbolic Computation, Springer, ISBN: 978-3-030-67079-5, 2021

Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems.
J. Symb. Comput., 2021

Multivariate Analytic Combinatorics for Cost Constrained Channels and Subsequence Enumeration.
CoRR, 2021

Asymptotic enumeration of lonesum matrices.
Adv. Appl. Math., 2021

2020
Counting Partitions inside a Rectangle.
SIAM J. Discret. Math., 2020

Sequence Positivity Through Numeric Analytic Continuation: Uniqueness of the Canham Model for Biomembranes.
CoRR, 2020

2019
Higher Dimensional Lattice Walks: Connecting Combinatorial and Analytic Behavior.
SIAM J. Discret. Math., 2019

Critical points at infinity for analytic combinatorics.
CoRR, 2019

Asymptotics of multivariate sequences in the presence of a lacuna.
CoRR, 2019

Vertically Constrained Motzkin-Like Paths Inspired by Bobbin Lace.
Electron. J. Comb., 2019

Change of Basis for m-primary Ideals in One and Two Variables.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018
A fast algorithm for solving linearly recurrent sequences.
ACM Commun. Comput. Algebra, 2018

Diagonal Asymptotics for Symmetric Rational Functions via ACSV.
Proceedings of the 29th International Conference on Probabilistic, 2018

2017
Analytic Combinatorics in Several Variables : Effective Asymptotics and Lattice Path Enumeration. (Combinatoire analytique en plusieurs variables : asymptotique efficace et énumération de chemin de treillis).
PhD thesis, 2017

Weighted lattice walks and universality classes.
J. Comb. Theory, Ser. A, 2017

Analytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration.
CoRR, 2017

2016
Tableau sequences, open diagrams, and Baxter families.
Eur. J. Comb., 2016

Asymptotic Lattice Path Enumeration Using Diagonals.
Algorithmica, 2016

Symbolic-Numeric Tools for Analytic Combinatorics in Several Variables.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2014
Singularity Analysis Via the Iterated Kernel Method.
Comb. Probab. Comput., 2014

Ink-constrained halftoning with application to QR codes.
Proceedings of the Color Imaging XIX: Displaying, 2014


  Loading...