The following pages link to Frank Thompson Leighton (Q796305):
Displayed 43 items.
- Item:Q796305 (redirect page) (← links)
- First-fit allocation of queues: Tight probabilistic bounds on wasted space (Q756295) (← links)
- A provably efficient algorithm for dynamic storage allocation (Q756873) (← links)
- A framework for solving VLSI graph layout problems (Q796306) (← links)
- Global wire routing in two-dimensional arrays (Q1097238) (← links)
- Item:Q796305 (redirect page) (← links)
- Finite common coverings of graphs (Q1165857) (← links)
- Sign patterns of inverse-positive matrices (Q1256532) (← links)
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps (Q1330796) (← links)
- An asymptotically optimal layout for the shuffle-exchange graph (Q1838315) (← links)
- Extensions and limits to vertex sparsification (Q2875131) (← links)
- (Q3138904) (← links)
- Drawing Graphs in the Plane with High Resolution (Q3142593) (← links)
- (Q3322997) (← links)
- Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram (Q3332261) (← links)
- Circulants and the Characterization of Vertex-Transitive Graphs (Q3344013) (← links)
- On the Decomposition of Vertex-Transitive Graphs into Multicycles (Q3344014) (← links)
- Fast algorithms for bit-serial routing on a hypercube (Q3357513) (← links)
- Hamming Codes, Hypercube Embeddings, and Fault Tolerance (Q3507520) (← links)
- (Q3691751) (← links)
- Three-Dimensional Circuit Layouts (Q3753506) (← links)
- Universal Graphs for Bounded-Degree Trees and Planar Graphs (Q3828026) (← links)
- Positive Definite Matrices and Catalan Numbers (Q3874339) (← links)
- A graph coloring algorithm for large scheduling problems (Q3878752) (← links)
- An $O(n^{1/10.89))$ Primality Testing Algorithm,$ (Q3898557) (← links)
- New lower bound techniques for VLSI (Q3950484) (← links)
- Efficient Embeddings of Trees in Hypercubes (Q3990107) (← links)
- (Q4002466) (← links)
- Dynamic Tree Embeddings in Butterflies and Hypercubes (Q4018398) (← links)
- Comparing Queues and Stacks As Machines for Laying Out Graphs (Q4018851) (← links)
- Tables of binomial coefficients and Stirling numbers (Q4103533) (← links)
- (Q4127382) (← links)
- Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times (Q4210092) (← links)
- On the Fault Tolerance of Some Popular Bounded-Degree Networks (Q4210098) (← links)
- Randomized Routing and Sorting on Fixed-Connection Networks (Q4304064) (← links)
- Optimal emulations by butterfly-like networks (Q4371672) (← links)
- Work-preserving emulations of fixed-connection networks (Q4371700) (← links)
- Estimating a probability using finite memory (Q4725462) (← links)
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design (Q4727445) (← links)
- (Q4778567) (← links)
- Queues served by a rotating ring (Q4849178) (← links)
- Salvage-Embeddings of Complete Trees (Q4863979) (← links)
- On-Line Algorithms for Path Selection in a Nonblocking Network (Q4887019) (← links)