Aviv Nisgav

According to our database, Aviv Nisgav authored at least 8 papers between 2001 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

Finding Similar Users in Social Networks.

Aviv Nisgav, Boaz Patt-Shamir

Theory Comput. Syst., 2011

Recommender systems with non-binary grades.

Yossi Azar, Aviv Nisgav, Boaz Patt-Shamir

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Improved Collaborative Filtering.

Aviv Nisgav, Boaz Patt-Shamir

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2009

Finding similar users in social networks: extended abstract.

Aviv Nisgav, Boaz Patt-Shamir

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

2007

Asynchronous recommendation systems.

Baruch Awerbuch, Aviv Nisgav, Boaz Patt-Shamir

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Asynchronous Active Recommendation Systems.

Baruch Awerbuch, Aviv Nisgav, Boaz Patt-Shamir

Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

2002

General perfectly periodic scheduling.

Zvika Brakerski, Aviv Nisgav, Boaz Patt-Shamir

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001

Nearly optimal perfectly-periodic schedules.

Amotz Bar-Noy, Aviv Nisgav, Boaz Patt-Shamir

Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001