![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Simon Shamoun
Person information
Refine list
![note](https://dblp.uni-trier.de./img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c17]Anurag Dasgupta, Venkat Margapuri, Simon Shamoun, Shubbhi Taneja, Matthew Toups:
Hands-On Learning: Teaching Parallel and Distributed Computing through Unplugged Activities in Undergraduate CS Courses. SC Workshops 2024: 363-369
2010 – 2019
- 2019
- [c16]Simon Shamoun, Tarek F. Abdelzaher, Amotz Bar-Noy:
Dynamic sensor selection for path coverage. ICDCN 2019: 277-281 - [c15]Simon Shamoun:
Distributed Learning of Hop Count Distributions in Ad Hoc Networks. MobiWac 2019: 57-62 - [c14]Simon Shamoun, Tarek F. Abdelzaher, Amotz Bar-Noy:
Maximum Gaps in Path Coverage. MSWiM 2019: 109-112 - 2018
- [c13]Simon Shamoun, Jie Mei, Tarek F. Abdelzaher, Amotz Bar-Noy:
Leveraging Knowledge for Path Exposure. DCOSS 2018: 103-110 - [c12]Simon Shamoun, Tianyi Tu, Amotz Bar-Noy, Tarek F. Abdelzaher:
Poster: Local Algorithms for Sensor Selection. EWSN 2018: 179-180 - [c11]Simon Shamoun, Tianyi Tu, Tarek F. Abdelzaher, Amotz Bar-Noy:
Local Algorithms for Sensor Selection. PE-WASUN 2018: 84-91 - 2017
- [j3]Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun:
On sensor selection in linked information networks. Comput. Networks 126: 100-113 (2017) - [c10]Simon Shamoun, Tarek F. Abdelzaher, Amotz Bar-Noy:
Sensor Selection for Heterogeneous Coverage Measures. DCOSS 2017: 93-98 - 2015
- [c9]Amotz Bar-Noy, Matthew P. Johnson, Nooreddin Naghibolhosseini, Dror Rawitz, Simon Shamoun:
The Price of Incorrectly Aggregating Coverage Values in Sensor Selection. DCOSS 2015: 98-107 - [c8]Simon Shamoun, Reuven Cohen
, David Sarne, Gal Miller:
Combined TTL-based search algorithm. Med-Hoc-Net 2015: 1-8 - 2014
- [c7]Simon Shamoun, David Sarne:
Two-sided expanding ring search. COMSNETS 2014: 1-8 - 2013
- [j2]Simon Shamoun, David Sarne:
Increasing threshold search for best-valued agents. Artif. Intell. 199-200: 1-21 (2013) - [c6]Simon Shamoun, David Sarne, Steven Goldfeder:
Elastic Ring Search for Ad Hoc Networks. MobiQuitous 2013: 564-575 - 2012
- [j1]Amotz Bar-Noy, Theodore Brown, Simon Shamoun:
Sensor allocation in diverse environments. Wirel. Networks 18(6): 697-711 (2012) - 2011
- [c5]Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun:
On sensor selection in linked information networks. DCOSS 2011: 1-8 - 2010
- [c4]David Sarne, Simon Shamoun, Eli Rata:
Increasing Threshold Search for Best-Valued Agents. AAAI 2010: 848-853 - [c3]David Sarne, Simon Shamoun, Eli Rata:
Iterative expanding search in multi-agent systems. AAMAS 2010: 1451-1452 - [c2]Amotz Bar-Noy, Theodore Brown, Simon Shamoun:
Sensor Allocation in Diverse Environments. DCOSS 2010: 379-392
2000 – 2009
- 2009
- [c1]Dinesh C. Verma, Chai Wah Wu
, Theodore Brown, Amotz Bar-Noy, Simon Shamoun, Mark S. Nixon
:
Application of Halftoning Algorithms to Location Dependent Sensor Placement. ISCAS 2009: 161-164
Coauthor Index
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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 2025-01-22 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint