E-LIB Suche - Ergebnisse für: Leighton, Frank Thomson

1

Challenges Posed by Newly Elected Members:

Leighton, Frank Thomson ; Bertozzi, Carolyn R. ; Gates, Sr., William H...
Bulletin of the American Academy of Arts and Sciences. 57 (2004) 2 - p. 2-7 , 2004

Link: https://www.jstor.org/st..

2

Salvage-Embeddings of Complete Trees:

Bhatt, Sandeep N. ; Chung, Fan R. K. ; Leighton, Frank Thomson.
SIAM Journal on Discrete Mathematics. 8 (1995) 4 - p. 617-637 , 1995

Link: https://doi.org/10.1137/..

3

Comparing Queues and Stacks As Machines for Laying Out Grap..:

Heath, Lenwood S. ; Leighton, Frank Thomson ; Rosenberg, Arnold L.
SIAM Journal on Discrete Mathematics. 5 (1992) 3 - p. 398-412 , 1992

Link: https://doi.org/10.1137/..

4

Embedding Graphs in Books: A Layout Problem with Applicatio..:

Chung, Fan R. K. ; Leighton, Frank Thomson ; Rosenberg, Arnold L.
SIAM Journal on Algebraic Discrete Methods. 8 (1987) 1 - p. 33-58 , 1987

Link: https://doi.org/10.1137/..

5

Three-Dimensional Circuit Layouts:

Leighton, Frank Thomson ; Rosenberg, Arnold L.
SIAM Journal on Computing. 15 (1986) 3 - p. 793-813 , 1986

Link: https://doi.org/10.1137/..

6

Layouts for the Shuffle-Exchange Graph Based on the Complex..:

Leighton, Frank Thomson ; Lepley, Margaret ; Miller, Gary L.
SIAM Journal on Algebraic Discrete Methods. 5 (1984) 2 - p. 202-215 , 1984

Link: https://doi.org/10.1137/..

7

New lower bound techniques for VLSI:

Leighton, Frank Thomson
Mathematical Systems Theory. 17 (1984) 1 - p. 47-70 , 1984

Link: https://doi.org/10.1007/..

8

An approximation algorithm for manhattan routing:

, In: Proceedings of the fifteenth annual ACM symposium on Theory of computing,

Baker, Brenda S. ; Bhatt, Sandeep N. ; Leighton, Frank Thomson - p. 477-486 , 1983

Link: https://dl.acm.org/doi/1..

9

Finite common coverings of graphs:

Leighton, Frank Thomson
Journal of Combinatorial Theory, Series B. 33 (1982) 3 - p. 231-238 , 1982

Link: https://doi.org/10.1016/..

10

A layout strategy for VLSI which is provably good (Extended..:

, In: Proceedings of the fourteenth annual ACM symposium on Theory of computing,

Leighton, Frank Thomson - p. 85-98 , 1982

Link: https://dl.acm.org/doi/1..

11

An $O(n^{1/10.89))$ Primality Testing Algorithm,$:

Adleman, Leonard ; Leighton, Frank Thomson
Mathematics of Computation. 36 (1981) 153 - p. 261-266 , 1981

Link: https://www.jstor.org/st..

12

New layouts for the shuffle-exchange graph(Extended Abstrac..:

, In: Proceedings of the thirteenth annual ACM symposium on Theory of computing,

Kleitman, Daniel ; Leighton, Frank Thomson ; Lepley, Margaret. - p. 278-292 , 1981

Link: https://dl.acm.org/doi/1..

13

Positive Definite Matrices and Catalan Numbers:

Leighton, Frank Thomson ; Newman, Morris
Proceedings of the American Mathematical Society. 79 (1980) 2 - p. 177-181 , 1980

Link: https://www.jstor.org/st..

14

Sign patterns of inverse-positive matrices:

Johnson, Charles R. ; Leighton, Frank Thomson ; Robinson, Herbert A.
Linear Algebra and its Applications. 24 (1979) - p. 75-83 , 1979

Link: https://doi.org/10.1016/..

15

A framework for solving VLSI graph layout problems:

Bhatt, Sandeep N. ; Thomson Leighton, Frank
Journal of Computer and System Sciences. 28 (1984) 2 - p. 300-343 , 1984

Link: https://doi.org/10.1016/..