Demo Data from EDBT 2026 / reviewers in the wild / expert
Robert E. Kahn
dblp:85/2295
· DBLP profile ↗
6ranked-venue papers
4as first author
0since 2021 · last 1977
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 4 · 2 first-authorTheory of computation · 2 · 2 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer networks
3 papers |
Wireless networking · 25% Physical-layer communications · 25% Transport protocols and congestion control · 17% | |
| Theoretical computer science
2 papers |
Information theory · 100% | |
| Network and information security
1 paper |
Authentication and access control · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% |
Topics — the 11 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications › relaying
multi-hop relaying |
0.0 | 1 | 1977 | The Organization of Computer Resources into a Packet Radio Network · IEEE Trans. Commun. 1977 |
Wireless networking
packet radio network |
0.0 | 1 | 1977 | The Organization of Computer Resources into a Packet Radio Network · IEEE Trans. Commun. 1977 |
Transport protocols and congestion control
flow control |
0.0 | 2 | 1974 | Flow Control in a Resource-Sharing Computer Network · IEEE Trans. Commun. 1972 A Protocol for Packet Network Intercommunication · IEEE Trans. Commun. 1974 |
Internet architecture and protocols › network interconnection
internetwork protocol |
0.0 | 1 | 1974 | A Protocol for Packet Network Intercommunication · IEEE Trans. Commun. 1974 |
Network optimization and economics
resource sharing |
0.0 | 1 | 1972 | Flow Control in a Resource-Sharing Computer Network · IEEE Trans. Commun. 1972 |
Authentication and access control
authentication |
0.0 | 1 | 1977 | The Organization of Computer Resources into a Packet Radio Network · IEEE Trans. Commun. 1977 |
Routing and switching
internet routing |
0.0 | 1 | 1974 | A Protocol for Packet Network Intercommunication · IEEE Trans. Commun. 1974 |
Distributed systems
resource sharing |
0.0 | 1 | 1972 | Flow Control in a Resource-Sharing Computer Network · IEEE Trans. Commun. 1972 |
Information theory › signal processing › sampling theory
sampling and reconstruction |
0.0 | 1 | 1965 | Sampling representations and the optimum reconstruction of signals · IEEE Trans. Inf. Theory 1965 |
Information theory
signal processing |
0.0 | 1 | 1965 | Sampling representations and the optimum reconstruction of signals · IEEE Trans. Inf. Theory 1965 |
Information theory › signal processing
signal recovery |
0.0 | 1 | 1965 | Sampling representations and the optimum reconstruction of signals · IEEE Trans. Inf. Theory 1965 |
Methods — techniques the papers use, named apart from their topics
store-and-forward networking · 0.0repeater-based routing · 0.0protocol design · 0.0ALOHA · 0.0linear prefiltering · 0.0linear postfiltering · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1977 | The Organization of Computer Resources into a Packet Radio NetworkabstractPacket radio communications provides an effective way to interconnect fixed and mobile computer resources. The ALOHA System at the University of Hawaii first introduced this capability in the context of a single-hop system using off-the-shelf RF equipment with all terminals within line of sight of the central station. The packet radio network described in this paper is 1) an extension of the basic Hawaii work to a geographically distributed system involving the use of repeaters to achieve area coverage beyond line of sight, and 2) provides added capabilities for authentication, antijam protection, and coexistence with other possibly different systems in the same band. An overview of the packet radio system concept is given in this paper. Robert E. Kahn |
IEEE Trans. Commun. | 1 |
| 1974 | A Protocol for Packet Network IntercommunicationabstractA protocol that supports the sharing of resources that exist in different packet switching networks is presented. The protocol provides for variation in individual network packet sizes, transmission failures, sequencing, flow control, end-to-end error checking, and the creation and destruction of logical process-to-process connections. Some implementation issues are considered, and problems such as internetwork routing, accounting, and timeouts are exposed. Vint Cerf, Robert E. Kahn |
IEEE Trans. Commun. | 2 |
| 1972 | Computer communication network design: Experience with theory and practiceabstractAbstract The design of the ARPA Computer Network brought together many individuals with diverse backgrounds and philosophies. In this paper, we review the methods used in the design of the Network from the vantage of over two years' experience in its development. The design variables, system constraints, and performance criteria for the network are discussed along with an evaluation of the tools used to design an efficient and reliable system. The design procedures and the conclusions reached about the network's properties appear to be generally applicable to message switched networks. Consequently, the results of this paper should be useful in the design and study of other store‐and‐forward computer communication networks. Howard Frank, Robert E. Kahn, Leonard Kleinrock |
Networks | 2 |
| 1972 | Flow Control in a Resource-Sharing Computer NetworkabstractIn this paper, we discuss flow control in a resourcesharing computer network. The resources consist of a set of inhomogeneous computers called hosts that are geographically distributed and are interconnected by a store-and-forward communications subnet. In the communication process, messages pass between hosts via the subnet. A protocol is used to control the flow of messages in such a way as to efficiently utilize the subnet and the host resources. In this paper, we examine in some detail the nature of the flow control required in the subnet and its relation to the host flow control and subnet performance. Robert E. Kahn, William R. Crowther |
IEEE Trans. Commun. | 1 |
| 1965 | Sampling representations and the optimum reconstruction of signalsabstractThis paper treats the problem of the representation and reconstruction of signals from several sets of sampled values using a multiple-channel sampling and reconstruction scheme. Realizable and unrealizable solutions are presented for the optimum linear postfiltering and prefiltering operations. It is shown that the number of "independent" sets of samples which are necessary for the exact reconstruction of a signal is equal to the maximum number of overlappings of its sampled spectrum. This enables many different sampling expansions to be derived. The simultaneous optimization of the unrealizable linear prefilter and postfilter combination is carried out for the case where two sets of sampled values are taken. It is shown that with the optimum combination of filters, the angular frequency range of the input signal is limited by the prefilters to a total width of4\pi \rho, which is a natural extension of the single-channel result. Robert E. Kahn, Bede Liu |
IEEE Trans. Inf. Theory | 1 |
| 1965 | Some bandwidth properties of simultaneous amplitude and angle modulationabstractThis paper treats some bandwidth properties of modulated signals of the formq(t) \cos [\omega_{c}t + \varphi(t)]where bothq(t)and\varphi(t)are modulating time functions. For such simultaneous amplitude and angle modulation (AAM), relationships are given connecting the bandwidth of the modulated signal with the properties of the modulating time functions. Some useful bounds on the bandwidth are found and a relationship is derived between the amplitude and the angle modulating functions which results in a minimum bandwidth. Several examples of such minimum bandwidth signals are given. Robert E. Kahn, John B. Thomas |
IEEE Trans. Inf. Theory | 1 |