Cameron E. Freer

Cited by

	All	Since 2018
Citations	861	515
h-index	14	13
i10-index	17	15

120

201120122013201420152016201720182019202020212022202320 10 30 56 57 78 75 95 84 102 85 90 59

Public access

View all

9 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Nate AckermanHarvard UniversityVerified email at math.harvard.edu
Daniel M. RoyUniversity of Toronto, Dept of Statistical Sciences; Computer ScienceVerified email at utoronto.ca
Rehana PatelMathematicianVerified email at wesleyan.edu
Alexander D. Wissner-GrossHarvard, MITVerified email at post.harvard.edu
Vikash K. MansinghkaMIT, Probabilistic Computing ProjectVerified email at mit.edu
Feras A. SaadCMUVerified email at cmu.edu
Frank StephanNational University of SingaporeVerified email at comp.nus.edu.sg
Andre NiesUniversity of AucklandVerified email at cs.auckland.ac.nz
Bjørn Kjos-HanssenProfessor of Mathematics, University of Hawaii at ManoaVerified email at hawaii.edu
Diana CaiCenter for Computational Mathematics, Flatiron InstituteVerified email at flatironinstitute.org
martin rinardMITVerified email at lcs.mit.edu
Span SpanbauerMassachusetts Institute of TechnologyVerified email at mit.edu
Jason RuteIBM ResearchVerified email at ibm.com
Jeremy AvigadProfessor of Philosophy and Mathematical Sciences, Carnegie Mellon UniversityVerified email at cmu.edu
Joshua B. TenenbaumMITVerified email at mit.edu
Hongseok YangProfessor, School of Computing, KAISTVerified email at kaist.ac.kr
Dario SteinRadboud University NijmegenVerified email at ru.nl
Jean-Baptiste TristanAmazon Web Services - Automated Reasoning GroupVerified email at bc.edu
Jaroslav NešetřilCharles UniversityVerified email at kam.mff.cuni.cz
Alex KruckmanWesleyan UniversityVerified email at wesleyan.edu

Cameron E. Freer

Research Scientist, MIT and Project Associate Professor, Keio University

Verified email at mit.edu - Homepage

computability probability mathematical logic probabilistic programming combinatorics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Causal entropic forces AD Wissner-Gross, CE Freer Physical Review Letters 110 (16), 168702, 2013	323	2013
Relativistic statistical arbitrage AD Wissner-Gross, CE Freer Physical Review E 82 (5), 056104, 2010	72	2010
Noncomputable conditional distributions NL Ackerman, CE Freer, DM Roy 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011), 107-116, 2011	60	2011
Invariant measures concentrated on countable structures N Ackerman, C Freer, R Patel Forum of Mathematics, Sigma 4 (e17), 59pp., 2016	44	2016
Algorithmic aspects of Lipschitz functions C Freer, B Kjos-Hanssen, A Nies, F Stephan Computability 3 (1), 45-61, 2014	39*	2014
Computable de Finetti measures CE Freer, DM Roy Annals of Pure and Applied Logic 163 (5), 530-546, 2012	33	2012
On the computability of conditional probability NL Ackerman, CE Freer, DM Roy Journal of the ACM (JACM) 66 (3), 23, 2019	30	2019
System and method for relativistic statistical securities trading CE Freer, AD Wissner-Gross US Patent 8,635,133, 2014	23	2014
Towards common-sense reasoning via conditional simulation: legacies of Turing in Artificial Intelligence CE Freer, DM Roy, JB Tenenbaum Turing's Legacy: Developments from Turing's Ideas in Logic, 2014	22*	2014
On computability and disintegration NL Ackerman, CE Freer, DM Roy Mathematical Structures in Computer Science 27 (8), 1287-1314, 2017	20	2017
Deep involutive generative models for neural MCMC S Spanbauer, C Freer, V Mansinghka arXiv preprint arXiv:2006.15167, 2020	18	2020
An iterative step-function estimator for graphons D Cai, N Ackerman, C Freer arXiv preprint arXiv:1412.2129, 2014	17	2014
The Beta-Bernoulli process and algebraic effects S Staton, D Stein, H Yang, N Ackerman, C Freer, DM Roy ICALP 2018, 141:1-141:15, 2018	16	2018
Graph Turing machines NL Ackerman, CE Freer WoLLIC 2017, LNCS 10388, 1-13, 2017	15	2017
Posterior distributions are computable from predictive distributions CE Freer, DM Roy AISTATS 2010, JMLR: W&CP 9, 233-240, 2010	14	2010
Computable exchangeable sequences have computable de Finetti measures CE Freer, DM Roy Computability in Europe (CiE 2009), LNCS 5635, 218-231, 2009	14	2009
A family of exact goodness-of-fit tests for high-dimensional discrete distributions FA Saad, CE Freer, NL Ackerman, VK Mansinghka AISTATS 2019, PMLR 89, 1640-1649, 2019	10	2019
Optimal approximate sampling from discrete probability distributions FA Saad, CE Freer, MC Rinard, VK Mansinghka Proceedings of the ACM on Programming Languages 4 (POPL), 36, 2020	9	2020
Stable regularity for relational structures N Ackerman, C Freer, R Patel arXiv preprint arXiv:1712.09305, 2017	9	2017
The Fast Loaded Dice Roller: A near-optimal exact sampler for discrete probability distributions FA Saad, CE Freer, MC Rinard, VK Mansinghka AISTATS 2020, PMLR 108, 2020	7	2020

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors