default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul S. Min
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c25]Qixiang Yu, Zhenxing Luo, Paul S. Min:
Intrusion detection in wireless sensor networks for destructive intruders. APSIPA 2015: 68-75- 2013
- [j12]Zhenxing Luo, Paul S. Min, Shu-Jun Liu:
Target Localization in Wireless Sensor Networks for Industrial Control with Selected Sensors. Int. J. Distributed Sens. Networks 9 (2013) - [c24]Chung-Ping Hung, Paul S. Min:
Access LUT without CAM - Improved Pearson hashing for collision reduction. ICON 2013: 1-5 - [c23]Chung-Ping Hung, Paul S. Min:
Deriving and visualizing the lower bounds of information gain for prefetch systems. ICON 2013: 1-6 - [c22]Zhenxing Luo, Paul S. Min:
Survey of sensor selection methods in wireless sensor networks. ICON 2013: 1-5 - [c21]Zhenxing Luo, Paul S. Min:
Survey of target localization methods in wireless sensor networks. ICON 2013: 1-4
2000 – 2009
- 2007
- [c20]Afshin Shiravi, Paul S. Min:
LOOFA-PB: A Modified LOOFA Scheduler for Variable-Length Packet Switching. ICC 2007: 6336-6343 - 2006
- [c19]Afshin Shiravi, Paul S. Min, Yoon G. Kim:
Traffic Dispatching Algorithm in Three-Stage Switch. ICN/ICONS/MCL 2006: 55 - [c18]Yoon G. Kim, Afshin Shiravi, Paul S. Min:
Congestion Prediction of Self-Similar Network through Parameter Estimation. NOMS 2006 - 2005
- [c17]Afshin Shiravi, Yoon G. Kim, Paul S. Min:
Proportional Nested Deficit Round Robin: Improving the Latency of Packet Scheduler with an O(1) Complexity. AAA-IDEA 2005: 34-41 - [c16]Afshin Shiravi, Paul S. Min, Yoon G. Kim:
Proportional Nested Deficit Round Robin with Credit Adjusting. QSHINE 2005: 50 - 2004
- [c15]Yoon G. Kim, Afshin Shiravi, Paul S. Min:
Prediction-Based Routing through Least Cost Delay Constraint. IPDPS 2004 - 2003
- [c14]Yoon G. Kim, Paul S. Min:
On the prediction of average queueing delay with self-similar traffic. GLOBECOM 2003: 2987-2991 - 2001
- [j11]Robert Akl, Manju V. Hegde, Mort Naraghi-Pour, Paul S. Min:
Multicell CDMA network design. IEEE Trans. Veh. Technol. 50(3): 711-722 (2001) - [c13]Chunhua Hu, Hossein Saidi, Jeong Gyu Lee, Peter Y. Yan, Paul S. Min:
Train queue processing for highly scalable switch fabric design. GLOBECOM 2001: 2088-2092 - [c12]Nasser Yazdani, Paul S. Min:
Prefix Trees: New Efficient Data Structures for Matching Strings of Different Lengths. IDEAS 2001: 76-85 - [c11]Uooyeol Yoon, Seongsoo Park, Paul S. Min:
Performance analysis of data transmission in W-CDMA system. VTC Fall 2001: 1584-1588 - 2000
- [c10]Uooyeol Yoon, Seongsoo Park, Paul S. Min:
Performance analysis of multiple rejects ARQ at RLC (radio link control) for packet data service in W-CDMA system. GLOBECOM 2000: 48-52 - [c9]Uooyeol Yoon, Seongsoo Park, Paul S. Min:
Performance analysis of multiple rejects ARQ for RLC (radio link control) in the third generation wireless communication. WCNC 2000: 460-464 - [c8]Robert Akl, Manju V. Hegde, Mort Naraghi-Pour, Paul S. Min:
Call admission control scheme for arbitrary traffic distribution in CDMA cellular systems. WCNC 2000: 465-470
1990 – 1999
- 1999
- [c7]Robert Akl, Manju V. Hegde, Paul S. Min:
Effects of call arrival rate and mobility on network throughput in multi-cell CDMA. ICC 1999: 1763-1767 - [c6]Manju V. Hegde, Otto Schmid, Hossein Saidi
, Paul S. Min:
Real-time adaptive bandwidth allocation for ATM switches. ICC 1999: 1831-1835 - [c5]Robert Akl, Manju V. Hegde, Mort Naraghi-Pour, Paul S. Min:
Cell placement in a CDMA network. WCNC 1999: 903-907 - 1998
- [j10]A. S. Maunder, Paul S. Min:
Dynamic bandwidth allocation to virtual paths in ATM networks. Int. J. Commun. Syst. 11(4): 237-246 (1998) - 1997
- [c4]Peter Y. Yan, Kyeong Soo Kim, Manju V. Hegde, Paul S. Min:
Multi-Channel Deflection Crossbar (MCDC): A VLSI Optimized Architecture for Multi-Channel ATM Switching. INFOCOM 1997: 12-19 - 1996
- [j9]Paul S. Min, Manjunath V. Hegde, Alex Chandra, A. S. Maunder:
Analysis of banyan-based copy networks with internal buffering. J. High Speed Networks 5(3): 259-275 (1996) - [j8]M. Ammar Rayes, Paul S. Min:
Application of Shadow Price in Capacity Expansion of State-Dependent Routing. J. Netw. Syst. Manag. 4(1): 71-93 (1996) - [j7]César Vargas Rosales, Manju V. Hegde, Morteza Naraghi-Pour, Paul S. Min:
Shadow prices for LLR and ALBA. IEEE/ACM Trans. Netw. 4(5): 796-807 (1996) - 1995
- [j6]Manju V. Hegde, Paul S. Min, Kazem Sohraby:
Editorial. J. Netw. Syst. Manag. 3(4): 347-349 (1995) - [j5]Paul S. Min, Manju V. Hegde, Ammar Rayes:
Estimation of exogenous traffic based on link measurements in circuit-switched networks. IEEE Trans. Commun. 43(8): 2381-2390 (1995) - [j4]Paul S. Min, Hossein Saidi, Manju V. Hegde:
A nonblocking architecture for broadband multichannel switching. IEEE/ACM Trans. Netw. 3(2): 181-198 (1995) - [j3]Hossein Saidi, Paul S. Min, Manju V. Hegde:
A new structural property of statistical data forks. IEEE/ACM Trans. Netw. 3(3): 289-298 (1995) - [j2]Paul S. Min, Manju V. Hegde, Hossein Saidi, Alex Chandra:
Nonblocking copy networks in multi-channel switching. IEEE/ACM Trans. Netw. 3(6): 857-871 (1995) - [c3]Paul S. Min, Hossein Saidi, Alex Chandra, Manju V. Hegde:
Multi-Channel Copy Networks: Architecture, Performance Model, Fairness, and Cell Sequencing. INFOCOM 1995: 931-938 - 1994
- [j1]Manju V. Hegde, Paul S. Min, Ammar Rayes:
State-Dependent Routing: Traffic Dynamics and Performance Benefits. J. Netw. Syst. Manag. 2(2): 125-149 (1994) - [c2]Hossein Saidi, Paul S. Min, Manju V. Hegde:
Guaranteed Cell Sequence in Nonblocking Multi-channel Switching. INFOCOM 1994: 1420-1427 - 1990
- [c1]Paul S. Min, Manju V. Hegde:
End-to-End Planning Model for Optimal Evolution of Telecommunications Network. INFOCOM 1990: 200-206
Coauthor Index
aka: Manjunath V. Hegde
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-24 22:50 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:
