![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
András Telcs
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Tamás Sándor Biró
, András Telcs
, Antal Jakovác:
Analogies and Relations between Non-Additive Entropy Formulas and Gintropy. Entropy 26(3): 185 (2024) - [j21]Ádám Zlatniczki, András Telcs:
Application of Portfolio Optimization to Achieve Persistent Time Series. J. Optim. Theory Appl. 201(2): 932-954 (2024) - 2023
- [i2]Tamás Sándor Biró
, András Telcs, Máté Józsa, Zoltán Néda:
Gintropic Scaling of Scientometric Indexes. CoRR abs/2302.05720 (2023) - 2022
- [j20]Laszlo Gadar, Zsolt Tibor Kosztyán, András Telcs, János Abonyi:
Cooperation patterns in the ERASMUS student exchange network: an empirical study. Appl. Netw. Sci. 7(1): 74 (2022) - [j19]Tamás Sándor Biró
, András Telcs
, Máté Józsa
, Zoltán Néda
:
f-Gintropy: An Entropic Distance Ranking Based on the Gini Index. Entropy 24(3): 407 (2022) - [j18]Antal Jakovác, András Telcs
:
A Note on Representational Understanding. Entropy 24(9): 1313 (2022) - [j17]Zsolt Tibor Kosztyán
, András Telcs
, János Abonyi
:
A multi-block clustering algorithm for high dimensional binarized sparse data. Expert Syst. Appl. 191: 116219 (2022) - [j16]Zsigmond Benko, Marcell Stippinger, Roberta Rehus, Attila Bencze, Dániel Fabó, Boglárka Hajnal, Loránd G. Eröss, András Telcs, Zoltán Somogyvári
:
Manifold-adaptive dimension estimation revisited. PeerJ Comput. Sci. 8: e790 (2022) - 2021
- [j15]Zsolt Tibor Kosztyán
, Vivien Valéria Csányi, Zsuzsanna Banász, Ákos Jakobi, Ildikó Neumanné-Virág, András Telcs:
The role of higher education in spatial mobility. Appl. Netw. Sci. 6(1): 88 (2021) - [j14]Ádám Zlatniczki, Marcell Stippinger, Zsigmond Benko, Zoltán Somogyvári
, András Telcs
:
Relaxation of Some Confusions about Confounders. Entropy 23(11): 1450 (2021) - 2020
- [i1]Zsigmond Benko, Marcell Stippinger, Roberta Rehus, Attila Bencze, Dániel Fabó, Boglárka Hajnal, Loránd Eröss, András Telcs, Zoltán Somogyvári:
Manifold-adaptive dimension estimation revisited. CoRR abs/2008.03221 (2020)
2010 – 2019
- 2019
- [j13]Tamás Sándor Biró
, Zoltán Néda
, András Telcs
:
Entropic Divergence and Entropy Related to Nonlinear Master Equations. Entropy 21(10): 993 (2019) - 2018
- [j12]Péter Mihályi, Ádám Zlatniczki, András Telcs:
Cycles Generated by the Consumer Durables Sector. Period. Polytech. Electr. Eng. Comput. Sci. 62(2): 47-58 (2018) - 2014
- [j11]András Schubert
, András Telcs:
A note on the Jaccardized Czekanowski similarity index. Scientometrics 98(2): 1397-1399 (2014) - 2013
- [j10]Mokhtar H. Konsowa, Fahimah Al-Awadhi
, András Telcs
:
Commute times of random walks on trees. Discret. Appl. Math. 161(7-8): 1014-1021 (2013)
2000 – 2009
- 2009
- [j9]András Schubert
, András Korn, András Telcs:
Hirsch-type indices for characterizing networks. Scientometrics 78(2): 375-382 (2009) - [j8]Krisztina Barcza, András Telcs
:
Paretian publication patterns imply Paretian Hirsch index. Scientometrics 81(2): 513-519 (2009) - 2007
- [j7]Zoltán Vincze, Dorottya Vass, Rolland Vida, Attila Vidács, András Telcs:
Adaptive Sink Mobility in Event-Driven Densely Deployed Wireless Sensor Networks. Ad Hoc Sens. Wirel. Networks 3(2-3): 255-284 (2007) - [j6]András Telcs, Nicholas C. Wormald, Sanming Zhou
:
Hamiltonicity of random graphs produced by 2-processes. Random Struct. Algorithms 31(4): 450-481 (2007) - 2006
- [c2]Zoltán Vincze, Dorottya Vass, Rolland Vida, Attila Vidács, András Telcs:
Adaptive sink mobility in event-driven multi-hop wireless sensor networks. InterSense 2006: 13 - 2003
- [c1]András Telcs:
The volume and time comparison principle and transition probability estimates for random walks. DRW 2003: 301-308 - 2002
- [j5]András Telcs:
A Note On Rough Isometry Invariance Of Resistance. Comb. Probab. Comput. 11(4): 427-432 (2002)
1990 – 1999
- 1996
- [j4]Dezsö Miklós, András Telcs
:
On fully extended self-avoiding polygons. Discret. Math. 150(1-3): 437-440 (1996)
1980 – 1989
- 1989
- [j3]András Schubert, András Telcs:
Estimation of the publication potential in 50 U.S. states and in the District of Columbia based on the frequency distribution of scientific productivity. JASIS 40(4): 291-297 (1989) - 1986
- [j2]András Schubert
, András Telcs:
Publication potential - An indicator of scientific strength for cross-national comparisons. Scientometrics 9(5-6): 231-238 (1986) - 1984
- [j1]András Schubert
, Sándor Zsindely, András Telcs, Tibor Braun:
Quantitative analysis of a visible tip of the peer review iceberg: Book reviews in chemistry. Scientometrics 6(6): 433-443 (1984)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-08-05 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint