( en | de | ru )

 

Disambiguation of "Dahlhaus, Elias"

Author of the publication

copydeleteadd this publication to your clipboard
Concerning Two-Adjacent Context-Free Languages.

, and . Theor. Comput. Sci., (1985)

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.

Elias Dahlhaus

Elias Elias

Elias

Helmut Dahlhaus

Friedrich Dahlhaus

 

Other publications of authors with the same name

The Computation of the Jump Number of Convex Graphs.. ORDAL, volume 831 of Lecture Notes in Computer Science, page 176-185. Springer, (1994)Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes.. WG, volume 657 of Lecture Notes in Computer Science, page 60-69. Springer, (1992)A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract)., and . SWAT, volume 318 of Lecture Notes in Computer Science, page 139-144. Springer, (1988)Membership for Growing Context-Sensitive Grammars is Polynomial., and . J. Comput. Syst. Sci., 33 (3): 456-472 (1986)MAD trees and distance-hereditary graphs., , , and . Discret. Appl. Math., 131 (1): 151-167 (2003)Fast Parallel Algorithm for the Single Link Heuristics of Hierarchical Clustering.. SPDP, page 184-187. IEEE Computer Society, (1992)The Complexity of Multiway Cuts (Extended Abstract), , , , and . STOC, page 241-251. ACM, (1992)Efficient Parallel Modular Decomposition (Extended Abstract).. WG, volume 1017 of Lecture Notes in Computer Science, page 290-302. Springer, (1995)Skolem Normal Forms Concerning the Least Fixpoint.. Computation Theory and Logic, volume 270 of Lecture Notes in Computer Science, page 101-106. Springer, (1987)Reduction to NP-complete problems by interpretations.. Logic and Machines, volume 171 of Lecture Notes in Computer Science, page 357-365. Springer, (1983)