|
|
 |
» |
|
|
 |
Economic methods
- Truth-telling reservations
with F. Wu and B. Huberman
Algorithmica, to appear, 2008
Proceedings of Workshop on Internet and Network Economics (WINE) , pp:80-91, 2005 (invited to the Algorithmica special issue)
- Proportional response dynamics leads to market equilibrium
with F. Wu
39th Annual ACM Symposium on Theory of Computing (STOC) , pp:354-363, 2007
- Ensuring trust in one time exchanges: solving the QoS problem
with B. Huberman and F. Wu
Netnomics, 7(1):27-37, 2006
- The efficiency and fairness of a fixed budget resource allocation game
Proceedings of 32nd International Colloquium on Automata, Languages and Programming (ICALP) , pp:80-91, 2005
- A price-anticipating resource allocation mechanism for distributed shared clusters
with M. Feldman and K. Lai
Proceedings of ACM Conference on Electronic Commerce (ACMEC) , pp:127-136, 2005
- Games and queues
with F. Wu and B. Huberman
10th International Conference on Computing in Economics and Finance, 2004
- Reduced entanglement for quantum games
with T. Hogg
International Journal of Quantum Information, 1(3):321-336, 2003
Wireless newtorks
- Tradeoffs between stretch factor and load balancing ratio in routing in growth restricted graphs
with J. Gao
IEEE Transactions on Parallel and Distributed Systems (TPDS) , to appear, 2008
Proceedings of 23rd ACM Symposium on Principles of Distributed Computing (PODC) , pp:189-196, 2004
- Load balanced short path routing in wireless networks
with J. Gao
IEEE Transactions on Parallel and Distributed Systems (TPDS) , 17(4):377-388, 2006
IEEE INFOCOM Proceedings (INFOCOM) , 2004
- Well-separated pair decomposition for the unit-disk graph metric and its applications
with J. Gao
SIAM Journal on Computing (SICOMP) , 35(1):151-169, 2005
Proceedings of 35th Annual ACM Symposium on Theory of Computing (STOC) , pp:483-492, 2003
- Glider: gradient landmark-based distributed routing for sensor networks
with Q. Fang, J. Gao, L. Guibas, and V. de Silva
IEEE INFOCOM Proceedings (INFOCOM) , 2005
- Geometric spanner for routing in mobile networks
with J. Gao, L. Guibas, J. Hershberger, and A. Zhu
IEEE Journal on Selected Areas in Communications (JSAC) , 23(1):174-185, 2005
Proceedings of ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) , pp:45-55, 2001
- Fractional cascaded information in a sensor network
with J. Gao, L. Guibas, and J. Hershberger
Proceedings of 3rd International Symposium on Information Processing in Sensor Networks (IPSN) , pp:311-319, 2004
Kinetic data structures
- On incremental rendering of silhouette maps of a polyhedral scene
with A. Efrat, L. Guibas, and O. Hall-Holt
Computational Geometry: Theory and Applications (CGTA) , 38(10):129-138, 2007
Proceedings of 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pp:910-917, 2000
- Kinetic collision detection for two simple polygons
with J. Basch, J. Erickson, L. Guibas, and J. Hershberger
Computational Geometry: Theory and Applications (CGTA) , 27(3):211-235, 2004
Proceedings of 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pp:102-111, 1999
- Discrete mobile centers
with J. Gao, L. Guibas, J. Hershberger, and A. Zhu
Discrete and Computational Geometry (DCG) , 30(1):45-65, 2003
Proceedings of 17th ACM Symposium on Computational Geometry (SoCG) , pp:188-196, 2001 (invited to the DCG special issue)
- Probabilistic analysis for combinatorial functions of moving points
with J. Basch, H. Devarajan, and P. Indyk
International Journal of Computational Geometry and Applications (IJCGA) , 13(1):5-22, 2003
Proceedings of 13th ACM Symposium on Computational Geometry (SoCG) , pp:442-444, 1997
- Deformable free space tilings for kinetic collision detection
with P. Agarwal, J. Basch, L. Guibas, and J. Hershberger
International Journal on Robotics Research (IJRR) , 21(3):179-197, 2002
Proceedings of 4th International Workshop on Algorithmic Foundations of Robotics (WAFR) , pp:83-96, 2000 (invited to the IJRR special issue)
- Kinetic connectivity of unit disks
with L. Guibas, J. Hershberger, and S. Suri
Discrete and Computational Geometry (DCG) , 25(4):591-610, 2001
Proceedings of 16th ACM Symposium on Computational Geometry (SoCG) , pp:331-340, 2000 (invited to the DCG special issue)
- Kinetic data structures for efficient simulation
with L. Guibas and F. Xie
Proceedings of IEEE International Conference on Robotics and Automation (ICRA) , pp:2903-2910, 2001
- Kinetic maintenance of proximity structures
Ph.D. thesis. Department of Computer Scienc, Stanford University, 2000
- Compact Voronoi diagram for moving convex polygons
with L. Guibas and J. Snoeyink
Proceedings of 7th Scandinavian Workshop on Algorithm Theory (SWAT) , pp:339-352, 2000
- Kinetic data structures: animating proofs through time (video)
with J. Basch, J. Comba, L. Guibas, J. Hershberger, and C. Silverstein
Proceedings of 15th ACM Symposium on Computational Geometry (SoCG) , pp:427-428, 1999
- Separation-sensitive convex collision detection
with J. Erickson, L. Guibas, and J. Stolfi
Proceedings of 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pp:327-336, 1999
- Proximity problems on moving points
with J. Basch and L. Guibas
Proceedings of 13th ACM Symposium on Computational Geometry (SoCG) , pp:344-351, 1997
- A practical evaluation of kinetic data structures
with J. Basch, L. Guibas, and C. Silverstein
Proceedings of 13th ACM Symposium on Computational Geometry (SoCG) , pp:388-390, 1997
Geometric algorithms
- Collision detection for deforming necklaces
with P. Agarwal, L. Guibas, A. Ngyuen, and D. Russel
Computational Geometry: Theory and Applications (CGTA) , 28(2-3):137-163, 2004
Proceedings of 18th ACM Symposium on Computational Geometry (SoCG) , pp:33-42, 2002 (invited to the CGTA special issue)
- Zonotopes as bounding volumes
with L. Guibas and A. Ngyuen
Proceedings of 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pp:803-812, 2003
- Visibility queries and maintenance in simple polygons
with B. Aronov, L. Guibas, and M. Teichmann
Discrete and Computational Geometry (DCG) , 27(4):461-483, 2002
Proceedings of 9th Annual International Symposium on Algorithms and Computation (ISAAC) , pp:327-336, 1998
- A hierarchical method for real-time distance computation among moving convex bodies
with L. Guibas and D. Hsu
Computational Geometry: Theory and Applications (CGTA) , 15(1-3):51-68, 2000
Proceedings of 15th ACM Symposium on Computational Geometry (SoCG) , pp:344-351, 1999
- Euclidean proximity and power diagrams
with L. Guibas
10th Canadian Conference on Computational Geometry (CCCG) , 1998
Phylogenetic trees
Cryptography
- An efficient systolic implementation of RSA operations (in Chinese)
with K. Lu
Proceedings of 3rd Annual Symposium on Computer Information Security, Chinese Computer Association, 1993
- Secret exchange without computational hardness assumption (in Chinese)
with W. Chen and J. He
Proceedings of 1st National Conference of Young Scientists, Chinese Computer Association, 1992
- An efficient public key agreement scheme (in Chinese)
with B. Jiang
Proceedings of 2nd Annual Symposium on Computer Information Security, Chinese Computer Association, 1992
- An identity based dynamic password verification scheme (in Chinese)
Proceedings of 2nd Annual Symposium on Computer Information Security, Chinese Computer Association, 1992
Other
- Implicit link structure and the dynamic of Blogspace
with E. Adar, L. Adamic, and R. Lukose
Workshop on the Weblogging Ecosystem, WWW Conference, 2004
- Fault-tolerant networks with small degrees
IEEE Transactions on Computers (TOC) , 51(5):553-560, 2002
Proceedings of 11th ACM Symposium on Parallel Algorithms and Architectures (SPAA) , pp:64-69, 2000
- Myriad: cost-effective disaster tolerance
with F. Chang, M. Ji, S. Leung, J. MacCormick, and S. Perl
USENIX First Conference on File and Storage Technologies (FAST) , pp:103-116, 2002
- On variants of block-sorting compression using context from both the left and right
with M. Burrows
Technical Note 2000-005, Compaq Systems Research Center, 2000
- On the time-randomness tradeoff for oblivious routing (in Chinese)
Chinese Journal of Computers, 19(5):388-397, 1996
|
 |
|