default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaniv Sadeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Yaniv Sadeh, Haim Kaplan:
Caching Connections in Matchings. ICALP 2024: 120:1-120:20- 2023
- [j4]Yaniv Sadeh
, Ori Rottenstreich, Haim Kaplan:
Load Balancing With Minimal Deviation in Switch Memories. IEEE Trans. Netw. Serv. Manag. 20(4): 4283-4296 (2023) - [c6]Yaniv Sadeh, Haim Kaplan:
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. STACS 2023: 53:1-53:21 - [i5]Yaniv Sadeh, Haim Kaplan:
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm. CoRR abs/2301.03084 (2023) - [i4]Yaniv Sadeh, Haim Kaplan:
Caching Connections in Matchings. CoRR abs/2310.14058 (2023) - 2022
- [j3]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Optimal Weighted Load Balancing in TCAMs. IEEE/ACM Trans. Netw. 30(3): 985-998 (2022) - [c5]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Minimal Total Deviation in TCAM Load Balancing. INFOCOM 2022: 450-459 - [c4]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Coding Size of Traffic Partition in Switch Memories. ISIT 2022: 1590-1595 - [i3]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Codes for Load Balancing in TCAMs: Size Analysis. CoRR abs/2212.13256 (2022) - [i2]Yaniv Sadeh:
On Ranges and Partitions in Optimal TCAMs. CoRR abs/2212.13283 (2022) - 2021
- [c3]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
How Much TCAM do we Need for Splitting Traffic? SOSR 2021: 169-175 - [i1]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Optimal Weighted Load Balancing in TCAMs. CoRR abs/2112.14732 (2021) - 2020
- [j2]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) - [c2]Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Optimal approximations for traffic distribution in bounded switch memories. CoNEXT 2020: 309-322
2010 – 2019
- 2019
- [c1]Yaniv Sadeh, Ori Rottenstreich, Arye Barkan, Yossi Kanizo, Haim Kaplan:
Optimal Representations of a Traffic Distribution in Switch Memories. INFOCOM 2019: 2035-2043 - 2016
- [j1]Oren Shriki, Yaniv Sadeh, Jamie Ward:
The Emergence of Synaesthesia in a Neuronal Network Model via Changes in Perceptual Sensitivity and Plasticity. PLoS Comput. Biol. 12(7) (2016)
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-07-03 21:32 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:
