default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaymond Yim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[c12]Raymond Yim, Andrew Brzezinski:
Limit order placement across multiple exchanges. CIFEr 2012: 1-8- 2011
- [j9]Fei Ye, Raymond Yim, Sumit Roy, Jinyun Zhang:
Efficiency and Reliability of One-Hop Broadcasting in Vehicular Ad Hoc Networks. IEEE J. Sel. Areas Commun. 29(1): 151-160 (2011) - 2010
- [j8]Virag Shah, Neelesh B. Mehta
, Raymond Yim:
Optimal timer based selection schemes. IEEE Trans. Commun. 58(6): 1814-1823 (2010) - [j7]Virag Shah, Neelesh B. Mehta, Raymond Yim:
Splitting algorithms for fast relay selection: generalizations, analysis, and a unified view. IEEE Trans. Wirel. Commun. 9(4): 1525-1535 (2010) - [j6]Virag Shah, Neelesh B. Mehta, Raymond Yim:
The Relay Selection and Transmission Trade-off in Cooperative Communication Systems. IEEE Trans. Wirel. Commun. 9(8): 2505-2515 (2010) - [c11]Virag Shah, Neelesh B. Mehta, Raymond Yim:
A Complete Characterization of an Optimal Timer Based Selection Scheme. ICC 2010: 1-5 - [c10]Fei Ye, Raymond Yim, Jinlin Guo, Jinyun Zhang, Sumit Roy:
Prioritized Broadcast Contention Control in VANET. ICC 2010: 1-5 - [c9]Fei Ye, Raymond Yim, Jinyun Zhang, Sumit Roy:
Congestion Control to Achieve Optimal Broadcast Efficiency in VANETs. ICC 2010: 1-5
2000 – 2009
- 2009
- [j5]Raymond Yim, Neelesh B. Mehta, Andreas F. Molisch:
Fast Multiple Access Selection through variable power transmissions. IEEE Trans. Wirel. Commun. 8(4): 1962-1973 (2009) - [j4]Raymond Yim, Neelesh B. Mehta, Andreas F. Molisch, Jinyun Zhang:
Dual Power Multiple Access with Multipacket Reception using Local CSI. IEEE Trans. Wirel. Commun. 8(8): 4078-4088 (2009) - [c8]Virag Shah, Neelesh B. Mehta, Raymond Yim:
Relay Selection and Data Transmission Throughput Tradeoff in Cooperative Systems. GLOBECOM 2009: 1-6 - [c7]Virag Shah, Neelesh B. Mehta, Raymond Yim:
Analysis, Insights and Generalization of a Fast Decentralized Relay Selection Mechanism. ICC 2009: 1-6 - [c6]Raymond Yim, Andreas F. Molisch, Jinyun Zhang:
Optimization of Split-And-Combine Relaying. ICC 2009: 1-5 - [i2]Virag Shah, Neelesh B. Mehta, Raymond Yim:
Optimal Timer Based Selection Schemes. CoRR abs/0909.1241 (2009) - [i1]Virag Shah, Neelesh B. Mehta, Raymond Yim:
Splitting Algorithms for Fast Relay Selection: Generalizations, Analysis, and a Unified View. CoRR abs/0911.4357 (2009) - 2008
- [j3]Raymond Yim, Neelesh B. Mehta, Andreas F. Molisch, Jinyun Zhang:
Progressive Accumulative Routing: Fundamental Concepts and Protocol. IEEE Trans. Wirel. Commun. 7(11-1): 4142-4154 (2008) - [c5]Raymond Yim, Neelesh B. Mehta, Andreas F. Molisch:
Best Node Selection through Distributed Fast Variable Power Multiple Access. ICC 2008: 5028-5032 - [c4]Raymond Yim, Neelesh B. Mehta, Andreas F. Molisch, Jinyun Zhang:
Efficient Multiple Access Using Received Signal Strength and Local Channel Information. WCNC 2008: 1962-1967 - 2007
- [j2]Raymond Yim, Oh-Soon Shin, Vahid Tarokh:
Reverse-Link Rate Control Algorithms with Fairness Guarantees for CDMA Systems. IEEE Trans. Wirel. Commun. 6(4): 1386-1397 (2007) - 2006
- [c3]Raymond Yim, Neelesh B. Mehta, Andreas F. Molisch, Jinyun Zhang:
Progressive Accumulative Routing in Wireless Networks. GLOBECOM 2006 - [c2]Raymond Yim, Oh-Soon Shin, Vahid Tarokh:
Distributed Delay-Aware Rate Control Algorithm for the Reverse-Link of CDMA Systems. ICC 2006: 4363-4368 - 2005
- [j1]Il-Min Kim, Raymond Yim, Hemant M. Chaskar:
Optimum scheduling for smart antenna systems in Rayleigh fading channels. IEEE Trans. Commun. 53(7): 1210-1219 (2005) - [c1]Raymond Yim, Michael Rosenblum, Vahid Tarokh:
Delay bounds for packetizing time-varying fluid policies with speedup and lookahead in single server systems. INFOCOM 2005: 2590-2601
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 2025-01-28 22:35 CET 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:
