Author: Jian Yin

Publication Overview

Publication period start: 2008
Number of co-authors: 10

Co-Authors

Number of publications with favourite co-authors

Productive Colleagues

Most productive colleagues in number of publications

Publications

Srivatsa, Mudhakar, Iyengar, Arun, Yin, Jian, Liu, Ling (2008): Mitigating application-level denial of service attacks on Web servers: A client-transparen. In ACM Transactions on the Web, 2 (3) pp. 15. https://dx.doi.org/10.1145/1377488.1377489
Yin, Jian, Alvisi, Lorenzo, Dahlin, Michael, Iyengar, Arun (2002): Engineering web cache consistency. In ACM Trans. Internet Techn., 2 (3) pp. 224-259. https://dl.acm.org/doi/10.1145/572326.572329
Wang, Haixun, Yin, Jian, Perng, Chang-Shing, Yu, Philip S. (2008): Dual encryption for query integrity assurance. In: Shanahan, James G., Amer-Yahia, Sihem, Manolescu, Ioana, Zhang, Yi, Evans, David A., Kolcz, Aleksander, Choi, Key-Sun, Chowdhury, Abdur (eds.) Proceedings of the 17th ACM Conference on Information and Knowledge Management - CIKM 2008 October 26-30, 2008, Napa Valley, California, USA. pp. 863-872. https://doi.acm.org/10.1145/1458082.1458196
Yin, Jian, Madria, Sanjay Kumar (2006): A Hierarchical Secure Routing Protocol against Black Hole Attacks in Sensor Networks. In: SUTC 2006 - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing 5-7 June, 2006, Taichung, Taiwan. pp. 376-383. https://doi.ieeecomputersociety.org/10.1109/SUTC.2006.8
Yin, Jian, Alvisi, Lorenzo, Dahlin, Mike, Iyengar, Arun (2001): Engineering server-driven consistency for large scale dynamic Web services. In: Proceedings of the 2001 International Conference on the World Wide Web , 2001, . pp. 45-57. https://doi.acm.org/10.1145/371920.371935
Privacy Settings
By using this site, you accept our Cookie Policy and Terms of Use.
Customize
Accept all

Feel Stuck? Want Freedom?

Join 326,571+ designers who get one powerful email each week. Learn to design a life you love.

Next email in
0
days
12
hrs
12
mins
28
secs

Free forever. No spam. Unsubscribe anytime.