default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBirendra Ghimire
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c13]Birendra Ghimire, Ritesh Shreevastav, Xiaolin Jiang:
Preconfigured Assistance Data for Reduction in Latency and Power Consumption. VTC2023-Spring 2023: 1-6- 2022
- [c12]Phuong Bich Duong, Birendra Ghimire, Katrin Dietmayer, Sheikh Usman Ali, Haider Al Kim, Jochen Seitz:
Supervised Machine Learning Assisted Hybrid Positioning Based on GNSS and 5G. IPIN 2022: 1-8 - [c11]Birendra Ghimire, Ernst Eberlein, Mohammad Alawieh:
Reference Signal Enhancement in 5G for Extended Coverage in Multi-User Scenarios. VTC Fall 2022: 1-6
2010 – 2019
- 2018
- [c10]Birendra Ghimire, Jochen Seitz, Christopher Mutschler:
Indoor Positioning Using OFDM-Based Visible Light Communication System. IPIN 2018: 1-8 - 2016
- [c9]Birendra Ghimire, Christian Nickel, Jochen Seitz:
Pedestrian motion state classification using pressure sensors. IPIN 2016: 1-6 - 2012
- [j4]Birendra Ghimire, Harald Haas
:
Self-organising interference coordination in optical wireless networks. EURASIP J. Wirel. Commun. Netw. 2012: 131 (2012) - [c8]Samip Malla, Birendra Ghimire, Mark C. Reed, Harald Haas:
Energy efficient resource allocation in OFDMA networks using ant-colony optimization. ISCIT 2012: 889-894 - 2011
- [j3]Birendra Ghimire, Gunther Auer, Harald Haas:
Busy Burst Enabled Coordinated Multipoint Network with Decentralized Control. IEEE Trans. Wirel. Commun. 10(10): 3310-3320 (2011) - [c7]Birendra Ghimire, Irina Stefan, Hany Elgala, Harald Haas:
Time and frequency synchronisation in optical wireless OFDM networks. PIMRC 2011: 819-823 - [c6]Birendra Ghimire, Harald Haas:
Resource allocation in optical wireless networks. PIMRC 2011: 1061-1065 - [c5]Birendra Ghimire, Gunther Auer, Harald Haas:
Heuristic Thresholds for Busy Burst Signalling in a Decentralised Coordinated Multipoint Network. VTC Spring 2011: 1-5
2000 – 2009
- 2009
- [j2]Birendra Ghimire, Gunther Auer, Harald Haas:
Busy Bursts for Trading off Throughput and Fairness in Cellular OFDMA-TDD. EURASIP J. Wirel. Commun. Netw. 2009 (2009) - [j1]Gunther Auer, Stefan Videv, Birendra Ghimire, Harald Haas:
Contention free inter-cellular slot reservation. IEEE Commun. Lett. 13(5): 318-320 (2009) - [c4]Birendra Ghimire, Gunther Auer, Harald Haas:
OFDMA-TDD Networks with Busy Burst Enabled Grid-of-Beam Selection. ICC 2009: 1-6 - 2008
- [c3]Birendra Ghimire, Stefan Videv, Gunther Auer, Harald Haas:
Balancing system throughput and fairness in multi-user OFDMA-TDD using busy bursts. PIMRC 2008: 1-6 - 2007
- [c2]Birendra Ghimire, Harald Haas, Gunther Auer:
Busy Burst Enabled Interference Avoidance in Winner-TDD. PIMRC 2007: 1-5 - 2006
- [c1]Ellina Foutekova, Patrick Agyapong, Birendra Ghimire, Hrishikesh Venkataraman, Harald Haas:
Scheduling in Cellular CDMA-TDD Networks. VTC Fall 2006: 1-5
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 22:17 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:
