default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZaid Allybokus
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Yi Ju
, Teng Zeng, Zaid Allybokus, Scott J. Moura:
Robo-Chargers: Optimal Operation and Planning of a Robotic Charging System to Alleviate Overstay. IEEE Trans. Smart Grid 15(1): 770-782 (2024)- [c3]Ruiting Wang, Yi Ju, Zaid Allybokus, Wente Zeng, Nicolas Obrecht, Scott Moura:
Optimal Sizing, Operation, and Efficiency Evaluation of Battery Swapping Stations for Electric Heavy-Duty Trucks. ACC 2024: 707-712 - 2023
- [j4]Yiqi Zhao, Teng Zeng, Zaid Allybokus, Ye Guo, Scott J. Moura:
Joint Design for Electric Fleet Operator and Charging Service Provider: Understanding the Non-Cooperative Nature. IEEE Trans. Intell. Transp. Syst. 24(1): 115-127 (2023) - [c2]Yi Ju, Teng Zeng, Zaid Allybokus, Scott J. Moura:
Optimal Operation with Robo-chargers in Plug-in Electric Vehicle Charging Stations. ACC 2023: 2487-2492 - 2022
- [i5]Yi Ju, Teng Zeng, Zaid Allybokus, Scott J. Moura:
Robo-Chargers: Optimal Operation and Planning of a Robotic Charging System to Alleviate Overstay. CoRR abs/2212.03391 (2022)
2010 – 2019
- 2019
- [b1]Zaid Allybokus:
Real-time scalable algorithms for alpha-fair resource allocation in software defined networks. (Algorithmes distribués dédiés au calcul de l'allocation alpha-équitable en temps réel dans les réseaux SDN). University of Côte d'Azur, Nice, France, 2019 - 2018
- [j3]Zaid Allybokus, Konstantin Avrachenkov, Jeremie Leguay, Lorenzo Maggi:
Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software-Defined Networks. IEEE J. Sel. Areas Commun. 36(12): 2655-2666 (2018) - [j2]Zaid Allybokus, Nancy Perrot, Jérémie Leguay, Lorenzo Maggi, Eric Gourdin:
Virtual function placement for service chaining with partial orders and anti-affinity rules. Networks 71(2): 97-106 (2018) - [i4]Zaid Allybokus, Konstantin Avrachenkov, Jérémie Leguay, Lorenzo Maggi:
Lower Bounds for the Fair Resource Allocation Problem. CoRR abs/1802.02932 (2018) - [i3]Zaid Allybokus, Konstantin Avrachenkov, Jérémie Leguay, Lorenzo Maggi:
Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software Defined Networks. CoRR abs/1809.01050 (2018) - 2017
- [j1]Zaid Allybokus, Konstantin Avrachenkov, Jérémie Leguay, Lorenzo Maggi:
Lower Bounds for the Fair Resource Allocation Problem. SIGMETRICS Perform. Evaluation Rev. 45(3): 167-173 (2017) - [c1]Zaid Allybokus, Konstantin Avrachenkov, Jeremie Leguay, Lorenzo Maggi:
Real-Time Fair Resource Allocation in Distributed Software Defined Networks. ITC 2017: 19-27 - [i2]Zaid Allybokus, Nancy Perrot, Jérémie Leguay, Lorenzo Maggi, Eric Gourdin:
Virtual Function Placement for Service Chaining with Partial Orders and Anti-Affinity Rules. CoRR abs/1705.10554 (2017) - [i1]Zaid Allybokus, Konstantin Avrachenkov, Jérémie Leguay, Lorenzo Maggi:
Real-Time Fair Resource Allocation in Distributed Software Defined Networks. CoRR abs/1711.09690 (2017)
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-09-23 00:28 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:
