default search action
Iosif Salem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c19]Evgeniy Feder, Anton Paramonov, Pavel Mavrin, Iosif Salem, Vitaly Aksenov, Stefan Schmid:
Toward Self-Adjusting k-Ary Search Tree Networks. ESA 2024: 52:1-52:15 - [c18]Evgeniy Feder, Anton Paramonov, Pavel Mavrin, Iosif Salem, Stefan Schmid, Vitaly Aksenov
:
Toward Self-Adjusting $k$-Ary Search Tree Networks. IPDPS (Workshops) 2024: 1209-1211 - [c17]Lukas Aumayr, Esra Ceylan, Yannik Kopyciok, Matteo Maffei, Pedro Moreno-Sanchez, Iosif Salem, Stefan Schmid:
Optimizing Virtual Payment Channel Establishment in the Face of On-Path Adversaries. IFIP Networking 2024: 1-10 - [c16]Sean Doris, Iosif Salem
Anomaly Detection Within Mission-Critical Call Processing. SSS 2024: 322-337 - [i16]Sean Doris, Iosif Salem, Stefan Schmid:
Anomaly Detection Within Mission-Critical Call Processing. CoRR abs/2408.14599 (2024) - 2023
- [c15]Vitaly Aksenov
Self-adjusting Linear Networks with Ladder Demand Graph. SIROCCO 2023: 132-148 - [i15]Evgenii Feder, Anton Paramonov, Iosif Salem, Stefan Schmid, Vitaly Aksenov:
Toward Self-Adjusting k-ary Search Tree Networks. CoRR abs/2302.13113 (2023) - 2022
- [j4]Christos Liaskos, Ageliki Tsioliaridou, Konstantinos Georgopoulos, Ioannis Morianos, Sotiris Ioannidis, Iosif Salem
XR-RF Imaging Enabled by Software-Defined Metasurfaces and Machine Learning: Foundational Vision, Technologies and Challenges. IEEE Access 10: 119841-119862 (2022) - [j3]Marco Canini
Renaissance: A self-stabilizing distributed SDN control plane using in-band communications. J. Comput. Syst. Sci. 127: 91-121 (2022) - [c14]Samarth Tiwari
Wiser: Increasing Throughput in Payment Channel Networks with Transaction Aggregation. AFT 2022: 217-231 - [c13]Zeta Avarikioti, Krzysztof Pietrzak, Iosif Salem, Stefan Schmid
Hide & Seek: Privacy-Preserving Rebalancing on Payment Channel Networks. Financial Cryptography 2022: 358-373 - [c12]Chen Avin, Marcin Bienkowski, Iosif Salem
Deterministic Self-Adjusting Tree Networks Using Rotor Walks. ICDCS 2022: 67-77 - [c11]Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov
Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model. INFOCOM 2022: 1089-1098 - [i14]Chen Avin, Marcin Bienkowski, Iosif Salem
Deterministic Self-Adjusting Tree Networks Using Rotor Walks. CoRR abs/2204.10754 (2022) - [i13]Samarth Tiwari, Michelle Yeo, Zeta Avarikioti, Iosif Salem
Wiser: Increasing Throughput in Payment Channel Networks with Transaction Aggregation. CoRR abs/2205.11597 (2022) - [i12]Anton Paramonov, Iosif Salem
Self-Adjusting Linear Networks with Ladder Demand Graph. CoRR abs/2207.03948 (2022) - [i11]Christos Liaskos, Ageliki Tsioliaridou, Konstantinos Georgopoulos, George Morianos, Sotiris Ioannidis, Iosif Salem
XR-RF Imaging Enabled by Software-Defined Metasurfaces and Machine Learning: Foundational Vision, Technologies and Challenges. CoRR abs/2209.15436 (2022) - [i10]Artur Hecker, Stefan Schmid, Henning Schulzrinne, Lily Hügerich, Sándor Laki, Iosif Salem:
Towards More Flexible and Automated Communication Networks (Dagstuhl Seminar 22471). Dagstuhl Reports 12(11): 96-108 (2022) - 2021
- [c10]Krzysztof Pietrzak, Iosif Salem
LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks. Networking 2021: 1-9 - [c9]Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov
Toward Self-Adjusting Networks for the Matching Model. SPAA 2021: 429-431 - [i9]Krzysztof Pietrzak, Iosif Salem, Stefan Schmid, Michelle Yeo:
LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks. CoRR abs/2104.04293 (2021) - [i8]Zeta Avarikioti, Krzysztof Pietrzak, Iosif Salem, Stefan Schmid, Samarth Tiwari, Michelle Yeo:
HIDE & SEEK: Privacy-Preserving Rebalancing on Payment Channel Networks. CoRR abs/2110.08848 (2021) - [i7]Zeta Avarikioti, Krzysztof Pietrzak, Iosif Salem
HIDE & SEEK: Privacy-Preserving Rebalancing on Payment Channel Networks. IACR Cryptol. ePrint Arch. 2021: 1401 (2021) - 2020
- [c8]Chen Avin, Iosif Salem
Working Set Theorems for Routing in Self-Adjusting Skip List Networks. INFOCOM 2020: 2175-2184 - [i6]Chen Avin, Chen Griner, Iosif Salem, Stefan Schmid:
An Online Matching Model for Self-Adjusting ToR-to-ToR Networks. CoRR abs/2006.11148 (2020) - [i5]Lukas Aumayr, Esra Ceylan, Matteo Maffei, Pedro Moreno-Sanchez, Iosif Salem, Stefan Schmid:
Demand-Aware Payment Channel Networks. CoRR abs/2011.14341 (2020)
2010 – 2019
- 2019
- [c7]Chen Avin
Brief Announcement: On Self-Adjusting Skip List Networks. DISC 2019: 35:1-35:3 - 2018
- [j2]Iosif Salem
Shared-object system equilibria: Delay and throughput analysis. Theor. Comput. Sci. 731: 1-27 (2018) - [c6]Marco Canini
Renaissance: A Self-Stabilizing Distributed SDN Control Plane. ICDCS 2018: 233-243 - [c5]Iosif Salem
Practically-Self-stabilizing Vector Clocks in the Absence of Execution Fairness. NETYS 2018: 318-333 - 2017
- [c4]Marco Canini
A Self-Organizing Distributed and In-Band SDN Control Plane. ICDCS 2017: 2656-2657 - [i4]Marco Canini, Iosif Salem, Liron Schiff, Elad Michael Schiller, Stefan Schmid:
Renaissance: Self-Stabilizing Distributed SDN Control Plane. CoRR abs/1712.07697 (2017) - [i3]Iosif Salem, Elad Michael Schiller:
Practically-Self-Stabilizing Vector Clocks in the Absence of Execution Fairness. CoRR abs/1712.08205 (2017) - 2016
- [c3]Iosif Salem
Shared-object system equilibria: delay and throughput analysis. ICDCN 2016: 30:1-30:10 - [c2]Giorgos Georgiadis, Iosif Salem
Tailor your curves after your costume: supply-following demand in smart grids through the adwords problem. SAC 2016: 2127-2134 - 2015
- [i2]Iosif Salem, Elad Schiller, Marina Papatriantafilou, Philippas Tsigas:
Shared-object System Equilibria: Delay and Throughput Analysis. CoRR abs/1508.01660 (2015) - 2014
- [j1]Archontia C. Giannopoulou, Iosif Salem
Effective computation of immersion obstructions for unions of graph classes. J. Comput. Syst. Sci. 80(1): 207-216 (2014) - 2012
- [c1]Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros:
Effective Computation of Immersion Obstructions for Unions of Graph Classes. SWAT 2012: 165-176 - [i1]Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros:
Effective Computation of Immersion Obstructions for Unions of Graph Classes. CoRR abs/1207.5636 (2012)
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-11-07 21:32 CET 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: