Balázs Gerencsér

Zsombor Várkonyi

Inf. Comput., January, 2024

2023

Trajectory convergence from coordinate-wise decrease of general energy functions.

[BibT_eX]

[DOI]

Autom., August, 2023

Analysis of a non-reversible Markov chain speedup by a single edge.

[BibT_eX]

[DOI]

J. Appl. Probab., June, 2023

Low complexity convergence rate bounds for the synchronous gossip subclass of push-sum algorithms.

[BibT_eX]

[DOI]

Miklós Kornyik

CoRR, 2023

2022

Tight Bounds on the Convergence Rate of Generalized Ratio Consensus Algorithms.

[BibT_eX]

[DOI]

László Gerencsér

IEEE Trans. Autom. Control., 2022

Computable Convergence Rate Bound for Ratio Consensus Algorithms.

[BibT_eX]

[DOI]

IEEE Control. Syst. Lett., 2022

Trajectory convergence from coordinate-wise decrease of general convex energy functions.

[BibT_eX]

[DOI]

CoRR, 2022

2020

Trajectory Convergence From Coordinate-Wise Decrease of Quadratic Energy Functions, and Applications to Platoons.

[BibT_eX]

[DOI]

Baris Fidan

IEEE Control. Syst. Lett., 2020

2019

Too Acute to Be True: The Story of Acute Sets.

[BibT_eX]

[DOI]

Viktor Harangi

Am. Math. Mon., 2019

Push-Sum With Transmission Failures.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2019

On the Interplay Between Černý and Babai's Conjectures.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

Acute Sets of Exponentially Optimal Size.

[BibT_eX]

[DOI]

Viktor Harangi

Discret. Comput. Geom., 2019

Correction to: Acute Sets of Exponentially Optimal Size.

[BibT_eX]

[DOI]

Viktor Harangi

Discret. Comput. Geom., 2019

On the Poisson Equation of Parameter-Dependent Markov Chains.

[BibT_eX]

[DOI]

CoRR, 2019

Parameter-Dependent Poisson Equations: Tools for Stochastic Approximation in a Markovian Framework.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Conference on Decision and Control, 2019

2018

Primitive Sets of Nonnegative Matrices and Synchronizing Automata.

[BibT_eX]

[DOI]

Vladimir V. Gusev

SIAM J. Matrix Anal. Appl., 2018

Correlation Bounds for Distant Parts of Factor of IID Processes.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2018

2017

A complexity analysis of Policy Iteration through combinatorial matrices arising from Unique Sink Orientations.

[BibT_eX]

[DOI]

Romain Hollanders

Jean-Charles Delvenne

J. Discrete Algorithms, 2017

On the Interplay Between Babai and Černý's Conjectures.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016

Improved bound on the worst case complexity of Policy Iteration.

[BibT_eX]

[DOI]

Romain Hollanders

Jean-Charles Delvenne

Oper. Res. Lett., 2016

2015

Optimal One-Dimensional Coverage by Unreliable Sensors.

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2015

Invariant Gaussian processes and independent sets on regular graphs of large girth.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2015

Markov modeling of Twitter tweet inter-arrival times.

[BibT_eX]

[DOI]

Christophe Cloquet

Vincent D. Blondel

CoRR, 2015

Spectral gap of Markov chains on a cycle.

[BibT_eX]

[DOI]

Paul Van Dooren

Proceedings of the 14th European Control Conference, 2015

2014

An improved lower bound for Order-Regular matrices.

[BibT_eX]

[DOI]

Romain Hollanders

Jean-Charles Delvenne