The following pages link to Jonathan S. Turner (Q1822980):
Displaying 16 items.
- (Q1398838) (redirect page) (← links)
- Configuring sessions in programmable networks. (Q1398840) (← links)
- Approximation algorithms for the shortest common superstring problem (Q1822981) (← links)
- A Legendre pair of length 77 using complementary binary matrices with fixed marginals (Q2034994) (← links)
- Counting the decimation classes of binary vectors with relatively prime length and density (Q2114775) (← links)
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees (Q3740255) (← links)
- On the Probable Performance of Heuristics for Bandwidth Minimization (Q3777452) (← links)
- Almost all k-colorable graphs are easy to color (Q3811723) (← links)
- Nonblocking Multirate Networks (Q3824240) (← links)
- Nonblocking multirate distribution networks (Q4202038) (← links)
- Queueing analysis of buffered switching networks (Q4202048) (← links)
- A practical version of Lee's multicast switch architecture (Q4274775) (← links)
- Designing Least-Cost Nonblocking Broadband Networks (Q4360132) (← links)
- Toward Advocacy-Free Evaluation of Packet Classification Algorithms (Q5280591) (← links)
- Issues in distributed control for ATM networks (Q5361430) (← links)
- Legendre pairs of lengths \(\ell \equiv 0 \pmod 5\) (Q6194287) (← links)
