default search action
Rena Bakhshi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i12]Deekshitha, Rena Bakhshi, Jason Maassen, Carlos Martinez-Ortiz, Rob van Nieuwpoort, Slinger Jansen:
RSMM: A Framework to Assess Maturity of Research Software Project. CoRR abs/2406.01788 (2024) - [i11]Deekshitha, Siamak Farshidi, Jason Maassen, Rena Bakhshi, Rob van Nieuwpoort, Slinger Jansen:
FAIRSECO: An Extensible Framework for Impact Measurement of Research Software. CoRR abs/2406.02412 (2024) - 2023
- [c17]Deekshitha, Siamak Farshidi
, Jason Maassen, Rena Bakhshi
FAIRSECO: An Extensible Framework for Impact Measurement of Research Software. e-Science 2023: 1-10 - 2022
- [j15]Carlos Martinez-Ortiz
Structured and Unstructured Teams for Research Software Development at The Netherlands eScience Center. Comput. Sci. Eng. 24(3): 25-32 (2022) - [j14]Dafne E. van Kuppevelt
Community membership consistency applied to corporate board interlock networks. J. Comput. Soc. Sci. 5(1): 841-860 (2022) - [j13]Elena Ranguelova
DIANNA: Deep Insight And Neural Network Analysis. J. Open Source Softw. 7(80): 4493 (2022) - [i10]Carlos Martinez-Ortiz, Rena Bakhshi, Yifat Dzigan
Structured and Unstructured Teams for Research Software Development at the Netherlands eScience Center. CoRR abs/2204.08783 (2022) - 2021
- [j12]Faruk Diblen, Luc Hendriks, Bob Stienen, Sascha Caron, Rena Bakhshi
Interactive Web-Based Visualization of Multidimensional Physical and Astronomical Data. Frontiers Big Data 4: 626998 (2021) - 2020
- [j11]Jörg Endrullis
Transducer degrees: atoms, infima and suprema. Acta Informatica 57(3-5): 727-758 (2020) - [i9]Dafne E. van Kuppevelt, Rena Bakhshi
Community membership consistency in corporate board interlock networks. CoRR abs/2008.00745 (2020)
2010 – 2019
- 2019
- [j10]Sonja Georgievska
Detecting high indoor crowd density with Wi-Fi localization: a statistical mechanics approach. J. Big Data 6: 31 (2019) - [j9]Faruk Diblen, Jisk Attema
spot: Open Source framework for scientific data repository and interactive visualization. SoftwareX 9: 328-331 (2019) - [c16]Sara Shakeri, Valentina Maccatrozzo, Lourens E. Veen, Rena Bakhshi, Leon Gommans, Cees de Laat, Paola Grosso
Modeling and Matching Digital Data Marketplace Policies. eScience 2019: 570-577 - 2018
- [c15]Faruk Diblen, Jisk Attema
SPOT: Open Source Visual Data Analytics Platform for High-Dimensional Scientific Data. eScience 2018: 411 - [e1]Rena Bakhshi, Paolo Ballarini, Benoît Barbot
Computer Performance Engineering - 15th European Workshop, EPEW 2018, Paris, France, October 29-30, 2018, Proceedings. Lecture Notes in Computer Science 11178, Springer 2018, ISBN 978-3-030-02226-6 [contents] - [i8]Rena Bakhshi
Examining key features and platforms of IoT. CoRR abs/1806.08337 (2018) - [i7]Faruk Diblen, Jisk Attema, Rena Bakhshi
SPOT: Open Source framework for scientific data repository and interactive visualization. CoRR abs/1809.08893 (2018) - 2017
- [j8]Sonja Georgievska
Clustering image noise patterns by embedding and visualization for common source camera detection. Digit. Investig. 23: 22-30 (2017) - [c14]Gijs van den Oord, Rena Bakhshi
Parallel Post-Processing of the Earth Climate Model Output. ICCS 2017: 2473-2477 - 2014
- [j7]Jörg Endrullis
On the complexity of stream equality. J. Funct. Program. 24(2-3): 166-217 (2014) - 2013
- [j6]Suhail Yousaf, Rena Bakhshi
Reliable localised event detection in a wireless distributed radio telescope. Int. J. Sens. Networks 14(3): 155-167 (2013) - [c13]Hans Akkermans
Toward a next generation of network models for the web. WebSci 2013: 1-10 - 2012
- [c12]Suhail Yousaf, Rena Bakhshi, Maarten van Steen
Reliable Localized Event Detection in a Wireless Distributed Radio Telescope. ICCCN 2012: 1-6 - [c11]Jörg Endrullis
On the complexity of equivalence of specifications of infinite objects. ICFP 2012: 153-164 - [c10]Matthias Woehrle, Rena Bakhshi
Mechanized Extraction of Topology Anti-patterns in Wireless Networks. IFM 2012: 158-173 - [c9]Julie M. Birkholz
Scalable Analysis for Large Social Networks: The Data-Aware Mean-Field Approach. SocInfo 2012: 406-419 - [i6]Jörg Endrullis, Dimitri Hendriks, Rena Bakhshi
On the Complexity of Equivalence of Specifications of Infinite Objects. CoRR abs/1207.0158 (2012) - [i5]Suhail Yousaf, Rena Bakhshi
Exploring Design Tradeoffs Of A Distributed Algorithm For Cosmic Ray Event Detection. CoRR abs/1209.6577 (2012) - [i4]Julie M. Birkholz, Rena Bakhshi
Scalable Analysis for Large Social Networks: the data-aware mean-field approach. CoRR abs/1209.6615 (2012) - 2011
- [j5]Rena Bakhshi
Fast leader election in anonymous rings with bounded expected delay. Inf. Process. Lett. 111(17): 864-870 (2011) - [j4]Rena Bakhshi
Mean-field framework for performance evaluation of push-pull gossip protocols. Perform. Evaluation 68(2): 157-179 (2011) - [c8]Rena Bakhshi
A Modeling Framework for Gossip-based Information Spread. QEST 2011: 245-254 - [i3]Rena Bakhshi
A Modeling Framework for Gossip-based Information Spread. CoRR abs/1105.5986 (2011) - 2010
- [c7]Rena Bakhshi, Jörg Endrullis
Brief announcement: asynchronous bounded expected delay networks. PODC 2010: 392-393 - [c6]Rena Bakhshi, Jörg Endrullis
Automating the Mean-Field Method for Large Dynamic Gossip Networks. QEST 2010: 241-250 - [i2]Rena Bakhshi
Asynchronous Bounded Expected Delay Networks. CoRR abs/1003.2084 (2010)
2000 – 2009
- 2009
- [j3]Rena Bakhshi
An analytical model of information dissemination for a gossip-based protocol. Comput. Networks 53(13): 2288-2303 (2009) - [c5]Rena Bakhshi
An Analytical Model of Information Dissemination for a Gossip-Based Protocol. ICDCN 2009: 230-242 - [c4]Rena Bakhshi
On the Impact of Modelling Choices for Distributed Information Spread. QEST 2009: 41-50 - [c3]Rena Bakhshi
Mean-Field Analysis for the Evaluation of Gossip Protocols. QEST 2009: 247-256 - 2008
- [j2]Rena Bakhshi, Lucia Cloth, Wan J. Fokkink
MeanField analysis for the evaluation of gossip protocols. SIGMETRICS Perform. Evaluation Rev. 36(3): 31-39 (2008) - [c2]Rena Bakhshi
Leader Election in Anonymous Rings: Franklin Goes Probabilistic. IFIP TCS 2008: 57-72 - [i1]Rena Bakhshi
An Analytical Model of Information Dissemination for a Gossip-based Protocol. CoRR abs/0810.1571 (2008) - 2007
- [j1]Rena Bakhshi
Formal analysis techniques for gossiping protocols. ACM SIGOPS Oper. Syst. Rev. 41(5): 28-36 (2007) - 2006
- [c1]Rena Bakhshi
Verification of Peer-to-peer Algorithms: A Case Study. CoOrg/MTCoord@COORDINATION 2006: 35-47
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-07 21:20 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: