Author of the publication

Allowable processing orders in the accelerated cascade algorithm.

, and . Discret. Appl. Math., 13 (2-3): 213-221 (1986)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Lower Bound for Integer Greatest Common Divisor Computations., , and . J. ACM, 38 (2): 453-471 (1991)The Electrical Resistance of a Graph Captures its Commute and Cover Times., , , , and . Comput. Complex., 6 (4): 312-340 (1997)Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs., , and . SWAT, volume 621 of Lecture Notes in Computer Science, page 326-337. Springer, (1992)The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract), , , , and . STOC, page 574-586. ACM, (1989)Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary), , and . FOCS, page 54-63. IEEE Computer Society, (1988)Transforming Electrical Load from an Operational Constraint to a Controllable Resource., , , , , and . Interfaces, 47 (4): 292-304 (2017)Lower bounds on communication complexity in distributed computer networks.. J. ACM, 34 (4): 921-938 (1987)The Computational Complexity of Universal Hashing., , and . Theor. Comput. Sci., 107 (1): 121-133 (1993)Decomposition of product graphs into complete bipartite subgraphs., , and . Discret. Math., 57 (1-2): 189-193 (1985)A Tight Bound for Approximating the Square Root., , , and . Inf. Process. Lett., 63 (4): 211-213 (1997)