default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMoein Falahatgar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c11]Moein Falahatgar, Mesrob I. Ohannessian, Alon Orlitsky, Venkatadheeraj Pichapati:
Towards Competitive N-gram Smoothing. AISTATS 2020: 4206-4215- [c10]Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati:
Optimal Sequential Maximization: One Interview is Enough! ICML 2020: 2975-2984
2010 – 2019
- 2018
- [j1]Jayadev Acharya, Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Maximum Selection and Sorting with Adversarial Comparators. J. Mach. Learn. Res. 19: 59:1-59:31 (2018) - [c9]Moein Falahatgar, Ayush Jain, Alon Orlitsky, Venkatadheeraj Pichapati, Vaishakh Ravindrakumar:
The Limits of Maxing, Ranking, and Preference Learning. ICML 2018: 1426-1435 - 2017
- [c8]Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh:
Maximum Selection and Ranking under Noisy Comparisons. ICML 2017: 1088-1096 - [c7]Moein Falahatgar, Mesrob I. Ohannessian, Alon Orlitsky, Venkatadheeraj Pichapati:
The power of absolute discounting: all-dimensional distribution estimation. NIPS 2017: 6660-6669 - [c6]Moein Falahatgar, Yi Hao, Alon Orlitsky, Venkatadheeraj Pichapati, Vaishakh Ravindrakumar:
Maxing and Ranking with Few Assumptions. NIPS 2017: 7060-7070 - [i4]Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh:
Maximum Selection and Ranking under Noisy Comparisons. CoRR abs/1705.05366 (2017) - 2016
- [c5]Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh:
Estimating the number of defectives with group testing. ISIT 2016: 1376-1380 - [c4]Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh:
Learning Markov distributions: Does estimation trump compression? ISIT 2016: 2689-2693 - [c3]Moein Falahatgar, Mesrob I. Ohannessian, Alon Orlitsky:
Near-Optimal Smoothing of Structured Conditional Probability Matrices. NIPS 2016: 4853-4861 - [i3]Jayadev Acharya, Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Maximum Selection and Sorting with Adversarial Comparators and an Application to Density Estimation. CoRR abs/1606.02786 (2016) - 2015
- [c2]Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh:
Faster Algorithms for Testing under Conditional Sampling. COLT 2015: 607-636 - [c1]Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh:
Universal compression of power-law distributions. ISIT 2015: 2001-2005 - [i2]Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapathi, Ananda Theertha Suresh:
Faster Algorithms for Testing under Conditional Sampling. CoRR abs/1504.04103 (2015) - [i1]Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh:
Universal Compression of Power-Law Distributions. CoRR abs/1504.08070 (2015)
Coauthor Index
aka: Venkatadheeraj Pichapathi
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-13 00:44 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:
