default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKimberly M. Wasserman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j6]Kimberly M. Wasserman, George Michailidis, Nicholas Bambos:
Optimal processor allocation to differentiated job flows. Perform. Evaluation 63(1): 1-14 (2006)- 2005
- [c11]H. Cahit Akin, Özdemir Akin, Kimberly M. Wasserman:
QoS Guarantees in Multimedia CDMA Wireless Systems with Non-precise Network Parameter Estimates. IWQoS 2005: 94-106 - 2003
- [j5]Seong-Jun Oh, Danlu Zhang, Kimberly M. Wasserman:
Optimal resource allocation in multiservice CDMA networks. IEEE Trans. Wirel. Commun. 2(4): 811-821 (2003) - 2002
- [c10]Danlu Zhang, Kimberly M. Wasserman:
Transmission schemes for time-varying wireless channels with partial state observations. INFOCOM 2002: 467-476 - [c9]Danlu Zhang, Wei Biao Wu, Kimberly M. Wasserman:
Analysis on Markov modeling of cellular packet transmission. WCNC 2002: 876-880 - 2001
- [j4]Kimberly M. Wasserman, Tava Lennon Olsen:
On Mutually Interfering Parallel Servers Subject to External Disturbances. Oper. Res. 49(5): 700-709 (2001) - [c8]Agisilaos-Georgios P. Ziotopoulos, Alfred O. Hero III, Kimberly M. Wasserman:
Estimation of network link loss rates via chaining in multicast trees. ICASSP 2001: 2517-2520 - 2000
- [c7]Seong-Jun Oh, Tava Lennon Olsen, Kimberly M. Wasserman:
Distributed Power Control and Spreading Gain Allocation in CDMA Data Networks. INFOCOM 2000: 379-385 - [c6]Danlu Zhang, Kimberly M. Wasserman:
Energy efficient data communication over fading channels. WCNC 2000: 986-991
1990 – 1999
- 1999
- [j3]Seong-Jun Oh, Kimberly M. Wasserman:
Dynamic spreading gain control in multiservice CDMA networks. IEEE J. Sel. Areas Commun. 17(5): 918-927 (1999) - [c5]John D. Choi, Kimberly M. Wasserman, Wayne E. Stark:
Effect of channel memory on retransmission protocols for low energy wireless data communications. ICC 1999: 1552-1556 - [c4]Seong-Jun Oh, Kimberly M. Wasserman:
Optimality of Greedy Power Control and Variable Spreading Gain in Multi-Class CDMA Mobile Networks. MobiCom 1999: 102-112 - [c3]Seong-Jun Oh, Kimberly M. Wasserman:
Adaptive resource allocation in power constrained CDMA mobile networks. WCNC 1999: 510-514 - 1998
- [c2]Seong-Jun Oh, Kimberly M. Wasserman:
Integration of voice and data traffic in CDMA networks using dynamic spreading gain control. ICC 1998: 968-972 - [c1]Seong-Jun Oh, Kimberly M. Wasserman:
Adaptive Resource Management for DS-CDMA Networks Subject to Energy Constraints. INFOCOM 1998: 556-563 - 1995
- [j2]Nicholas Bambos
, Kimberly M. Wasserman:
Asymptotic optimality of statistical multiplexing in pipelined processing. Queueing Syst. Theory Appl. 21(1-2): 97-123 (1995) - 1994
- [j1]Nicholas Bambos, Kimberly M. Wasserman:
On stationary tandem queueing networks with job feedback. Queueing Syst. Theory Appl. 15(1-4): 137-164 (1994)
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-24 22:48 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:
