Yossi Kanizo

Ph.D. student in the Computer Science Department of the Technion, Israel. Research in Computer Networks under the supervision of Prof. Isaac Keslassy and Dr. David Hay.

Contact

E-mail:	ykanizo (at) cs.technion.ac.il
Phone:	(972) 4-829 3864
Address:	Taub, 324
	Computer Science Department
	Technion - Israel Institute of Technology
	Haifa, 32000
	Israel

Publications

Journal Publications

• Yossi Kanizo, David Hay and Isaac Keslassy, "Hash Tables With Finite Buckets Are Less Resistant To Deletions," Computer Networks, 2012.

Conference Publications

• Yossi Kanizo, David Hay and Isaac Keslassy, "Access-Efficient Balanced Bloom Fiters," ICC, 2012.
• Ori Rottenstreich, Yossi Kanizo and Isaac Keslassy, "The Variable-Increment Counting Bloom Filter," Infocom, 2012.
• Yossi Kanizo, David Hay and Isaac Keslassy, "Hash Tables With Finite Buckets Are Less Resistant To Deletions," Allerton, 2010.
• Yossi Kanizo, David Hay and Isaac Keslassy, "The Crosspoint-Queued Switch," Infocom, 2009.
• Yossi Kanizo, David Hay and Isaac Keslassy, "Optimal Fast Hashing," Infocom, 2009.

Technical Reports

• Yossi Kanizo, David Hay and Isaac Keslassy, "Maximum Bipartite Matching Size And Application to Cuckoo Hashing," Technical Report TR11-02, Comnet, Technion, Israel.
• Yossi Kanizo, David Hay and Isaac Keslassy, "Hash Tables With Finite Buckets Are Less Resistant To Deletions," Technical Report TR10-01, Comnet, Technion, Israel.
• Yossi Kanizo, David Hay and Isaac Keslassy, "The Crosspoint-Queued Switch," Technical Report TR08-04, Comnet, Technion, Israel.
• Yossi Kanizo, David Hay and Isaac Keslassy, "Optimal Fast Hashing," Technical Report TR08-05, Comnet, Technion, Israel.