default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBalázs Gerencsér
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Balázs Gerencsér
, Miklós Kornyik:
Low Complexity Convergence Rate Bounds for the Synchronous Gossip Subclass of Push-Sum Algorithms. IEEE Control. Syst. Lett. 8: 1283-1288 (2024)- [j17]Balázs Gerencsér, Zsombor Várkonyi:
Fast synchronization of inhomogenous random automata. Inf. Comput. 296: 105129 (2024) - 2023
- [j16]Julien M. Hendrickx, Balázs Gerencsér:
Trajectory convergence from coordinate-wise decrease of general energy functions. Autom. 154: 111099 (2023) - [j15]Balázs Gerencsér:
Analysis of a non-reversible Markov chain speedup by a single edge. J. Appl. Probab. 60(2): 642-660 (2023) - [i13]Balázs Gerencsér, Miklós Kornyik:
Low complexity convergence rate bounds for the synchronous gossip subclass of push-sum algorithms. CoRR abs/2307.06157 (2023) - 2022
- [j14]Balázs Gerencsér:
Computable Convergence Rate Bound for Ratio Consensus Algorithms. IEEE Control. Syst. Lett. 6: 3307-3312 (2022) - [j13]Balázs Gerencsér, László Gerencsér:
Tight Bounds on the Convergence Rate of Generalized Ratio Consensus Algorithms. IEEE Trans. Autom. Control. 67(4): 1669-1684 (2022) - [i12]Julien M. Hendrickx, Balázs Gerencsér:
Trajectory convergence from coordinate-wise decrease of general convex energy functions. CoRR abs/2203.03316 (2022) - [i11]Balázs Gerencsér, Zsombor Várkonyi:
Fast synchronization of inhomogenous random automata. CoRR abs/2206.05043 (2022) - 2020
- [j12]Julien M. Hendrickx, Balázs Gerencsér, Baris Fidan:
Trajectory Convergence From Coordinate-Wise Decrease of Quadratic Energy Functions, and Applications to Platoons. IEEE Control. Syst. Lett. 4(1): 151-156 (2020)
2010 – 2019
- 2019
- [j11]Balázs Gerencsér, Viktor Harangi:
Correction to: Acute Sets of Exponentially Optimal Size. Discret. Comput. Geom. 62(1): 239 (2019) - [j10]Balázs Gerencsér, Viktor Harangi:
Acute Sets of Exponentially Optimal Size. Discret. Comput. Geom. 62(4): 775-780 (2019) - [j9]François Gonze, Vladimir V. Gusev, Raphaël M. Jungers, Balázs Gerencsér, Mikhail V. Volkov:
On the Interplay Between Černý and Babai's Conjectures. Int. J. Found. Comput. Sci. 30(1): 93-114 (2019) - [j8]Balázs Gerencsér, Julien M. Hendrickx:
Push-Sum With Transmission Failures. IEEE Trans. Autom. Control. 64(3): 1019-1033 (2019) - [j7]Balázs Gerencsér, Viktor Harangi:
Too Acute to Be True: The Story of Acute Sets. Am. Math. Mon. 126(10): 905-914 (2019) - [c3]Algo Carè, Balázs Csanád Csáji, Balázs Gerencsér, László Gerencsér, Miklós Rásonyi:
Parameter-Dependent Poisson Equations: Tools for Stochastic Approximation in a Markovian Framework. CDC 2019: 2259-2264 - [i10]Balázs Gerencsér, László Gerencsér:
Tight bounds on the convergence rate of generalized ratio consensus algorithms. CoRR abs/1901.11374 (2019) - [i9]Julien M. Hendrickx, Balázs Gerencsér, Baris Fidan:
Trajectory convergence from coordinate-wise decrease of quadratic energy functions, and applications to platoons. CoRR abs/1903.00290 (2019) - [i8]Algo Carè, Balázs Csanád Csáji, Balázs Gerencsér, László Gerencsér, Miklós Rásonyi:
On the Poisson Equation of Parameter-Dependent Markov Chains. CoRR abs/1906.09464 (2019) - 2018
- [j6]Ágnes Backhausz, Balázs Gerencsér, Viktor Harangi, Máté Vizer:
Correlation Bounds for Distant Parts of Factor of IID Processes. Comb. Probab. Comput. 27(1): 1-20 (2018) - [j5]Balázs Gerencsér, Vladimir V. Gusev, Raphaël M. Jungers:
Primitive Sets of Nonnegative Matrices and Synchronizing Automata. SIAM J. Matrix Anal. Appl. 39(1): 83-98 (2018) - 2017
- [j4]Balázs Gerencsér, Romain Hollanders, Jean-Charles Delvenne, Raphaël M. Jungers:
A complexity analysis of Policy Iteration through combinatorial matrices arising from Unique Sink Orientations. J. Discrete Algorithms 44: 21-38 (2017) - [c2]François Gonze, Vladimir V. Gusev, Balázs Gerencsér, Raphaël M. Jungers, Mikhail V. Volkov:
On the Interplay Between Babai and Černý's Conjectures. DLT 2017: 185-197 - [i7]François Gonze, Vladimir V. Gusev, Balázs Gerencsér, Raphaël M. Jungers, Mikhail V. Volkov:
On the interplay between Babai and Černý's conjectures. CoRR abs/1704.04047 (2017) - 2016
- [j3]Romain Hollanders, Balázs Gerencsér, Jean-Charles Delvenne, Raphaël M. Jungers:
Improved bound on the worst case complexity of Policy Iteration. Oper. Res. Lett. 44(2): 267-272 (2016) - [i6]Balázs Gerencsér, Vladimir V. Gusev, Raphaël M. Jungers:
Primitive sets of nonnegative matrices and synchronizing automata. CoRR abs/1602.07556 (2016) - 2015
- [j2]Endre Csóka, Balázs Gerencsér, Viktor Harangi, Bálint Virág:
Invariant Gaussian processes and independent sets on regular graphs of large girth. Random Struct. Algorithms 47(2): 284-303 (2015) - [j1]Paolo Frasca, Federica Garin, Balázs Gerencsér, Julien M. Hendrickx:
Optimal One-Dimensional Coverage by Unreliable Sensors. SIAM J. Control. Optim. 53(5): 3120-3140 (2015) - [c1]Balázs Gerencsér, Julien M. Hendrickx, Paul Van Dooren:
Spectral gap of Markov chains on a cycle. ECC 2015: 765-769 - [i5]Balázs Gerencsér, Julien M. Hendrickx:
Push sum with transmission failures. CoRR abs/1504.08193 (2015) - [i4]Balázs Gerencsér, Christophe Cloquet, Vincent D. Blondel:
Markov modeling of Twitter tweet inter-arrival times. CoRR abs/1509.04857 (2015) - 2014
- [i3]Paolo Frasca, Federica Garin, Balázs Gerencsér, Julien M. Hendrickx:
One-dimensional coverage by unreliable sensors. CoRR abs/1404.7711 (2014) - [i2]Romain Hollanders, Balázs Gerencsér, Jean-Charles Delvenne, Raphaël M. Jungers:
An improved lower bound for Order-Regular matrices. CoRR abs/1407.4293 (2014) - [i1]Romain Hollanders, Balázs Gerencsér, Jean-Charles Delvenne, Raphaël M. Jungers:
Improved bound on the worst case complexity of Policy Iteration. CoRR abs/1410.7583 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
