default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCan Umut Ileri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Elmira Ebrahimi, Michael Sober, Anh-Tu Hoang, Can Umut Ileri, William Sanders, Stefan Schulte:
Blockchain-based Federated Learning Utilizing Zero-Knowledge Proofs for Verifiable Training and Aggregation. Blockchain 2024: 54-63- [c8]Anh-Tu Hoang, Can Umut Ileri, William Sanders, Stefan Schulte:
zkSSI: A Zero-Knowledge-Based Self-Sovereign Identity Framework. Blockchain 2024: 276-285 - 2023
- [j5]Quinten Stokkink
, Can Umut Ileri, Dick H. J. Epema, Johan Pouwelse:
Web3 Sybil avoidance using network latency. Comput. Networks 227: 109701 (2023) - [c7]Can Umut Ileri, Nikita Polyanskii:
Dynamic Availability and Definite Finality in IOTA 2.0. BlockSys 2023: 1 - 2022
- [c6]Quinten Stokkink, Can Umut Ileri, Johan Pouwelse:
Reputation-Based Data Carrying for Web3 Networks. LCN 2022: 283-286 - 2021
- [j4]Martijn de Vos, Can Umut Ileri, Johan Pouwelse:
XChange: A Universal Mechanism for Asset Exchange between Permissioned Blockchains. World Wide Web 24(5): 1691-1728 (2021) - [c5]Alexander Stannat, Can Umut Ileri, Dion Gijswijt, Johan Pouwelse:
Achieving Sybil-Proofness in Distributed Work Systems. AAMAS 2021: 1263-1271 - 2020
- [i1]Martijn de Vos, Can Umut Ileri, Johan Pouwelse:
XChange: A Blockchain-based Mechanism for Generic Asset Trading In Resource-constrained Environments. CoRR abs/2004.05046 (2020)
2010 – 2019
- 2019
- [j3]Can Umut Ileri, Orhan Dagdeviren:
A distributed and asynchronous approach for optimizing weighted graph matchings in wireless network services. Expert Syst. Appl. 119: 73-89 (2019) - [j2]Can Umut Ileri, Orhan Dagdeviren:
A self-stabilizing algorithm for b-matching. Theor. Comput. Sci. 753: 64-75 (2019) - 2018
- [b1]Can Umut Ileri:
Distributed and self-stabilizing algorithms for capacitated graph theory problems (Kapasite kısıtlı çizge teorisi problemleri içindağıtık ve öz-kararlı algoritmalar). Ege University, Turkey, 2018 - [c4]Can Umut Ileri, Orhan Dagdeviren:
Evaluating Fault Tolerance Properties of Self-Stabilizing Matching Algorithms in Wireless Sensor Networks. BlackSeaCom 2018: 1-5 - 2017
- [c3]Can Umut Ileri, Orhan Dagdeviren:
Improving distributed maximum weighted matchings for communication networks. BlackSeaCom 2017: 1-5 - [c2]Mustafa Asci, Can Umut Ileri, Orhan Dagdeviren:
An energy-efficient capacitated minimum spanning tree algorithm for topology control in Wireless Sensor Networks. SIU 2017: 1-4 - 2016
- [c1]Can Umut Ileri, Orhan Dagdeviren:
Performance evaluation of distributed maximum weighted matching algorithms. DICTAP 2016: 103-108 - 2013
- [j1]Edoardo Amaldi, Stefano Coniglio, Luca Giovanni Gianoli, Can Umut Ileri:
On single-path network routing subject to max-min fair flow allocation. Electron. Notes Discret. Math. 41: 543-550 (2013)
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-10-16 21:23 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:
