Jennifer T. Chayes
Affiliations:- University of California, Berkeley, CA, USA
- Microsoft Research (former)
According to our database1,
Jennifer T. Chayes
authored at least 90 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2010, "For contributions to the foundations of dynamic random networks in theoretical computer science.".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on acm.org
-
on viaf.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
A Multi-Grained Symmetric Differential Equation Model for Learning Protein-Ligand Binding Dynamics.
CoRR, 2024
2023
Efficient sampling and counting algorithms for the Potts model on <i>ℤ</i><sup><i>d</i></sup> at all temperatures.
Random Struct. Algorithms, August, 2023
CoRR, 2023
Symmetry-Informed Geometric Representation for Molecules, Proteins, and Crystalline Materials.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the 3rd Workshop on Adverse Impacts and Collateral Effects of Artificial Intelligence Technologies (AiOfAi 2023) co-located with 32nd International Conference on Artificial Intelligence (IJCAI 2023), 2023
2022
Oper. Res., November, 2022
2020
The Road for Recovery: Aligning COVID-19 efforts and building a more resilient future.
IEEE Data Eng. Bull., 2020
Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
The disparate equilibria of algorithmic decision making when individuals invest rationally.
Proceedings of the FAT* '20: Conference on Fairness, 2020
2019
Efficient sampling and counting algorithms for the Potts model on Z<sup>d</sup> at all temperatures.
CoRR, 2019
Visualizing the Consequences of Climate Change Using Cycle-Consistent Adversarial Networks.
CoRR, 2019
Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2019
Proceedings of the Conference on Fairness, Accountability, and Transparency, 2019
Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society, 2019
2018
Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018
2017
Random Struct. Algorithms, 2017
J. Mach. Learn. Res., 2017
Graphons: A Nonparametric Method to Model, Estimate, and Design Algorithms for Massive Networks.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
Thy Friend is My Friend: Iterative Collaborative Filtering for Sparse Matrix Estimation.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017
Proceedings of the 5th International Conference on Learning Representations, 2017
2016
Unreasonable effectiveness of learning neural networks: From accessible states and robust ensembles to basic algorithmic schemes.
Proc. Natl. Acad. Sci. USA, 2016
Unreasonable Effectiveness of Learning Neural Nets: Accessible States and Robust Ensembles.
CoRR, 2016
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016
2015
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015
2014
Internet Math., 2014
CoRR, 2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Sharing Information to Reconstruct Patient-Specific Pathways in Heterogeneous Diseases.
Proceedings of the Biocomputing 2014: Proceedings of the Pacific Symposium, 2014
2013
Random Struct. Algorithms, 2013
Simultaneous Reconstruction of Multiple Signaling Pathways via the Prize-Collecting Steiner Forest Problem.
J. Comput. Biol., 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
2012
CoRR, 2012
CoRR, 2012
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012
Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012
2011
Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions.
SIAM J. Discret. Math., 2011
CoRR, 2011
We know who you followed last summer: inferring social link creation times in twitter.
Proceedings of the 20th International Conference on World Wide Web, 2011
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Proceedings of the Innovations in Computer Science, 2011
2010
CoRR, 2010
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010
Proceedings of the Algorithms and Models for the Web-Graph - 7th International Workshop, 2010
2009
Proof of the local REM conjecture for number partitioning. II. Growing energy scales.
Random Struct. Algorithms, 2009
Proof of the local REM conjecture for number partitioning. I: Constant energy scales.
Random Struct. Algorithms, 2009
2008
Proceedings of the 17th International Conference on World Wide Web, 2008
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
Proceedings of the AIRWeb 2008, 2008
2007
Proc. Natl. Acad. Sci. USA, 2007
Proceedings of the 16th International Conference on World Wide Web, 2007
First to market is not everything: an analysis of preferential attachment with fitness.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
2006
Comb., 2006
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006
2005
Random subgraphs of finite graphs: I. The scaling window under the triangle condition.
Random Struct. Algorithms, 2005
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005
2004
Random Struct. Algorithms, 2004
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004
2003
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003
2002
Proceedings of the LATIN 2002: Theoretical Informatics, 2002
2001
Random Struct. Algorithms, 2001
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
Proceedings of the Graphs, 2001
1999
Random Struct. Algorithms, 1999
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999