The following pages link to E. N. Gilbert (Q287235):
Displayed 50 items.
- An approximate model of processor communication rings under heavy load (Q287237) (← links)
- Symmetry types of periodic sequences (Q775348) (← links)
- Analysis of conveyor queue in a flexible manufacturing system (Q1099777) (← links)
- Polling and greedy servers on a line (Q1108180) (← links)
- A selection-replacement process on the circle (Q1308703) (← links)
- Constrained arrangements of objects in a cycle (Q1378360) (← links)
- Enumeration Of Labelled Graphs (Q3236812) (← links)
- (Q3247626) (← links)
- Optimal Search Strategies (Q3270244) (← links)
- (Q3274428) (← links)
- Design of Mixed Doubles Tournaments (Q3281972) (← links)
- Tandem Conveyor Queues (Q3415950) (← links)
- Gated, Exhaustive, Parallel Service (Q3416045) (← links)
- Optimal strategies for scheduling checkpoints and preventive maintenance (Q3483057) (← links)
- Reverberation between concentric spheres (Q3685472) (← links)
- On the Expected Relative Performance of List Scheduling (Q3686419) (← links)
- Dynamic, first-fit packings in two or more dimensions (Q3719853) (← links)
- A solvable routing problem (Q3824127) (← links)
- Random Plane Networks (Q3849287) (← links)
- The Packing Problem for Twisted Pairs (Q3868392) (← links)
- Multigram codes (Corresp.) (Q3869252) (← links)
- Random Colorings of a Lattice of Squares in the Plane (Q3964587) (← links)
- Tiling Rectangles with Rectangles (Q3968948) (← links)
- How Things Float (Q3983394) (← links)
- A distributed clustering process (Q3988114) (← links)
- Scheduling Checks and Saves (Q3993668) (← links)
- Service by a Queue and a Cart (Q4018308) (← links)
- Paths through a maze of rectangles (Q4018994) (← links)
- The Lempel-Ziv algorithm and message complexity (Q4024568) (← links)
- The Gated Infinite-Server Queue: Uniform Service Times (Q4037676) (← links)
- (Q4120590) (← links)
- Doubly Orthogonal Concentrated Polynomials (Q4130372) (← links)
- Estimators for distances (Q4142420) (← links)
- Increased information rate by oversampling (Q4307476) (← links)
- Codes Which Detect Deception (Q4401320) (← links)
- Coding with digits of unequal cost (Q4838702) (← links)
- Queues served by a rotating ring (Q4849178) (← links)
- REDIALING POLICIES: OPTIMALITY AND SUCCESS PROBABILITIES (Q4955517) (← links)
- Latin Squares which Contain No Repeated Digrams (Q5330660) (← links)
- A Polygon Problem (Q5342332) (← links)
- The probability of covering a sphere with N circular caps (Q5511768) (← links)
- Randomly Packed and Solidly Packed Spheres (Q5517537) (← links)
- Random Minimal Trees (Q5536040) (← links)
- Steiner Minimal Trees (Q5542568) (← links)
- (Q5543202) (← links)
- Random Graphs (Q5555420) (← links)
- How good is morse code? (Q5568904) (← links)
- Codes based on inaccurate source probabilities (Q5627986) (← links)
- (Q5638894) (← links)
- Random Subdivisions of Space into Crystals (Q5653401) (← links)