default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArash Pourdamghani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Johannes Gruendler, Darya Melnyk, Arash Pourdamghani, Stefan Schmid:
DecentPeeR: A Self-Incentivised & Inclusive Decentralized Peer Review System. ICBC 2024: 394-396- [c7]Aleksander Figiel
, Darya Melnyk, André Nichterlein, Arash Pourdamghani, Stefan Schmid:
Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation. SPAA 2024: 447-449 - 2023
- [c6]Vamsi Addanki, Maciej Pacut, Arash Pourdamghani, Gábor Rétvári, Stefan Schmid, Juan Vanerio:
Self-Adjusting Partially Ordered Lists. INFOCOM 2023: 1-10 - [c5]Arash Pourdamghani, Chen Avin, Robert Sama, Stefan Schmid:
SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree. INFOCOM 2023: 1-10 - [i5]Arash Pourdamghani, Chen Avin, Robert Sama, Stefan Schmid:
SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree. CoRR abs/2301.03074 (2023) - 2022
- [j1]Christos Liaskos, Lefteris Mamatas, Arash Pourdamghani, Ageliki Tsioliaridou, Sotiris Ioannidis, Andreas Pitsillides, Stefan Schmid, Ian F. Akyildiz:
Software-Defined Reconfigurable Intelligent Surfaces: From Theory to End-to-End Implementation. Proc. IEEE 110(9): 1466-1493 (2022) - [c4]Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid:
The augmentation-speed tradeoff for consistent network updates. SOSR 2022: 67-80 - [i4]Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid:
The Augmentation-Speed Tradeoff for Consistent Network Updates. CoRR abs/2211.03716 (2022) - 2021
- [i3]Maciej Pacut, Juan Vanerio, Vamsi Addanki, Arash Pourdamghani, Gábor Rétvári, Stefan Schmid:
Online List Access with Precedence Constraints. CoRR abs/2104.08949 (2021) - [i2]Maciej Pacut, Juan Vanerio, Vamsi Addanki, Arash Pourdamghani, Gábor Rétvári, Stefan Schmid:
Self-Adjusting Packet Classification. CoRR abs/2109.15090 (2021)
2010 – 2019
- 2019
- [c3]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Arash Pourdamghani:
Probabilistic Smart Contracts: Secure Randomness on the Blockchain. IEEE ICBC 2019: 403-412 - [c2]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Arash Pourdamghani:
Hybrid mining: exploiting blockchain's computational power for distributed problem solving. SAC 2019: 374-381 - [c1]Mohammad Taheri, Arash Pourdamghani, Mohsen Lesani:
Polynomial-Time Fence Insertion for Structured Programs. DISC 2019: 34:1-34:17 - [i1]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Arash Pourdamghani:
Probabilistic Smart Contracts: Secure Randomness on the Blockchain. CoRR abs/1902.07986 (2019)
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-17 21:30 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:
