Citations
-
X. Guan and M. A. Langston,
``Time-Space Optimal Parallel Merging and Sorting,''
IEEE Transactions on Computers 40 (1991), 596-602.
-
M. R. Fellows and M. A. Langston,
``Fast Search Algorithms for Layout Permutation Problems,''
International Journal of Computer Aided VLSI Design 3 (1991), 325-342.
-
D. K. Friesen and M. A. Langston,
``Analysis of a Compound Bin Packing Algorithm,''
SIAM Journal on Discrete Mathematics 4 (1991), 61-79.
-
B.-C. Huang and M. A. Langston,
``Stable Set and Multiset Operations in Optimal Time and Space,''
Information Processing Letters 39 (1991), 131-136.
-
K. Abrahamson, M. R. Fellows, M. A. Langston and B. M. E. Moret.
``Constructive Complexity,''
Discrete Applied Mathematics 34 (1991), 3-16.
-
L. Campbell, G. E. Carlsson, M. J. Dinneen, V. Faber, M. R. Fellows,
M. A. Langston, J. W. Moore, A. P. Mullhaupt and H. B. Sexton,
``Small Diameter Symmetric Networks from Linear Groups,''
IEEE Transactions on Computers 41 (1992), 218-220.
-
M. R. Fellows and M. A. Langston,
``On Well-Partial-Order Theory and Its Application to Combinatorial
Problems of VLSI Design,''
SIAM Journal on Discrete Mathematics 5 (1992), 117-126.
-
X. Guan and M. A. Langston,
``Parallel Methods for Solving Fundamental File Rearrangement Problems,''
Journal of Parallel and Distributed Computing 14 (1992), 436-439.
-
B.-C. Huang and M. A. Langston,
``Fast Stable Merging and Sorting in Constant Extra Space,''
The Computer Journal 35 (1992), 643-650.
-
M. R. Fellows and M. A. Langston,
``Constructivity Issues in Graph Algorithms,'' in
Lecture Notes in Computer Science 613 (J. P. Myers and
M. J. O'Donnell, editors), Springer-Verlag, 1992, 150-158.
-
M. A. Langston,
``An Obstruction-Based Approach to Layout Optimization,'' in
Graph Structure Theory (N. Robertson and P. D. Seymour, editors),
AMS Press, 1993, 623-630.
-
M. A. Langston,
``Time-Space Optimal Parallel Computation,'' in
Parallel Algorithm Derivation and Program Transformation (R. Paige,
J. Reif and R. Wachter, editors), Kluwer Academic Publishers, 1993, 207-223.
-
C. P. Breshears and M. A. Langston,
``MIMD versus SIMD Computation: Experience with Nonnumeric Parallel
Algorithms,''
Journal of Parallel Algorithms and Applications 2 (1994), 123-138.
-
N. G. Kinnersley and M. A. Langston,
``Obstruction Set Isolation for the Gate Matrix Layout Problem,''
Discrete Applied Mathematics 54 (1994), 169-213.
-
M. R. Fellows and M. A. Langston,
``On Search, Decision and the Efficiency of Polynomial-Time Algorithms,''
Journal of Computer and Systems Sciences 49 (1994), 769-779.
-
H. D. Booth, R. Govindan, M. A. Langston and S. Ramachandramurthi,
``Fast Algorithms for $K_4$ Immersion Testing,'' Technical Report, 1994.
-
D. Bienstock and M. A. Langston,
``Algorithmic Implications of the Graph Minor Theorem,'' in
Handbook of Operations Research and Management Science: Network Models
(M. O. Ball, T. L. Magnanti, C. L. Monma and G. L. Nemhauser, editors),
North-Holland, 1995, 481-502
-
C. P. Breshears and M. A. Langston,
``Parallel Benchmarks and Comparison-Based Computing,'' Technical Report, 1995.
-
M. A. Langston and B. C. Plaut,
``Algorithmic Applications of the Immersion Order,''
Technical Report, 1995.
-
M. A. Langston,
``Parallel Algorithms, An Introduction to the Special Issue,''
Journal of Parallel Algorithms and Applications, to appear.