Frank Thompson Leighton

Available identifiers

zbMath Open leighton.frank-thomsonWikidataQ5424058 ScholiaQ5424058MaRDI QIDQ796305

List of research outcomes

Publication	Date of Publication	Type
Extensions and limits to vertex sparsification	2014-08-13	Paper
Hamming Codes, Hypercube Embeddings, and Fault Tolerance	2008-06-19	Paper
https://portal.mardi4nfdi.de/entity/Q4778567	2002-11-18	Paper
Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times	1998-09-20	Paper
On the Fault Tolerance of Some Popular Bounded-Degree Networks	1998-09-20	Paper
Work-preserving emulations of fixed-connection networks	1998-01-22	Paper
Optimal emulations by butterfly-like networks	1998-01-21	Paper
On-Line Algorithms for Path Selection in a Nonblocking Network	1996-11-26	Paper
Salvage-Embeddings of Complete Trees	1996-02-20	Paper
Queues served by a rotating ring	1996-01-15	Paper
Randomized Routing and Sorting on Fixed-Connection Networks	1995-03-09	Paper
Drawing Graphs in the Plane with High Resolution	1994-10-10	Paper
https://portal.mardi4nfdi.de/entity/Q3138904	1994-09-19	Paper
Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps	1994-08-11	Paper
Dynamic Tree Embeddings in Butterflies and Hypercubes	1993-01-16	Paper
Comparing Queues and Stacks As Machines for Laying Out Graphs	1993-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q4002466	1992-09-18	Paper
Efficient Embeddings of Trees in Hypercubes	1992-06-28	Paper
Fast algorithms for bit-serial routing on a hypercube	1991-01-01	Paper
First-fit allocation of queues: Tight probabilistic bounds on wasted space	1990-01-01	Paper
A provably efficient algorithm for dynamic storage allocation	1989-01-01	Paper
Universal Graphs for Bounded-Degree Trees and Planar Graphs	1989-01-01	Paper
Global wire routing in two-dimensional arrays	1987-01-01	Paper
Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design	1987-01-01	Paper
Three-Dimensional Circuit Layouts	1986-01-01	Paper
Estimating a probability using finite memory	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3691751	1985-01-01	Paper
A framework for solving VLSI graph layout problems	1984-01-01	Paper
Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram	1984-01-01	Paper
New lower bound techniques for VLSI	1984-01-01	Paper
An asymptotically optimal layout for the shuffle-exchange graph	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3322997	1983-01-01	Paper
Circulants and the Characterization of Vertex-Transitive Graphs	1983-01-01	Paper
On the Decomposition of Vertex-Transitive Graphs into Multicycles	1983-01-01	Paper
Finite common coverings of graphs	1982-01-01	Paper
An $O(n^{1/10.89))$ Primality Testing Algorithm,$	1981-01-01	Paper
Positive Definite Matrices and Catalan Numbers	1980-01-01	Paper
Sign patterns of inverse-positive matrices	1979-01-01	Paper
A graph coloring algorithm for large scheduling problems	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4127382	1977-01-01	Paper
Tables of binomial coefficients and Stirling numbers	1976-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Frank Thompson Leighton