![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Armen E. Allahverdyan
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j4]Armen E. Allahverdyan, Andranik Khachatryan:
Optimal alphabet for single text compression. Inf. Sci. 621: 458-473 (2023) - [i25]Lida H. Aleksanyan, Armen E. Allahverdyan:
Unsupervised extraction of local and global keywords from a single text. CoRR abs/2307.14005 (2023) - [i24]Lida H. Aleksanyan, Armen E. Allahverdyan, Vardan G. Bardakhchyan:
Ultimatum game: regret or fairness? CoRR abs/2311.03814 (2023) - 2022
- [j3]Armen E. Allahverdyan, Edvard A. Khalafyan:
Energy Cost of Dynamical Stabilization: Stored versus Dissipated Energy. Entropy 24(8): 1020 (2022) - [i23]Armen E. Allahverdyan, Andranik Khachatryan:
Optimal alphabet for single text compression. CoRR abs/2201.05234 (2022) - 2021
- [i22]Armen E. Allahverdyan, David Petrosyan:
Dissipative search of an unstructured database. CoRR abs/2106.02703 (2021) - 2020
- [i21]Weibing Deng, Rongrong Xie, Shengfeng Deng, Armen E. Allahverdyan:
Two halves of a meaningful text are statistically different. CoRR abs/2004.06474 (2020)
2010 – 2019
- 2019
- [i20]S. G. Babajanyan, Kang Hao Cheong, Armen E. Allahverdyan:
Bargaining with entropy and energy. CoRR abs/1910.06544 (2019) - [i19]S. G. Babajanyan, Alexey V. Melkikh, Armen E. Allahverdyan:
Leadership scenarios in prisoner's dilemma game. CoRR abs/1910.08929 (2019) - 2018
- [j2]Armen E. Allahverdyan, Aram Galstyan, Ali E. Abbas, Zbigniew R. Struzik
:
Adaptive decision making via entropy minimization. Int. J. Approx. Reason. 103: 270-287 (2018) - [i18]Armen E. Allahverdyan, Aram Galstyan, Ali E. Abbas, Zbigniew R. Struzik:
Adaptive prior probabilities via optimization of risk and entropy. CoRR abs/1803.06638 (2018) - [i17]Weibing Deng, Armen E. Allahverdyan:
Relating Zipf's law to textual information. CoRR abs/1809.08399 (2018) - [i16]Rongrong Xie, Shengfeng Deng, Weibing Deng, Armen E. Allahverdyan:
Active image restoration. CoRR abs/1809.08406 (2018) - 2017
- [i15]Armen E. Allahverdyan, Aram Galstyan:
Emergence of Leadership in Communication. CoRR abs/1710.09076 (2017) - [i14]Armen E. Allahverdyan, Greg Ver Steeg, Aram Galstyan:
Memory-induced mechanism for self-sustaining activity in networks. CoRR abs/1712.07844 (2017) - 2016
- [i13]A. V. Gurzadyan, Armen E. Allahverdyan:
Non-random structures in universal compression and the Fermi paradox. CoRR abs/1603.00048 (2016) - 2015
- [i12]Weibing Deng, Armen E. Allahverdyan:
Rank-frequency relations of phonemes uncover an author-dependency of their usage. CoRR abs/1510.01315 (2015) - 2014
- [i11]Armen E. Allahverdyan, Aram Galstyan:
Active Inference for Binary Symmetric Hidden Markov Models. CoRR abs/1411.0630 (2014) - [i10]Armen E. Allahverdyan, Aram Galstyan:
Opinion Dynamics with Confirmation Bias. CoRR abs/1411.4328 (2014) - 2013
- [i9]Armen E. Allahverdyan, Weibing Deng, Qiuping A. Wang:
Explaining Zipf's Law via Mental Lexicon. CoRR abs/1302.4383 (2013) - [i8]Weibing Deng, Armen E. Allahverdyan, B. Li, Qiuping A. Wang:
Rank-frequency relation for Chinese characters. CoRR abs/1309.1536 (2013) - [i7]Greg Ver Steeg, Cristopher Moore, Aram Galstyan, Armen E. Allahverdyan:
Phase Transitions in Community Detection: A Solvable Toy Model. CoRR abs/1312.0631 (2013) - [i6]Armen E. Allahverdyan, Aram Galstyan:
Comparative Analysis of Viterbi Training and Maximum Likelihood Estimation for HMMs. CoRR abs/1312.4551 (2013) - 2012
- [c7]Ardeshir Kianercy, Aram Galstyan, Armen E. Allahverdyan:
Adaptive agents on evolving networks. AAMAS 2012: 1391-1392 - 2011
- [c6]Armen E. Allahverdyan, Aram Galstyan:
Comparative Analysis of Viterbi Training and Maximum Likelihood Estimation for HMMs. NIPS 2011: 1674-1682 - [c5]Greg Ver Steeg, Aram Galstyan, Armen E. Allahverdyan:
Statistical Mechanics of Semi-Supervised Clustering in Sparse Graphs (Abstract). UAI 2011: 853 - [i5]Aram Galstyan, Greg Ver Steeg, Armen E. Allahverdyan:
Statistical Mechanics of Semi-Supervised Clustering in Sparse Graphs. CoRR abs/1101.4227 (2011) - [i4]Aram Galstyan, Ardeshir Kianercy, Armen E. Allahverdyan:
Replicator Dynamics of Co-Evolving Networks. CoRR abs/1107.5354 (2011) - 2010
- [c4]Aram Galstyan, Ardeshir Kianercy, Armen E. Allahverdyan:
Replicator Dynamics of Coevolving Networks. AAAI Fall Symposium: Complex Adaptive Systems 2010
2000 – 2009
- 2009
- [c3]Armen E. Allahverdyan, Aram Galstyan:
On Maximum a Posteriori Estimation of Hidden Markov Processes. UAI 2009: 1-9 - [i3]Armen E. Allahverdyan, Aram Galstyan:
On Maximum a Posteriori Estimation of Hidden Markov Processes. CoRR abs/0906.1980 (2009) - [i2]Armen E. Allahverdyan, Aram Galstyan:
Community Detection with and without Prior Information. CoRR abs/0907.4803 (2009) - 2008
- [i1]Armen E. Allahverdyan:
Entropy of Hidden Markov Processes via Cycle Expansion. CoRR abs/0810.4341 (2008) - 2004
- [j1]Armen E. Allahverdyan, Roger Balian, Theodorus M. Nieuwenhuizen:
Thomson's formulation of the second law for macroscopic and finite work sources. Entropy 6(1): 30-37 (2004)
1990 – 1999
- 1998
- [c2]Armen E. Allahverdyan, David B. Saakian:
Accessible Information in Multi-access Quantum Channels. QCQC 1998: 276-284 - [c1]David B. Saakian, Armen E. Allahverdyan:
Strengthened Lindblad Inequality: Applications in Non-equilibrium Thermodynamics and Quantum Information Theory. QCQC 1998: 296-301
Coauthor Index
![](https://dblp1.uni-trier.de/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-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint