default search action
Amrinder Arora
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c14]Yingda Fan, Amrinder Arora:
Attention Constraint Mechanism through Auxiliary Attention. ICTAI 2022: 90-95 - 2021
- [c13]Guantao Zhao, Ziqiu Zhu, Yinan Sun, Amrinder Arora:
Pairwise Cosine Similarity of Emission Probability Matrix as an Indicator of Prediction Accuracy of the Viterbi Algorithm. ICAART (2) 2021: 941-946
2010 – 2019
- 2019
- [c12]Chen Shen
, Mira Yun
Dynamic Placement Algorithm for Multiple Classes of Mobile Base Stations in Public Safety Networks. CrownCom 2019: 112-125 - [c11]Runyu Ma, Hantian Li, Jin Cen, Amrinder Arora:
Placement-and-Profit-Aware Association Rules Mining. ICAART (2) 2019: 639-646 - 2013
- [c10]Luca Zappaterra, Joseph S. Gomes, Amrinder Arora, Hyeong-Ah Choi:
A polynomial-time algorithm for optimizing channel selection in Cognitive Radio Networks. IWCMC 2013: 1559-1564 - [c9]Luca Zappaterra, Joseph S. Gomes, Amrinder Arora, Hyeong-Ah Choi:
Resource discovery algorithms for channel aggregation in Cognitive Radio Networks. WCNC 2013: 309-314 - [c8]Luca Zappaterra, Joseph S. Gomes, Amrinder Arora, Hyeong-Ah Choi:
A linear-time algorithm for optimal multi-channel access in Cognitive Radio Networks. WOWMOM 2013: 1-6
2000 – 2009
- 2009
- [c7]Mira Yun, Yu Zhou, Amrinder Arora, Hyeong-Ah Choi:
Channel-Assignment and Scheduling in Wireless Mesh Networks Considering Switching Overhead. ICC 2009: 1-6 - [c6]Yu Zhou, Mira Yun, Timothy Kim, Amrinder Arora, Hyeong-Ah Choi:
RL-Based Queue Management for QoS Support in Multi-channel Multi-radio Mesh Networks. NCA 2009: 306-309 - [c5]Mira Yun, Timothy Kim, Yu Zhou, Amrinder Arora, Joseph S. Gomes, Hyeong-Ah Choi:
Uplink Resource Management Design in Multi-access Wireless Networks. WASA 2009: 499-508 - 2007
- [c4]Fanchun Jin, Amrinder Arora, Jinho Hwang, Hyeong-Ah Choi:
Routing and packet scheduling in WiMAX mesh networks. BROADNETS 2007: 574-582 - 2006
- [j4]Amrinder Arora, Fanchun Jin, Gokhan Sahin
Throughput analysis in wireless networks with multiple users and multiple channels. Acta Informatica 43(3): 147-164 (2006) - [j3]Amrinder Arora, Fanchun Jin, Hyeong-Ah Choi:
Scheduling resource allocation with timeslot penalty for changeover. Theor. Comput. Sci. 369(1-3): 323-337 (2006) - [c3]Amrinder Arora, Fanchun Jin, Hyeong-Ah Choi:
Optimized Channel Utilization in Multi-carrier Wireless Mobile Networks. WASA 2006: 572-585 - 2004
- [c2]Fanchun Jin, Gokhan Sahin, Amrinder Arora, Hyeong-Ah Choi:
The Effects of the Sub-Carrier Grouping on Multi-Carrier Channel Aware Scheduling. BROADNETS 2004: 632-640 - 2002
- [j2]Amrinder Arora, Suresh Subramaniam
Logical topology design for linear and ring optical networks. IEEE J. Sel. Areas Commun. 20(1): 62-74 (2002) - [j1]Amrinder Arora, Suresh Subramaniam:
Wavelength Conversion Placement in WDM Mesh Optical Networks. Photonic Netw. Commun. 4(2): 167-177 (2002) - 2000
- [c1]Amrinder Arora, Suresh Subramaniam:
Converter Placement in Wavelength Routing Mesh Topologies. ICC (3) 2000: 1282-1288
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-04-25 05:42 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: