Glenn K. Manacher

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

18EEGlenn K. Manacher, Terrance A. Mankus: A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone. Networks 39(2): 68-72 (2002)
17 Glenn K. Manacher, Terrance A. Mankus: Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications. Int. J. Found. Comput. Sci. 8(4): 469- (1997)
16 Y. Daniel Liang, Raymond Greenlaw, Glenn K. Manacher: NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract). Canada-France Conference on Parallel and Distributed Computing 1994: 45-57
15EEY. Daniel Liang, Glenn K. Manacher: An O(nlogn) Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs. ACM Conference on Computer Science 1993: 390-397
14 Glenn K. Manacher, Terrance A. Mankus: Incorporating Negative-Weight Vertices in Certain Vertex-Search Graph Algorithms. Inf. Process. Lett. 42(6): 293-294 (1992)
13 Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher: Efficient Reduction for Path Problems on Circular-Arc Graphs. BIT 31(2): 182-193 (1991)
12 Glenn K. Manacher, Terrance A. Mankus, Carol Joan Smith: An Optimum Theta (n log n) Algorithm for Finding a Canonical Hamiltonian Path and a Canonical Hamiltonian Circuit in a Set of Intervals. Inf. Process. Lett. 35(4): 205-211 (1990)
11EEGlenn K. Manacher, T. D. Bui, T. Mai: Optimum combinations of sorting and merging. J. ACM 36(2): 290-334 (1989)
10EEMikhail J. Atallah, Glenn K. Manacher, Jorge Urrutia: Finding a minimum independent dominating set in a permutation graph. Discrete Applied Mathematics 21(3): 177-183 (1988)
9 Glenn K. Manacher: Steady-Paced-Output and Fractional-On-Line Algorithms on a RAM. Inf. Process. Lett. 15(2): 47-52 (1982)
8 Glenn K. Manacher, Albert L. Zobrist: Neither the Greedy Nor the Delaunay Triangulation of a Planar Point Set Approximates the Optimal Triangulation. Inf. Process. Lett. 9(1): 31-34 (1979)
7EEGlenn K. Manacher: Significant Improvements to the Hwang-Lin Merging Algorithm. J. ACM 26(3): 434-440 (1979)
6EEGlenn K. Manacher: The Ford-Johnson Sorting Algorithm Is Not Optimal. J. ACM 26(3): 441-456 (1979)
5 Glenn K. Manacher: An Improved Version of the Cocke-Younger-Kasami Algorithm. Comput. Lang. 3(2): 127-133 (1978)
4 Glenn K. Manacher: An Application of Pattern Matching to a Problem in Geometrical Complexity. Inf. Process. Lett. 5(1): 6-7 (1976)
3EEGlenn K. Manacher: On the Feasibility of Implementing a Large Relational Data Base with Optimal Performance on a Mini-Computer. VLDB 1975: 175-201
2EEGlenn K. Manacher: A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String. J. ACM 22(3): 346-351 (1975)
1EEGlenn K. Manacher: Production and Stabilization of Real-Time Task Schedules. J. ACM 14(3): 439-465 (1967)

Coauthor Index

1Srinivasa Rao Arikati [13]
2Mikhail J. Atallah [10]
3Tien D. Bui (T. D. Bui) [11]
4Raymond Greenlaw [16]
5Y. Daniel Liang [15] [16]
6T. Mai [11]
7Terrance A. Mankus [12] [14] [17] [18]
8C. Pandu Rangan (Chanrasekharan Pandu Rangan) [13]
9Carol Joan Smith [12]
10Jorge Urrutia [10]
11Albert L. Zobrist [8]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)