default search action
Robert R. Boorstyn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
- [j13]Robert R. Boorstyn, Almut Burchard, Jörg Liebeherr, Chaiwat Oottamakorn:
Statistical service assurances for traffic scheduling algorithms. IEEE J. Sel. Areas Commun. 18(12): 2651-2664 (2000) - [c6]Robert R. Boorstyn, Almut Burchard, Jörg Liebeherr, Chaiwat Oottamakorn:
Effective Envelopes: Statistical Bounds on Multiplexed Traffic in Packet Networks. INFOCOM 2000: 1223-1232
1990 – 1999
- 1994
- [j12]Dragomir D. Dimitrijevic
, Basil S. Maglaris
Routing in multidomain networks. IEEE/ACM Trans. Netw. 2(3): 252-262 (1994) - [c5]Robert R. Boorstyn, Aaron Kershenbaum:
Characterization of bursty sources and capacity estimation in high speed networks. CAMAD 1994 - 1991
- [c4]Dragomir D. Dimitrijevic, Basil S. Maglaris, Robert R. Boorstyn:
Routing in Multi-Domain Networks. INFOCOM 1991: 257-264
1980 – 1989
- 1989
- [c3]Dragomir D. Dimitrijevic
Routing in Multiple Domain Networks. INFOCOM 1989: 1047-1056 - 1987
- [j11]Aaron Kershenbaum, Robert R. Boorstyn, Mon-Song Chen:
An Algorithm for Evaluation of Throughput in Multihop Packet Radio Networks with Complex Topologies. IEEE J. Sel. Areas Commun. 5(6): 1003-1012 (1987) - [j10]Robert R. Boorstyn, Aaron Kershenbaum, Basil S. Maglaris
Throughput Analysis in Multihop CSMA Packet Radio Networks. IEEE Trans. Commun. 35(3): 267-274 (1987) - 1984
- [c2]Aaron Kershenbaum, Robert R. Boorstyn:
Evaluation of Throughput in Multihop Packet Radio Networks with Complex Topologies. INFOCOM 1984: 330-335 - 1983
- [j9]Michael G. Hluchyj, Chan David Tsao, Robert R. Boorstyn:
Performance analysis of a preemptive priority queue with applications to packet communication systems. Bell Syst. Tech. J. 62(10): 3225-3245 (1983) - [j8]Aaron Kershenbaum, Robert R. Boorstyn:
Centralized teleprocessing network design. Networks 13(2): 279-293 (1983) - [c1]Basil S. Maglaris, Robert R. Boorstyn, Aaron Kershenbaum:
Extensions to the Analysis of Multihop Packet Radio Networks. INFOCOM 1983: 390-395 - 1981
- [j7]Robert R. Boorstyn, Adam Livne:
A Technique for Adaptive Routing in Networks. IEEE Trans. Commun. 29(4): 474-480 (1981) - [j6]Jeremiah F. Hayes, Robert R. Boorstyn:
Delay and Overhead in the Encoding of Data Sources. IEEE Trans. Commun. 29(11): 1678-1683 (1981) - 1980
- [j5]Aaron Kershenbaum, Robert R. Boorstyn, Rosa Oppenheim:
Second-Order Greedy Algorithms for Centralized Teleprocessing Network Design. IEEE Trans. Commun. 28(10): 1835-1838 (1980)
1970 – 1979
- 1976
- [j4]David C. Rife, Robert R. Boorstyn:
Multiple tone parameter estimation from discrete-time observations. Bell Syst. Tech. J. 55(9): 1389-1410 (1976) - 1975
- [j3]David C. Rife, M. Goldstein, Robert R. Boorstyn:
A unification of Cramér-Rao type bounds (Corresp.). IEEE Trans. Inf. Theory 21(3): 330-332 (1975) - 1974
- [j2]David C. Rife, Robert R. Boorstyn:
Single tone parameter estimation from discrete-time observations. IEEE Trans. Inf. Theory 20(5): 591-598 (1974)
1960 – 1969
- 1968
- [j1]Raymond L. Pickholtz, Robert R. Boorstyn:
A recursive approach to signal detection. IEEE Trans. Inf. Theory 14(3): 445-450 (1968)
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:56 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: