The following pages link to Adrian Segall (Q1219637):
Displaying 30 items.
- Radon-Nikodym derivatives with respect to measures induced by discontinuous independent-increment processes (Q1219638) (← links)
- (Q3045079) (← links)
- Distributed network protocols (Q3313789) (← links)
- (Q3342474) (← links)
- (Q3342475) (← links)
- The Communication Complexity of Atomic Commitment and of Gossiping (Q3359736) (← links)
- Structured priority queueing systems with applications to packet-radio networks (Q3670899) (← links)
- (Q3793715) (← links)
- Distributed name assignment in computer networks (Q3833601) (← links)
- Dynamic file assignment in a computer network--Part II: Decentralized control (Q3858094) (← links)
- An optimal control approach to dynamic routing in networks (Q3943536) (← links)
- Decentralized maximum-flow protocols (Q3951886) (← links)
- The modeling of randomly modulated jump processes (Q4052944) (← links)
- Nonlinear filtering with counting observations (Q4053446) (← links)
- (Q4074778) (← links)
- Bit allocation and encoding for vector sources (Q4085611) (← links)
- Dynamic file assignment in a computer network (Q4098663) (← links)
- Recursive estimation from discrete-time point processes (Q4099501) (← links)
- Stochastic processes in estimation theory (Q4101700) (← links)
- (Q4115026) (← links)
- Orthogonal functionals of independent-increment processes (Q4124075) (← links)
- Optimal control of noisy finite-state Markov processes (Q4126193) (← links)
- The Modeling of Adaptive Routing in Data-Communication Networks (Q4136587) (← links)
- Optimal Distributed Routing for Virtual Line-Switched Data Networks (Q4175187) (← links)
- Centralized and decentralized control schemes for Gauss-Poisson processes (Q4182646) (← links)
- (Q4189210) (← links)
- (Q4194842) (← links)
- (Q4197142) (← links)
- On the memory overhead of distributed snapshots (Q4262691) (← links)
- Distributed priority algorithms under one-bit-delay constraint (Q5348830) (← links)