default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoseph S. Kaufman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[j15]Ashwin Sampath, Joseph S. Kaufman, Muralidharan S. Kodialam, Kenneth C. Budka:
Performance analysis of call assignment and carrier packing schemes for TDMA systems. IEEE Trans. Veh. Technol. 52(6): 1540-1557 (2003)
1990 – 1999
- 1996
- [j14]Joseph S. Kaufman, Kiran M. Rege:
Blocking in a Shared Resource Environment with Batched Poisson Arrival Processes. Perform. Evaluation 24(4): 249-263 (1996) - 1994
- [j13]Joseph S. Kaufman, Wing Shing Wong:
Approximate analysis of a gordon-newell like non-product-form queueing network. Ann. Oper. Res. 48(3): 249-271 (1994) - [j12]Joseph S. Kaufman:
The art of computer systems performance analysis, by R. Jain, John Wiley & Sons. New York, 1991, 685 pp. Networks 24(2): 127 (1994) - 1993
- [j11]Joseph S. Kaufman, B. Sengupta, Wing Shing Wong:
Performance analysis of a packet assembly function. IEEE Trans. Autom. Control. 38(1): 109-114 (1993) - 1992
- [j10]Joseph S. Kaufman:
Blocking with Retrials in a Completely Shared Resource Environment. Perform. Evaluation 15(2): 99-113 (1992) - [c4]Joseph S. Kaufman:
Blocking in a Completely Shared Resource Environment with State Dependent Resource and Residency Requirements. INFOCOM 1992: 2224-2232 - 1990
- [j9]Joseph S. Kaufman, Wing Shing Wong:
Approximate Analysis of a Cyclic Queuing Network with Applications to a Simultaneous Resource Possession Problem. Perform. Evaluation 11(3): 187-200 (1990) - [j8]Flavio Bonomi, Bharat T. Doshi, Joseph S. Kaufman, T. Paul Lee, Anurag Kumar
:
A Case Study of an Adaptive Load Balancing Algorithm. Queueing Syst. Theory Appl. 7(1): 23-49 (1990)
1980 – 1989
- 1989
- [j7]Joseph S. Kaufman, Yung-Terng Wang:
A Conservation Law Based Approximate Analysis For a Class of Simultaneous Resource Possession Problems. Perform. Evaluation 10(4): 263-280 (1989) - 1988
- [c3]Joseph S. Kaufman, Yung-Terng Wang:
Approximate analysis of a simultaneous resource possession problem. ICCC 1988: 199-206 - 1986
- [j6]Joseph S. Kaufman:
A Recursive Approximation Technique for a Combined Source Queueing Model. IEEE J. Sel. Areas Commun. 4(6): 919-925 (1986) - 1984
- [j5]Joseph S. Kaufman:
Approximation methods for networks of queues with priorities. Perform. Evaluation 4(3): 183-198 (1984) - [c2]Joseph S. Kaufman:
Finite and Infinite Source Interactions. Performance 1984: 345-359 - 1982
- [j4]Robert J. T. Morris, Joseph S. Kaufman:
Performance Comparison of I/0 Access Disciplines for Transaction-Processing Systems. Comput. J. 25(1): 74-83 (1982) - 1981
- [j3]Joseph S. Kaufman:
Congestion Formulas for a Heterogeneous Server Loss System with Random Selection Discipline. Oper. Res. 29(6): 1167-1180 (1981) - [j2]Joseph S. Kaufman:
Blocking in a Shared Resource Environment. IEEE Trans. Commun. 29(10): 1474-1481 (1981)
1970 – 1979
- 1979
- [j1]Joseph S. Kaufman:
Technical Note - The Busy Probability in M/G/N Loss Systems. Oper. Res. 27(1): 204-206 (1979) - [c1]Ed Arthurs, Joseph S. Kaufman:
Sizing a Message Store Subject to Blocking Criteria. Performance 1979: 547-564
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:19 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:
