default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBalázs Bánhelyi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Emília Heinc
, Balázs Bánhelyi:
Comparing Structural Constraints for Accelerated Branch and Bound Solver of Process Network Synthesis Problems. Acta Cybern. 26(3): 475-499 (2024)- 2023
- [j9]Andreas Rauh, Balázs Bánhelyi:
Preface. Acta Cybern. 26(1): 3 (2023) - 2021
- [c5]Dániel Zombori, Balázs Bánhelyi, Tibor Csendes, István Megyeri, Márk Jelasity:
Fooling a Complete Neural Network Verifier. ICLR 2021 - 2020
- [j8]Balázs Bánhelyi, Tibor Csendes, László Hatvani:
On the existence and stabilization of an upper unstable limit cycle of the damped forced pendulum. J. Comput. Appl. Math. 371: 112702 (2020) - [c4]Balázs Bánhelyi, Tamás Szabó:
Data Mining and Analysis for Data From Vehicles Based on the OBDII Standard. ICAI 2020: 30-37 - [c3]Tibor Csendes, Nándor Balogh, Balázs Bánhelyi, Dániel Zombori, Richárd Tóth, István Megyeri:
Adversarial Example Free Zones for Specific Inputs and Neural Networks. ICAI 2020: 76-84
2010 – 2019
- 2017
- [j7]Zsolt Bagóczki, Balázs Bánhelyi:
A Parallel Interval Arithmetic-based Reliable Computing Method on a GPU. Acta Cybern. 23(2): 491-501 (2017) - 2015
- [j6]Balázs Bánhelyi, Endre Palatinus, Balázs L. Lévai:
Optimal circle covering problems and their applications. Central Eur. J. Oper. Res. 23(4): 815-832 (2015) - 2014
- [j5]Balázs Bánhelyi, Tibor Csendes, Tibor Krisztin, Arnold Neumaier:
Global Attractivity of the Zero Solution for Wright's Equation. SIAM J. Appl. Dyn. Syst. 13(1): 537-563 (2014) - 2013
- [j4]Balázs L. Lévai, Balázs Bánhelyi:
An optimization technique for verified location of trajectories with prescribed geometrical behaviour in the chaotic forced damped pendulum. Central Eur. J. Oper. Res. 21(4): 757-767 (2013)
2000 – 2009
- 2009
- [c2]Balázs Bánhelyi, Marco Biazzini, Alberto Montresor, Márk Jelasity:
Peer-to-Peer Optimization in Large Unreliable Networks with Branch-and-Bound and Particle Swarms. EvoWorkshops 2009: 87-92 - [c1]Marco Biazzini, Balázs Bánhelyi, Alberto Montresor, Márk Jelasity:
Distributed hyper-heuristics for real parameter optimization. GECCO 2009: 1339-1346 - 2008
- [j3]Balázs Bánhelyi, Tibor Csendes, Barnabas M. Garay, László Hatvani:
A Computer-Assisted Proof of Σ3-Chaos in the Forced Damped Pendulum Equation. SIAM J. Appl. Dyn. Syst. 7(3): 843-867 (2008) - 2007
- [j2]Balázs Bánhelyi, Tibor Csendes, Barnabas M. Garay:
Optimization and the Miranda Approach in Detecting Horseshoe-Type Chaos by Computer. Int. J. Bifurc. Chaos 17(3): 735-747 (2007) - 2006
- [j1]Tibor Csendes, Barnabas M. Garay, Balázs Bánhelyi:
A Verified Optimization Technique to Locate Chaotic Regions of Hénon Systems. J. Glob. Optim. 35(1): 145-160 (2006)
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-09-10 01:11 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:
