According to our database1, Christian Borgs authored at least 84 papers between 1999 and 2020.
Legend:Book In proceedings Article PhD thesis Other
Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures.
Proceedings of the Proccedings 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
Optimal Parameter Choice for Bloom Filter-based Privacy-preserving Record Linkage.
PhD thesis, 2019
Efficient sampling and counting algorithms for the Potts model on Zd at all temperatures.
Encoding Hierarchical Classification Codes for Privacy-Preserving Record Linkage Using Bloom Filters.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019
What's in a Name? Reducing Bias in Bios without Access to Protected Attributes.
Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2019
Bias in Bios: A Case Study of Semantic Representation Bias in a High-Stakes Setting.
Proceedings of the Conference on Fairness, Accountability, and Transparency, 2019
Algorithmic Greenlining: An Approach to Increase Diversity.
Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society, 2019
Private Algorithms Can Always Be Extended.
Hardening Encrypted Patient Names Against Cryptographic Attacks Using Cellular Automata.
Proceedings of the 2018 IEEE International Conference on Data Mining Workshops, 2018
Protecting Record Linkage Identifiers Using a Language Model for Patient Names.
Proceedings of the German Medical Data Sciences: A Learning Healthcare System, 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
Convergent sequences of sparse graphs: A large deviations approach.
Random Struct. Algorithms, 2017
Evaluating privacy-preserving record linkage using cryptographic long-term keys and multibit trees on large medical datasets.
BMC Med. Inf. & Decision Making, 2017
Sparse Exchangeable Graphs and Their Limits via Graphon Processes.
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
Entropy-SGD: Biasing Gradient Descent Into Wide Valleys.
Proceedings of the 5th International Conference on Learning Representations, 2017
A Comparison of Statistical Linkage Keys with Bloom Filter-based Encryptions for Privacy-preserving Record Linkage using Real-world Mammography Data.
Proceedings of the 10th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2017), 2017
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.
An Axiomatic Approach to Community Detection.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016
Randomized Response and Balanced Bloom Filters for Privacy Preserving Record Linkage.
Proceedings of the IEEE International Conference on Data Mining Workshops, 2016
Bargaining dynamics in exchange networks.
J. Econ. Theory, 2015
Private Graphon Estimation for Sparse Graphs.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015
Building a National Perinatal Data Base without the Use of Unique Personal Identifiers.
Proceedings of the IEEE International Conference on Data Mining Workshop, 2015
Privacy Preserving Record Linkage with PPJoin.
Proceedings of the Datenbanksysteme für Business, 2015
Optimal Multiperiod Pricing with Service Guarantees.
Manag. Sci., 2014
Multiscale Matrix Sampling and Sublinear-Time PageRank Computation.
Internet Math., 2014
Fixed-Points of Social Choice: An Axiomatic Approach to Network Communities.
Maximizing Social Influence in Nearly Optimal Time.
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
Left and right convergence of graphs with bounded degree.
Random Struct. Algorithms, 2013
Simultaneous Reconstruction of Multiple Signaling Pathways via the Prize-Collecting Steiner Forest Problem.
J. Comput. Biol., 2013
Finding Endogenously Formed Communities.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Pricing and queueing.
SIGMETRICS Perform. Evaluation Rev., 2012
Influence Maximization in Social Networks: Towards an Optimal Algorithmic Solution
Sublinear Time Algorithm for PageRank Computations and Related Applications
I Like Her more than You: Self-determined Communities
The Power of Local Information in Social Networks.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012
A Sublinear Time Algorithm for PageRank Computations.
Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012
Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions.
SIAM J. Discret. Math., 2011
Limits of randomly grown graph sequences.
Eur. J. Comb., 2011
Finding undetected protein associations in cell signaling by belief propagation
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
Optimal Multi-period Pricing with Service Guarantees - Working Paper.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
The Hitchhiker's Guide to Affiliation Networks: A Game-Theoretic Approach.
Proceedings of the Innovations in Computer Science, 2011
How to distribute antidote to control epidemics.
Random Struct. Algorithms, 2010
Tight Bounds for Mixing of the Swendsen-Wang Algorithm at the Potts Transition Point
A Novel Approach to Propagating Distrust.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010
Game-Theoretic Models of Information Overload in Social Networks.
Proceedings of the Algorithms and Models for the Web-Graph - 7th International Workshop, 2010
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
A Natural Dynamics for Bargaining on Exchange Networks
Local Computation of PageRank Contributions.
Internet Math., 2008
Trust-based recommendation systems: an axiomatic approach.
Proceedings of the 17th International Conference on World Wide Web, 2008
On the Stability of Web Crawling and Web Search.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
Robust PageRank and locally computable spam detection features.
Proceedings of the AIRWeb 2008, 2008
Degree distribution of the FKP network model.
Theor. Comput. Sci., 2007
Emergence of tempered preferential attachment from optimization.
Proc. Natl. Acad. Sci. USA, 2007
The Myth of the Folk Theorem.
Electronic Colloquium on Computational Complexity (ECCC), 2007
Fitting the WHOIS Internet data
Dynamics of bid optimization in online advertisement auctions.
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
Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs.
Comb. Probab. Comput., 2006
Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube.
Graph limits and parameter testing.
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
Random subgraphs of finite graphs: I. The scaling window under the triangle condition.
Random Struct. Algorithms, 2005
Degree Distribution of Competition-Induced Preferential Attachment Graphs
On the spread of viruses on the internet.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
Multi-unit auctions with budget-constrained bidders.
Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005
Phase diagram for the constrained integer partitioning problem.
Random Struct. Algorithms, 2004
Constrained Integer Partitions.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
Exploring the community structure of newsgroups.
Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004
Competition-Induced Preferential Attachment.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004
Directed scale-free graphs.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003
Phase transition and finite-size scaling for the integer partitioning problem.
Random Struct. Algorithms, 2001
The scaling window of the 2-SAT transition.
Random Struct. Algorithms, 2001
Sharp threshold and scaling window for the integer partitioning problem.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
On the Sampling Problem for H-Colorings on the Hypercubic Lattice.
Proceedings of the Graphs, 2001
Uniform boundedness of critical crossing probabilities implies hyperscaling.
Random Struct. Algorithms, 1999
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999