Li Zhang

According to our database1, Li Zhang authored at least 64 papers between 1997 and 2018.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Differentially Private False Discovery Rate Control.
CoRR, 2018

Learning Differentially Private Recurrent Language Models.
Proceedings of the 6th International Conference on Learning Representations, 2018

2017
Learning Differentially Private Language Models Without Losing Accuracy.
CoRR, 2017

On the Protection of Private Information in Machine Learning Systems: Two Recent Approaches.
CoRR, 2017

On the Protection of Private Information in Machine Learning Systems: Two Recent Approches.
Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

2016
Well Separated Pair Decomposition for Unit-Disk Graph.
Encyclopedia of Algorithms, 2016

The Geometry of Differential Privacy: The Small Database and Approximate Cases.
SIAM J. Comput., 2016

Deep Learning with Differential Privacy.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Private False Discovery Rate Control.
CoRR, 2015

Nearly Optimal Private LASSO.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

2014
Private Empirical Risk Minimization Beyond the Worst Case: The Effect of the Constraint Set Geometry.
CoRR, 2014

Analyze gauss: optimal bounds for privacy-preserving principal component analysis.
Proceedings of the Symposium on Theory of Computing, 2014

Learning Sparse Polynomial Functions.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Learning Polynomials with Neural Networks.
Proceedings of the 31th International Conference on Machine Learning, 2014

2013
The geometry of differential privacy: the sparse and approximate cases.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Sybil-proof mechanisms in query incentive networks.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012
The Mind Grows Circuits
CoRR, 2012

Understanding cyclic trends in social choices.
Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

Domain bias in web search.
Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

2011
Proportional response dynamics in the Fisher market.
Theor. Comput. Sci., 2011

2010
Understanding Fashion Cycles as a Social Choice
CoRR, 2010

Scalable Influence Maximization in Social Networks under the Linear Threshold Model.
Proceedings of the ICDM 2010, 2010

2009
Trade-Offs between Stretch Factor and Load-Balancing Ratio in Routing on Growth-Restricted Graphs.
IEEE Trans. Parallel Distrib. Syst., 2009

The Proportional-Share Allocation Market for Computational Resources.
IEEE Trans. Parallel Distrib. Syst., 2009

2008
Well Separated Pair Decomposition.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Truth-Telling Reservations.
Algorithmica, 2008

2007
On incremental rendering of silhouette maps of a polyhedral scene.
Comput. Geom., 2007

Proportional response dynamics leads to market equilibrium.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006
Load-Balanced Short-Path Routing in Wireless Networks.
IEEE Trans. Parallel Distrib. Syst., 2006

2005
Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications.
SIAM J. Comput., 2005

Tycoon: An implementation of a distributed, market-based resource allocation system.
Multiagent and Grid Systems, 2005

Geometric spanners for routing in mobile networks.
IEEE Journal on Selected Areas in Communications, 2005

Ensuring Trust in One Time Exchanges: Solving the QoS Problem
CoRR, 2005

A price-anticipating resource allocation mechanism for distributed shared clusters.
Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005

GLIDER: gradient landmark-based distributed routing for sensor networks.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

The Efficiency and Fairness of a Fixed Budget Resource Allocation Game.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
Tycoon: an Implementation of a Distributed, Market-based Resource Allocation System
CoRR, 2004

Kinetic collision detection between two simple polygons.
Comput. Geom., 2004

Collision detection for deforming necklaces.
Comput. Geom., 2004

Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Fractionally cascaded information in a sensor network.
Proceedings of the Third International Symposium on Information Processing in Sensor Networks, 2004

2003
TreeJuxtaposer: scalable tree comparison using Focus+Context with guaranteed visibility.
ACM Trans. Graph., 2003

Probabilistic Analysis for Discrete Attributes of Moving Points.
Int. J. Comput. Geometry Appl., 2003

Discrete Mobile Centers.
Discrete & Computational Geometry, 2003

On the complexity of distance-based evolutionary tree reconstruction.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Zonotopes as bounding volumes.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
Fault-Tolerant Meshes with Small Degree.
IEEE Trans. Computers, 2002

Deformable Free-Space Tilings for Kinetic Collision Detection.
I. J. Robotics Res., 2002

Visibility Queries and Maintenance in Simple Polygons.
Discrete & Computational Geometry, 2002

Myriad: Cost-Effective Disaster Tolerance.
Proceedings of the FAST '02 Conference on File and Storage Technologies, 2002

Collision detection for deforming necklaces.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

2001
Kinetic Connectivity for Unit Disks.
Discrete & Computational Geometry, 2001

Geometric spanner for routing in mobile networks.
Proceedings of the 2nd ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2001

Kinetic Collision Detection: Algorithms and Experiments.
Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001

2000
A hierarchical method for real-time distance computation among moving convex bodies.
Comput. Geom., 2000

Compact Voronoi Diagrams for Moving Convex Polygons.
Proceedings of the Algorithm Theory, 2000

1999
Separation-Sensitive Collision Detection for Convex Objects.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

H-Walk: Hierarchical Distance Computation for Moving Convex Bodies.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

Kinetic Data Structures: Animating Proofs Through Time.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
Visibility Queries in Simple Polygons and Applications.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Euclidean proximity and power diagrams.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Probabilistic Analysis for Combinatorial Functions of Moving Points.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Proximity Problems on Moving Points.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

A Practical Evaluation of Kinetic Data Structures.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997


  Loading...