default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatrick Thiran
- > Home > Persons > Patrick Thiran
Publications
- 2016
[j35]Farid Movahedi Naini, Jayakrishnan Unnikrishnan
, Patrick Thiran, Martin Vetterli:
Where You Are Is Who You Are: User Identification by Matching Statistics. IEEE Trans. Inf. Forensics Secur. 11(2): 358-372 (2016)- 2015
- [j33]Runwei Zhang, François Ingelrest, Guillermo Barrenetxea, Patrick Thiran, Martin Vetterli:
The Beauty of the Commons: Optimal Load Sharing by Base Station Hopping in Wireless Sensor Networks. IEEE J. Sel. Areas Commun. 33(8): 1480-1491 (2015) - [j32]Farid Movahedi Naini, Olivier Dousse, Patrick Thiran, Martin Vetterli:
Opportunistic Sampling for Joint Population Size and Density Estimation. IEEE Trans. Mob. Comput. 14(12): 2530-2543 (2015) - [c78]Runwei Zhang, Patrick Thiran, Martin Vetterli:
Virtually Moving Base Stations for Energy Efficiency in Wireless Sensor Networks. MobiHoc 2015: 357-366 - [i10]Farid Movahedi Naini, Jayakrishnan Unnikrishnan, Patrick Thiran, Martin Vetterli:
Where You Are Is Who You Are: User Identification by Matching Statistics. CoRR abs/1512.02896 (2015) - 2014
- [c75]Farid Movahedi Naini, Jayakrishnan Unnikrishnan, Patrick Thiran, Martin Vetterli:
Privacy-preserving function computation by exploitation of friendships in social networks. ICASSP 2014: 6250-6254 - [i9]Runwei Zhang, François Ingelrest, Guillermo Barrenetxea, Patrick Thiran, Martin Vetterli:
The Beauty of the Commons: Optimal Load Sharing by Base Station Hopping in Wireless Sensor Networks. CoRR abs/1403.2527 (2014) - 2012
- [i6]Pedro C. Pinto, Patrick Thiran, Martin Vetterli:
Locating the Source of Diffusion in Large-Scale Networks. CoRR abs/1208.2534 (2012) - 2011
- [j27]Florence Bénézit, Patrick Thiran, Martin Vetterli:
The Distributed Multiple Voting Problem. IEEE J. Sel. Top. Signal Process. 5(4): 791-804 (2011) - [c66]Farid Movahedi Naini, Olivier Dousse, Patrick Thiran, Martin Vetterli:
Population size estimation using a few individuals as agents. ISIT 2011: 2499-2503 - 2010
- [j25]Florence Bénézit, Alexandros G. Dimakis, Patrick Thiran, Martin Vetterli:
Order-optimal consensus through randomized path averaging. IEEE Trans. Inf. Theory 56(10): 5150-5167 (2010) - [c61]Florence Bénézit, Vincent D. Blondel, Patrick Thiran, John N. Tsitsiklis, Martin Vetterli:
Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices. ISIT 2010: 1753-1757 - 2009
- [c57]Florence Bénézit, Patrick Thiran, Martin Vetterli:
Interval consensus: From quantized gossip to voting. ICASSP 2009: 3661-3664 - 2008
- [c51]Patrick Denantes, Florence Bénézit, Patrick Thiran, Martin Vetterli:
Which Distributed Averaging Algorithm Should I Choose for my Sensor Network? INFOCOM 2008: 986-994 - [i2]Florence Bénézit, Alexandros G. Dimakis, Patrick Thiran, Martin Vetterli:
Order-Optimal Consensus through Randomized Path Averaging. CoRR abs/0802.2587 (2008)
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.
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.
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.
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-07-13 20:24 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:
