default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnthimos Vardis Kandiros
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros:
On Sampling from Ising Models with Spectral Constraints. APPROX/RANDOM 2024: 70:1-70:14- [c7]Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros:
Learning Hard-Constrained Models with One Sample. SODA 2024: 3184-3196 - [i7]Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros:
On Sampling from Ising Models with Spectral Constraints. CoRR abs/2407.07645 (2024) - 2023
- [j1]Dimitris Fotakis, Anthimos Vardis Kandiros
, Vasilis Kontonis, Stratis Skoulakis:
Opinion Dynamics with Limited Information. Algorithmica 85(12): 3855-3888 (2023) - [c6]Anthimos Vardis Kandiros, Constantinos Daskalakis, Yuval Dagan, Davin Choo:
Learning and Testing Latent-Tree Ising Models Efficiently. COLT 2023: 1666-1729 - [i6]Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros:
Learning Hard-Constrained Models with One Sample. CoRR abs/2311.03332 (2023) - 2022
- [c5]Yuval Dagan, Anthimos Vardis Kandiros, Constantinos Daskalakis:
EM's Convergence in Gaussian Latent Tree Models. COLT 2022: 2597-2667 - [i5]Yuval Dagan, Constantinos Daskalakis, Anthimos Vardis Kandiros:
EM's Convergence in Gaussian Latent Tree Models. CoRR abs/2211.11904 (2022) - [i4]Davin Choo, Yuval Dagan, Constantinos Daskalakis, Anthimos Vardis Kandiros:
Learning and Testing Latent-Tree Ising Models Efficiently. CoRR abs/2211.13291 (2022) - 2021
- [c4]Anthimos Vardis Kandiros, Yuval Dagan, Nishanth Dikkala, Surbhi Goel, Constantinos Daskalakis:
Statistical Estimation from Dependent Data. ICML 2021: 5269-5278 - [c3]Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Anthimos Vardis Kandiros:
Learning Ising models from one or multiple samples. STOC 2021: 161-168 - [i3]Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Surbhi Goel, Anthimos Vardis Kandiros:
Statistical Estimation from Dependent Data. CoRR abs/2107.09773 (2021) - 2020
- [c2]Dimitris Fotakis, Anthimos Vardis Kandiros, Thanasis Lianeas, Nikos Mouzakis, Panagiotis Patsilinakos, Stratis Skoulakis:
Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games. ICALP 2020: 50:1-50:19 - [i2]Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Anthimos Vardis Kandiros:
Estimating Ising Models from One Sample. CoRR abs/2004.09370 (2020)
2010 – 2019
- 2019
- [i1]Dimitris Fotakis, Anthimos Vardis Kandiros, Thanasis Lianeas, Nikos Mouzakis, Panagiotis Patsilinakos, Stratis Skoulakis:
Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games. CoRR abs/1911.08704 (2019) - 2018
- [c1]Dimitris Fotakis, Anthimos Vardis Kandiros, Vasilis Kontonis, Stratis Skoulakis:
Opinion Dynamics with Limited Information. WINE 2018: 282-296
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-18 00:12 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:
