default search action
Róbert Vajda
Person information
- affiliation: University of Szeged, Bolyai Institute, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Zoltán Kovács
, Christopher W. Brown, Tomás Recio, Róbert Vajda:
Computing with Tarski formulas and semi-algebraic sets in a web browser. J. Symb. Comput. 120: 102235 (2024) - 2023
- [c11]Christopher W. Brown, Zoltán Kovács, Simone Luksch, Tomás Recio, Róbert Vajda, M. Pilar Vélez:
Towards Detection of Partial Truth via Real Geometry. SC-Square@ISSAC 2023: 44-53 - 2022
- [j3]Christopher W. Brown, Zoltán Kovács, Tomás Recio
Is Computer Algebra Ready for Conjecturing and Proving Geometric Inequalities in the Classroom? Math. Comput. Sci. 16(4): 31 (2022) - [c10]Jan-Michael Holzinger, Róbert Vajda:
Extreme Points of the Unit Ball B4 in the Space of Real Polynomials of Degree at most Four with the Supremum Norm. SYNASC 2022: 19-26 - [c9]Zoltán Kovács, Christopher W. Brown, Tomás Recio, Róbert Vajda:
A web version of Tarski, a system for computing with Tarski formulas and semialgebraic sets. SYNASC 2022: 59-62 - 2021
- [c8]Zoltán Kovács, Róbert Vajda:
Extending GeoGebra/realgeom with QEPCAD B to obtain proofs on geometric inequalities. CICM Workshops 2021 - [c7]Zoltán Kovács, Róbert Vajda:
Symbolic Comparison of Geometric Quantities in GeoGebra. ThEdu@CADE 2021: 13-25 - [c6]Christopher W. Brown, Zoltán Kovács, Róbert Vajda:
Supporting Proving and Discovering Geometric Inequalities in GeoGebra by using Tarski. ADG 2021: 156-166 - [c5]Zoltán Kovács, Róbert Vajda:
Parametric Root Finding for Supporting Proving and Discovering Geometric Inequalities in GeoGebra. ADG 2021: 167-172 - 2020
- [c4]Róbert Vajda, Zoltán Kovács:
GeoGebra and the realgeom Reasoning Tool. PAAR+SC²@IJCAR 2020: 204-219 - [c3]Róbert Vajda:
Computational Exploration of the Degree Sequence of the Malyshev Polynomials. ICAI 2020: 420-428 - [i2]Heinz-Joachim Rack, Róbert Vajda:
An explicit univariate and radical parametrization of the septic proper Zolotarev polynomials in power form. CoRR abs/2002.00503 (2020)
2010 – 2019
- 2017
- [c2]Róbert Vajda
Maximal Radius for Stabilty Regions of Explicit Runge Kutta Methods by Real Quantifier Elimination. SYNASC 2017: 49-54 - [i1]Zoltán Kovács, Róbert Vajda:
A note about Euler's inequality and automated reasoning with dynamic geometry. CoRR abs/1708.02993 (2017) - 2013
- [c1]Róbert Vajda:
Lebesgue Constants and Optimal Node Systems via Symbolic Computations. SCSS 2013: 125 - 2010
- [j2]Attila Máder, Róbert Vajda
Elementary Approaches to the Teaching of the Combinatorial Problem of Rectangular Islands. Int. J. Comput. Math. Learn. 15(3): 267-281 (2010)
2000 – 2009
- 2009
- [j1]Róbert Vajda
Combining logical and algebraic techniques for natural style proving in elementary analysis. Math. Comput. Simul. 79(8): 2310-2316 (2009)
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-04-24 23:01 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: