The following pages link to D. S. Richards (Q1179759):
Displayed 46 items.
- (Q516793) (redirect page) (← links)
- Minimum multiple originator broadcast graphs (Q516794) (← links)
- Efficient parallel graph algorithms based on open ear decomposition (Q688195) (← links)
- Toward optimal gossiping schemes with conference calls (Q787168) (← links)
- Broadcasting from multiple originators (Q967331) (← links)
- Data compression and Gray-code sorting (Q1075764) (← links)
- On the distribution of comparisons in sorting algorithms (Q1115198) (← links)
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
- On a theorem of Chorneyko and Mohanty (Q1137997) (← links)
- A simple proof of Hwang's theorem for rectilinear Steiner minimal trees (Q1179761) (← links)
- A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets (Q1186799) (← links)
- The Steiner tree problem (Q1202044) (← links)
- Stacks, queues, and deques with order-statistic operations (Q1203596) (← links)
- On the inference of strategies (Q1263988) (← links)
- Reliable broadcasting (Q1339885) (← links)
- New results on routing via matchings on graphs (Q1679957) (← links)
- Efficient algorithms for path partitions (Q1813975) (← links)
- Sorting networks on restricted topologies (Q2206216) (← links)
- (Q2799882) (← links)
- Computing Maximal Layers of Points in $$E^{f(n)}$$ E f ( n ) (Q2802933) (← links)
- Martin Gardner (1914–2010) (Q3101786) (← links)
- The Structure of PEC Networks (Q3164209) (← links)
- A Multistage Linear Array Assignment Problem (Q3210145) (← links)
- (Q3221986) (← links)
- Complexity of Single-Layer Routing (Q3309079) (← links)
- Sorting with expensive comparands (Q3332257) (← links)
- Generalizations of broadcasting and gossiping (Q3494462) (← links)
- (Q3495358) (← links)
- (Q3663335) (← links)
- (Q3665154) (← links)
- (Q3687728) (← links)
- (Q3710543) (← links)
- Finding short cycles in planar graphs using separators (Q3739145) (← links)
- (Q3782802) (← links)
- On the Worst-Possible Analysis of Weighted Comparison-Based Algorithms (Q3792249) (← links)
- Generalized Magic Cubes (Q3887478) (← links)
- (Q4260378) (← links)
- Logic and Language Models for Computer Science (Q4593771) (← links)
- MIXED SPANNING TREES IN THEORY AND PRACTICE (Q4949992) (← links)
- A rectilinear steiner minimal tree algorithm for convex point sets (Q5056104) (← links)
- A Sorting Network on Trees (Q5087857) (← links)
- Sorting under Forbidden Comparisons (Q5369524) (← links)
- Logic and Language Models for Computer Science (Q5881590) (← links)
- Analysis of consensus sorting via the cycle metric (Q5918520) (← links)
- Analysis of consensus sorting via the cycle metric (Q5919649) (← links)
- Steiner tree problems (Q5966604) (← links)