default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosef Kanizo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2014
[b1]Yossi Kanizo:
Fast decisions in high-Speed networking devices. Technion - Israel Institute of Technology, Israel, 2014
Journal Articles
- 2020
- [j9]Osnat Mokryn
, Adi Akavia, Yossi Kanizo:
Optimal cache placement with local sharing: An ISP guide to the benefits of the sharing economy. Comput. Networks 171: 107153 (2020) - [j8]Yaniv Sadeh, Ori Rottenstreich, Arye Barkan, Yossi Kanizo, Haim Kaplan:
Optimal Representations of a Traffic Distribution in Switch Memories. IEEE/ACM Trans. Netw. 28(2): 930-943 (2020) - 2018
- [j7]Ori Rottenstreich, Yossi Kanizo, Haim Kaplan, Jennifer Rexford:
Accurate Traffic Splitting on SDN Switches. IEEE J. Sel. Areas Commun. 36(10): 2190-2201 (2018) - [j6]Yossi Kanizo, Ori Rottenstreich, Itai Segall, Jose Yallouz:
Designing Optimal Middlebox Recovery Schemes With Performance Guarantees. IEEE J. Sel. Areas Commun. 36(10): 2373-2383 (2018) - 2017
- [j5]Yossi Kanizo, Ori Rottenstreich, Itai Segall, Jose Yallouz:
Optimizing Virtual Backup Allocation for Middleboxes. IEEE/ACM Trans. Netw. 25(5): 2759-2772 (2017) - 2015
- [j4]Yossi Kanizo, David Hay, Isaac Keslassy:
Maximizing the Throughput of Hash Tables in Network Devices with Combined SRAM/DRAM Memory. IEEE Trans. Parallel Distributed Syst. 26(3): 796-809 (2015) - 2014
- [j3]Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy:
The Variable-Increment Counting Bloom Filter. IEEE/ACM Trans. Netw. 22(4): 1092-1105 (2014) - 2013
- [j2]Yossi Kanizo, David Hay, Isaac Keslassy:
Access-efficient Balanced Bloom Filters. Comput. Commun. 36(4): 373-385 (2013) - 2012
- [j1]Yossi Kanizo, David Hay, Isaac Keslassy:
Hash tables with finite buckets are less resistant to deletions. Comput. Networks 56(4): 1376-1389 (2012)
Conference and Workshop Papers
- 2019
- [c11]Yaniv Sadeh, Ori Rottenstreich, Arye Barkan, Yossi Kanizo, Haim Kaplan:
Optimal Representations of a Traffic Distribution in Switch Memories. INFOCOM 2019: 2035-2043 - 2018
- [c10]Yossi Kanizo, Ori Rottenstreich, Itai Segall, Jose Yallouz:
Designing Optimal Middlebox Recovery Schemes with Performance Guarantees. INFOCOM 2018: 2096-2104 - [c9]Ori Rottenstreich, Yossi Kanizo, Haim Kaplan, Jennifer Rexford:
Accurate Traffic Splitting on Commodity Switches. SPAA 2018: 311-320 - 2016
- [c8]Yossi Kanizo, Ori Rottenstreich, Itai Segall, Jose Yallouz:
Optimizing virtual backup allocation for middleboxes. ICNP 2016: 1-10 - 2013
- [c7]Yossi Kanizo, Danny Raz, Alexander Zlotnik:
Efficient Use of Geographically Spread Cloud Resources. CCGRID 2013: 450-457 - [c6]Yossi Kanizo, David Hay, Isaac Keslassy:
Palette: Distributing tables in software-defined networks. INFOCOM 2013: 545-549 - 2012
- [c5]Yossi Kanizo, David Hay, Isaac Keslassy:
Access-efficient Balanced Bloom Filters. ICC 2012: 2723-2728 - [c4]Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy:
The Variable-Increment Counting Bloom Filter. INFOCOM 2012: 1880-1888 - 2010
- [c3]Yossi Kanizo, David Hay, Isaac Keslassy:
Hash tables with finite buckets are less resistant to deletions. Allerton 2010: 678-685 - 2009
- [c2]Josef Kanizo, David Hay, Isaac Keslassy:
The Crosspoint-Queued Switch. INFOCOM 2009: 729-737 - [c1]Josef Kanizo, David Hay, Isaac Keslassy:
Optimal Fast Hashing. INFOCOM 2009: 2500-2508
Informal and Other Publications
- 2010
- [i1]Josef Kanizo, David Hay, Isaac Keslassy:
Maximum Bipartite Matching Size And Application to Cuckoo Hashing. CoRR abs/1007.1946 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
